Home
last modified time | relevance | path

Searched refs:nodes (Results 426 - 450 of 958) sorted by relevance

1...<<11121314151617181920>>...39

/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...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Dbackref.c491 eb = path->nodes[level]; in add_all_parents()
508 eb = path->nodes[0]; in add_all_parents()
519 eb = path->nodes[0]; in add_all_parents()
608 * other tree nodes. This happens when qgroups does backref walks when in resolve_indirect_ref()
680 eb = path->nodes[level]; in resolve_indirect_ref()
687 eb = path->nodes[level]; in resolve_indirect_ref()
731 * New backrefs (i.e., for parent nodes) are added to the appropriate
1035 leaf = path->nodes[0]; in add_inline_refs()
1170 leaf = path->nodes[0]; in add_keyed_refs()
1301 * If the node at this level is shared, than all nodes belo in lookup_backref_shared_cache()
[all...]
H A Ddefrag.c400 * leafs from path->nodes[1], so set lowest_level to 1 to avoid later in btrfs_defrag_leaves()
410 if (!path->nodes[1]) { in btrfs_defrag_leaves()
421 path->nodes[1], 0, in btrfs_defrag_leaves()
437 path->slots[1] = btrfs_header_nritems(path->nodes[1]); in btrfs_defrag_leaves()
474 * will not visit leaves and nodes with a generation smaller than given
515 if (path.slots[0] >= btrfs_header_nritems(path.nodes[0])) { in defrag_get_extent()
521 ASSERT(btrfs_header_nritems(path.nodes[0])); in defrag_get_extent()
522 path.slots[0] = btrfs_header_nritems(path.nodes[0]) - 1; in defrag_get_extent()
524 btrfs_item_key_to_cpu(path.nodes[0], &key, path.slots[0]); in defrag_get_extent()
532 btrfs_item_key_to_cpu(path.nodes[ in defrag_get_extent()
[all...]
/third_party/selinux/libsepol/src/
H A Dnode_internal.h5 #include <sepol/nodes.h>
/arkcompiler/ets_frontend/ets2panda/parser/
H A DETSparser.h70 void ProcessFormattedArg(std::vector<ir::AstNode *> &nodes, T &&arg) in ProcessFormattedArg() argument
73 nodes.emplace_back(std::forward<T>(arg)); in ProcessFormattedArg()
75 nodes.emplace_back(AllocNode<ir::Identifier>(std::forward<T>(arg), Allocator())); in ProcessFormattedArg()
77 nodes.emplace_back(AllocNode<ir::Identifier>(arg.View(), Allocator())); in ProcessFormattedArg()
79 nodes.emplace_back( in ProcessFormattedArg()
82 nodes.emplace_back(AllocNode<ir::Identifier>( in ProcessFormattedArg()
85 nodes.emplace_back(AllocNode<ir::OpaqueTypeNode>(std::forward<T>(arg))); in ProcessFormattedArg()
87 nodes.emplace_back(AllocNode<ir::TSInterfaceBody>(std::forward<T>(arg))); in ProcessFormattedArg()
89 nodes.emplace_back(AllocNode<ir::SequenceExpression>(std::forward<T>(arg))); in ProcessFormattedArg()
91 nodes in ProcessFormattedArg()
[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...]
/kernel/linux/linux-5.10/include/trace/events/
H A Dbcache.h298 TP_PROTO(unsigned nodes),
299 TP_ARGS(nodes),
302 __field(unsigned, nodes )
306 __entry->nodes = nodes;
309 TP_printk("coalesced %u nodes", __entry->nodes)
/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
/kernel/linux/linux-6.6/drivers/md/persistent-data/
H A Ddm-btree.c550 * Redistributes entries between two btree nodes to make them
579 * Redistribute entries between three nodes. Assumes the central
625 * Splits a node by creating a sibling node and shifting half the nodes
693 s->nodes[1] = left; in split_one_into_two()
696 s->nodes[1] = right; in split_one_into_two()
734 * Splits two nodes into three. This is more work, but results in fuller
735 * nodes, so saves metadata space.
801 s->nodes[1] = left; in split_two_into_three()
805 s->nodes[1] = middle; in split_two_into_three()
809 s->nodes[ in split_two_into_three()
[all...]
/kernel/linux/linux-6.6/tools/perf/util/
H A Dheader.c702 struct numa_topology_node *n = &tp->nodes[i]; in write_numa_topology()
957 struct hybrid_topology_node *n = &tp->nodes[i]; in write_hybrid_topology()
1411 struct memory_node *nodes = NULL; in build_mem_topology() local
1437 reallocarray(nodes, cnt + 4, sizeof(*nodes)); in build_mem_topology()
1440 pr_err("Failed to write MEM_TOPOLOGY, size %zd nodes\n", size); in build_mem_topology()
1444 nodes = new_nodes; in build_mem_topology()
1447 ret = memory_node__read(&nodes[cnt], idx); in build_mem_topology()
1455 *nodesp = nodes; in build_mem_topology()
1456 qsort(nodes, cn in build_mem_topology()
1481 struct memory_node *nodes = NULL; write_mem_topology() local
2247 struct memory_node *nodes; print_mem_topology() local
2711 struct numa_node *nodes, *n; process_numa_topology() local
2975 struct memory_node *nodes; process_mem_topology() local
3070 struct hybrid_node *nodes, *n; process_hybrid_topology() local
[all...]
/third_party/ltp/testcases/kernel/include/
H A Dnuma_helper.h34 int get_allowed_nodes_arr(int flag, int *num_nodes, int **nodes);
/kernel/linux/linux-5.10/fs/unicode/
H A Dmkutf8data.c113 * Internal nodes are one byte for the node itself, and up to three
128 * Due to the way utf8 works, there cannot be branching nodes with
129 * NEXTBYTE set, and moreover those nodes always have a righthand
424 int nodes, singletons, leaves; in tree_walk() local
426 nodes = singletons = leaves = 0; in tree_walk()
444 nodes += 1; in tree_walk()
485 printf("nodes %d leaves %d singletons %d\n", in tree_walk()
486 nodes, leaves, singletons); in tree_walk()
638 * Prune internal nodes.
641 * been collapsed. There are still internal nodes tha
1198 int nodes[4]; emit() local
[all...]
/kernel/linux/linux-6.6/fs/unicode/
H A Dmkutf8data.c113 * Internal nodes are one byte for the node itself, and up to three
128 * Due to the way utf8 works, there cannot be branching nodes with
129 * NEXTBYTE set, and moreover those nodes always have a righthand
424 int nodes, singletons, leaves; in tree_walk() local
426 nodes = singletons = leaves = 0; in tree_walk()
444 nodes += 1; in tree_walk()
485 printf("nodes %d leaves %d singletons %d\n", in tree_walk()
486 nodes, leaves, singletons); in tree_walk()
638 * Prune internal nodes.
641 * been collapsed. There are still internal nodes tha
1198 int nodes[4]; emit() local
[all...]
/kernel/linux/linux-6.6/drivers/net/ethernet/mellanox/mlx5/core/en/
H A Dptp.c32 struct mlx5e_ptp_port_ts_cqe_tracker *nodes; member
41 struct mlx5e_ptp_port_ts_cqe_tracker *tracker = &list->nodes[metadata]; in mlx5e_ptp_port_ts_cqe_list_add()
53 struct mlx5e_ptp_port_ts_cqe_tracker *tracker = &list->nodes[metadata]; in mlx5e_ptp_port_ts_cqe_list_remove()
191 if (likely(pending_cqe_list->nodes[metadata_id].inuse)) { in mlx5e_ptp_handle_ts_cqe()
389 cqe_list->nodes = kvzalloc_node(array_size(db_sz, sizeof(*cqe_list->nodes)), in mlx5e_ptp_alloc_traffic_db()
391 if (!cqe_list->nodes) in mlx5e_ptp_alloc_traffic_db()
404 cqe_list->nodes[md].metadata_id = md; in mlx5e_ptp_alloc_traffic_db()
421 kvfree(cqe_list->nodes); in mlx5e_ptp_alloc_traffic_db()
443 kvfree(ptpsq->ts_cqe_pending_list->nodes); in mlx5e_ptp_free_traffic_db()
[all...]
/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/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
/kernel/linux/linux-5.10/tools/perf/util/
H A Dcputopo.h25 struct numa_topology_node nodes[]; member
/third_party/ffmpeg/libavcodec/
H A Dhuffman.h45 Node *nodes, HuffCmp cmp, int flags);
/arkcompiler/ets_frontend/ets2panda/compiler/core/
H A DETSfunction.cpp107 auto const checkInitializer = [](ArenaVector<ir::AstNode *> const &nodes) -> bool { in CompileAsStaticBlock()
108 for (auto const *const node : nodes) { in CompileAsStaticBlock()
/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()
/kernel/linux/linux-5.10/Documentation/sphinx/
H A Dkernel_abi.py44 from docutils import nodes, statemachine namespace
142 node = nodes.section()
/test/xts/acts/
H A Dget_dependency.py86 def get_all_dependencies(nodes, dependencies):
101 for node in nodes:

Completed in 25 milliseconds

1...<<11121314151617181920>>...39