Home
last modified time | relevance | path

Searched refs:nodes (Results 101 - 125 of 490) sorted by relevance

12345678910>>...20

/third_party/node/deps/v8/third_party/jinja2/
H A Doptimizer.py11 from . import nodes namespace
29 # Do constant folding. Some other nodes besides Expr have
31 if isinstance(node, nodes.Expr):
33 return nodes.Const.from_untrusted(
38 except nodes.Impossible:
/third_party/skia/third_party/externals/jinja2/
H A Doptimizer.py11 from . import nodes namespace
29 # Do constant folding. Some other nodes besides Expr have
31 if isinstance(node, nodes.Expr):
33 return nodes.Const.from_untrusted(
38 except nodes.Impossible:
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
H A Dgraphcycles_benchmark.cc30 std::vector<absl::synchronization_internal::GraphId> nodes(num_nodes); in BM_StressTest()
32 nodes[i] = g.GetId(reinterpret_cast<void*>(static_cast<uintptr_t>(i))); in BM_StressTest()
37 ABSL_RAW_CHECK(g.InsertEdge(nodes[i], nodes[j]), ""); in BM_StressTest()
/third_party/mesa3d/src/broadcom/compiler/
H A Dvir_register_allocate.c55 get_temp_class_bits(struct v3d_ra_node_info *nodes, in get_temp_class_bits() argument
58 return nodes->info[temp_to_node(temp)].class_bits; in get_temp_class_bits()
62 set_temp_class_bits(struct v3d_ra_node_info *nodes, in set_temp_class_bits() argument
65 nodes->info[temp_to_node(temp)].class_bits = class_bits; in set_temp_class_bits()
86 assert(temp < c->num_temps && temp < c->nodes.alloc_count); in choose_reg_class_for_temp()
87 return choose_reg_class(c, get_temp_class_bits(&c->nodes, temp)); in choose_reg_class_for_temp()
326 if (c->num_temps < c->nodes.alloc_count) in ensure_nodes()
329 c->nodes.alloc_count *= 2; in ensure_nodes()
330 c->nodes.info = reralloc_array_size(c, in ensure_nodes()
331 c->nodes in ensure_nodes()
774 struct v3d_ra_node_info *nodes; global() member
[all...]
/base/security/device_security_level/baselib/utils/src/
H A Dutils_state_machine.c40 static const StateNode *GetScheduleStateNode(const StateNode *nodes, uint32_t nodeCnt, uint32_t state, uint32_t event) in GetScheduleStateNode() argument
43 const StateNode *node = nodes + i; in GetScheduleStateNode()
76 void ScheduleMachine(const StateNode *nodes, uint32_t nodeCnt, StateMachine *machine, uint32_t event, const void *para) in ScheduleMachine() argument
79 if ((nodes == NULL) || (nodeCnt == 0) || (machine == NULL)) { in ScheduleMachine()
80 SECURITY_LOG_ERROR("invlid params, nodes or context is null"); in ScheduleMachine()
92 const StateNode *node = GetScheduleStateNode(nodes, nodeCnt, state, event); in ScheduleMachine()
109 return ScheduleMachine(nodes, nodeCnt, machine, nextEvent, nextPara); in ScheduleMachine()
/third_party/jinja2/
H A Dnativetypes.py8 from . import nodes namespace
17 """Return a native Python type from the list of compiled nodes. If
19 nodes are concatenated as strings. If the result can be parsed with
52 ``str()`` around output nodes.
63 self, node: nodes.Expr, frame: Frame, finalize: CodeGenerator._FinalizeInfo
68 raise nodes.Impossible()
70 if isinstance(node, nodes.TemplateData):
76 self, node: nodes.Expr, frame: Frame, finalize: CodeGenerator._FinalizeInfo
82 self, node: nodes.Expr, frame: Frame, finalize: CodeGenerator._FinalizeInfo
101 nodes ar
[all...]
/third_party/ltp/testcases/kernel/mem/cpuset/
H A Dcpuset01.c39 static int *nodes; variable
62 if (nodes[i] >= MAXNODES) in test_cpuset()
64 set_node(nmask, nodes[i]); in test_cpuset()
71 SAFE_CG_PRINTF(tst_cg, "cpuset.mems", "%d", nodes[0]); in test_cpuset()
72 SAFE_CG_PRINTF(tst_cg, "cpuset.mems", "%d", nodes[1]); in test_cpuset()
82 if (get_allowed_nodes_arr(NH_MEMS | NH_CPUS, &nnodes, &nodes) < 0) in setup()
/third_party/mesa3d/src/nouveau/codegen/
H A Dnv50_ir_graph.cpp203 nodes = new Graph::Node * [graph->getSize() + 1]; in DFSIterator()
206 nodes[graph->getSize()] = 0; in DFSIterator()
216 if (nodes) in ~DFSIterator()
217 delete[] nodes; in ~DFSIterator()
223 nodes[count++] = node; in search()
230 nodes[count++] = node; in search()
235 virtual void *get() const { return nodes[pos]; } in get()
239 Graph::Node **nodes; member in nv50_ir::DFSIterator
259 nodes = new Graph::Node * [graph->getSize() + 1]; in CFGIterator()
262 nodes[grap in CFGIterator()
323 Graph::Node **nodes; global() member in nv50_ir::CFGIterator
[all...]
/third_party/python/Lib/test/
H A Dtest_finalization.py360 nodes = [cls() for cls in classes]
361 for i in range(len(nodes)):
362 nodes[i].chain(nodes[i-1])
363 return nodes
368 nodes = self.build_chain(classes)
369 ids = [id(s) for s in nodes]
370 wrs = [weakref.ref(s) for s in nodes]
371 del nodes
382 nodes
[all...]
/third_party/ffmpeg/libavcodec/
H A Dylc.c64 Node *nodes, int node, in get_tree_codes()
69 s = nodes[node].sym; in get_tree_codes()
78 get_tree_codes(bits, lens, xlat, nodes, nodes[node].l, pfx, pl, in get_tree_codes()
81 get_tree_codes(bits, lens, xlat, nodes, nodes[node].r, pfx, pl, in get_tree_codes()
88 Node nodes[512]; in build_vlc() local
97 nodes[i].count = table[i]; in build_vlc()
98 nodes[i].sym = i; in build_vlc()
99 nodes[ in build_vlc()
63 get_tree_codes(uint32_t *bits, int16_t *lens, uint8_t *xlat, Node *nodes, int node, uint32_t pfx, int pl, int *pos) get_tree_codes() argument
[all...]
/third_party/node/test/common/
H A Dheap.js21 const nodes =
22 readHeapInfo(dump.nodes, meta.node_fields, meta.node_types, dump.strings);
26 for (const node of nodes) {
34 while (edgeIndex === nodes[fromNodeIndex].edge_count) {
38 const toNode = nodes[to_node / meta.node_fields.length];
39 const fromNode = nodes[fromNodeIndex];
51 for (const node of nodes) {
55 return nodes;
/foundation/graphic/graphic_3d/lume/LumeRender/src/loader/
H A Drender_node_graph_loader.cpp182 if (const auto nodes = json.find("nodes"); nodes) { in LoadString()
183 if (nodes->is_array()) { in LoadString()
184 nodeDescriptors.reserve(nodes->array_.size()); in LoadString()
185 for (auto const& node : nodes->array_) { in LoadString()
195 finalResult.error += "\"nodes\" must to be an array."; in LoadString()
199 if (const auto nodes = json.find("renderNodeGraphOutputResources"); nodes) { in LoadString()
200 outputResources.reserve(nodes in LoadString()
[all...]
/third_party/icu/icu4c/source/i18n/
H A Dcollationbuilder.cpp206 rootPrimaryIndexes(errorCode), nodes(errorCode) { in CollationBuilder()
326 int64_t node = nodes.elementAti(index); in addReset()
328 // then skip backwards over this and further "weaker" nodes. in addReset()
331 node = nodes.elementAti(index); in addReset()
361 // Tailor after the last node between adjacent root nodes. in addReset()
363 node = nodes.elementAti(index); in addReset()
376 node = nodes.elementAti(index); in addReset()
398 node = nodes.elementAti(i); in addReset()
412 // Skip weaker nodes and same-level tailored nodes in addReset()
833 binarySearchForRootPrimaryNode(const int32_t *rootPrimaryIndexes, int32_t length, const int64_t *nodes, uint32_t p) binarySearchForRootPrimaryNode() argument
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Dcollationbuilder.cpp206 rootPrimaryIndexes(errorCode), nodes(errorCode) { in CollationBuilder()
326 int64_t node = nodes.elementAti(index); in addReset()
328 // then skip backwards over this and further "weaker" nodes. in addReset()
331 node = nodes.elementAti(index); in addReset()
361 // Tailor after the last node between adjacent root nodes. in addReset()
363 node = nodes.elementAti(index); in addReset()
376 node = nodes.elementAti(index); in addReset()
398 node = nodes.elementAti(i); in addReset()
412 // Skip weaker nodes and same-level tailored nodes in addReset()
833 binarySearchForRootPrimaryNode(const int32_t *rootPrimaryIndexes, int32_t length, const int64_t *nodes, uint32_t p) binarySearchForRootPrimaryNode() argument
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dcollationbuilder.cpp212 rootPrimaryIndexes(errorCode), nodes(errorCode) { in CollationBuilder()
324 int64_t node = nodes.elementAti(index); in addReset()
326 // then skip backwards over this and further "weaker" nodes. in addReset()
329 node = nodes.elementAti(index); in addReset()
359 // Tailor after the last node between adjacent root nodes. in addReset()
361 node = nodes.elementAti(index); in addReset()
374 node = nodes.elementAti(index); in addReset()
396 node = nodes.elementAti(i); in addReset()
410 // Skip weaker nodes and same-level tailored nodes in addReset()
827 binarySearchForRootPrimaryNode(const int32_t *rootPrimaryIndexes, int32_t length, const int64_t *nodes, uint32_t p) binarySearchForRootPrimaryNode() argument
[all...]
/third_party/node/deps/npm/lib/utils/
H A Dsbom-spdx.js22 const spdxOutput = ({ npm, nodes, packageType }) => {
23 const rootNode = nodes.find(node => node.isRoot)
24 const childNodes = nodes.filter(node => !node.isRoot && !node.isLink)
31 for (let node of nodes) {
42 // Filter out edges that are linking to nodes not in the list
43 .filter(edge => nodes.find(n => n === edge.to))
50 const extraRelationships = nodes.filter(node => node.extraneous)
90 /* For workspace nodes, use the location from their linkNode */
H A Dsbom-cyclonedx.js29 const cyclonedxOutput = ({ npm, nodes, packageType, packageLockOnly }) => {
30 const rootNode = nodes.find(node => node.isRoot)
31 const childNodes = nodes.filter(node => !node.isRoot && !node.isLink)
36 for (let node of nodes) {
45 deps.push(toCyclonedxDependency(node, nodes))
170 const toCyclonedxDependency = (node, nodes) => {
174 // Filter out edges that are linking to nodes not in the list
175 .filter(edge => nodes.find(n => n === edge.to))
/third_party/skia/third_party/externals/angle2/src/compiler/translator/TranslatorMetalDirect/
H A DIntermRebuild.h16 // Walks the tree to rebuild nodes.
27 // - If multiple nodes are returned, children and post visits of the returned nodes are not
36 // If supplied, the nodes are spliced children at the spot of the original child.
45 // without modifying the visited nodes.
107 BaseResult(std::vector<TIntermNode *> &&nodes);
111 static BaseResult Multi(std::vector<TIntermNode *> &&nodes);
116 std::vector<TIntermNode *> nodes; in Multi() local
119 nodes.push_back(*nodesCurr); in Multi()
121 return std::move(nodes); in Multi()
150 Multi(std::vector<TIntermNode *> &&nodes) Multi() argument
183 Multi(std::vector<TIntermNode *> &&nodes) Multi() argument
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/
H A DIntermRebuild.h16 // Walks the tree to rebuild nodes.
27 // - If multiple nodes are returned, children and post visits of the returned nodes are not
36 // If supplied, the nodes are spliced children at the spot of the original child.
45 // without modifying the visited nodes.
107 BaseResult(std::vector<TIntermNode *> &&nodes);
111 static BaseResult Multi(std::vector<TIntermNode *> &&nodes);
116 std::vector<TIntermNode *> nodes; in Multi() local
119 nodes.push_back(*nodesCurr); in Multi()
121 return std::move(nodes); in Multi()
150 Multi(std::vector<TIntermNode *> &&nodes) Multi() argument
183 Multi(std::vector<TIntermNode *> &&nodes) Multi() argument
[all...]
/base/hiviewdfx/hicollie/frameworks/native/thread_sampler/
H A Dsample_stack_printer.cpp168 std::vector<SampleStackItem*> nodes; in Print() local
169 nodes.push_back(root_); in Print()
171 while (!nodes.empty()) { in Print()
172 SampleStackItem* back = nodes.back(); in Print()
176 nodes.pop_back(); in Print()
180 nodes.push_back(sibling); in Print()
184 nodes.push_back(child); in Print()
/third_party/ltp/testcases/kernel/syscalls/migrate_pages/
H A Dmigrate_pages02.c44 static int *nodes, nodeA, nodeB; variable
85 set_bit(old_nodes, nodes[i], 1); in migrate_to_node()
269 ret = get_allowed_nodes_arr(NH_MEMS, &num_nodes, &nodes); in setup()
274 tst_brk(TCONF, "at least 2 allowed NUMA nodes" in setup()
277 * find 2 nodes, which can hold NODE_MIN_FREEMEM bytes in setup()
287 p = numa_alloc_onnode(NODE_MIN_FREEMEM, nodes[i]); in setup()
294 if (addr_on_node(p + j) != nodes[i]) in setup()
302 nodeA = nodes[i]; in setup()
304 nodeB = nodes[i]; in setup()
311 tst_brk(TCONF, "at least 2 NUMA nodes wit in setup()
[all...]
/foundation/ability/ability_base/interfaces/kits/native/view_data/src/
H A Dview_data.cpp28 constexpr const char* VIEW_DATA_NODES = "nodes";
59 nodes.clear(); in FromJsonString()
66 nodes.emplace_back(pageNodeInfo); in FromJsonString()
78 auto size = nodes.size() > NODES_SIZE_LIMIT ? NODES_SIZE_LIMIT : nodes.size(); in ToJsonString()
80 jsonNodes.emplace_back(nodes[i].ToJsonString()); in ToJsonString()
/third_party/ninja/src/
H A Dninja.cc100 /// Loaded state (rules, nodes).
379 vector<Node*> nodes; in ToolGraph() local
381 if (!CollectTargetsFromArgs(argc, argv, &nodes, &err)) { in ToolGraph()
388 for (vector<Node*>::const_iterator n = nodes.begin(); n != nodes.end(); ++n) in ToolGraph()
481 int ToolTargetsList(const vector<Node*>& nodes, int depth, int indent) { in ToolTargetsList() argument
482 for (vector<Node*>::const_iterator n = nodes.begin(); in ToolTargetsList()
483 n != nodes.end(); in ToolTargetsList()
548 vector<Node*> nodes; in ToolDeps() local
550 for (vector<Node*>::const_iterator ni = deps_log_.nodes() in ToolDeps()
588 vector<Node*> nodes; ToolMissingDeps() local
753 vector<Node*> nodes; ToolCommands() local
811 vector<Node*> nodes; ToolInputs() local
[all...]
/third_party/node/deps/ngtcp2/ngtcp2/lib/
H A Dngtcp2_ksl.c154 memcpy(rblk->nodes, blk->nodes + ksl->nodelen * (blk->n - rblk->n), in ksl_split_blk()
167 * into 2 adjacent nodes. The new node is always inserted at the
185 memmove(blk->nodes + (i + 2) * ksl->nodelen, in ksl_split_node()
186 blk->nodes + (i + 1) * ksl->nodelen, in ksl_split_node()
246 * of nodes contained by |blk| is strictly less than
255 memmove(blk->nodes + (i + 1) * ksl->nodelen, blk->nodes + i * ksl->nodelen, in ksl_insert_node()
270 for (i = 0, node = (ngtcp2_ksl_node *)(void *)blk->nodes; in ksl_bsearch()
367 memmove(blk->nodes in ksl_remove_node()
[all...]
/third_party/node/deps/ngtcp2/nghttp3/lib/
H A Dnghttp3_ksl.c155 memcpy(rblk->nodes, blk->nodes + ksl->nodelen * (blk->n - rblk->n), in ksl_split_blk()
168 * into 2 adjacent nodes. The new node is always inserted at the
186 memmove(blk->nodes + (i + 2) * ksl->nodelen, in ksl_split_node()
187 blk->nodes + (i + 1) * ksl->nodelen, in ksl_split_node()
251 * of nodes contained by |blk| is strictly less than
260 memmove(blk->nodes + (i + 1) * ksl->nodelen, blk->nodes + i * ksl->nodelen, in ksl_insert_node()
276 for (i = 0, node = (nghttp3_ksl_node *)(void *)blk->nodes; in ksl_bsearch()
373 memmove(blk->nodes in ksl_remove_node()
[all...]

Completed in 16 milliseconds

12345678910>>...20