Home
last modified time | relevance | path

Searched refs:nodes (Results 76 - 100 of 924) sorted by relevance

12345678910>>...37

/kernel/linux/linux-5.10/drivers/gpu/drm/amd/amdgpu/
H A Damdgpu_vram_mgr.c261 struct drm_mm_node *nodes = mem->mm_node; in amdgpu_vram_mgr_bo_visible_size() local
271 for (usage = 0; nodes && pages; pages -= nodes->size, nodes++) in amdgpu_vram_mgr_bo_visible_size()
272 usage += amdgpu_vram_mgr_vis_size(adev, nodes); in amdgpu_vram_mgr_bo_visible_size()
317 struct drm_mm_node *nodes; in amdgpu_vram_mgr_new() local
353 nodes = kvmalloc_array((uint32_t)num_nodes, sizeof(*nodes), in amdgpu_vram_mgr_new()
355 if (!nodes) { in amdgpu_vram_mgr_new()
371 r = drm_mm_insert_node_in_range(mm, &nodes[ in amdgpu_vram_mgr_new()
432 struct drm_mm_node *nodes = mem->mm_node; amdgpu_vram_mgr_del() local
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Dinode-item.c93 return btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0], in btrfs_lookup_inode_extref()
135 extref = btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0], in btrfs_del_inode_extref()
143 leaf = path->nodes[0]; in btrfs_del_inode_extref()
207 ref = btrfs_find_name_in_backref(path->nodes[0], path->slots[0], name, in btrfs_del_inode_ref()
214 leaf = path->nodes[0]; in btrfs_del_inode_ref()
277 if (btrfs_find_name_in_ext_backref(path->nodes[0], in btrfs_insert_inode_extref()
289 leaf = path->nodes[0]; in btrfs_insert_inode_extref()
295 btrfs_set_inode_extref_name_len(path->nodes[0], extref, name_len); in btrfs_insert_inode_extref()
296 btrfs_set_inode_extref_index(path->nodes[0], extref, index); in btrfs_insert_inode_extref()
297 btrfs_set_inode_extref_parent(path->nodes[ in btrfs_insert_inode_extref()
[all...]
/kernel/linux/linux-5.10/drivers/md/persistent-data/
H A Ddm-btree-spine.c131 s->nodes[0] = NULL; in init_ro_spine()
132 s->nodes[1] = NULL; in init_ro_spine()
140 unlock_block(s->info, s->nodes[i]); in exit_ro_spine()
149 unlock_block(s->info, s->nodes[0]); in ro_step()
150 s->nodes[0] = s->nodes[1]; in ro_step()
154 r = bn_read_lock(s->info, new_child, s->nodes + s->count); in ro_step()
165 unlock_block(s->info, s->nodes[s->count]); in ro_pop()
173 block = s->nodes[s->count - 1]; in ro_node()
191 unlock_block(s->info, s->nodes[ in exit_shadow_spine()
[all...]
/third_party/skia/third_party/externals/swiftshader/src/Vulkan/
H A DVkDescriptorPool.cpp81 if(nodes.empty()) in findAvailableMemory()
87 const auto itLast = nodes.rbegin(); in findAvailableMemory()
97 const auto itBegin = nodes.begin(); in findAvailableMemory()
105 const auto itEnd = nodes.end(); in findAvailableMemory()
142 nodes.insert(Node(memory, sizes[i])); in allocateSets()
171 nodes.insert(Node(memory, sizes[i])); in allocateSets()
187 const auto itEnd = nodes.end(); in freeSet()
188 auto it = std::find(nodes.begin(), itEnd, asMemory(descriptorSet)); in freeSet()
191 nodes.erase(it); in freeSet()
197 nodes in reset()
[all...]
/third_party/python/Doc/tools/extensions/
H A Dc_annotations.py24 from docutils import nodes namespace
45 # Monkeypatch nodes.Node.findall for forwards compatability
52 nodes.Node.findall = findall
130 emph_node = nodes.emphasis(message, message,
137 ref_node += nodes.Text('Limited API')
139 ref_node += nodes.Text('Stable ABI')
142 emph_node += nodes.Text(' (as an opaque struct)')
144 emph_node += nodes.Text(' (including all members)')
146 emph_node += nodes.Text(' ' + record['ifdef_note'])
151 emph_node += nodes
[all...]
/kernel/linux/linux-6.6/drivers/interconnect/qcom/
H A Dsdx65.c611 .nodes = { &qxm_crypto },
618 .nodes = { &ebi },
625 .nodes = { &qhm_snoc_cfg,
658 .nodes = { &xm_sdc1 },
665 .nodes = { &qhm_audio, &qhm_spmi_fetcher1 },
672 .nodes = { &qhm_blsp1, &qhm_qpic },
679 .nodes = { &qxm_crypto },
686 .nodes = { &qns_llcc },
693 .nodes = { &qns_memnoc_snoc },
700 .nodes
[all...]
/third_party/mesa3d/src/util/
H A Dregister_allocate.c34 * edges in the graph between nodes that interfere (can't be allocated
41 * That likely causes other nodes to become trivially colorable as well.
43 * Then during the "select" process, nodes are popped off of that
122 * it allocates the nodes.
516 int n1_class = g->nodes[n1].class; in ra_add_node_adjacency()
517 int n2_class = g->nodes[n2].class; in ra_add_node_adjacency()
518 g->nodes[n1].q_total += g->regs->classes[n1_class]->q[n2_class]; in ra_add_node_adjacency()
520 util_dynarray_append(&g->nodes[n1].adjacency_list, unsigned int, n2); in ra_add_node_adjacency()
529 int n1_class = g->nodes[n1].class; in ra_node_remove_adjacency()
530 int n2_class = g->nodes[n in ra_node_remove_adjacency()
[all...]
/third_party/node/deps/v8/src/regexp/
H A Dregexp-ast.cc42 return ListCaptureRegisters(nodes()); in CaptureRegisters()
78 ZoneList<RegExpTree*>* nodes = this->nodes(); in IsAnchoredAtStart() local
79 for (int i = 0; i < nodes->length(); i++) { in IsAnchoredAtStart()
80 RegExpTree* node = nodes->at(i); in IsAnchoredAtStart()
93 ZoneList<RegExpTree*>* nodes = this->nodes(); in IsAnchoredAtEnd() local
94 for (int i = nodes->length() - 1; i >= 0; i--) { in IsAnchoredAtEnd()
95 RegExpTree* node = nodes->at(i); in IsAnchoredAtEnd()
169 for (int i = 0; i < that->nodes() in VisitAlternative()
331 RegExpAlternative(ZoneList<RegExpTree*>* nodes) RegExpAlternative() argument
[all...]
/base/msdp/device_status/tools/vdev/src/
H A Dvirtual_device.cpp47 std::map<std::string, std::string> nodes; in FindDeviceNode() local
48 GetInputDeviceNodes(nodes); in FindDeviceNode()
49 FI_HILOGD("There are %{public}zu device nodes", nodes.size()); in FindDeviceNode()
51 std::map<std::string, std::string>::const_iterator cItr = nodes.find(name); in FindDeviceNode()
52 if (cItr == nodes.cend()) { in FindDeviceNode()
81 void VirtualDevice::GetInputDeviceNodes(std::map<std::string, std::string> &nodes) in GetInputDeviceNodes() argument
107 std::map<std::string, std::string>::const_iterator cItr = nodes.find(name); in GetInputDeviceNodes()
108 if (cItr != nodes.end()) { in GetInputDeviceNodes()
109 nodes in GetInputDeviceNodes()
[all...]
/foundation/multimodalinput/input/test/facility/virtual_device/src/
H A Dgeneral_device.cpp70 std::map<std::string, std::string> nodes; in FindDeviceNode() local
71 GetInputDeviceNodes(nodes); in FindDeviceNode()
72 std::cout << "There are " << nodes.size() << " device nodes" << std::endl; in FindDeviceNode()
74 std::map<std::string, std::string>::const_iterator cItr = nodes.find(name); in FindDeviceNode()
75 if (cItr == nodes.cend()) { in FindDeviceNode()
102 void GeneralDevice::GetInputDeviceNodes(std::map<std::string, std::string> &nodes) in GetInputDeviceNodes() argument
126 std::map<std::string, std::string>::const_iterator cItr = nodes.find(name); in GetInputDeviceNodes()
127 if (cItr != nodes.end()) { in GetInputDeviceNodes()
128 nodes in GetInputDeviceNodes()
[all...]
/third_party/node/deps/openssl/openssl/crypto/
H A Dsparse_array.c55 void **nodes; member
69 void *nodes[SA_BLOCK_MAX_LEVELS]; in sa_doall() local
74 nodes[0] = sa->nodes; in sa_doall()
77 void ** const p = nodes[l]; in sa_doall()
90 nodes[l] = p[n]; in sa_doall()
165 p = sa->nodes; in ossl_sa_get()
196 p[0] = sa->nodes; in ossl_sa_set()
197 sa->nodes = p; in ossl_sa_set()
202 p = sa->nodes; in ossl_sa_set()
[all...]
/third_party/openssl/crypto/
H A Dsparse_array.c55 void **nodes; member
69 void *nodes[SA_BLOCK_MAX_LEVELS]; in sa_doall() local
74 nodes[0] = sa->nodes; in sa_doall()
77 void ** const p = nodes[l]; in sa_doall()
90 nodes[l] = p[n]; in sa_doall()
165 p = sa->nodes; in ossl_sa_get()
196 p[0] = sa->nodes; in ossl_sa_set()
197 sa->nodes = p; in ossl_sa_set()
202 p = sa->nodes; in ossl_sa_set()
[all...]
/kernel/linux/linux-6.6/Documentation/sphinx/
H A Dautomarkup.py7 from docutils import nodes namespace
110 repl.append(nodes.Text(t[done:m.start()]))
120 repl.append(nodes.Text(t[done:]))
143 target_text = nodes.Text(match.group(0))
154 lit_text = nodes.literal(classes=['xref', 'c', 'c-func'])
203 target_text = nodes.Text(match.group(0))
214 lit_text = nodes.literal(classes=['xref', 'c', class_str[match.re]])
268 return nodes.Text(match.group(0))
283 # The nodes.literal test catches ``literal text``, its purpose is to
286 if not isinstance(node, nodes
[all...]
/third_party/ninja/src/
H A Ddeps_log.cc61 const vector<Node*>& nodes) { in RecordDeps()
62 return RecordDeps(node, mtime, nodes.size(), in RecordDeps()
63 nodes.empty() ? NULL : (Node**)&nodes.front()); in RecordDeps()
67 int node_count, Node** nodes) { in RecordDeps()
71 // Assign ids to all nodes that are missing one. in RecordDeps()
78 if (nodes[i]->id() < 0) { in RecordDeps()
79 if (!RecordId(nodes[i])) in RecordDeps()
94 if (deps->nodes[i] != nodes[ in RecordDeps()
60 RecordDeps(Node* node, TimeStamp mtime, const vector<Node*>& nodes) RecordDeps() argument
66 RecordDeps(Node* node, TimeStamp mtime, int node_count, Node** nodes) RecordDeps() argument
[all...]
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/arborist/
H A Drebuild.js40 async rebuild ({ nodes, handleOptionalFailure = false } = {}) {
47 // failures in optional nodes, and just delete them. however, when
51 if (!nodes) {
52 nodes = await this.#loadDefaultNodes()
55 // separates links nodes so that it can run
62 } = this.#retrieveNodesByType(nodes)
76 // if we don't have a set of nodes, then just rebuild
79 let nodes
84 nodes = tree.inventory.filter(node =>
93 nodes
[all...]
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/finitestatematcher/compiler/
H A DMatcherCompiler.java72 * A map from nodes which are at the beginning of a sequence to that sequence. Not all nodes
123 * method which should be used to obtain output nodes.
139 * keys (nodes) in the order of the input by which they can be reached, the keys of the returned
151 * nodes which neither branch, nor are branched to. Each such sub-sequence is represented by a
160 ImmutableList.Builder<DfaNode> nodes = ImmutableList.builder(); in buildSequencesFrom()
162 nodes.add(current); in buildSequencesFrom()
172 Sequence seq = new Sequence(nodes.build()); in buildSequencesFrom()
193 * A contiguous sub-sequence of nodes in the DFA which neither branch, nor are branched to.
201 private final ImmutableList<DfaNode> nodes; field in MatcherCompiler.Sequence
203 Sequence(ImmutableList<DfaNode> nodes) Sequence() argument
[all...]
/kernel/linux/linux-5.10/lib/
H A Drbtree_test.c14 __param(int, nnodes, 100, "Number of nodes in the rb-tree");
28 static struct test_node *nodes = NULL; variable
153 nodes[i].key = prandom_u32_state(&rnd); in init()
154 nodes[i].val = prandom_u32_state(&rnd); in init()
248 nodes = kmalloc_array(nnodes, sizeof(*nodes), GFP_KERNEL); in rbtree_test_init()
249 if (!nodes) in rbtree_test_init()
261 insert(nodes + j, &root); in rbtree_test_init()
263 erase(nodes + j, &root); in rbtree_test_init()
277 insert_cached(nodes in rbtree_test_init()
[all...]
/kernel/linux/linux-6.6/lib/
H A Drbtree_test.c14 __param(int, nnodes, 100, "Number of nodes in the rb-tree");
28 static struct test_node *nodes = NULL; variable
153 nodes[i].key = prandom_u32_state(&rnd); in init()
154 nodes[i].val = prandom_u32_state(&rnd); in init()
248 nodes = kmalloc_array(nnodes, sizeof(*nodes), GFP_KERNEL); in rbtree_test_init()
249 if (!nodes) in rbtree_test_init()
261 insert(nodes + j, &root); in rbtree_test_init()
263 erase(nodes + j, &root); in rbtree_test_init()
277 insert_cached(nodes in rbtree_test_init()
[all...]
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DCollationBuilder.java51 nodes = new UVector64(); in CollationBuilder()
129 long node = nodes.elementAti(index); in addReset()
131 // then skip backwards over this and further "weaker" nodes. in addReset()
134 node = nodes.elementAti(index); in addReset()
161 // Tailor after the last node between adjacent root nodes. in addReset()
163 node = nodes.elementAti(index); in addReset()
176 node = nodes.elementAti(index); in addReset()
195 node = nodes.elementAti(i); in addReset()
209 // Skip weaker nodes and same-level tailored nodes in addReset()
585 binarySearchForRootPrimaryNode( int[] rootPrimaryIndexes, int length, long[] nodes, long p) binarySearchForRootPrimaryNode() argument
1598 private UVector64 nodes; global() field in CollationBuilder
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/coll/
H A DCollationBuilder.java55 nodes = new UVector64(); in CollationBuilder()
133 long node = nodes.elementAti(index); in addReset()
135 // then skip backwards over this and further "weaker" nodes. in addReset()
138 node = nodes.elementAti(index); in addReset()
165 // Tailor after the last node between adjacent root nodes. in addReset()
167 node = nodes.elementAti(index); in addReset()
180 node = nodes.elementAti(index); in addReset()
199 node = nodes.elementAti(i); in addReset()
213 // Skip weaker nodes and same-level tailored nodes in addReset()
589 binarySearchForRootPrimaryNode( int[] rootPrimaryIndexes, int length, long[] nodes, long p) binarySearchForRootPrimaryNode() argument
1602 private UVector64 nodes; global() field in CollationBuilder
[all...]
/foundation/graphic/graphic_2d/rosen/modules/render_service_client/test/
H A Drender_service_client_transition_demo.cpp57 std::vector<std::shared_ptr<RSCanvasNode>> nodes; variable
352 nodes.emplace_back(RSCanvasNode::Create()); in Transition1()
353 nodes[0]->SetBounds({ 0, 0, WINDOW_WIDTH, WINDOW_HEIGHT}); in Transition1()
359 nodes[0]->AddModifier(transitionModifier1); in Transition1()
360 nodes[0]->AddModifier(transitionModifier2); in Transition1()
364 nodes[0]->SetTransitionEffect(RSTransitionEffect::Asymmetric(transitionInEffect, transitionOutEffect)); in Transition1()
371 rootNode->AddChild(nodes[0]); in Transition1()
384 nodes[0]->RemoveModifier(transitionModifier1); in Transition1()
389 nodes.emplace_back(RSCanvasNode::Create()); in Transition2()
390 nodes[ in Transition2()
[all...]
H A Drender_service_client_modifier_demo.cpp40 std::vector<std::shared_ptr<RSCanvasNode>> nodes; variable
51 nodes.emplace_back(RSCanvasNode::Create()); in Init()
52 nodes[0]->SetBounds(0, 0, 100, 100); in Init()
53 nodes[0]->SetFrame(0, 0, 100, 100); in Init()
54 nodes[0]->SetBackgroundColor(Drawing::Color::COLOR_BLUE); in Init()
56 rootNode->AddChild(nodes[0], -1); in Init()
58 nodes.emplace_back(RSCanvasNode::Create()); in Init()
59 nodes[1]->SetBounds(0, 200, 200, 200); in Init()
60 nodes[1]->SetFrame(0, 200, 200, 200); in Init()
61 nodes[ in Init()
[all...]
H A Drender_service_client_gesture_interrupt_animation_demo.cpp42 std::vector<std::shared_ptr<RSCanvasNode>> nodes; variable
53 nodes.emplace_back(RSCanvasNode::Create()); in Init()
54 nodes[0]->SetBounds(10, 10, 100, 100); in Init()
55 nodes[0]->SetFrame(10, 10, 100, 100); in Init()
56 nodes[0]->SetBackgroundColor(SK_ColorBLUE); in Init()
58 rootNode->AddChild(nodes[0], -1); in Init()
60 rootNode->AddChild(nodes[0], -1); in Init()
153 // Build rosen renderThread & create nodes in main()
178 nodes[0]->SetTranslate(vec); in main()
192 nodes[ in main()
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Dinode-item.c102 return btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0], in btrfs_lookup_inode_extref()
142 extref = btrfs_find_name_in_ext_backref(path->nodes[0], path->slots[0], in btrfs_del_inode_extref()
150 leaf = path->nodes[0]; in btrfs_del_inode_extref()
211 ref = btrfs_find_name_in_backref(path->nodes[0], path->slots[0], name); in btrfs_del_inode_ref()
217 leaf = path->nodes[0]; in btrfs_del_inode_ref()
279 if (btrfs_find_name_in_ext_backref(path->nodes[0], in btrfs_insert_inode_extref()
291 leaf = path->nodes[0]; in btrfs_insert_inode_extref()
296 btrfs_set_inode_extref_name_len(path->nodes[0], extref, name->len); in btrfs_insert_inode_extref()
297 btrfs_set_inode_extref_index(path->nodes[0], extref, index); in btrfs_insert_inode_extref()
298 btrfs_set_inode_extref_parent(path->nodes[ in btrfs_insert_inode_extref()
[all...]
/foundation/arkui/ace_engine/adapter/ohos/osal/
H A Dview_data_wrap_ohos.cpp48 for (auto it = viewData.nodes.begin(); it != viewData.nodes.end(); ++it) { in ViewDataToType()
55 for (auto it = viewData.nodes.begin(); it != viewData.nodes.end(); ++it) { in ViewDataToType()
95 for (auto it = viewData.nodes.begin(); it != viewData.nodes.end(); ++it) { in GetPlaceHolderValue()
106 for (auto it = viewData.nodes.begin(); it != viewData.nodes.end(); ++it) { in GetPlaceHolderValue()
155 for (const auto& node: viewData.nodes) { in ViewDataWrapOhos()
162 viewData_.nodes in GetViewData()
[all...]

Completed in 15 milliseconds

12345678910>>...37