| /kernel/linux/linux-5.10/Documentation/sphinx/ |
| H A D | automarkup.py | 7 from docutils import nodes namespace 106 repl.append(nodes.Text(t[done:m.start()])) 116 repl.append(nodes.Text(t[done:])) 132 target_text = nodes.Text(match.group(0)) 136 lit_text = nodes.literal(classes=['xref', 'c', class_s]) 183 target_text = nodes.Text(match.group(0)) 187 lit_text = nodes.literal(classes=['xref', 'c', class_str[match.re]]) 240 return nodes.Text(match.group(0)) 246 # kinds of nodes to prune. But this works well for now. 248 # The nodes [all...] |
| /third_party/node/deps/npm/test/lib/utils/ |
| H A D | sbom-spdx.js | 107 const res = spdxOutput({ npm, nodes: [root], packageType: 'application' }) 115 const res = spdxOutput({ npm, nodes: [node] }) 129 const res = spdxOutput({ npm, nodes: [node] }) 137 const res = spdxOutput({ npm, nodes: [node] }) 145 const res = spdxOutput({ npm, nodes: [node] }) 152 const res = spdxOutput({ npm, nodes: [node] }) 160 const res = spdxOutput({ npm, nodes: [node] }) 168 const res = spdxOutput({ npm, nodes: [node] }) 175 const res = spdxOutput({ npm, nodes: [node] }) 182 const res = spdxOutput({ npm, nodes [all...] |
| /kernel/linux/linux-6.6/drivers/interconnect/qcom/ |
| H A D | sdm670.c | 1053 .nodes = { &ebi }, 1060 .nodes = { &ebi }, 1067 .nodes = { &qns_llcc }, 1074 .nodes = { &qns_mem_noc_hf }, 1081 .nodes = { &qns_apps_io }, 1088 .nodes = { &qxm_camnoc_hf0_uncomp, 1102 .nodes = { &qns_memnoc_snoc }, 1109 .nodes = { &qns2_mem_noc }, 1116 .nodes = { &acm_tcu }, 1123 .nodes [all...] |
| H A D | sm8350.c | 1362 .nodes = { &ebi }, 1369 .nodes = { &qxm_crypto }, 1376 .nodes = { &qnm_gemnoc_cnoc, &qnm_gemnoc_pcie }, 1383 .nodes = { &xm_qdss_dap, 1437 .nodes = { &qhs_lpass_cfg, &qhs_pdm, &qhs_qspi, &qhs_sdc2, &qhs_sdc4 }, 1444 .nodes = { &qns_nsp_gemnoc }, 1451 .nodes = { &qxm_nsp }, 1458 .nodes = { &ebi }, 1465 .nodes = { &qns_mem_noc_hf }, 1472 .nodes [all...] |
| H A D | sdx55.c | 650 .nodes = { &ebi }, 657 .nodes = { &qns_llcc }, 664 .nodes = { &qxm_crypto }, 671 .nodes = { &qhm_snoc_cfg }, 678 .nodes = { &xm_apps_rdwr }, 685 .nodes = { &qns_memnoc_snoc, &qns_sys_pcie }, 692 .nodes = { &qns_snoc_memnoc }, 699 .nodes = { &qxs_imem }, 706 .nodes = { &xm_sdc1 }, 713 .nodes [all...] |
| /third_party/musl/porting/linux/user/src/exit/ |
| H A D | atexit.c | 27 static size_t g_len; // the number of nodes currently in use 28 static size_t g_capacity; // the number of available nodes 29 static struct node builtin[COUNT]; // 32 builtin nodes without malloc 38 struct node *nodes; in grow() local 41 nodes = builtin; in grow() 42 head = nodes; in grow() 44 nodes = malloc(sizeof(struct node) * COUNT); in grow() 45 if (nodes == NULL) { in grow() 51 nodes[i].next = nodes in grow() [all...] |
| /third_party/musl/src/exit/linux/ |
| H A D | atexit.c | 27 static size_t len; // the number of nodes currently in use 28 static size_t capacity; // the number of available nodes 29 static struct node builtin[COUNT]; // 32 builtin nodes without malloc 38 struct node *nodes; in grow() local 41 nodes = builtin; in grow() 42 head = nodes; in grow() 44 nodes = malloc(sizeof(struct node) * COUNT); in grow() 45 if (nodes == NULL) { in grow() 51 nodes[i].next = nodes in grow() [all...] |
| /third_party/node/deps/npm/node_modules/archy/examples/ |
| H A D | multi_line.js | 5 nodes : [ 9 nodes : [ 12 nodes : [ 15 nodes : [ 'hello', 'puny\nmeat' ]
|
| H A D | beep.js | 4 nodes : [ 8 nodes : [ 11 nodes : [ 14 nodes : [ 'hello', 'puny' ]
|
| /kernel/linux/linux-5.10/drivers/clk/zynqmp/ |
| H A D | clk-zynqmp.h | 39 const struct clock_topology *nodes); 44 const struct clock_topology *nodes); 50 const struct clock_topology *nodes); 55 const struct clock_topology *nodes); 61 const struct clock_topology *nodes);
|
| /third_party/typescript/tests/baselines/reference/ |
| H A D | recursiveExcessPropertyChecks.js | 13 const nodes = [] as ITreeItem[]; 14 getMaxId(nodes); 22 var nodes = [];
variable 23 getMaxId(nodes);
|
| H A D | typeArgumentInferenceWithRecursivelyReferencedTypeAliasToTypeLiteral01.js | 7 var nodes: TreeNode[]; variable 8 nodes.map(n => n.name); 12 var nodes;
variable 13 nodes.map(function (n) { return n.name; });
|
| H A D | typeArgumentInferenceWithRecursivelyReferencedTypeAliasToTypeLiteral02.js | 12 var nodes: TreeNodeMiddleman[]; variable 13 nodes.map(n => n.name); 17 var nodes;
variable 18 nodes.map(function (n) { return n.name; });
|
| /third_party/node/deps/openssl/openssl/crypto/x509/ |
| H A D | pcy_tree.c | 18 * If the maximum number of nodes in the policy tree isn't defined, set it to 19 * a generous default of 1000 nodes. 72 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++) { in tree_print() 74 sk_X509_POLICY_NODE_value(plev->nodes, i); in tree_print() 264 /* Iterate through all in nodes linking matches */ in tree_link_matching_nodes() 265 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { in tree_link_matching_nodes() 266 X509_POLICY_NODE *node = sk_X509_POLICY_NODE_value(last->nodes, i); in tree_link_matching_nodes() 296 /* Look for matching nodes in previous level */ in tree_link_nodes() 358 /* Locate unmatched nodes */ in tree_link_unmatched() 382 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); in tree_link_any() [all...] |
| /third_party/openssl/crypto/x509/ |
| H A D | pcy_tree.c | 18 * If the maximum number of nodes in the policy tree isn't defined, set it to 19 * a generous default of 1000 nodes. 72 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++) { in tree_print() 74 sk_X509_POLICY_NODE_value(plev->nodes, i); in tree_print() 264 /* Iterate through all in nodes linking matches */ in tree_link_matching_nodes() 265 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { in tree_link_matching_nodes() 266 X509_POLICY_NODE *node = sk_X509_POLICY_NODE_value(last->nodes, i); in tree_link_matching_nodes() 296 /* Look for matching nodes in previous level */ in tree_link_nodes() 358 /* Locate unmatched nodes */ in tree_link_unmatched() 382 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); in tree_link_any() [all...] |
| /third_party/node/deps/v8/third_party/jinja2/ |
| H A D | nativetypes.py | 5 from . import nodes namespace 13 def native_concat(nodes): 14 """Return a native Python type from the list of compiled nodes. If 16 nodes are concatenated as strings. If the result can be parsed with 20 :param nodes: Iterable of nodes to concatenate. 22 head = list(islice(nodes, 2)) 30 raw = u"".join([text_type(v) for v in chain(head, nodes)]) 40 ``to_string()`` around output nodes. 54 raise nodes [all...] |
| /third_party/ninja/src/ |
| H A D | deps_log.h | 74 bool RecordDeps(Node* node, TimeStamp mtime, const std::vector<Node*>& nodes); 75 bool RecordDeps(Node* node, TimeStamp mtime, int node_count, Node** nodes); 81 : mtime(mtime), node_count(node_count), nodes(new Node*[node_count]) {} in Deps() 82 ~Deps() { delete [] nodes; } in ~Deps() 85 Node** nodes; member 103 const std::vector<Node*>& nodes() const { return nodes_; } in nodes() function
|
| 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...] |
| /third_party/skia/third_party/externals/jinja2/ |
| H A D | nativetypes.py | 5 from . import nodes namespace 13 def native_concat(nodes): 14 """Return a native Python type from the list of compiled nodes. If 16 nodes are concatenated as strings. If the result can be parsed with 20 :param nodes: Iterable of nodes to concatenate. 22 head = list(islice(nodes, 2)) 30 raw = u"".join([text_type(v) for v in chain(head, nodes)]) 40 ``to_string()`` around output nodes. 54 raise nodes [all...] |
| /third_party/node/deps/npm/node_modules/archy/test/ |
| H A D | multi_line.js | 7 nodes : [ 11 nodes : [ 14 nodes : [ 17 nodes : [ 'hello', 'puny\nmeat' ]
|
| H A D | non_unicode.js | 7 nodes : [ 11 nodes : [ 14 nodes : [ 17 nodes : [ 'hello', 'puny' ]
|
| H A D | beep.js | 7 nodes : [ 11 nodes : [ 14 nodes : [ 17 nodes : [ 'hello', 'puny' ]
|
| /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...] |
| /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...] |