Home
last modified time | relevance | path

Searched refs:node (Results 1351 - 1375 of 2502) sorted by relevance

1...<<51525354555657585960>>...101

/third_party/mesa3d/src/compiler/nir/
H A Dnir_opt_peephole_select.c432 /* At this point, we know that the previous CFG node is an if-then in nir_opt_peephole_select_block()
434 * just remove that entire CF node and replace all of the phi nodes with in nir_opt_peephole_select_block()
443 exec_node_remove(&instr->node); in nir_opt_peephole_select_block()
445 exec_list_push_tail(&prev_block->instr_list, &instr->node); in nir_opt_peephole_select_block()
449 exec_node_remove(&instr->node); in nir_opt_peephole_select_block()
451 exec_list_push_tail(&prev_block->instr_list, &instr->node); in nir_opt_peephole_select_block()
/third_party/ltp/testcases/kernel/controllers/cpuset/cpuset_lib/
H A Dcpuinfo.c253 int node = -1; in getcpuinfo() local
270 /* which node is every cpu belong to? */ in getcpuinfo()
272 node = cpuset_cpu2node(i); in getcpuinfo()
273 if (node == -1) in getcpuinfo()
275 cpus[i].nodeid = node; in getcpuinfo()
/third_party/node/src/
H A Dnode_process_object.cc14 namespace node { namespace
36 std::string title = GetProcessTitle("node"); in ProcessTitleGetter()
46 node::Utf8Value title(info.GetIsolate(), value); in ProcessTitleSetter()
111 versions, "node", per_process::metadata.versions.node); in CreateProcessObject()
255 } // namespace node
258 node::RegisterProcessExternalReferences)
H A Dstring_decoder.cc23 namespace node { namespace
40 isolate->ThrowException(node::ERR_STRING_TOO_LONG(isolate)); in MakeString()
343 } // namespace node
346 node::InitializeStringDecoder)
348 node::RegisterStringDecoderExternalReferences)
/third_party/node/deps/cares/src/lib/
H A Dares_qcache.c133 ares__slist_node_t *node; in ares__qcache_expire() local
139 while ((node = ares__slist_node_first(cache->expire)) != NULL) { in ares__qcache_expire()
140 const ares__qcache_entry_t *entry = ares__slist_node_val(node); in ares__qcache_expire()
146 ares__slist_node_destroy(node); in ares__qcache_expire()
/third_party/mesa3d/src/panfrost/bifrost/
H A Dcmdline.c85 exec_node_insert_node_before(&var->node, &new_var->node); in insert_sorted()
89 exec_list_push_tail(var_list, &new_var->node); in insert_sorted()
98 exec_node_remove(&var->node); in sort_varyings()
/third_party/lwip/src/apps/snmp/
H A Dsnmp_table.c49 const struct snmp_table_node *table_node = (const struct snmp_table_node *)(const void *)instance->node; in snmp_table_get_instance()
90 const struct snmp_table_node *table_node = (const struct snmp_table_node *)(const void *)instance->node; in snmp_table_get_next_instance()
167 const struct snmp_table_simple_node *table_node = (const struct snmp_table_simple_node *)(const void *)instance->node; in snmp_table_simple_get_instance()
229 const struct snmp_table_simple_node *table_node = (const struct snmp_table_simple_node *)(const void *)instance->node; in snmp_table_simple_get_next_instance()
/third_party/ltp/tools/sparse/sparse-src/
H A Dlinearize.h307 static inline void link_phi(struct instruction *node, pseudo_t phi) in link_phi() argument
309 use_pseudo(node, phi, add_pseudo(&node->phi_list, phi)); in link_phi()
310 phi->def->phi_node = node; in link_phi()
/third_party/mesa3d/src/gallium/drivers/freedreno/ir3/
H A Dir3_cmdline.c73 exec_node_insert_node_before(&var->node, &new_var->node); in insert_sorted()
77 exec_list_push_tail(var_list, &new_var->node); in insert_sorted()
86 exec_node_remove(&var->node); in sort_varyings()
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_ops/
H A DInitializeVariables.cpp264 bool visitDeclaration(Visit visit, TIntermDeclaration *node) override
266 for (TIntermNode *declarator : *node->getSequence())
289 // SimplifyLoopConditions should have been run so the parent node of this node
295 ASSERT(node->getSequence()->size() == 1);
305 queueReplacementWithParent(node, symbol, init, OriginalNode::BECOMES_CHILD);
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dscalar_analysis_nodes.h38 // Abstract class representing a node in the scalar evolution DAG. Each node
41 // using the SENodeHash functor. The vector of children is sorted when a node is
65 // If this is a constant node, assert. in AddChild()
67 assert(false && "Trying to add a child node to a constant!"); in AddChild()
70 // Find the first point in the vector where |child| is greater than the node in AddChild()
72 auto find_first_less_than = [child](const SENode* node) { in AddChild()
73 return child->unique_id_ <= node->unique_id_; in AddChild()
79 // for a node with the same children. X+Y should be the same as Y+X. in AddChild()
83 // Get the type as an std::string. This is used to represent the node i
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dscalar_analysis_nodes.h38 // Abstract class representing a node in the scalar evolution DAG. Each node
41 // using the SENodeHash functor. The vector of children is sorted when a node is
65 // If this is a constant node, assert. in AddChild()
67 assert(false && "Trying to add a child node to a constant!"); in AddChild()
70 // Find the first point in the vector where |child| is greater than the node in AddChild()
72 auto find_first_less_than = [child](const SENode* node) { in AddChild()
73 return child->unique_id_ <= node->unique_id_; in AddChild()
79 // for a node with the same children. X+Y should be the same as Y+X. in AddChild()
83 // Get the type as an std::string. This is used to represent the node i
[all...]
/third_party/python/Lib/test/
H A Dtest_graphlib.py13 for node in nodes:
14 ts.done(node)
31 for node, dependson in graph.items():
32 ts.add(node, *dependson)
87 # Test same node multiple times in dependencies
103 # Test same node multiple times
153 with self.assertRaisesRegex(ValueError, "node 2 was not passed out"):
155 with self.assertRaisesRegex(ValueError, r"node 24 was not added using add\(\)"):
/third_party/python/Lib/idlelib/idle_test/
H A Dtest_browser.py39 self.assertIsInstance(mb.node, TreeNode)
55 mb.node.destroy = Func()
58 self.assertTrue(mb.node.destroy.called)
59 del mb.top.destroy, mb.node.destroy
237 # Verify that processing each sublist hits every node and
/third_party/spirv-tools/source/opt/
H A Dscalar_analysis_nodes.h38 // Abstract class representing a node in the scalar evolution DAG. Each node
41 // using the SENodeHash functor. The vector of children is sorted when a node is
65 // If this is a constant node, assert. in AddChild()
67 assert(false && "Trying to add a child node to a constant!"); in AddChild()
70 // Find the first point in the vector where |child| is greater than the node in AddChild()
72 auto find_first_less_than = [child](const SENode* node) { in AddChild()
73 return child->unique_id_ <= node->unique_id_; in AddChild()
79 // for a node with the same children. X+Y should be the same as Y+X. in AddChild()
83 // Get the type as an std::string. This is used to represent the node i
[all...]
/third_party/lzma/CPP/7zip/UI/Common/
H A DEnumDirItems.cpp1590 static void ConvertToLongNames(const UString &prefix, NWildcard::CCensorNode &node) in ConvertToLongNames() argument
1592 ConvertToLongNames(prefix, node.IncludeItems); in ConvertToLongNames()
1593 ConvertToLongNames(prefix, node.ExcludeItems); in ConvertToLongNames()
1595 for (i = 0; i < node.SubNodes.Size(); i++) in ConvertToLongNames()
1597 UString &name = node.SubNodes[i].Name; in ConvertToLongNames()
1603 for (i = 0; i < node.SubNodes.Size(); i++) in ConvertToLongNames()
1605 NWildcard::CCensorNode &nextNode1 = node.SubNodes[i]; in ConvertToLongNames()
1606 for (unsigned j = i + 1; j < node.SubNodes.Size();) in ConvertToLongNames()
1608 const NWildcard::CCensorNode &nextNode2 = node.SubNodes[j]; in ConvertToLongNames()
1613 node in ConvertToLongNames()
[all...]
/third_party/node/deps/v8/third_party/zlib/
H A Dtrees.c423 /* Index within the heap array of least frequent node in the Huffman tree */
446 * Restore the heap property by moving down the tree starting at node k,
447 * exchanging a node with the smallest of its two sons if necessary, stopping
454 int k; /* node to move down */
517 if (n > max_code) continue; /* not a leaf node */
624 int node; /* new node being created */ local
647 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
648 tree[node].Freq = 1;
649 s->depth[node]
[all...]
/third_party/node/deps/zlib/
H A Dtrees.c479 /* Index within the heap array of least frequent node in the Huffman tree */
502 * Restore the heap property by moving down the tree starting at node k,
503 * exchanging a node with the smallest of its two sons if necessary, stopping
566 if (n > max_code) continue; /* not a leaf node */ in gen_bitlen()
631 int node; /* new node being created */ in build_tree() local
654 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); in build_tree()
655 tree[node].Freq = 1; in build_tree()
656 s->depth[node] = 0; in build_tree()
657 s->opt_len--; if (stree) s->static_len -= stree[node] in build_tree()
[all...]
/third_party/libwebsockets/win32port/zlib/
H A Dtrees.c431 /* Index within the heap array of least frequent node in the Huffman tree */
454 * Restore the heap property by moving down the tree starting at node k,
455 * exchanging a node with the smallest of its two sons if necessary, stopping
462 int k; /* node to move down */
525 if (n > max_code) continue; /* not a leaf node */
632 int node; /* new node being created */ local
655 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
656 tree[node].Freq = 1;
657 s->depth[node]
[all...]
/third_party/skia/third_party/externals/zlib/
H A Dtrees.c423 /* Index within the heap array of least frequent node in the Huffman tree */
446 * Restore the heap property by moving down the tree starting at node k,
447 * exchanging a node with the smallest of its two sons if necessary, stopping
454 int k; /* node to move down */
517 if (n > max_code) continue; /* not a leaf node */
624 int node; /* new node being created */ local
647 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
648 tree[node].Freq = 1;
649 s->depth[node]
[all...]
/third_party/zlib/
H A Dtrees.c496 /* Index within the heap array of least frequent node in the Huffman tree */
519 * Restore the heap property by moving down the tree starting at node k,
520 * exchanging a node with the smallest of its two sons if necessary, stopping
585 if (n > max_code) continue; /* not a leaf node */ in gen_bitlen()
651 int node; /* new node being created */ in build_tree() local
674 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); in build_tree()
675 tree[node].Freq = 1; in build_tree()
676 s->depth[node] = 0; in build_tree()
677 s->opt_len--; if (stree) s->static_len -= stree[node] in build_tree()
[all...]
/third_party/node/deps/v8/tools/profview/
H A Dprofview.js517 let node = children[i];
521 if (node.type === "CAT") {
524 row.style.backgroundColor = bucketFromKind(node.type).backgroundColor;
529 c.textContent = (node.ticks * 100 / this.tickCount).toFixed(2) + "%";
533 c.textContent = (node.ticks * 100 / tree.ticks).toFixed(2) + "%";
538 c.textContent = (node.ownTicks * 100 / this.tickCount).toFixed(2) + "%";
547 nameCell.appendChild(createTypeNode(node.type));
548 nameCell.appendChild(createFunctionNode(node.name, node.codeId));
550 node
[all...]
/third_party/mesa3d/src/gallium/drivers/r600/sb/
H A Dsb_sched.cpp67 bool rp_kcache_tracker::try_reserve(node* n) { in try_reserve()
95 void rp_kcache_tracker::unreserve(node* n) { in unreserve()
742 node *d = v->any_def(); in init_uc_val()
762 unsigned post_scheduler::init_ucm(container_node *c, node *n) { in init_ucm()
784 node *n; in schedule_bb()
914 node *n = *I; in process_fetch()
969 node *n = *I; in process_alu()
1060 void post_scheduler::update_live(node *n, val_set *born) { in update_live()
1096 node *n = rt.slot(i); in process_group()
1640 unsigned post_scheduler::try_add_instruction(node *
[all...]
/third_party/ffmpeg/libavcodec/
H A Dj2kenc.c251 /** code the value stored in node */
252 static void tag_tree_code(Jpeg2000EncoderContext *s, Jpeg2000TgtNode *node, int threshold) in tag_tree_code() argument
257 while(node->parent){ in tag_tree_code()
258 stack[++sp] = node; in tag_tree_code()
259 node = node->parent; in tag_tree_code()
263 if (curval > node->temp_val) in tag_tree_code()
264 node->temp_val = curval; in tag_tree_code()
266 curval = node->temp_val; in tag_tree_code()
269 if (node in tag_tree_code()
289 tag_tree_update(Jpeg2000TgtNode *node) tag_tree_update() argument
[all...]
/third_party/gn/src/gn/
H A Derr.cc111 Err::Err(const ParseNode* node, in Err() argument
116 if (node) { in Err()
117 LocationRange range = node->GetRange(); in Err()

Completed in 22 milliseconds

1...<<51525354555657585960>>...101