| /third_party/ninja/src/ |
| H A D | manifest_parser_test.cc | 1053 EXPECT_EQ("could not determine root nodes of build graph", err); in TEST_F()
1068 vector<Node*> nodes = state.DefaultNodes(&err); in TEST_F() local
1070 ASSERT_EQ(3u, nodes.size()); in TEST_F()
1071 EXPECT_EQ("a", nodes[0]->path()); in TEST_F()
1072 EXPECT_EQ("b", nodes[1]->path()); in TEST_F()
1073 EXPECT_EQ("c", nodes[2]->path()); in TEST_F()
|
| H A D | build_test.cc | 283 // Mark all the out* nodes dirty
in TEST_F()
994 // added nodes, but not phony edges to the graph.
in TEST_F()
997 // Verify that nodes for blah.h and bar.h were added and that they
in TEST_F()
2304 EXPECT_EQ("in1", out1_deps->nodes[0]->path());
in TEST_F()
2309 EXPECT_EQ("in1", out2_deps->nodes[0]->path());
in TEST_F()
2333 EXPECT_EQ("in1", out1_deps->nodes[0]->path());
in TEST_F()
2334 EXPECT_EQ("in2", out1_deps->nodes[1]->path());
in TEST_F()
2339 EXPECT_EQ("in1", out2_deps->nodes[0]->path());
in TEST_F()
2340 EXPECT_EQ("in2", out2_deps->nodes[1]->path());
in TEST_F()
2364 EXPECT_EQ("in1", out1_deps->nodes[ in TEST_F()
[all...] |
| /third_party/node/deps/v8/src/maglev/ |
| H A D | maglev-regalloc.cc | 42 // Conditional control nodes don't cause holes themselves. So, the nearest in NearestPostDominatingHole()
90 // Compute, for all forward control nodes (i.e. excluding Return and JumpLoop) a
113 // tree, up to nodes which are holes (in this example, A, D, F and H).
302 node_it_ = block->nodes().begin(); in AllocateRegisters()
303 for (; node_it_ != block->nodes().end(); ++node_it_) { in AllocateRegisters()
573 (*block_it_)->nodes().Add(gap_move); in AddMoveBeforeCurrentNode()
574 node_it_ = (*block_it_)->nodes().end(); in AddMoveBeforeCurrentNode()
576 DCHECK_NE(node_it_, (*block_it_)->nodes().end()); in AddMoveBeforeCurrentNode()
|
| /third_party/skia/third_party/externals/jinja2/ |
| H A D | environment.py | 13 from . import nodes namespace
48 from .nodes import EvalContext
525 tree of nodes is used by the compiler to convert the template into
680 body = [nodes.Assign(nodes.Name("result", "store"), expr, lineno=1)]
681 template = self.from_string(nodes.Template(body, lineno=1))
|
| /third_party/protobuf/src/google/protobuf/util/ |
| H A D | field_mask_util.cc | 265 // by all leaf nodes descended from "node" to mask.
269 // Merge all leaf nodes of a sub-tree to another tree.
364 std::vector<Node*> nodes(parts.size()); in RemovePath()
369 nodes[i] = node; in RemovePath()
377 // If add any new nodes, cleanup. in RemovePath()
403 delete nodes[i]->children[parts[i]]; in RemovePath()
404 nodes[i]->children.erase(parts[i]); in RemovePath()
405 if (!nodes[i]->children.empty()) { in RemovePath()
432 // Now we found a matching node with the given path. Add all leaf nodes in IntersectPath()
|
| /third_party/icu/icu4j/tools/build/src/com/ibm/icu/dev/tool/coverage/ |
| H A D | JacocoReportCheck.java | 153 NodeList nodes = doc.getElementsByTagName("report"); in parseReport()
154 for (int idx = 0; idx < nodes.getLength(); idx++) { in parseReport()
155 Node node = nodes.item(idx); in parseReport()
|
| /third_party/node/src/ |
| H A D | heap_utils.cc | 109 Local<Array> nodes = Array::New(isolate_, nodes_.size()); in CreateObject() local
150 if (nodes->Set(context, i++, obj).IsNothing()) in CreateObject()
200 return handle_scope.Escape(nodes); in CreateObject()
|
| /third_party/mesa3d/src/loader/ |
| H A D | loader.c | 186 fd = loader_open_device(device->nodes[DRM_NODE_RENDER]); in loader_open_render_node()
224 render_node = strdup(dev_ptr->nodes[DRM_NODE_RENDER]); in loader_get_render_node()
402 fd = loader_open_device(devices[i]->nodes[DRM_NODE_RENDER]); in loader_get_user_preferred_fd()
|
| /third_party/node/deps/npm/node_modules/yallist/ |
| H A D | yallist.js | 323 Yallist.prototype.splice = function (start, deleteCount, ...nodes) {
348 for (var i = 0; i < nodes.length; i++) {
349 walker = insert(this, walker, nodes[i])
|
| /third_party/libdrm/tests/amdgpu/ |
| H A D | amdgpu_stress.c | 107 fd = open(devices[i]->nodes[DRM_NODE_RENDER], O_RDWR | O_CLOEXEC); in amdgpu_open_device()
117 devices[i]->nodes[DRM_NODE_RENDER], in amdgpu_open_device()
|
| /third_party/rust/crates/regex/regex-syntax/src/ast/ |
| H A D | visitor.rs | 37 /// nodes.
43 /// `Ast` nodes.
48 /// This method is called between child nodes of an
56 /// before descending into child nodes.
66 /// after descending into child nodes.
76 /// before descending into child nodes.
86 /// after descending into child nodes.
94 /// This method is called between the left hand and right hand child nodes
126 /// A stack of `Ast` nodes. This is roughly analogous to the call stack
149 /// The remaining child nodes t
[all...] |
| /foundation/arkui/ace_engine/test/unittest/core/pattern/flex/ |
| H A D | flex_new_test_ng.cpp | 85 // // step: create child nodes in HWTEST_F()
389 std::list<MagicLayoutNode> nodes = { child1 }; in HWTEST_F() local
390 flexLayoutAlgorithm->magicNodes_[2] = nodes; in HWTEST_F()
453 std::list<MagicLayoutNode> nodes = { child1 }; in HWTEST_F() local
454 flexLayoutAlgorithm->magicNodes_[2] = nodes; in HWTEST_F()
708 std::list<MagicLayoutNode> nodes = { child1, child2 }; in HWTEST_F() local
709 flexLayoutAlgorithm->magicNodes_[2] = nodes; in HWTEST_F()
|
| /third_party/ffmpeg/libavcodec/ |
| H A D | truemotion2.c | 108 int nodes; ///< total number of nodes in tree member
157 huff.nodes = get_bits(&ctx->gb, 17); in tm2_build_huff_table()
167 if ((huff.nodes <= 0) || (huff.nodes > 0x10000)) { in tm2_build_huff_table()
169 "nodes: %i\n", huff.nodes); in tm2_build_huff_table()
176 /* allocate space for codes - it is exactly ceil(nodes / 2) entries */ in tm2_build_huff_table()
177 huff.max_num = (huff.nodes + 1) >> 1; in tm2_build_huff_table()
|
| /base/hiviewdfx/faultloggerd/interfaces/innerkits/async_stack/include/ |
| H A D | unique_stack_table.h | 63 std::vector<UniStackNode> nodes; member
|
| /base/msdp/device_status/tools/vdev/include/ |
| H A D | virtual_device.h | 65 static void GetInputDeviceNodes(std::map<std::string, std::string> &nodes);
|
| /foundation/arkui/ace_engine/frameworks/core/common/recorder/ |
| H A D | node_data_cache.h | 75 void GetNodeData(const std::string& pageUrl, std::unordered_map<std::string, std::string>& nodes);
|
| /foundation/graphic/graphic_2d/rosen/modules/render_service_client/test/ |
| H A D | render_service_client_app_demo.cpp | 34 std::vector<std::shared_ptr<RSCanvasNode>> nodes; variable
|
| H A D | render_service_client_first_frame_callback_demo.cpp | 34 std::vector<std::shared_ptr<RSCanvasNode>> nodes; variable
|
| /foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/rdb/ |
| H A D | rdb_cloud.h | 66 static QueryNodes ConvertQuery(DBQueryNodes&& nodes);
|
| /foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/data_share/subscriber_managers/ |
| H A D | rdb_subscriber_manager.h | 87 void SetObserverNotifyOnEnabled(std::vector<ObserverNode> &nodes);
|
| /third_party/node/deps/v8/src/compiler/ |
| H A D | common-node-cache.h | 22 // Bundles various caches for common nodes.
85 // Return all nodes from the cache.
86 void GetCachedNodes(ZoneVector<Node*>* nodes);
|
| H A D | state-values-utils.h | 43 // ValueArray - array of nodes ({node} has to be nullptr).
69 Node* GetValuesNodeFromCache(Node** nodes, size_t count,
100 // Returns the number of empty nodes that were skipped over.
|
| H A D | js-graph.h | 77 // Adds all the cached nodes to the given list.
78 void GetCachedNodes(NodeVector* nodes);
80 // Cached global nodes.
|
| /third_party/python/Lib/lib2to3/ |
| H A D | btm_matcher.py | 5 leaves to the root of the AST and returns a set of nodes for further
6 matching. This reduces significantly the number of candidate nodes."""
33 self.nodes = [self.root]
91 recheck the nodes
|
| /third_party/rust/crates/regex/regex-syntax/src/hir/ |
| H A D | visitor.rs | 27 /// nodes.
33 /// `Hir` nodes.
38 /// This method is called between child nodes of an alternation.
66 /// A stack of `Hir` nodes. This is roughly analogous to the call stack
85 /// The remaining child nodes to visit (which may be empty).
93 /// The remaining child nodes to visit (which may be empty).
140 // Otherwise, we've finished visiting all the child nodes for in visit()
148 /// and only if there are child nodes in the HIR). Otherwise, return None.
|