| /third_party/ltp/testcases/kernel/controllers/cpuset/cpuset_memory_spread_test/ |
| H A D | cpuset_memory_spread_testset.sh | 37 # In general, the cache hog will use more than 10000 kb slab space on the nodes
38 # on which it is running. The other nodes' slab space has littler change.(less
290 while read spread cpus nodes exp_nodes
292 base_test "$spread" "$cpus" "$nodes" "$exp_nodes"
301 # while read spread cpus nodes exp_nodes
|
| /third_party/node/deps/v8/tools/clusterfuzz/js_fuzzer/mutators/ |
| H A D | differential_fuzz_mutator.js | 136 printVariables(path, nodes) {
138 for (const node of nodes) {
176 // original source files. We detect the dummy no-op nodes that were
|
| /third_party/node/deps/v8/src/maglev/ |
| H A D | maglev-graph-processor.h | 27 // // A function that processes the graph before the nodes are walked.
30 // // A function that processes the graph after the nodes are walked.
33 // // A function that processes each basic block before its nodes are walked.
98 for (node_it_ = block->nodes().begin(); node_it_ != block->nodes().end(); in ProcessGraph()
|
| /third_party/python/Lib/ |
| H A D | graphlib.py | 21 # List of successor nodes. The list can contain duplicated elements as
33 of nodes, such that each node is, in the graph, an immediate predecessor of the
42 """Provides functionality to topologically sort a graph of hashable nodes"""
90 still be used to obtain as many nodes as possible until cycles block more
92 therefore no more nodes can be added using "add".
103 # nodes as possible before cycles block more progress
106 raise CycleError(f"nodes are in a cycle", cycle)
109 """Return a tuple of all the nodes that are ready.
111 Initially it returns all nodes with no predecessors; once those are marked
112 as processed by calling "done", further calls will return all new nodes tha
[all...] |
| /third_party/vk-gl-cts/scripts/log/ |
| H A D | log_to_xml.py | 101 def findFirstElementByName (nodes, name):
102 for node in nodes:
|
| /third_party/vk-gl-cts/framework/common/ |
| H A D | tcuLibDrm.cpp | 122 int res = stat(devices[i]->nodes[j], &statBuf); in findDeviceNode()
130 return devices[i]->nodes[j]; in findDeviceNode()
|
| /kernel/linux/linux-6.6/fs/ntfs3/ |
| H A D | index.c | 661 struct indx_node *n = fnd->nodes[i]; in fnd_clear()
667 fnd->nodes[i] = NULL; in fnd_clear()
678 if (i < 0 || i >= ARRAY_SIZE(fnd->nodes)) in fnd_push()
680 fnd->nodes[i] = n; in fnd_push()
692 n = fnd->nodes[i]; in fnd_pop()
693 fnd->nodes[i] = NULL; in fnd_pop()
1230 n = fnd->nodes[level - 1]; in indx_find_sort()
1292 n = fnd->nodes[level - 1]; in indx_find_sort()
1368 n = fnd->nodes[fnd->level - 1]; in indx_find_raw()
1789 struct indx_node *n1 = fnd->nodes[leve in indx_insert_into_buffer()
[all...] |
| /arkcompiler/ets_runtime/ecmascript/dfx/hprof/tests/ |
| H A D | heap_tracker_third_test.cpp | 164 std::string nodes = "\"nodes\":["; in HWTEST_F_L0() local
166 uint32_t nodesSize = nodes.size(); in HWTEST_F_L0()
171 if (line.substr(0U, nodesSize) == nodes) { in HWTEST_F_L0()
|
| H A D | heap_tracker_first_test.cpp | 261 std::string nodes = "\"nodes\":[";
in HWTEST_F_L0() local
263 uint32_t nodesSize = nodes.size();
in HWTEST_F_L0()
268 if (line.substr(0U, nodesSize) == nodes) {
in HWTEST_F_L0()
|
| /foundation/arkui/ace_engine/frameworks/core/components/split_container/ |
| H A D | render_split_container.cpp | 69 std::list<MagicLayoutNode> nodes; in InitProperties() local
70 nodes.emplace_back(node); in InitProperties()
71 magicNodes_[idx] = nodes; in InitProperties()
|
| /foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/service/data_share/data/ |
| H A D | template_data.cpp | 41 std::vector<PredicateTemplateNode> nodes;
in ToTemplate() local
43 nodes.emplace_back(predicate.key, predicate.selectSql);
in ToTemplate()
45 return Template(nodes, scheduler);
in ToTemplate()
|
| /kernel/linux/linux-5.10/tools/perf/util/ |
| H A D | cputopo.c | 324 tp = zalloc(sizeof(*tp) + sizeof(tp->nodes[0])*nr); in numa_topology__new()
331 if (load_numa_node(&tp->nodes[i], node_map->map[i])) { in numa_topology__new()
350 zfree(&tp->nodes[i].cpus); in numa_topology__delete()
|
| /kernel/linux/linux-5.10/fs/ubifs/ |
| H A D | scan.c | 13 * determining what nodes are in an eraseblock. The scan is used to replay the
138 INIT_LIST_HEAD(&sleb->nodes); in ubifs_start_scan()
150 * Note, we ignore integrity errors (EBASMSG) because all the nodes are in ubifs_start_scan()
205 * nodes. in ubifs_add_snod()
213 list_add_tail(&snod->list, &sleb->nodes); in ubifs_add_snod()
359 head = &sleb->nodes; in ubifs_scan_destroy()
|
| /kernel/linux/linux-6.6/fs/ubifs/ |
| H A D | scan.c | 13 * determining what nodes are in an eraseblock. The scan is used to replay the
138 INIT_LIST_HEAD(&sleb->nodes); in ubifs_start_scan()
150 * Note, we ignore integrity errors (EBASMSG) because all the nodes are in ubifs_start_scan()
205 * nodes. in ubifs_add_snod()
213 list_add_tail(&snod->list, &sleb->nodes); in ubifs_add_snod()
359 head = &sleb->nodes; in ubifs_scan_destroy()
|
| /test/xts/hats/ai/nnrt/hdi/v1_0/nnrtFunctionTest/src/ |
| H A D | hdi_device_test.cpp | 161 * @tc.name : 模型算子支持查询，nodes为空
173 // set nodes to empty in HWTEST_F()
174 iModel->nodes = {}; in HWTEST_F()
188 * @tc.name : 模型算子支持查询，nodes中存在NodeType为-1
201 for (auto &node : iModel->nodes) { in HWTEST_F()
220 * @tc.name : 模型算子支持查询，nodes中存在NodeType为10000
233 for (auto &node : iModel->nodes) { in HWTEST_F()
|
| /test/xts/hats/ai/nnrt/hdi/v2_0/nnrtFunctionTest/src/ |
| H A D | hdi_device_test.cpp | 161 * @tc.name : 模型算子支持查询，nodes为空
173 // set nodes to empty in HWTEST_F()
174 iModel->nodes = {}; in HWTEST_F()
188 * @tc.name : 模型算子支持查询，nodes中存在NodeType为-1
201 for (auto &node : iModel->nodes) { in HWTEST_F()
220 * @tc.name : 模型算子支持查询，nodes中存在NodeType为10000
233 for (auto &node : iModel->nodes) { in HWTEST_F()
|
| /third_party/ffmpeg/libavcodec/ |
| H A D | fraps.c | 78 * Comparator - our nodes should ascend by count
97 Node nodes[512]; in fraps2_decode_plane() local
100 nodes[i].count = bytestream_get_le32(&src); in fraps2_decode_plane()
103 nodes, huff_cmp, in fraps2_decode_plane()
|
| /third_party/PyYAML/lib/yaml/ |
| H A D | __init__.py | 6 from .nodes import *
178 def serialize_all(nodes, stream=None, Dumper=Dumper,
200 for node in nodes:
|
| /third_party/node/tools/gyp/tools/ |
| H A D | pretty_vcproj.py | 39 """Compare function between 2 xml nodes."""
101 """Returns a list of all the node and sub nodes."""
198 # Insert the nodes in the correct order.
212 nodes = []
217 nodes.append(sub_node)
219 return nodes
241 # Look through all the nodes to find a match.
|
| /foundation/graphic/graphic_3d/lume/Lume_3D/src/gltf/ |
| H A D | gltf2_exporter.cpp | 205 vector<Entity> nodes; member
630 // reduce the numer of nodes until one remains (or there are multiple roots) in FindSkeletonRoot()
632 // select a range of nodes at an equal depth in FindSkeletonRoot()
640 // sort again according to updated depths and nodes in FindSkeletonRoot()
671 // gather all the joint nodes in ExportGltfSkins()
675 if (auto const jointIndex = FindHandleIndex(entities.nodes, jointEntity); in ExportGltfSkins()
696 const Entities& entities, array_view<const unique_ptr<Node>> nodes, const Entity trackEntity, in GetAnimationTarget()
701 if (auto const nodeIndex = FindHandleIndex(entities.nodes, static_cast<Entity>(trackComponent.target)); in GetAnimationTarget()
702 nodeIndex < nodes.size()) { in GetAnimationTarget()
703 target = nodes[nodeInde in GetAnimationTarget()
695 GetAnimationTarget(const INodeSystem& nodeSystem, const INameComponentManager& nameManager, const Entities& entities, array_view<const unique_ptr<Node>> nodes, const Entity trackEntity, const AnimationTrackComponent& trackComponent) GetAnimationTarget() argument
[all...] |
| /base/security/device_security_level/baselib/utils/include/ |
| H A D | utils_state_machine.h | 51 void ScheduleMachine(const StateNode *nodes, uint32_t nodeCnt, StateMachine *machine, uint32_t event, const void *para);
|
| /foundation/multimodalinput/input/test/facility/virtual_device/include/ |
| H A D | general_device.h | 46 void GetInputDeviceNodes(std::map<std::string, std::string> &nodes);
|
| /kernel/linux/linux-5.10/drivers/interconnect/qcom/ |
| H A D | bcm-voter.h | 20 .nodes = { __VA_ARGS__ }, \
|
| /kernel/linux/linux-5.10/drivers/interconnect/imx/ |
| H A D | imx.h | 57 struct imx_icc_node_desc *nodes,
|
| /kernel/linux/linux-5.10/drivers/staging/rtl8712/ |
| H A D | rtl871x_event.h | 88 struct event_node nodes[C2HEVENT_SZ]; member
|