Searched refs:next_node (Results 1 – 9 of 9) sorted by relevance
71 heap_offset next_node; // offset into heap member118 freelist->next_node = offset_from_node(list_end); in init_heap()141 prev = p, p = node_from_offset(p->next_node)) { in fallback_malloc()163 q->next_node = 0; in fallback_malloc()174 freelist = node_from_offset(p->next_node); in fallback_malloc()176 prev->next_node = p->next_node; in fallback_malloc()177 p->next_node = 0; in fallback_malloc()200 prev = p, p = node_from_offset(p->next_node)) { in fallback_free()220 cp->next_node = p->next_node; in fallback_free()222 prev->next_node = offset_from_node(cp); in fallback_free()[all …]
364 et_forest_occurrence_t prev_node, next_node; local367 next_node = splay (find_leftmost_node (last->right));370 if (prev_node->next != next_node)373 prev_node->right = next_node->right;374 prev_node->count_right = next_node->count_right;375 prev_node->next = next_node->next;379 if (prev_node->node->last == next_node)382 free (next_node);391 et_forest_occurrence_t next_node; local400 next_node = node->next;[all …]
12735 limbo_die_node *node, *next_node; local12759 for (node = limbo_die_list; node; node = next_node)12761 next_node = node->next;
146 def next_node(self, node): member in AbstractListSynthProvider152 valid = self.value(self.next_node(node)) != self.get_end_of_list_address()179 fast1 = self.next_node(fast2)180 fast2 = self.next_node(fast1)184 slow = self.next_node(slow)
236 def next_node(self, node): member in stdlist_SynthProvider
1182 struct attr_node *node, *next_node; in ike_phase_1_validate_prop() local1213 node; node = next_node) { in ike_phase_1_validate_prop()1214 next_node = in ike_phase_1_validate_prop()
2208 ddg_node_ptr next_node; in ps_insn_advance_column() local2218 next_node = ps_i->next_in_row->node; in ps_insn_advance_column()2222 if (TEST_BIT (must_follow, next_node->cuid)) in ps_insn_advance_column()
14238 limbo_die_node *node, *next_node; in dwarf2out_finish() local14259 for (node = limbo_die_list; node; node = next_node) in dwarf2out_finish()14261 next_node = node->next; in dwarf2out_finish()
3796 next_node(int node) in next_node() 3836 node = next_node((uintptr_t)np); in __matching_node() 3841 node = next_node(node); in __matching_node() 3793 next_node(int node) next_node() function