Searched refs:next_node (Results 1 – 3 of 3) sorted by relevance
67 heap_offset next_node; // offset into heap member87 freelist->next_node = offset_from_node(list_end); in init_heap()110 prev = p, p = node_from_offset(p->next_node)) { in fallback_malloc()117 q->next_node = 0; in fallback_malloc()124 freelist = node_from_offset(p->next_node); in fallback_malloc()126 prev->next_node = p->next_node; in fallback_malloc()127 p->next_node = 0; in fallback_malloc()148 prev = p, p = node_from_offset(p->next_node)) { in fallback_free()168 cp->next_node = p->next_node; in fallback_free()170 prev->next_node = offset_from_node(cp); in fallback_free()[all …]
147 def next_node(self, node): member in AbstractListSynthProvider153 valid = self.value(self.next_node(node)) != self.get_end_of_list_address()180 fast1 = self.next_node(fast2)181 fast2 = self.next_node(fast1)185 slow = self.next_node(slow)
236 def next_node(self, node): member in stdlist_SynthProvider