Home | History | Annotate | Download | only in libgcc

Lines Matching defs:left_node

553   struct btree_node *left_node, *right_node;
560       left_node = parent->content.children[left_slot].child;
567       left_node = parent->content.children[left_slot].child;
569       btree_node_lock_exclusive (left_node);
573   unsigned total_count = left_node->entry_count + right_node->entry_count;
575     = btree_node_is_inner (left_node) ? max_fanout_inner : max_fanout_leaf;
582 	  if (btree_node_is_inner (left_node))
584 	      for (unsigned index = 0; index != left_node->entry_count; ++index)
586 		  = left_node->content.children[index];
589 		parent->content.children[index + left_node->entry_count]
595 	      for (unsigned index = 0; index != left_node->entry_count; ++index)
597 		  = left_node->content.entries[index];
600 		parent->content.entries[index + left_node->entry_count]
604 	  btree_release_node (t, left_node);
611 	  if (btree_node_is_inner (left_node))
615 		left_node->content.children[left_node->entry_count++]
622 		left_node->content.entries[left_node->entry_count++]
634 	  return left_node;
639   if (left_node->entry_count > right_node->entry_count)
643 	= (left_node->entry_count - right_node->entry_count) / 2;
644       if (btree_node_is_inner (left_node))
654 	      = left_node->content
655 		  .children[left_node->entry_count - to_shift + index];
667 	      = left_node->content
668 		  .entries[left_node->entry_count - to_shift + index];
670       left_node->entry_count -= to_shift;
677 	= (right_node->entry_count - left_node->entry_count) / 2;
678       if (btree_node_is_inner (left_node))
681 	    left_node->content.children[left_node->entry_count + index]
691 	    left_node->content.entries[left_node->entry_count + index]
698       left_node->entry_count += to_shift;
702   if (btree_node_is_leaf (left_node))
708       left_fence = btree_node_get_fence_key (left_node);
715       return left_node;
719       btree_node_unlock_exclusive (left_node);