Home
last modified time | relevance | path

Searched refs:nodes (Results 201 - 225 of 484) sorted by relevance

12345678910>>...20

/third_party/skia/third_party/externals/brotli/c/enc/
H A Dbackward_references_hq.h74 On return, the nodes[0..num_bytes] array will have the following
76 For each i in [1..num_bytes], if nodes[i].cost < kInfinity, then
77 (1) nodes[i].copy_length() >= 2
78 (2) nodes[i].command_length() <= i and
79 (3) nodes[i - nodes[i].command_length()].cost < kInfinity */
84 const int* dist_cache, Hasher* hasher, ZopfliNode* nodes);
87 const size_t num_bytes, const size_t block_start, const ZopfliNode* nodes,
/third_party/selinux/libsepol/cil/src/
H A Dcil_symtab.h39 struct cil_list *nodes; member
46 #define NODE(n) ((struct cil_tree_node *)(DATUM(n)->nodes->head->data))
/foundation/graphic/graphic_3d/lume/Lume_3D/src/util/
H A Drender_util.cpp101 for (auto& rnRef : desc.nodes) { in FillCameraDescsData()
125 for (auto& rnRef : desc.nodes) { in FillCameraPostProcessDescsData()
290 if (!desc.nodes.empty()) { in GetRenderNodeGraphDescs()
313 if (!ppDesc.nodes.empty()) { in GetRenderNodeGraphDescs()
345 for (auto& rnRef : desc.nodes) { in GetRenderNodeGraphDesc()
369 for (auto& rnRef : desc.nodes) { in GetRenderNodeGraphDesc()
/third_party/mesa3d/src/imgui/
H A Dimstb_rectpack.h128 STBRP_DEF void stbrp_init_target (stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes);
131 // using temporary storage provided by the array 'nodes', which is 'num_nodes' long
135 // There is no "shutdown" function. The 'nodes' memory must stay valid for
189 stbrp_node extra[2]; // we allocate two extra nodes so optimal user-node-count is 'width' not 'width+2'
250 // so that num_nodes is always enough nodes. in stbrp_setup_allow_out_of_mem()
260 STBRP_DEF void stbrp_init_target(stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes) in stbrp_init_target() argument
268 nodes[i].next = &nodes[i+1]; in stbrp_init_target()
269 nodes[i].next = NULL; in stbrp_init_target()
272 context->free_head = &nodes[ in stbrp_init_target()
[all...]
/third_party/skia/third_party/externals/imgui/
H A Dimstb_rectpack.h130 STBRP_DEF void stbrp_init_target (stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes);
133 // using temporary storage provided by the array 'nodes', which is 'num_nodes' long
137 // There is no "shutdown" function. The 'nodes' memory must stay valid for
191 stbrp_node extra[2]; // we allocate two extra nodes so optimal user-node-count is 'width' not 'width+2'
252 // so that num_nodes is always enough nodes. in stbrp_setup_allow_out_of_mem()
262 STBRP_DEF void stbrp_init_target(stbrp_context *context, int width, int height, stbrp_node *nodes, int num_nodes) in stbrp_init_target() argument
270 nodes[i].next = &nodes[i+1]; in stbrp_init_target()
271 nodes[i].next = NULL; in stbrp_init_target()
274 context->free_head = &nodes[ in stbrp_init_target()
[all...]
/third_party/jinja2/
H A Denvironment.py16 from . import nodes namespace
43 from .nodes import EvalContext
599 ) -> nodes.Template:
601 tree of nodes is used by the compiler to convert the template into
615 ) -> nodes.Template:
679 source: nodes.Template,
709 source: t.Union[str, nodes.Template],
720 source: t.Union[str, nodes.Template],
731 source: t.Union[str, nodes.Template],
811 body = [nodes
[all...]
/foundation/arkui/ace_engine/frameworks/core/common/recorder/
H A Dnode_data_cache.cpp174 void NodeDataCache::GetNodeData(const std::string& pageUrl, std::unordered_map<std::string, std::string>& nodes) in GetNodeData() argument
184 for (auto nodeIter = nodes.begin(); nodeIter != nodes.end(); nodeIter++) { in GetNodeData()
187 nodes[it->first] = it->second; in GetNodeData()
/foundation/arkui/ace_engine/frameworks/core/components_ng/syntax/
H A Dfor_each_node.cpp23 void MakeNodeMapById(const std::list<RefPtr<UINode>>& nodes, const std::list<std::string>& ids, in MakeNodeMapById() argument
26 ACE_DCHECK(ids.size() == nodes.size()); in MakeNodeMapById()
28 auto nodeIter = nodes.begin(); in MakeNodeMapById()
29 while (idsIter != ids.end() && nodeIter != nodes.end()) { in MakeNodeMapById()
209 // Collect IDs of removed nodes starting from 'oldNode' (incl.) in FinishRepeatRender()
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/
H A Daudit-report.js131 // which also have the affected nodes, and also create entries
147 // need to search for nodes we already would have added.
166 if (vuln.nodes.has(node)) {
171 vuln.nodes.add(node)
197 if (this.get(name).nodes.size === 0) {
203 // the nodes it references, then remove it from the advisory list.
206 const relevant = [...vuln.nodes]
252 // We don't provide fixes for top nodes other than root, but we
/third_party/mesa3d/src/panfrost/bifrost/
H A Dbi_opt_push_ubo.c223 * Create an undirected graph where nodes are 32-bit uniform indices and edges
224 * represent that two nodes are used in the same instruction.
232 unsigned nodes[BI_MAX_SRCS] = {}; in bi_create_fau_interference_graph() local
235 /* Set nodes[] to 32-bit uniforms accessed */ in bi_create_fau_interference_graph()
241 nodes[node_count++] = word; in bi_create_fau_interference_graph()
245 /* Create clique connecting nodes[] */ in bi_create_fau_interference_graph()
251 unsigned x = nodes[i], y = nodes[j]; in bi_create_fau_interference_graph()
254 /* Add undirected edge between the nodes */ in bi_create_fau_interference_graph()
314 /* Push unpaired nodes a in bi_opt_reorder_push()
[all...]
/third_party/skia/buildtools/checkdeps/
H A Dgraphdeps.py33 Also can highlight fanins and/or fanouts of certain nodes matching the
69 incl: Include only nodes matching this regexp; such nodes' fanin/fanout
71 excl: Exclude nodes matching this regexp; such nodes' fanin/fanout is
73 hilite_fanins: Highlight fanins of nodes matching this regexp with a
75 hilite_fanouts: Highlight fanouts of nodes matching this regexp with a
140 """Computes nodes' and edges' properties for the dependency graph |deps| and
187 # Edges and nodes are emphasized with color and line/border weight depending
235 nodes
[all...]
/foundation/ai/neural_network_runtime/example/drivers/nnrt/v2_0/hdi_cpu_service/src/
H A Dnnrt_device_service.cpp71 size_t nodeSize = model.nodes.size(); in GetSupportedOperation()
72 auto nodes = model.nodes; in GetSupportedOperation() local
76 ops[i] = regInstance.IsNodeTypeExist(nodes[i].nodeType); in GetSupportedOperation()
287 if (model.nodes.empty()) { in ValidateModel()
288 HDF_LOGE("Model has no nodes."); in ValidateModel()
343 for (auto& node : model.nodes) { in TransModelToGraph()
349 metaGraph->nodes.emplace_back(std::move(transNode)); in TransModelToGraph()
/third_party/ninja/src/
H A Dgraph.cc55 std::deque<Node*> nodes(1, initial_node); in RecomputeDirty()
57 // RecomputeNodeDirty might return new validation nodes that need to be in RecomputeDirty()
58 // checked for dirty state, keep a queue of nodes to visit. in RecomputeDirty()
59 while (!nodes.empty()) { in RecomputeDirty()
60 Node* node = nodes.front(); in RecomputeDirty()
61 nodes.pop_front(); in RecomputeDirty()
68 nodes.insert(nodes.end(), new_validation_nodes.begin(), in RecomputeDirty()
159 // Store any validation nodes from the edge for adding to the initial in RecomputeNodeDirty()
160 // nodes in RecomputeNodeDirty()
[all...]
/third_party/ltp/testcases/kernel/mem/lib/
H A Dmem.c172 int num_nodes, *nodes; in set_global_mempolicy() local
176 ret = get_allowed_nodes_arr(NH_MEMS|NH_CPUS, &num_nodes, &nodes); in set_global_mempolicy()
181 free(nodes); in set_global_mempolicy()
187 set_node(nmask, nodes[1]); in set_global_mempolicy()
193 "more than 2 numa nodes"); in set_global_mempolicy()
194 free(nodes); in set_global_mempolicy()
198 set_node(nmask, nodes[1]); in set_global_mempolicy()
199 set_node(nmask, nodes[2]); in set_global_mempolicy()
/third_party/mesa3d/src/egl/main/
H A Degldevice.c227 return dev->device->nodes[DRM_NODE_RENDER]; in _eglGetDRMDeviceRenderNode()
254 return dev->device->nodes[DRM_NODE_PRIMARY]; in _eglQueryDeviceStringEXT()
266 return dev->device ? dev->device->nodes[DRM_NODE_RENDER] : NULL; in _eglQueryDeviceStringEXT()
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/arborist/
H A Dindex.js106 // Get the actual nodes corresponding to a root node's child workspaces,
115 const nodes = []
131 nodes.push(node)
134 return nodes
137 // returns a set of workspace nodes and all their deps
/third_party/node/deps/v8/src/compiler/
H A Djs-graph.cc100 void JSGraph::GetCachedNodes(NodeVector* nodes) { in GetCachedNodes() argument
101 cache_.GetCachedNodes(nodes); in GetCachedNodes()
103 if (name##_) nodes->push_back(name##_); in GetCachedNodes()
H A Dloop-analysis.h42 // Represents a loop in the tree of loops, including the header nodes,
110 // Return a range which can iterate over the header nodes of {loop}.
119 // Return a range which can iterate over the body nodes of {loop}.
125 // Return a range which can iterate over the body nodes of {loop}.
131 // Return a range which can iterate over the nodes of {loop}.
183 // Find all nodes in the loop headed by {loop_header} if it contains no nested
186 // marked with LoopExit, LoopExitEffect, LoopExitValue, or End nodes.
188 // 1) the loop size (in graph nodes) exceeds {max_size},
197 // Copies a range of nodes any number of times.
200 // {max}: The maximum number of nodes tha
223 CopyNodes(Graph* graph, Zone* tmp_zone_, Node* dead, base::iterator_range<InputIterator> nodes, SourcePositionTable* source_positions, NodeOriginTable* node_origins) CopyNodes() argument
[all...]
/third_party/mesa3d/src/util/tests/
H A Ddag_test.cpp79 init_nodes(struct dag *dag, struct node *nodes, unsigned num_nodes) in init_nodes() argument
82 dag_init_node(dag, static_cast<struct dag_node *>(&nodes[i])); in init_nodes()
83 nodes[i].val = i; in init_nodes()
/third_party/skia/third_party/externals/angle2/src/tests/deqp_support/
H A DtcuRandomOrderExecutor.cpp94 static TestNode *findNodeByName(vector<TestNode *> &nodes, const std::string &name) in findNodeByName() argument
96 for (vector<TestNode *>::const_iterator node = nodes.begin(); node != nodes.end(); ++node) in findNodeByName()
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/bloat/
H A Dwebtreemap.js15 // Size of border around nodes.
99 // Given a list of rectangles |nodes|, the 1-d space available
105 function selectSpan(nodes, space, start) {
109 var node = nodes[start];
114 for (var end = start; node = nodes[end]; ++end) {
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dloop_dependence.cpp71 // and contains only the following types of nodes: SERecurrentNode, SEAddNode
91 auto nodes = std::vector<SERecurrentNode*>{}; in GetAllTopLevelRecurrences() local
93 nodes.push_back(recurrent_node); in GetAllTopLevelRecurrences()
99 nodes.insert(nodes.end(), child_nodes.begin(), child_nodes.end()); in GetAllTopLevelRecurrences()
103 return nodes; in GetAllTopLevelRecurrences()
109 auto nodes = std::vector<SEConstantNode*>{}; in GetAllTopLevelConstants() local
111 nodes.push_back(recurrent_node); in GetAllTopLevelConstants()
117 nodes.insert(nodes in GetAllTopLevelConstants()
124 AreOffsetsAndCoefficientsConstant( const std::vector<SERecurrentNode*>& nodes) AreOffsetsAndCoefficientsConstant() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dloop_dependence.cpp71 // and contains only the following types of nodes: SERecurrentNode, SEAddNode
91 auto nodes = std::vector<SERecurrentNode*>{}; in GetAllTopLevelRecurrences() local
93 nodes.push_back(recurrent_node); in GetAllTopLevelRecurrences()
99 nodes.insert(nodes.end(), child_nodes.begin(), child_nodes.end()); in GetAllTopLevelRecurrences()
103 return nodes; in GetAllTopLevelRecurrences()
109 auto nodes = std::vector<SEConstantNode*>{}; in GetAllTopLevelConstants() local
111 nodes.push_back(recurrent_node); in GetAllTopLevelConstants()
117 nodes.insert(nodes in GetAllTopLevelConstants()
124 AreOffsetsAndCoefficientsConstant( const std::vector<SERecurrentNode*>& nodes) AreOffsetsAndCoefficientsConstant() argument
[all...]
/third_party/spirv-tools/source/opt/
H A Dloop_dependence.cpp69 // and contains only the following types of nodes: SERecurrentNode, SEAddNode
89 auto nodes = std::vector<SERecurrentNode*>{}; in GetAllTopLevelRecurrences() local
91 nodes.push_back(recurrent_node); in GetAllTopLevelRecurrences()
97 nodes.insert(nodes.end(), child_nodes.begin(), child_nodes.end()); in GetAllTopLevelRecurrences()
101 return nodes; in GetAllTopLevelRecurrences()
107 auto nodes = std::vector<SEConstantNode*>{}; in GetAllTopLevelConstants() local
109 nodes.push_back(recurrent_node); in GetAllTopLevelConstants()
115 nodes.insert(nodes in GetAllTopLevelConstants()
122 AreOffsetsAndCoefficientsConstant( const std::vector<SERecurrentNode*>& nodes) AreOffsetsAndCoefficientsConstant() argument
[all...]
/third_party/node/deps/ngtcp2/ngtcp2/lib/
H A Dngtcp2_ksl.h43 /* NGTCP2_KSL_MAX_NBLK is the maximum number of nodes which a single
46 /* NGTCP2_KSL_MIN_NBLK is the minimum number of nodes which a single
90 /* n is the number of nodes this object contains in nodes. */
92 /* leaf is nonzero if this block contains leaf nodes. */
96 /* nodes is a buffer to contain NGTCP2_KSL_MAX_NBLK
101 uint8_t nodes[1]; member
123 * ngtcp2_ksl_it is a forward iterator to iterate nodes.
228 * ngtcp2_ksl_update_key replaces the key of nodes which has |old_key|
264 ((ngtcp2_ksl_node *)(void *)((BLK)->nodes
[all...]

Completed in 17 milliseconds

12345678910>>...20