| /external/v8/src/ |
| locked-queue-inl.h | 62 Node* const next_node = head_->next.Value(); local
63 if (next_node == nullptr) return false;
64 *record = next_node->value;
65 head_ = next_node;
82 Node* const next_node = head_->next.Value(); local
83 if (next_node == nullptr) return false;
84 *record = next_node->value;
|
| /external/libcxxabi/src/ |
| fallback_malloc.cpp | 66 heap_offset next_node; // offset into heap member in struct:__anon27997::heap_node
86 freelist->next_node = offset_from_node(list_end);
109 prev = p, p = node_from_offset(p->next_node)) {
116 q->next_node = 0;
123 freelist = node_from_offset(p->next_node);
125 prev->next_node = p->next_node;
126 p->next_node = 0;
148 prev = p, p = node_from_offset(p->next_node)) {
170 cp->next_node = p->next_node
[all...] |
| /external/adhd/cras/src/common/ |
| utlist.h | 168 #define DL_INSERT(head, next_node, add) \
170 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); \
|
| /external/mesa3d/src/intel/compiler/ |
| brw_disasm_info.c | 40 struct exec_node *next_node = exec_node_get_next(&group->link); local
41 if (exec_node_is_tail_sentinel(next_node))
45 exec_node_data(struct inst_group, next_node, link);
164 struct exec_node *next_node = exec_node_get_next(&cur->link); local
165 if (exec_node_is_tail_sentinel(next_node))
169 exec_node_data(struct inst_group, next_node, link);
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| instruction_list.h | 81 iterator_template next_node = *this; local
82 ++next_node;
85 return next_node;
|
| /external/mesa3d/src/intel/tools/ |
| disasm.c | 90 struct exec_node *next_node = exec_node_get_next(&group->link); local
91 if (exec_node_is_tail_sentinel(next_node))
95 exec_node_data(struct inst_group, next_node, link);
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| instruction_list.h | 81 iterator_template next_node = *this; local
82 ++next_node;
85 return next_node;
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/lib2to3/ |
| btm_matcher.py | 71 next_node = BMNode()
72 start.transition_table[pattern[0]] = next_node
75 next_node = start.transition_table[pattern[0]]
78 end_nodes = self.add(pattern[1:], start=next_node)
80 end_nodes = [next_node]
|
| /external/python/cpython2/Lib/lib2to3/ |
| btm_matcher.py | 71 next_node = BMNode()
72 start.transition_table[pattern[0]] = next_node
75 next_node = start.transition_table[pattern[0]]
78 end_nodes = self.add(pattern[1:], start=next_node)
80 end_nodes = [next_node]
|
| /external/python/cpython3/Lib/lib2to3/ |
| btm_matcher.py | 71 next_node = BMNode()
72 start.transition_table[pattern[0]] = next_node
75 next_node = start.transition_table[pattern[0]]
78 end_nodes = self.add(pattern[1:], start=next_node)
80 end_nodes = [next_node]
|
| /external/bcc/src/cc/frontends/p4/compiler/ |
| topoSorting.py | 63 for next_node in node.edges:
64 res = visit(next_node, topo_sorting, sequence)
|
| /external/grpc-grpc/src/core/lib/security/credentials/alts/ |
| grpc_alts_credentials_client_options.cc | 122 target_service_account* next_node = node->next; local
124 node = next_node;
|
| /external/libchrome/base/sampling_heap_profiler/ |
| lock_free_address_hash_set.cc | 39 for (; node != nullptr; node = next_node(node)) {
64 node = next_node(node)) {
|
| lock_free_address_hash_set.h | 94 static Node* next_node(Node* node) { function in class:base::LockFreeAddressHashSet
125 for (Node* node = Bucket(key); node != nullptr; node = next_node(node)) {
|
| lock_free_address_hash_set_unittest.cc | 26 node; node = LockFreeAddressHashSet::next_node(node)) {
44 for (; node; node = set.next_node(node))
|
| /external/u-boot/common/ |
| update.c | 296 goto next_node;
304 goto next_node;
313 goto next_node;
321 goto next_node;
330 next_node:
|
| /external/tensorflow/tensorflow/core/kernels/boosted_trees/ |
| prediction_ops.cc | 157 node_id = resource->next_node(tree_id, node_id, i,
250 node_id = resource->next_node(tree_id, node_id, i,
364 node_id = resource->next_node(tree_id, node_id, i,
|
| resources.h | 67 int32 next_node(
|
| resources.cc | 53 int32 BoostedTreesEnsembleResource::next_node( function in class:tensorflow::BoostedTreesEnsembleResource
|
| /external/yapf/yapf/yapflib/ |
| split_penalty.py | 426 next_node = pytree_utils.FirstLeafNode(node.children[index + 1])
427 _SetSplitPenalty(next_node, ARITH_EXPR)
441 next_node = pytree_utils.FirstLeafNode(node.children[index + 1])
442 _SetSplitPenalty(next_node, TERM)
|
| /external/u-boot/fs/ext4/ |
| ext4_journal.c | 272 struct revoke_blk_list *next_node = NULL; local
282 next_node = tmp_node->next;
284 tmp_node = next_node;
|
| /external/antlr/runtime/Ruby/lib/antlr3/ |
| tree.rb | 1331 def next_node method in class:ANTLR3.CommonTree.TreeAdaptor.CommonTreeNodeStream.each.RewriteRuleTokenStream
1351 def next_node method in class:ANTLR3.CommonTree.TreeAdaptor.CommonTreeNodeStream.each.RewriteRuleSubtreeStream
[all...] |
| /external/mesa3d/src/compiler/nir/ |
| nir.c | [all...] |
| nir_validate.c | 817 nir_cf_node *next_node = nir_cf_node_next(&if_stmt->cf_node); local
818 validate_assert(state, next_node->type == nir_cf_node_block);
850 nir_cf_node *next_node = nir_cf_node_next(&loop->cf_node); local
851 validate_assert(state, next_node->type == nir_cf_node_block);
[all...] |
| /external/ImageMagick/MagickCore/ |
| quantize.c | 294 *next_node;
291 *next_node; member in struct:_CubeInfo
[all...] |
