Home
last modified time | relevance | path

Searched refs:nodes (Results 226 - 250 of 490) sorted by relevance

12345678910>>...20

/third_party/node/deps/ngtcp2/nghttp3/lib/
H A Dnghttp3_ksl.h44 /* NGHTTP3_KSL_MAX_NBLK is the maximum number of nodes which a single
47 /* NGHTTP3_KSL_MIN_NBLK is the minimum number of nodes which a single
92 /* n is the number of nodes this object contains in nodes. */
94 /* leaf is nonzero if this block contains leaf nodes. */
98 /* nodes is a buffer to contain NGHTTP3_KSL_MAX_NBLK
103 uint8_t nodes[1]; member
125 * nghttp3_ksl_it is a forward iterator to iterate nodes.
230 * nghttp3_ksl_update_key replaces the key of nodes which has |old_key|
266 ((nghttp3_ksl_node *)(void *)((BLK)->nodes
[all...]
/third_party/mesa3d/src/tool/pps/
H A Dpps_device.cc78 int fd = open(device->nodes[DRM_NODE_RENDER], O_RDWR); in create_all()
104 int fd = open(device->nodes[DRM_NODE_RENDER], O_RDWR); in create()
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DNfaBuilder.java62 /** Adds a new path between the given source and target (all intermediate nodes are new). */
74 * Adds a new path between the given source and target nodes, along with an epsilon edge from the
83 checkArgument(graph.nodes().contains(s), "missing source node"); in addEpsilon()
84 checkArgument(graph.nodes().contains(s), "missing target node"); in addEpsilon()
/third_party/ffmpeg/libavcodec/
H A Dagm.c921 static void get_tree_codes(uint32_t *codes, Node *nodes, int idx, uint32_t pfx, int bitpos) in get_tree_codes() argument
926 get_tree_codes(codes, nodes, nodes[idx].child[0], pfx + (0 << bitpos), bitpos + 1); in get_tree_codes()
927 get_tree_codes(codes, nodes, nodes[idx].child[1], pfx + (1U << bitpos), bitpos + 1); in get_tree_codes()
936 Node nodes[512]; in make_new_tree() local
950 nodes[i].child[0] = -1; in make_new_tree()
951 nodes[i].child[1] = -1; in make_new_tree()
974 if (nodes[p].child[0] == -1) { in make_new_tree()
975 nodes[ in make_new_tree()
[all...]
H A Dqdm2.c1091 QDM2SubPNode *nodes[4]; in process_synthesis_subpackets() local
1093 nodes[0] = qdm2_search_subpacket_type_in_list(list, 9); in process_synthesis_subpackets()
1094 if (nodes[0]) in process_synthesis_subpackets()
1095 process_subpacket_9(q, nodes[0]); in process_synthesis_subpackets()
1097 nodes[1] = qdm2_search_subpacket_type_in_list(list, 10); in process_synthesis_subpackets()
1098 if (nodes[1]) in process_synthesis_subpackets()
1099 process_subpacket_10(q, nodes[1]); in process_synthesis_subpackets()
1103 nodes[2] = qdm2_search_subpacket_type_in_list(list, 11); in process_synthesis_subpackets()
1104 if (nodes[0] && nodes[ in process_synthesis_subpackets()
[all...]
H A Dhuffman.h45 Node *nodes, HuffCmp cmp, int flags);
/third_party/selinux/libsepol/src/
H A Dnode_internal.h5 #include <sepol/nodes.h>
/third_party/mesa3d/src/compiler/nir/
H A Dnir_from_ssa.c112 * nodes in a given set interfere. Merging two sets or checking for
114 * two lists of nodes.
125 struct exec_list nodes; member
138 foreach_list_typed(merge_node, node, node, &set->nodes) {
161 exec_list_make_empty(&set->nodes); in get_merge_node()
169 exec_list_push_head(&set->nodes, &node->node); in get_merge_node()
197 struct exec_node *an = exec_list_get_head(&a->nodes); in merge_merge_sets()
198 struct exec_node *bn = exec_list_get_head(&b->nodes); in merge_merge_sets()
231 /* List of all the nodes which dominate the current node, in dominance in merge_sets_interfere()
237 struct exec_node *an = exec_list_get_head(&a->nodes); in merge_sets_interfere()
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/
H A DIntermRebuild.cpp67 TIntermRebuild::BaseResult::BaseResult(std::vector<TIntermNode *> &&nodes) in BaseResult() argument
71 mMulti(std::move(nodes)) in BaseResult()
82 TIntermRebuild::BaseResult TIntermRebuild::BaseResult::Multi(std::vector<TIntermNode *> &&nodes) in Multi() argument
84 auto it = std::remove(nodes.begin(), nodes.end(), nullptr); in Multi()
85 nodes.erase(it, nodes.end()); in Multi()
86 return std::move(nodes); in Multi()
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
H A Dgraphcycles.cc284 NodeSet in; // List of immediate predecessor nodes in graph
285 NodeSet out; // List of immediate successor nodes in graph
294 explicit PointerMap(const Vec<Node*>* nodes) : nodes_(nodes) { in PointerMap() argument
353 Vec<int32_t> list_; // All nodes to reprocess
515 // We only need to consider nodes that fall in the range [ny->rank,nx->rank]. in InsertEdge()
534 // We instead keep a stack of nodes to visit. in ForwardDFS()
603 static void Sort(const Vec<Node*>& nodes, Vec<int32_t>* delta) { in Sort() argument
605 const Vec<Node*>* nodes; in Sort() member
607 return (*nodes)[ in Sort()
[all...]
/third_party/node/deps/npm/node_modules/postcss-selector-parser/dist/
H A Dparser.js248 // this look-ahead probably fails with comment nodes involved.
373 * otherwise an array of comment nodes with space before and after.
385 var nodes = [];
405 nodes.push(lastComment);
414 nodes.push(new _string["default"]({
425 return nodes;
430 * @param {*} nodes
432 _proto.convertWhitespaceNodesToSpace = function convertWhitespaceNodesToSpace(nodes, requiredSpace) {
439 nodes.forEach(function (n) {
488 var nodes
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A DStringTrieBuilder.java95 // In either case we need to fix-up linear-match nodes (for their maximum length) in buildImpl()
96 // and branch nodes (turning dynamic branch nodes into trees of in buildImpl()
97 // runtime-equivalent nodes), but the HashMap/hashCode()/equals() are omitted for in buildImpl()
98 // nodes other than final values. in buildImpl()
113 // Then we call root.register() to turn it into a tree of nodes in buildImpl()
129 nodes.clear(); in clearImpl()
146 Node oldNode=nodes.get(newNode); in registerNode()
152 oldNode=nodes.put(newNode, newNode); in registerNode()
168 Node oldNode=nodes in registerFinalValue()
891 private HashMap<Node, Node> nodes=new HashMap<Node, Node>(); global() field in StringTrieBuilder
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/util/
H A DStringTrieBuilder.java94 // In either case we need to fix-up linear-match nodes (for their maximum length) in buildImpl()
95 // and branch nodes (turning dynamic branch nodes into trees of in buildImpl()
96 // runtime-equivalent nodes), but the HashMap/hashCode()/equals() are omitted for in buildImpl()
97 // nodes other than final values. in buildImpl()
112 // Then we call root.register() to turn it into a tree of nodes in buildImpl()
128 nodes.clear(); in clearImpl()
145 Node oldNode=nodes.get(newNode); in registerNode()
151 oldNode=nodes.put(newNode, newNode); in registerNode()
167 Node oldNode=nodes in registerFinalValue()
890 private HashMap<Node, Node> nodes=new HashMap<Node, Node>(); global() field in StringTrieBuilder
[all...]
/third_party/nghttp2/doc/_exts/rubydomain/
H A Drubydomain.py14 from docutils import nodes namespace
24 from sphinx.util.nodes import make_refnode
97 Transform a Ruby signature into RST nodes.
404 targetnode = nodes.target('', '', ids=['module-' + modname], ismod=True)
410 node = nodes.paragraph()
411 node += nodes.emphasis('', _('Platforms: '))
412 node += nodes.Text(platform, platform)
426 # http://www.sphinx-doc.org/en/stable/extdev/nodes.html#sphinx.addnodes.index
/third_party/ltp/testcases/kernel/include/
H A Dnuma_helper.h34 int get_allowed_nodes_arr(int flag, int *num_nodes, int **nodes);
/foundation/ability/ability_base/interfaces/kits/native/view_data/include/
H A Dview_data.h27 // nodes has a limit size
29 // nodes has a limit size
36 std::vector<PageNodeInfo> nodes; member
/foundation/window/window_manager/wmserver/src/
H A Dwindow_controller.cpp298 std::vector<sptr<WindowNode>> nodes; in NotifyAfterAddWindow() local
299 nodes.emplace_back(node); in NotifyAfterAddWindow()
302 nodes.emplace_back(child); in NotifyAfterAddWindow()
305 for (auto& iter : nodes) { in NotifyAfterAddWindow()
311 accessibilityConnection_->NotifyAccessibilityWindowInfo(node->GetDisplayId(), nodes, in NotifyAfterAddWindow()
609 std::vector<sptr<WindowNode>> nodes; in RemoveWindowNode()
610 nodes.emplace_back(windowNode); in RemoveWindowNode()
612 nodes.emplace_back(child); in RemoveWindowNode()
614 for (auto& iter : nodes) { in RemoveWindowNode()
620 displayZoomController_->ClearZoomTransform(nodes); in RemoveWindowNode()
668 std::vector<sptr<WindowNode>> nodes; DestroyWindow() local
[all...]
/foundation/graphic/graphic_3d/lume/LumeRender/api/render/nodecontext/
H A Dintf_render_node_graph_manager.h62 /** Render nodes */
63 BASE_NS::vector<RenderNodeDesc> nodes; member
86 /** Render nodes */
87 BASE_NS::vector<RenderNodeDescInfo> nodes; member
105 * With dynamic render node graphs render nodes can be inserted or erased.
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/framework/test/
H A Dstore_test.cpp58 * @tc.desc: Set and query nodes.
70 QueryNodes nodes{ in HWTEST_F()
74 query.SetQueryNodes(tableName, std::move(nodes)); in HWTEST_F()
/test/xts/acts/
H A Dget_dependency.py86 def get_all_dependencies(nodes, dependencies):
101 for node in nodes:
/third_party/ltp/testcases/kernel/controllers/cpuset/cpuset_memory_spread_test/
H A Dcpuset_memory_spread_testset.sh37 # In general, the cache hog will use more than 10000 kb slab space on the nodes
38 # on which it is running. The other nodes' slab space has littler change.(less
290 while read spread cpus nodes exp_nodes
292 base_test "$spread" "$cpus" "$nodes" "$exp_nodes"
301 # while read spread cpus nodes exp_nodes
/third_party/node/deps/v8/tools/clusterfuzz/js_fuzzer/mutators/
H A Ddifferential_fuzz_mutator.js136 printVariables(path, nodes) {
138 for (const node of nodes) {
176 // original source files. We detect the dummy no-op nodes that were
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-graph-processor.h27 // // A function that processes the graph before the nodes are walked.
30 // // A function that processes the graph after the nodes are walked.
33 // // A function that processes each basic block before its nodes are walked.
98 for (node_it_ = block->nodes().begin(); node_it_ != block->nodes().end(); in ProcessGraph()
/third_party/python/Lib/
H A Dgraphlib.py21 # List of successor nodes. The list can contain duplicated elements as
33 of nodes, such that each node is, in the graph, an immediate predecessor of the
42 """Provides functionality to topologically sort a graph of hashable nodes"""
90 still be used to obtain as many nodes as possible until cycles block more
92 therefore no more nodes can be added using "add".
103 # nodes as possible before cycles block more progress
106 raise CycleError(f"nodes are in a cycle", cycle)
109 """Return a tuple of all the nodes that are ready.
111 Initially it returns all nodes with no predecessors; once those are marked
112 as processed by calling "done", further calls will return all new nodes tha
[all...]
/third_party/vk-gl-cts/scripts/log/
H A Dlog_to_xml.py101 def findFirstElementByName (nodes, name):
102 for node in nodes:

Completed in 20 milliseconds

12345678910>>...20