Home
last modified time | relevance | path

Searched refs:nodes (Results 726 - 750 of 925) sorted by relevance

1...<<21222324252627282930>>...37

/third_party/icu/icu4c/source/common/unicode/
H A Dstringtriebuilder.h176 * registerNode() and registerFinalValue() take ownership of their input nodes,
177 * and only return owned nodes.
190 // Hash set of nodes, maps from nodes to integer 1.
192 UHashtable *nodes; member in StringTrieBuilder
213 * Branch nodes in this trie data structure are not symmetric.
214 * Most branch edges "jump" to other nodes but the rightmost branch edges
222 * offset field which gets positive values when nodes are written.
229 * After root.markRightEdgesFirst(-1) the offsets of all nodes are negative
232 * @param edgeNumber The first edge number for this node and its sub-nodes
[all...]
/third_party/mesa3d/src/egl/drivers/dri2/
H A Dplatform_surfaceless.c253 dri2_dpy->fd = loader_open_device(device->nodes[node_type]); in surfaceless_probe_device()
/third_party/node/deps/icu-small/source/i18n/
H A Dcollationbuilder.h64 * node=nodes[index].
91 * Skips over nodes of weaker strength to maintain collation order
108 * Skips weaker nodes and tailored nodes if the current node is stronger
156 * Walks the tailoring graph and overwrites tailored nodes with new CEs.
158 * The nodes array can then be used only as a source of tailored CEs.
162 * Counts the tailored nodes of the given strength up to the next node
226 /** At most 1M nodes, limited by the 20 bits in node bit fields. */
229 * Node bit 6 is set on a primary node if there are nodes
234 * Node bit 5 is set on a primary or secondary node if there are nodes
405 UVector64 nodes; global() member in CollationBuilder
[all...]
/third_party/node/deps/icu-small/source/common/unicode/
H A Dstringtriebuilder.h176 * registerNode() and registerFinalValue() take ownership of their input nodes,
177 * and only return owned nodes.
190 // Hash set of nodes, maps from nodes to integer 1.
192 UHashtable *nodes; member in StringTrieBuilder
213 * Branch nodes in this trie data structure are not symmetric.
214 * Most branch edges "jump" to other nodes but the rightmost branch edges
222 * offset field which gets positive values when nodes are written.
229 * After root.markRightEdgesFirst(-1) the offsets of all nodes are negative
232 * @param edgeNumber The first edge number for this node and its sub-nodes
[all...]
/third_party/ltp/tools/sparse/sparse-src/Documentation/sphinx/
H A Dcdoc.py299 node = docutils.nodes.section()
/third_party/node/deps/v8/src/compiler/
H A Dschedule.h26 // A basic block contains an ordered list of nodes and ends with a control
28 // first nodes in the block.
32 // Possible control nodes that can end a block.
159 NodeVector* nodes() { return &nodes_; } in nodes() function in v8::internal::compiler::final
184 NodeVector nodes_; // nodes of this block in forward order.
198 // A schedule represents the result of assigning nodes to basic blocks
218 // Check if nodes {a} and {b} are in the same block.
288 // For CSA/Torque: Eliminates unnecessary phi nodes, including phis with a
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Dgpir.h161 /* for nodes relationship */
289 * worry about nodes that can't use the complex slot for (2), since there
302 * nodes for the next instruction) but when there is a complex1 node in
420 gpir_node *nodes[4]; member
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dcollationbuilder.h63 * node=nodes[index].
90 * Skips over nodes of weaker strength to maintain collation order
107 * Skips weaker nodes and tailored nodes if the current node is stronger
155 * Walks the tailoring graph and overwrites tailored nodes with new CEs.
157 * The nodes array can then be used only as a source of tailored CEs.
161 * Counts the tailored nodes of the given strength up to the next node
225 /** At most 1M nodes, limited by the 20 bits in node bit fields. */
228 * Node bit 6 is set on a primary node if there are nodes
233 * Node bit 5 is set on a primary or secondary node if there are nodes
403 UVector64 nodes; global() member in CollationBuilder
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
H A DGraphWriter.h118 // Emit all of the nodes in the graph... in writeGraph()
156 for (const auto Node : nodes<GraphType>(G)) in writeNodes()
/third_party/skia/third_party/externals/icu/source/common/unicode/
H A Dstringtriebuilder.h176 * registerNode() and registerFinalValue() take ownership of their input nodes,
177 * and only return owned nodes.
190 // Hash set of nodes, maps from nodes to integer 1.
192 UHashtable *nodes; member in StringTrieBuilder
213 * Branch nodes in this trie data structure are not symmetric.
214 * Most branch edges "jump" to other nodes but the rightmost branch edges
222 * offset field which gets positive values when nodes are written.
229 * After root.markRightEdgesFirst(-1) the offsets of all nodes are negative
232 * @param edgeNumber The first edge number for this node and its sub-nodes
[all...]
/third_party/protobuf/src/google/protobuf/
H A Darena_impl.h158 CleanupNode nodes[1]; // True length is |size|. member
/third_party/selinux/libsepol/cil/src/
H A Dcil_tree.c241 if (datum->nodes == NULL) { in cil_tree_node_destroy()
H A Dcil_resolve_ast.c566 a1_node = a1->datum.nodes->head->data; in cil_resolve_alias_to_actual()
574 a1_node = a1->datum.nodes->head->data; in cil_resolve_alias_to_actual()
2378 if (current != block->datum.nodes->head->data) { in cil_resolve_blockinherit_copy()
2459 if (block_datum->nodes && block_datum->nodes->head != block_datum->nodes->tail) { in cil_resolve_in()
2860 cil_list_append(((struct cil_symtab_datum*)catset)->nodes, in cil_build_call_args()
2890 cil_list_append(((struct cil_symtab_datum*)level)->nodes, in cil_build_call_args()
2920 cil_list_append(((struct cil_symtab_datum*)range)->nodes, in cil_build_call_args()
2954 cil_list_append(DATUM(ipaddr)->nodes, CIL_LIST_ITE in cil_build_call_args()
[all...]
/foundation/arkui/ace_engine/frameworks/core/components/flex/
H A Drender_flex.cpp327 // Hide nodes, reset properties and start next loop in PerformLayoutInWeightMode()
335 // Layout magic nodes in PerformLayoutInWeightMode()
940 std::list<MagicLayoutNode> nodes; in TravelChildrenFlexProps() local
941 nodes.emplace_back(node); in TravelChildrenFlexProps()
942 magicNodes_[idx] = nodes; in TravelChildrenFlexProps()
971 // push infinite nodes in ResizeByItem()
/foundation/graphic/graphic_3d/lume/LumeRender/src/
H A Drenderer.cpp131 // reset always, dependencies are redone with new nodes in InitializeRenderNodeContextData()
136 // with dynamic render node graphs, single nodes can be initialized in InitializeRenderNodeContextData()
409 rngd.nodes.push_back(move(rnd)); in CreateDefaultRenderNodeGraphs()
417 rngd.nodes.push_back(move(rnd)); in CreateDefaultRenderNodeGraphs()
430 rngd.nodes.push_back(move(rnd)); in CreateDefaultRenderNodeGraphs()
676 // render graph process for all render nodes of all render graphs in RenderFrameImpl()
893 // single threaded gpu resource creation with render nodes in ExecuteRenderNodes()
/kernel/linux/linux-5.10/fs/jffs2/
H A Dreadinode.c156 /* We only check the data CRC of unchecked nodes */ in check_tn_node()
206 * This function is used when we read an inode. Data nodes arrive in
207 * arbitrary order -- they may be older or newer than the nodes which
229 Note that such nodes won't be REF_UNCHECKED since there are no data to in jffs2_add_tn_to_tree()
301 /* ... and is good. Kill 'this' and any subsequent nodes which are also overlapped */ in jffs2_add_tn_to_tree()
313 dbg_readinode("Done killing overlapped nodes\n"); in jffs2_add_tn_to_tree()
445 we add nodes to the real fragtree, as long as they don't overlap. And
446 having thrown away the majority of overlapped nodes as we went, there
447 really shouldn't be many sets of nodes which do overlap. If we start at
448 the end, we can use the overlap markers -- we can just eat nodes whic
[all...]
H A Dnodemgmt.c53 * jffs2_reserve_space - request physical space to write nodes to flash
113 * of nodes. in jffs2_reserve_space()
132 * don't know, if unchecked size contains obsoleted nodes, which could give us some in jffs2_reserve_space()
134 * of nodes. in jffs2_reserve_space()
494 * Should only be used to report nodes for which space has been allocated
512 /* Allow non-obsolete nodes only to be added at the end of c->nextblock, in jffs2_add_physical_node_ref()
513 if c->nextblock is set. Note that wbuf.c will file obsolete nodes in jffs2_add_physical_node_ref()
609 function without actually obliterating any nodes or freeing in jffs2_mark_node_obsolete()
681 obliterate nodes that look obsolete. If they weren't in jffs2_mark_node_obsolete()
797 obsolete dirent nodes t in jffs2_mark_node_obsolete()
[all...]
H A Dnodelist.c220 /* Skip all the nodes which are completed before this one starts */ in jffs2_add_frag_to_fragtree()
383 /* If we now share a page with other nodes, mark either previous in jffs2_add_full_dnode_to_inode()
563 /* Pass 'c' argument to indicate that nodes should be marked obsolete as
627 ref->next_in_ino = ic->nodes; in jffs2_link_node_ref()
628 ic->nodes = ref; in jffs2_link_node_ref()
691 /* Calculate totlen from surrounding nodes or eraseblock */
/kernel/linux/linux-6.6/fs/jffs2/
H A Dreadinode.c156 /* We only check the data CRC of unchecked nodes */ in check_tn_node()
206 * This function is used when we read an inode. Data nodes arrive in
207 * arbitrary order -- they may be older or newer than the nodes which
229 Note that such nodes won't be REF_UNCHECKED since there are no data to in jffs2_add_tn_to_tree()
301 /* ... and is good. Kill 'this' and any subsequent nodes which are also overlapped */ in jffs2_add_tn_to_tree()
313 dbg_readinode("Done killing overlapped nodes\n"); in jffs2_add_tn_to_tree()
445 we add nodes to the real fragtree, as long as they don't overlap. And
446 having thrown away the majority of overlapped nodes as we went, there
447 really shouldn't be many sets of nodes which do overlap. If we start at
448 the end, we can use the overlap markers -- we can just eat nodes whic
[all...]
/third_party/skia/third_party/externals/angle2/src/compiler/translator/
H A DTranslatorVulkan.cpp773 std::array<TIntermNode *, 8> nodes = { in AddBresenhamEmulationFS() local
775 emulationSequence->insert(emulationSequence->begin(), nodes.begin(), nodes.end()); in AddBresenhamEmulationFS()
/foundation/arkui/ace_engine/frameworks/core/components_ng/pattern/text/
H A Dtext_pattern.cpp2913 // Depth-first iterates through all host's child nodes to collect the SpanNode object, building a text rendering in PreCreateLayoutWrapper()
2915 std::stack<SpanNodeInfo> nodes; in PreCreateLayoutWrapper() local
2917 nodes.push({ .node = *iter }); in PreCreateLayoutWrapper()
2920 InitSpanItem(nodes); in PreCreateLayoutWrapper()
2923 void TextPattern::InitSpanItem(std::stack<SpanNodeInfo> nodes) in InitSpanItem() argument
2931 if (!nodes.empty()) { in InitSpanItem()
2939 CollectSpanNodes(nodes, isSpanHasClick); in InitSpanItem()
3005 void TextPattern::CollectSpanNodes(std::stack<SpanNodeInfo> nodes, bool& isSpanHasClick) in CollectSpanNodes() argument
3007 while (!nodes.empty()) { in CollectSpanNodes()
3008 auto current = nodes in CollectSpanNodes()
[all...]
H A Dtext_pattern.h907 void CollectSpanNodes(std::stack<SpanNodeInfo> nodes, bool& isSpanHasClick);
918 void InitSpanItem(std::stack<SpanNodeInfo> nodes);
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/gt/
H A Dintel_lrc.c200 * engine, sorted by priority. Here we preallocate the nodes we need
206 } nodes[I915_NUM_ENGINES]; member
498 rb_entry(rb, typeof(*ve), nodes[engine->id].rb); in need_preempt()
1919 rb_entry(rb, typeof(*ve), nodes[engine->id].rb); in need_timeslice()
2107 rb_entry(rb, typeof(*ve), nodes[engine->id].rb); in execlists_dequeue()
2235 rb_entry(rb, typeof(*ve), nodes[engine->id].rb); in execlists_dequeue()
4410 rb_entry(rb, typeof(*ve), nodes[engine->id].rb); in execlists_reset_cancel()
5473 struct rb_node *node = &ve->nodes[sibling->id].rb; in rcu_virtual_context_destroy()
5634 struct ve_node * const node = &ve->nodes[sibling->id]; in virtual_submission_tasklet()
5867 GEM_BUG_ON(RB_EMPTY_NODE(&ve->nodes[siblin in intel_execlists_create_virtual()
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Dioctl.c1559 leaf = path->nodes[0]; in copy_to_sk()
1854 l = path->nodes[0]; in btrfs_search_path_in_tree()
1939 leaf = path->nodes[0]; in btrfs_search_path_in_tree_user()
1965 leaf = path->nodes[0]; in btrfs_search_path_in_tree_user()
2024 leaf = path->nodes[0]; in btrfs_search_path_in_tree_user()
2204 btrfs_header_nritems(path->nodes[0])) { in btrfs_ioctl_get_subvol_info()
2214 leaf = path->nodes[0]; in btrfs_ioctl_get_subvol_info()
2287 btrfs_header_nritems(path->nodes[0])) { in btrfs_ioctl_get_subvol_rootref()
2297 leaf = path->nodes[0]; in btrfs_ioctl_get_subvol_rootref()
2965 btrfs_set_dir_item_key(path->nodes[ in btrfs_ioctl_default_subvol()
[all...]
/foundation/arkui/ace_engine/test/unittest/core/syntax/
H A Drepeat_node_cache_syntax_test.cpp338 std::list<RefPtr<UINode>> nodes = repeatNode->GetChildren(); in HWTEST_F() local
339 EXPECT_EQ(nodes.size(), 0); in HWTEST_F()
496 * @tc.expected: Because there are no nodes nullptr is returned in HWTEST_F()

Completed in 45 milliseconds

1...<<21222324252627282930>>...37