| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | backref.h | 112 return iter->path->nodes[0]; in btrfs_backref_get_eb()
215 * Represent an edge connecting upper and lower backref nodes.
224 * linking list[UPPER] to its upper level nodes.
228 /* Two related nodes */
233 /* Red black tree of all backref nodes in the cache */
235 /* For passing backref nodes to btrfs_reloc_cow_block */
242 /* List of backref nodes with no child node */
257 /* List of useless backref nodes during backref cache build */
|
| /kernel/linux/linux-6.6/drivers/memory/tegra/ |
| H A D | tegra186-emc.c | 245 list_for_each_entry(node, &provider->nodes, node_list) { in tegra_emc_of_icc_xlate()
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | backref.h | 287 return iter->path->nodes[0]; in btrfs_backref_get_eb()
390 * Represent an edge connecting upper and lower backref nodes.
399 * linking list[UPPER] to its upper level nodes.
403 /* Two related nodes */
408 /* Red black tree of all backref nodes in the cache */
410 /* For passing backref nodes to btrfs_reloc_cow_block */
417 /* List of backref nodes with no child node */
432 /* List of useless backref nodes during backref cache build */
|
| /kernel/linux/linux-6.6/fs/jffs2/ |
| H A D | build.c | 95 - Scan physical nodes. Build map of inodes/dirents. Allocate inocaches as we go
109 lists of physical nodes */ in jffs2_build_filesystem()
251 raw = ic->nodes; in jffs2_build_remove_unlinked_inode()
307 The erase code will do that, when all the nodes are completely gone. in jffs2_build_remove_unlinked_inode()
322 of the medium to be available, for overhead caused by nodes being in jffs2_calc_trigger_levels()
335 /* When do we allow garbage collection to merge nodes to make in jffs2_calc_trigger_levels()
345 can't mark nodes obsolete on the medium, the old dirty nodes cause in jffs2_calc_trigger_levels()
|
| H A D | readinode.c | 156 /* 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/alsa-utils/topology/nhlt/intel/ssp/ |
| H A D | ssp-internal.h | 56 struct ssp_aux_config_node nodes[SSP_MAX_DAIS]; member
|
| /third_party/icu/icu4c/source/i18n/ |
| H A D | collationbuilder.h | 64 * 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/icu/icu4c/source/common/unicode/ |
| H A D | stringtriebuilder.h | 176 * 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 D | platform_surfaceless.c | 253 dri2_dpy->fd = loader_open_device(device->nodes[node_type]); in surfaceless_probe_device()
|
| /third_party/node/deps/icu-small/source/i18n/ |
| H A D | collationbuilder.h | 64 * 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 D | stringtriebuilder.h | 176 * 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 D | cdoc.py | 299 node = docutils.nodes.section()
|
| /third_party/node/deps/v8/src/compiler/ |
| H A D | schedule.h | 26 // 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 D | gpir.h | 161 /* 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 D | collationbuilder.h | 63 * 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 D | GraphWriter.h | 118 // 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 D | stringtriebuilder.h | 176 * 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 D | arena_impl.h | 158 CleanupNode nodes[1]; // True length is |size|. member
|
| /third_party/selinux/libsepol/cil/src/ |
| H A D | cil_tree.c | 241 if (datum->nodes == NULL) { in cil_tree_node_destroy()
|
| /foundation/arkui/ace_engine/frameworks/core/components/flex/ |
| H A D | render_flex.cpp | 327 // 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 D | renderer.cpp | 131 // 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 D | readinode.c | 156 /* 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 D | TranslatorVulkan.cpp | 773 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 D | text_pattern.cpp | 2913 // 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...] |
| /kernel/linux/linux-5.10/drivers/gpu/drm/i915/gt/ |
| H A D | intel_lrc.c | 200 * 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...] |