Home
last modified time | relevance | path

Searched refs:nodes (Results 1 - 25 of 34) sorted by relevance

12

/arkcompiler/ets_runtime/tools/circuit_viewer/src/ir/
H A DIrToPicture.js82 static isLoopBack(l, nodes) {
83 if (XTools.CONFIG.OpTypeLoopBegin.indexOf(nodes[l.toId].ir.op) >= 0 && l.fromId === nodes[l.toId].ir.in[0][1]) {
86 if (XTools.CONFIG.OpTypeDependSelector.indexOf(nodes[l.toId].ir.op) >= 0 && l.fromId === nodes[l.toId].ir.in[1][1]) {
89 if (XTools.CONFIG.OpTypeValueSelector.indexOf(nodes[l.toId].ir.op) >= 0 && l.fromId === nodes[l.toId].ir.in[2][1]) {
95 let nodes = {};
113 nodes[ir.id] = {
136 this.generateLine(nodes, line
[all...]
H A DIrViewer.js118 IrToPicture.resetPicture(this.visable_.nodes, this.direct_.type.startsWith('block:'));
125 let nodes = this.visable_.nodes;
126 for (let k in nodes) {
127 if (this.selectPoint_.indexOf(parseInt(nodes[k].ir.id)) >= 0) {
130 this.hideNodeIds_.push(parseInt(nodes[k].ir.id));
140 let nodes = this.visable_.nodes;
144 let n1 = nodes[l.fromId];
145 let n2 = nodes[
[all...]
/arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/mpl2mpl/include/
H A Dscc.h29 : id(index), nodes(alloc.Adapter()), inScc(alloc.Adapter()), outScc(alloc.Adapter()) in SCCNode()
37 nodes.push_back(node); in AddNode()
42 LogInfo::MapleLogger() << "SCC " << id << " contains " << nodes.size() << " node(s)\n"; in Dump()
43 for (auto const kIt : nodes) { in Dump()
51 T *currNode = nodes[0]; in DumpCycle()
86 if (searched.size() == nodes.size()) { in DumpCycle()
102 CHECK_FATAL(!nodes.empty(), "the size of nodes less than zero"); in Verify()
103 for (T *const &node : nodes) { in Verify()
114 for (T *const &node : nodes) { in Setup()
217 MapleVector<T *> nodes; global() member in maple::SCCNode
223 BuildSCCDFS(T &rootNode, uint32 &visitIndex, MapleVector<SCCNode<T> *> &sccNodes, std::vector<T *> &nodes, std::vector<uint32> &visitedOrder, std::vector<uint32> &lowestOrder, std::vector<bool> &inStack, std::vector<uint32> &visitStack, uint32 &numOfSccs, MapleAllocator &cgAlloc) BuildSCCDFS() argument
279 VerifySCC(std::vector<T *> nodes) VerifySCC() argument
[all...]
/arkcompiler/ets_frontend/ets2panda/ir/
H A DastDump.h54 std::vector<const AstNode *> nodes; in Optional() local
55 nodes.reserve(array.size()); in Optional()
58 nodes.push_back(it); in Optional()
61 value_ = std::move(nodes); in Optional()
147 std::vector<const ir::AstNode *> nodes; in Property() local
148 nodes.reserve(array.size()); in Property()
151 nodes.push_back(it); in Property()
154 value_ = std::move(nodes); in Property()
160 std::vector<const ir::AstNode *> nodes; in Property() local
161 nodes in Property()
[all...]
/arkcompiler/runtime_core/static_core/runtime/
H A Dlock_order_graph.cpp39 PandaMap<ThreadId, bool> nodes; in CheckForTerminationLoops() local
51 nodes[threadId] = true; in CheckForTerminationLoops()
57 nodes[threadId] = false; in CheckForTerminationLoops()
59 LOG(DEBUG, RUNTIME) << "LockOrderGraph node: " << threadId << ", is NATIVE = " << nodes[threadId]; in CheckForTerminationLoops() local
64 nodes[threadId] = true; in CheckForTerminationLoops()
82 return LockOrderGraph(nodes, edges).CheckForTerminationLoops(); in CheckForTerminationLoops()
97 // explored_nodes contains nodes reachable from the node chosen in the outer loop. in CheckNodeForTerminationLoops()
99 // front contains nodes which have not been explored yet. in CheckNodeForTerminationLoops()
101 // On each iteration of the loop we take next unexplored node from the front and find all reachable nodes from in CheckNodeForTerminationLoops()
103 // detect paths leading to nodes_in_deadlocks and to termination nodes in CheckNodeForTerminationLoops()
[all...]
H A Dlock_order_graph.h46 LockOrderGraph(PandaMap<ThreadId, bool> nodes, PandaMap<ThreadId, ThreadId> edges) in LockOrderGraph() argument
48 nodes_ = std::move(nodes); in LockOrderGraph()
/arkcompiler/runtime_core/compiler/optimizer/optimizations/regalloc/
H A Dreg_alloc_graph_coloring.cpp80 const ColorNode *FindFixedNode(const NodeVector &nodes, Location location) in FindFixedNode() argument
83 auto it = std::find_if(nodes.begin(), nodes.end(), [location](const auto &el) { in FindFixedNode()
88 return it != nodes.end() ? &*it : nullptr; in FindFixedNode()
91 const ColorNode *FindNode(const NodeVector &nodes, const Inst *inst) in FindNode() argument
94 auto it = std::find_if(nodes.begin(), nodes.end(), [inst](const auto &el) { in FindNode()
99 return it != nodes.end() ? &*it : nullptr; in FindNode()
106 auto &nodes = ig->GetNodes(); in PrecolorIG() local
108 // Walk nodes an in PrecolorIG()
154 auto &nodes = ig->GetNodes(); BuildBias() local
197 auto &nodes = ig->GetNodes(); AddAffinityEdges() local
[all...]
/arkcompiler/ets_runtime/ecmascript/dfx/tracing/
H A Dtracing.cpp24 size += cpuProfileArgs_.value().nodes.size() * sizeof(int); in GetEventBufferSize()
158 args.nodes.emplace_back(profileInfo->nodes[i].id); in TraceEventRecordCpuProfiler()
185 // nodes in TraceEventUpdateCpuProfiler()
186 if (cpuProfileArg.nodes.size() > 0) { in TraceEventUpdateCpuProfiler()
187 args += "\"nodes\": ["; in TraceEventUpdateCpuProfiler()
188 for (auto &nodeId : cpuProfileArg.nodes) { in TraceEventUpdateCpuProfiler()
189 struct CpuProfileNode &nodeInfo = profileInfo->nodes[nodeId - 1]; in TraceEventUpdateCpuProfiler()
234 args += std::to_string(profileInfo->nodes[profileInfo->samples[sample - 1]].codeEntry.lineNumber + 1) + ","; in TraceEventUpdateCpuProfiler()
H A Dtracing.h26 std::vector<int> nodes; member
/arkcompiler/ets_frontend/es2panda/ir/
H A DastDump.h123 std::vector<const ir::AstNode *> nodes; in Property() local
124 nodes.reserve(array.size()); in Property()
127 nodes.push_back(it); in Property()
130 value_ = std::move(nodes); in Property()
/arkcompiler/ets_frontend/ets2panda/compiler/lowering/ets/
H A DrecordLowering.cpp151 std::vector<ir::AstNode *> nodes; in CreateStatement() local
153 nodes.push_back(ident); in CreateStatement()
157 nodes.push_back(key); in CreateStatement()
161 nodes.push_back(value); in CreateStatement()
165 auto statements = parser->CreateFormattedStatements(src, nodes); in CreateStatement()
/arkcompiler/ets_runtime/ecmascript/dfx/cpu_profiler/
H A Dsamples_record.cpp56 profileInfo_->nodes[profileInfo_->nodeCount++] = methodNode; in NodeInit()
62 profileInfo_->nodes[profileInfo_->nodeCount++] = methodNode; in NodeInit()
63 profileInfo_->nodes[0].children.push_back(methodNode.id); in NodeInit()
69 profileInfo_->nodes[profileInfo_->nodeCount++] = methodNode; in NodeInit()
70 profileInfo_->nodes[0].children.push_back(methodNode.id); in NodeInit()
95 profileInfo_->nodes[profileInfo_->nodeCount++] = methodNode; in AddSample()
97 profileInfo_->nodes[methodNode.parentId - 1].children.push_back(id); in AddSample()
118 profileInfo_->nodes[sampleNodeId - 1].hitCount++; in AddSample()
140 profileInfo_->nodes[1].hitCount++; in AddEmptyStackSample()
176 sampleData_ += "\"nodes\" in StringifyNodes()
[all...]
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/regalloc/
H A Dreg_alloc_graph_coloring.cpp96 // inputs' nodes of that instruction in BuildIG()
111 // Walk nodes and propagate properties in PrecolorIG()
122 // Walk nodes and propagate properties in PrecolorIG()
151 auto &nodes = ig->GetNodes(); in BuildBias() local
154 // nodes of same component) in BuildBias()
158 auto &node = nodes[index]; in BuildBias()
170 WalkNodes(std::make_pair(walked, biased), nodes, node, ig, affinityNodes); in BuildBias() local
174 void RegAllocGraphColoring::WalkNodes(IndexVectorPair &&vectors, NodeVector &nodes, ColorNode node, in WalkNodes() argument
187 // Walk N affine nodes in WalkNodes()
189 auto &tryNode = nodes[tryInde in WalkNodes()
[all...]
H A Dreg_alloc_graph_coloring.h59 void WalkNodes(IndexVectorPair &&vectors, NodeVector &nodes, ColorNode node, InterferenceGraph *ig,
/arkcompiler/runtime_core/static_core/tests/tests-u-runner/runner/plugins/astchecker/
H A Dutil_astchecker.py236 nodes = []
239 nodes.append(root)
243 nodes.extend(self.find_nodes_by_start_location(child, line, col))
246 nodes.extend(self.find_nodes_by_start_location(item, line, col))
248 return nodes
/arkcompiler/ets_frontend/ets2panda/compiler/core/
H A DETSfunction.cpp107 auto const checkInitializer = [](ArenaVector<ir::AstNode *> const &nodes) -> bool { in CompileAsStaticBlock()
108 for (auto const *const node : nodes) { in CompileAsStaticBlock()
/arkcompiler/ets_frontend/ets2panda/parser/
H A DETSparser.h70 void ProcessFormattedArg(std::vector<ir::AstNode *> &nodes, T &&arg) in ProcessFormattedArg() argument
73 nodes.emplace_back(std::forward<T>(arg)); in ProcessFormattedArg()
75 nodes.emplace_back(AllocNode<ir::Identifier>(std::forward<T>(arg), Allocator())); in ProcessFormattedArg()
77 nodes.emplace_back(AllocNode<ir::Identifier>(arg.View(), Allocator())); in ProcessFormattedArg()
79 nodes.emplace_back( in ProcessFormattedArg()
82 nodes.emplace_back(AllocNode<ir::Identifier>( in ProcessFormattedArg()
85 nodes.emplace_back(AllocNode<ir::OpaqueTypeNode>(std::forward<T>(arg))); in ProcessFormattedArg()
87 nodes.emplace_back(AllocNode<ir::TSInterfaceBody>(std::forward<T>(arg))); in ProcessFormattedArg()
89 nodes.emplace_back(AllocNode<ir::SequenceExpression>(std::forward<T>(arg))); in ProcessFormattedArg()
91 nodes in ProcessFormattedArg()
[all...]
/arkcompiler/ets_runtime/ecmascript/dfx/hprof/tests/
H A Dheap_tracker_third_test.cpp164 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 Dheap_tracker_first_test.cpp261 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()
/arkcompiler/ets_runtime/ecmascript/dfx/hprof/
H A Dheap_snapshot_json_serializer.cpp133 const CList<Node *> *nodes = snapshot->GetNodes(); in SerializeNodes() local
135 ASSERT(nodes != nullptr); in SerializeNodes()
136 writer->WriteString("\"nodes\":["); // Section Header in SerializeNodes()
138 for (auto *node : *nodes) { in SerializeNodes()
157 if (i == nodes->size() - 1) { // add comma at last the line in SerializeNodes()
/arkcompiler/runtime_core/static_core/plugins/ets/tests/debugger/src/arkdb/
H A Drich_logging.py30 from _pytest import nodes # pylint:disable=protected-access namespace
410 def pytest_runtest_setup(self, item: nodes.Item) -> Generator[None, None, None]:
417 def pytest_runtest_call(self, item: nodes.Item) -> Generator[None, None, None]:
423 def pytest_runtest_teardown(self, item: nodes.Item) -> Generator[None, None, None]:
451 def _runtest_for(self, test_invocation_item: nodes.Item, when: str) -> Generator[None, None, None]:
H A Dexpect.py30 from _pytest.nodes import Item
/arkcompiler/runtime_core/static_core/tests/tests-u-runner/runner/reports/
H A Dspec_report.py220 def __report_nodes(self, nodes: List[SpecNode], lines: List[str]) -> None:
221 for node in nodes:
/arkcompiler/ets_runtime/ecmascript/dfx/cpu_profiler/tests/
H A Dcpu_profiler_test.cpp184 // Check if the function has multiple nodes in HWTEST_F_L0()
186 const auto &cpuProfileNode = profileInfo->nodes[i]; in HWTEST_F_L0()
/arkcompiler/ets_frontend/ets2panda/compiler/lowering/scopesInit/
H A DscopesInitPhase.h78 void CallNode(const ArenaVector<T *> &nodes) in CallNode() argument
80 for (auto *node : nodes) { in CallNode()

Completed in 19 milliseconds

12