| /third_party/node/deps/npm/node_modules/postcss-selector-parser/dist/selectors/ |
| H A D | container.js | 22 if (!_this.nodes) { 23 _this.nodes = []; 30 this.nodes.push(selector); 35 this.nodes.unshift(selector); 39 return this.nodes[index]; 45 return this.nodes.indexOf(child); 50 this.nodes.splice(child, 1); 61 for (var _iterator = _createForOfIteratorHelperLoose(this.nodes), _step; !(_step = _iterator()).done;) { 65 this.nodes = []; 74 this.nodes [all...] |
| /third_party/ninja/src/ |
| H A D | deps_log_test.cc | 64 ASSERT_EQ("foo.h", log_deps->nodes[0]->path()); in TEST_F() 65 ASSERT_EQ("bar.h", log_deps->nodes[1]->path()); in TEST_F() 75 ASSERT_EQ(log1.nodes().size(), log2.nodes().size()); in TEST_F() 76 for (int i = 0; i < (int)log1.nodes().size(); ++i) { in TEST_F() 77 Node* node1 = log1.nodes()[i]; in TEST_F() 78 Node* node2 = log2.nodes()[i]; in TEST_F() 88 ASSERT_EQ("foo.h", log_deps->nodes[0]->path()); in TEST_F() 89 ASSERT_EQ("bar2.h", log_deps->nodes[1]->path()); in TEST_F() 264 ASSERT_EQ("foo.h", deps->nodes[ in TEST_F() [all...] |
| /foundation/distributeddatamgr/udmf/framework/common/ |
| H A D | graph.cpp | 68 std::stack<uint32_t> nodes; in Dfs() local 71 nodes.push(startNode); in Dfs() 75 while (!nodes.empty()) { in Dfs() 76 edge = adjList_[nodes.top()].firstEdge; in Dfs() 80 nodes.push(edge->adjIndex); in Dfs() 91 visited_[nodes.top()] = 2; // 2: all edge of the adj is visited. in Dfs() 92 nodes.pop(); in Dfs()
|
| /third_party/curl/tests/unit/ |
| H A D | unit1309.c | 73 /* number of nodes to add to the splay tree */ 77 struct Curl_tree nodes[NUM_NODES*3]; variable 84 /* add nodes */ 91 nodes[i].payload = &storage[i]; 92 root = Curl_splayinsert(key, root, &nodes[i]); 103 *(size_t *)nodes[rem].payload); 104 rc = Curl_splayremove(root, &nodes[rem], &root); 112 fail_unless(root == NULL, "tree not empty after removing all nodes"); 121 /* add some nodes with the same key */ 124 nodes[ [all...] |
| /third_party/node/deps/cares/src/lib/ |
| H A D | ares__parse_into_addrinfo.c | 64 struct ares_addrinfo_node *nodes = NULL; in ares__parse_into_addrinfo() local 134 ares_dns_rr_get_addr(rr, ARES_RR_A_ADDR), &nodes); in ares__parse_into_addrinfo() 142 &nodes); in ares__parse_into_addrinfo() 168 ares__addrinfo_cat_nodes(&ai->nodes, nodes); in ares__parse_into_addrinfo() 169 nodes = NULL; in ares__parse_into_addrinfo() 179 ares__freeaddrinfo_nodes(nodes); in ares__parse_into_addrinfo()
|
| /third_party/node/test/common/ |
| H A D | cpu-prof.js | 18 const frames = profile.nodes.filter((i) => { 22 return { frames, nodes: profile.nodes }; 26 const { frames, nodes } = getFrames(file, suffix); 30 console.log(nodes);
|
| /foundation/window/window_manager/wmserver/src/ |
| H A D | minimize_app.cpp | 119 auto nodes = iter.second; in IsNodeNeedMinimize() local 120 if (std::find(nodes.begin(), nodes.end(), node) != nodes.end()) { in IsNodeNeedMinimize() 138 auto nodes = needMinimizeAppNodes_.at(reason); in IsNodeNeedMinimizeWithReason() local 139 if (std::find(nodes.begin(), nodes.end(), node) != nodes.end()) { in IsNodeNeedMinimizeWithReason()
|
| /third_party/node/tools/inspector_protocol/jinja2/ |
| H A D | nativetypes.py | 4 from jinja2 import nodes namespace 11 def native_concat(nodes): 12 """Return a native Python type from the list of compiled nodes. If the 13 result is a single node, its value is returned. Otherwise, the nodes are 18 head = list(islice(nodes, 2)) 26 out = u''.join([text_type(v) for v in chain(head, nodes)]) 41 ``to_string`` on output nodes in generated code. 75 for child in node.nodes: 78 raise nodes.Impossible() 82 raise nodes [all...] |
| /kernel/linux/linux-6.6/drivers/interconnect/qcom/ |
| H A D | sc7280.c | 1290 .nodes = { &ebi }, 1296 .nodes = { &qxm_crypto }, 1303 .nodes = { &qnm_gemnoc_cnoc, &qnm_gemnoc_pcie }, 1309 .nodes = { &qnm_cnoc3_cnoc2, &xm_qdss_dap, 1337 .nodes = { &qhs_lpass_cfg, &qhs_pdm, 1345 .nodes = { &qns_nsp_gemnoc }, 1351 .nodes = { &qxm_nsp }, 1358 .nodes = { &ebi }, 1365 .nodes = { &qns_mem_noc_hf }, 1371 .nodes [all...] |
| H A D | sm8250.c | 1403 .nodes = { &ebi }, 1410 .nodes = { &ebi }, 1417 .nodes = { &qns_llcc }, 1424 .nodes = { &qns_mem_noc_hf }, 1431 .nodes = { &qxm_crypto }, 1438 .nodes = { &qnm_camnoc_hf, &qxm_mdp0, &qxm_mdp1 }, 1445 .nodes = { &alm_gpu_tcu, &alm_sys_tcu }, 1452 .nodes = { &qns_mem_noc_sf }, 1459 .nodes = { &qup0_core_master, &qup1_core_master, &qup2_core_master }, 1466 .nodes [all...] |
| H A D | sm8150.c | 1288 .nodes = { &ebi }, 1295 .nodes = { &ebi }, 1302 .nodes = { &qns_llcc }, 1309 .nodes = { &qns_mem_noc_hf }, 1316 .nodes = { &qxm_camnoc_hf0_uncomp, 1330 .nodes = { &qns_gem_noc_snoc }, 1337 .nodes = { &qxm_camnoc_sf, &qns2_mem_noc }, 1344 .nodes = { &acm_gpu_tcu, &acm_sys_tcu }, 1351 .nodes = { &qxm_rot, &qxm_venus0, &qxm_venus1, &qxm_venus_arm9 }, 1358 .nodes [all...] |
| H A D | sm8550.c | 1480 .nodes = { &ebi }, 1486 .nodes = { &qxm_crypto }, 1494 .nodes = { &qsm_cfg, &qhs_ahb2phy0, 1526 .nodes = { &qhs_display_cfg }, 1533 .nodes = { &qxm_nsp, &qns_nsp_gemnoc }, 1539 .nodes = { &qnm_lpass_lpinoc, &qns_lpass_aggnoc }, 1546 .nodes = { &ebi }, 1552 .nodes = { &qns_mem_noc_hf }, 1559 .nodes = { &qnm_camnoc_hf, &qnm_camnoc_icp, 1570 .nodes [all...] |
| /arkcompiler/runtime_core/compiler/optimizer/optimizations/regalloc/ |
| H A D | reg_alloc_graph_coloring.cpp | 80 const ColorNode *FindFixedNode(const NodeVector &nodes, Location location) in FindFixedNode() argument 83 auto it = std::find_if(nodes.begin(), nodes.end(), [location](const auto &el) { in FindFixedNode() 88 return it != nodes.end() ? &*it : nullptr; in FindFixedNode() 91 const ColorNode *FindNode(const NodeVector &nodes, const Inst *inst) in FindNode() argument 94 auto it = std::find_if(nodes.begin(), nodes.end(), [inst](const auto &el) { in FindNode() 99 return it != nodes.end() ? &*it : nullptr; in FindNode() 106 auto &nodes = ig->GetNodes(); in PrecolorIG() local 108 // Walk nodes an in PrecolorIG() 154 auto &nodes = ig->GetNodes(); BuildBias() local 197 auto &nodes = ig->GetNodes(); AddAffinityEdges() local [all...] |
| /kernel/linux/linux-5.10/arch/sparc/kernel/ |
| H A D | cpumap.c | 45 int num_nodes; /* Number of nodes in a level in a cpuinfo tree */ 51 /* Offsets into nodes[] for each level of the tree */ 53 struct cpuinfo_node nodes[]; member 86 * nodes. 121 * end index, and number of nodes for each level in the cpuinfo tree. The 122 * total number of cpuinfo nodes required to build the tree is returned. 197 new_tree = kzalloc(struct_size(new_tree, nodes, n), GFP_ATOMIC); in build_cpuinfo_tree() 211 node = &new_tree->nodes[n]; in build_cpuinfo_tree() 252 node = &new_tree->nodes[level_rover[level]]; in build_cpuinfo_tree() 277 node = &new_tree->nodes[ in build_cpuinfo_tree() [all...] |
| /kernel/linux/linux-6.6/arch/sparc/kernel/ |
| H A D | cpumap.c | 45 int num_nodes; /* Number of nodes in a level in a cpuinfo tree */ 51 /* Offsets into nodes[] for each level of the tree */ 53 struct cpuinfo_node nodes[]; member 86 * nodes. 121 * end index, and number of nodes for each level in the cpuinfo tree. The 122 * total number of cpuinfo nodes required to build the tree is returned. 197 new_tree = kzalloc(struct_size(new_tree, nodes, n), GFP_ATOMIC); in build_cpuinfo_tree() 211 node = &new_tree->nodes[n]; in build_cpuinfo_tree() 252 node = &new_tree->nodes[level_rover[level]]; in build_cpuinfo_tree() 277 node = &new_tree->nodes[ in build_cpuinfo_tree() [all...] |
| /third_party/skia/third_party/externals/freetype/src/cache/ |
| H A D | ftcmru.c | 176 list->nodes = NULL; in FTC_MruList_Init() 186 while ( list->nodes ) in FTC_MruList_Reset() 187 FTC_MruList_Remove( list, list->nodes ); in FTC_MruList_Reset() 209 first = list->nodes; in FT_LOCAL_DEF() 220 FTC_MruNode_Up( &list->nodes, node ); in FT_LOCAL_DEF() 246 node = list->nodes->prev; in FT_LOCAL_DEF() 252 FTC_MruNode_Up( &list->nodes, node ); in FT_LOCAL_DEF() 259 FTC_MruNode_Remove( &list->nodes, node ); in FT_LOCAL_DEF() 272 FTC_MruNode_Prepend( &list->nodes, node ); in FT_LOCAL_DEF() 310 FTC_MruNode_Remove( &list->nodes, nod in FTC_MruList_Remove() [all...] |
| /third_party/ffmpeg/libavcodec/ |
| H A D | adpcmenc.c | 361 TrellisNode **nodes = nodep_buf; // nodes[] is always sorted by .ssd in adpcm_compress_trellis() local 368 nodes[0] = node_buf + frontier; in adpcm_compress_trellis() 369 nodes[0]->ssd = 0; in adpcm_compress_trellis() 370 nodes[0]->path = 0; in adpcm_compress_trellis() 371 nodes[0]->step = c->step_index; in adpcm_compress_trellis() 372 nodes[0]->sample1 = c->sample1; in adpcm_compress_trellis() 373 nodes[0]->sample2 = c->sample2; in adpcm_compress_trellis() 378 nodes[0]->sample1 = c->prev_sample; in adpcm_compress_trellis() 380 nodes[ in adpcm_compress_trellis() [all...] |
| /kernel/linux/linux-6.6/drivers/platform/surface/ |
| H A D | surface_aggregator_registry.c | 379 const struct software_node **nodes; in ssam_platform_hub_probe() local 384 nodes = (const struct software_node **)acpi_device_get_match_data(&pdev->dev); in ssam_platform_hub_probe() 385 if (!nodes) in ssam_platform_hub_probe() 399 status = software_node_register_node_group(nodes); in ssam_platform_hub_probe() 405 software_node_unregister_node_group(nodes); in ssam_platform_hub_probe() 414 software_node_unregister_node_group(nodes); in ssam_platform_hub_probe() 417 platform_set_drvdata(pdev, nodes); in ssam_platform_hub_probe() 423 const struct software_node **nodes = platform_get_drvdata(pdev); in ssam_platform_hub_remove() local 427 software_node_unregister_node_group(nodes); in ssam_platform_hub_remove()
|
| /third_party/ltp/include/ |
| H A D | tst_numa.h | 14 /** Number of nodes in map */ 25 * @nodes Numa nodemap. 27 void tst_nodemap_reset_counters(struct tst_nodemap *nodes); 32 * @nodes Numa nodemap. 34 void tst_nodemap_print_counters(struct tst_nodemap *nodes); 77 * @nodes Nodemap with initialized counters. 81 void tst_nodemap_count_pages(struct tst_nodemap *nodes, void *ptr, size_t size); 86 * @nodes Numa nodemap to be freed. 88 void tst_nodemap_free(struct tst_nodemap *nodes); 99 * Allocates and returns numa node map, which is an array of numa nodes whic [all...] |
| /third_party/node/deps/v8/third_party/jinja2/ |
| H A D | optimizer.py | 11 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 D | optimizer.py | 11 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 D | graphcycles_benchmark.cc | 30 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()
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | ctree.c | 217 if (!p->nodes[i]) in btrfs_release_path() 220 btrfs_tree_unlock_rw(p->nodes[i], p->locks[i]); in btrfs_release_path() 223 free_extent_buffer(p->nodes[i]); in btrfs_release_path() 224 p->nodes[i] = NULL; in btrfs_release_path() 911 * leaves and nodes. 1037 * node level balancing, used to make sure nodes are in proper order for 1058 mid = path->nodes[level]; in balance_level() 1066 parent = path->nodes[level + 1]; in balance_level() 1109 path->nodes[level] = NULL; in balance_level() 1266 path->nodes[leve in balance_level() [all...] |
| /kernel/linux/linux-5.10/sound/hda/ |
| H A D | hdac_sysfs.c | 16 struct kobject **nodes; member 328 if (tree->nodes) { in widget_tree_free() 329 for (p = tree->nodes; *p; p++) in widget_tree_free() 331 kfree(tree->nodes); in widget_tree_free() 377 tree->nodes = kcalloc(codec->num_nodes + 1, sizeof(*tree->nodes), in widget_tree_create() 379 if (!tree->nodes) in widget_tree_create() 384 &tree->nodes[i]); in widget_tree_create() 439 tree->nodes = kcalloc(num_nodes + 1, sizeof(*tree->nodes), GFP_KERNE in hda_widget_sysfs_reinit() [all...] |
| /kernel/linux/linux-6.6/sound/hda/ |
| H A D | hdac_sysfs.c | 16 struct kobject **nodes; member 328 if (tree->nodes) { in widget_tree_free() 329 for (p = tree->nodes; *p; p++) in widget_tree_free() 331 kfree(tree->nodes); in widget_tree_free() 377 tree->nodes = kcalloc(codec->num_nodes + 1, sizeof(*tree->nodes), in widget_tree_create() 379 if (!tree->nodes) in widget_tree_create() 384 &tree->nodes[i]); in widget_tree_create() 439 tree->nodes = kcalloc(num_nodes + 1, sizeof(*tree->nodes), GFP_KERNE in hda_widget_sysfs_reinit() [all...] |