Searched refs:next_node (Results 1 – 14 of 14) sorted by relevance
63 heap_offset next_node; // offset into heap member83 freelist->next_node = offset_from_node(list_end); in init_heap()106 prev = p, p = node_from_offset(p->next_node)) { in fallback_malloc()113 q->next_node = 0; in fallback_malloc()120 freelist = node_from_offset(p->next_node); in fallback_malloc()122 prev->next_node = p->next_node; in fallback_malloc()123 p->next_node = 0; in fallback_malloc()145 prev = p, p = node_from_offset(p->next_node)) { in fallback_free()167 cp->next_node = p->next_node; in fallback_free()169 prev->next_node = offset_from_node(cp); in fallback_free()[all …]
62 Node* const next_node = head_->next.Value();63 if (next_node == nullptr) return false;64 *record = next_node->value;65 head_ = next_node;82 Node* const next_node = head_->next.Value();83 if (next_node == nullptr) return false;84 *record = next_node->value;
168 #define DL_INSERT(head, next_node, add) \ argument170 if (head == next_node) \172 else if (next_node == NULL) { \175 (add)->prev = (next_node)->prev; \176 (next_node)->prev->next = (add); \177 (add)->next = (next_node); \178 (next_node)->prev = (add); \
71 next_node = BMNode()72 start.transition_table[pattern[0]] = next_node75 next_node = start.transition_table[pattern[0]]78 end_nodes = self.add(pattern[1:], start=next_node)80 end_nodes = [next_node]
237 @adaptor.add_child( root_<treeLevel>, stream_<label>.next_node )<\n>241 @adaptor.add_child( root_<treeLevel>, stream_<label>.next_node )<\n>245 root_<treeLevel> = @adaptor.become_root( stream_<label>.next_node, root_<treeLevel> )<\n>273 root_<treeLevel> = @adaptor.become_root( stream_<rule>.next_node, root_<treeLevel> )<\n>293 root_<treeLevel> = @adaptor.become_root( stream_<label>.next_node, root_<treeLevel> )<\n>297 root_<treeLevel> = @adaptor.become_root( stream_<label>.next_node, root_<treeLevel> )<\n>324 stream_<token>.next_node
228 <terminalOptions.node; format="constantPath">.new( stream_<token>.next_node )230 stream_<token>.next_node
1775 nir_cf_node *next_node = nir_cf_node_next(&block->cf_node); in nir_block_get_following_if() local1777 if (next_node->type != nir_cf_node_if) in nir_block_get_following_if()1780 return nir_cf_node_as_if(next_node); in nir_block_get_following_if()1792 nir_cf_node *next_node = nir_cf_node_next(&block->cf_node); in nir_block_get_following_loop() local1794 if (next_node->type != nir_cf_node_loop) in nir_block_get_following_loop()1797 return nir_cf_node_as_loop(next_node); in nir_block_get_following_loop()
777 nir_cf_node *next_node = nir_cf_node_next(&if_stmt->cf_node); in validate_if() local778 validate_assert(state, next_node->type == nir_cf_node_block); in validate_if()810 nir_cf_node *next_node = nir_cf_node_next(&loop->cf_node); in validate_loop() local811 validate_assert(state, next_node->type == nir_cf_node_block); in validate_loop()
1331 def next_node method in CommonTreeNodeStream.RewriteRuleTokenStream1351 def next_node method in CommonTreeNodeStream.RewriteRuleSubtreeStream1371 alias next_node __next__ alias in CommonTreeNodeStream.RewriteRuleNodeStream
288 *next_node; member2126 cube_info->next_node=nodes->nodes; in GetNodeInfo()2131 node_info=cube_info->next_node++; in GetNodeInfo()
1967 next_node: in xmlTextReaderReadTree()2020 goto next_node; in xmlTextReaderReadTree()
14362 next_node: in xmlXPathRunStreamEval()14397 goto next_node; in xmlXPathRunStreamEval()14428 goto next_node; in xmlXPathRunStreamEval()
8272 goto next_node; in xmlDOMWrapRemoveNode()8309 next_node: in xmlDOMWrapRemoveNode()