Home
last modified time | relevance | path

Searched refs:edges (Results 1 – 9 of 9) sorted by relevance

/arkcompiler/ets_runtime/ecmascript/dfx/hprof/
Dheap_snapshot_json_serializer.cpp127 const CList<Edge *> *edges = snapshot_->GetEdges(); in SerializeEdges() local
129 ASSERT(edges != nullptr); in SerializeEdges()
132 for (auto *edge : *edges) { in SerializeEdges()
141 if (i == edges->size() - 1) { // add comma at last the line in SerializeEdges()
/arkcompiler/runtime_core/compiler/docs/
Dreg_alloc_graph_coloring_doc.md27edges that represent interference, it is built affinity edges of the graph. Affinity edges represe…
28 Output graph will be interference-graph G = {Nodes, IEdges, AEdges} – graph with 2 types of edges: …
41edges of IG form components known as Affinity-components. In best-case scenario all nodes in affin…
42 …h algorithm which is recursive call to DFS, until all nodes having affine edges are visited. Marke…
Dcleanup_doc.md27edges between same blocks, but our way to store CFG edges don't support that. So, we have to inser…
Dir_builder.md102 # Add control flow edges between created basic blocks
/arkcompiler/runtime_core/compiler/tests/
Dreg_alloc_interference_graph_test.cpp124 … ::std::pair<unsigned, unsigned> *edges, unsigned count, ArenaVector<unsigned> &peo, in BuildSubgraph() argument
131 auto x = edges[i].first; in BuildSubgraph()
132 auto y = edges[i].second; in BuildSubgraph()
/arkcompiler/runtime_core/docs/
Dir_format.md134 **BasicBlock** can not have more than one incoming or outgoing edges into the same block.
146 …e `Phi` instructions in block 2 with different inputs from those incoming edges. When there are no…
236 …alidated after Control Flow transformations: removing or adding blocks or edges between blocks. Al…
Ddoxygen.config2412 # root by following a path via at most 3 edges will be shown. Nodes that lay
2427 # badly anti-aliased labels on the edges of a graph (i.e. they become hard to
/arkcompiler/ets_runtime/ecmascript/compiler/
Dcircuit_ir_specification.md5 …](https://en.wikipedia.org/wiki/Logic_gate) are nodes, wires are directed edges. For every gate, i…
/arkcompiler/ets_frontend/es2panda/test/compiler/js/
Dcocos_worker_test.js118631 D.edges = R;
119867 u.edges = this.getValue(e, "edges", null);
121621 if (null != this.edges) {
121622 e.edges = new Array(this.edges.length);
121623 t.Utils.arrayCopy(this.edges, 0, e.edges, 0, this.edges.length);