| /arkcompiler/runtime_core/compiler/optimizer/optimizations/ |
| D | code_sink.h | 24 class CodeSink : public Optimization {
25 using Optimization::Optimization;
28 explicit CodeSink(Graph *graph) : Optimization(graph) {}; in CodeSink()
|
| D | lowering.h | 26 class Lowering : public Optimization, public GraphVisitor {
27 using Optimization::Optimization;
30 explicit Lowering(Graph *graph) : Optimization(graph) {} in Lowering()
|
| D | object_type_check_elimination.h | 27 class ObjectTypeCheckElimination : public Optimization, public GraphVisitor {
29 using Optimization::Optimization;
33 : Optimization(graph), checks_must_throw_(graph->GetLocalAllocator()->Adapter()) in ObjectTypeCheckElimination()
|
| D | deoptimize_elimination.h | 28 class DeoptimizeElimination : public Optimization, public GraphVisitor {
29 using Optimization::Optimization;
33 : Optimization(graph), in DeoptimizeElimination()
|
| D | types_resolving.h | 27 * - If all inputs have undefined assumes type, the optimization isn't applied.
30 …* Next, optimization tries to replace the intrinsic with static instructions, taking into account …
33 class TypesResolving : public Optimization {
|
| D | vn.h | 82 * Optimization assigns numbers(named vn) to all instructions.
86 * The optimization creates VnObject for instruction without NO_CSE.
90 class ValNum : public Optimization {
|
| D | if_conversion.h | 26 class IfConversion : public Optimization {
28 explicit IfConversion(Graph *graph, uint32_t limit = 2) : Optimization(graph), limit_(limit) {} in Optimization() function
|
| D | scheduler.h | 23 class Scheduler : public Optimization {
26 : Optimization(graph), in Scheduler()
|
| D | memory_barriers.h | 27 class OptimizeMemoryBarriers : public Optimization, public GraphVisitor {
30 : Optimization(graph), barriers_insts_(graph->GetLocalAllocator()->Adapter()) in OptimizeMemoryBarriers()
|
| D | balance_expressions.h | 25 class BalanceExpressions : public Optimization {
32 : Optimization(graph), in BalanceExpressions()
|
| D | cleanup.h | 23 class Cleanup final : public Optimization {
26 : Optimization(graph), in Cleanup()
|
| D | loop_transform.h | 28 class LoopTransform : public Optimization {
30 explicit LoopTransform(Graph *graph) : Optimization(graph) {} in LoopTransform()
|
| /arkcompiler/runtime_core/bytecode_optimizer/ |
| D | reg_acc_alloc.h | 25 class RegAccAlloc : public compiler::Optimization {
26 using Optimization::Optimization;
29 …explicit RegAccAlloc(compiler::Graph *graph) : compiler::Optimization(graph), acc_marker_(graph->N… in RegAccAlloc()
|
| D | reg_encoder.h | 47 * is of course constant throughout optimization pipeline.
98 class RegEncoder : public compiler::Optimization, public compiler::GraphVisitor {
101 : compiler::Optimization(graph), num_temps_(0), state_(RegEncoderState::IDLE) in RegEncoder()
|
| D | codegen.h | 39 class BytecodeGen : public compiler::Optimization, public compiler::GraphVisitor {
43 : compiler::Optimization(graph), function_(function), ir_interface_(iface), program_(prog) in BytecodeGen()
|
| /arkcompiler/runtime_core/compiler/docs/ |
| D | memory_coalescing_doc.md | 4 The optimization is based on the fact that some architectures (`AArch64` particularly) support simu…
23 The optimization was implemented for arrays' accesses for `AArch64` architecture.
31 To implement such kind of optimization the extra support from IR is required
54 The optimization tries to coalesce memory operations in a scope of a basic block. It needs that two…
148 Before optimization
167 After optimization
187 Before optimization
211 After optimization
239 | `--compiler-memory-coalescing` | Enables optimization | `true` |
|
| D | code_sink_doc.md | 4 The optimization moves instructions into successor blocks, when possible, so that they are not exec…
8 This optimization allows to avoid execution of statements that are not used on execution path. This…
28 …ed only in one branch however it is always executed. The code sinking optimization suggests to mov…
39 The iterative approach is used. On each iteration the optimization tries to sink each instruction t…
|
| D | interface_inline_cache.md | 4 `Interface Inline Cache` is an optimization for speeding up find method in interface method call.
10 `Interface Inline Cache`'s reason for optimization:
97 this optimization will be abandoned.This condition is quite rare.
|
| D | aot_resolve_string.md | 50 slots in order to scan and update them. As an optimization `AotManager` stores information about wh…
52 …ung GC, but it also requires update during update phase. As yet another optimization PLT-slots are
|
| D | move_constants_closer_to_usage_doc.md | 24 IR before optimization
76 IR after optimization
|
| /arkcompiler/ets_runtime/test/aottest/optimization/ |
| D | BUILD.gn | 16 host_aot_test_action("optimization") {
|
| /arkcompiler/runtime_core/compiler/optimizer/ |
| D | pass.cpp | 30 static_cast<Optimization *>(this)->InvalidateAnalyses(); in Run()
|
| /arkcompiler/runtime_core/compiler/optimizer/ir_builder/ |
| D | ir_builder.h | 34 class IrBuilder : public Optimization {
72 : Optimization(graph), in IrBuilder()
|
| /arkcompiler/ets_frontend/es2panda/ |
| D | README.md | 18 - `--opt-level`: Compiler optimization level (options: 0 | 1 | 2)
|
| /arkcompiler/ets_runtime/ecmascript/compiler/tests/ |
| D | circuit_optimizer_tests.cpp | 101 // check optimization result (returned value is constant 1) in HWTEST_F_L0()
115 // check optimization result (returned value is not constant) in HWTEST_F_L0()
129 // check optimization result (returned value is constant 0) in HWTEST_F_L0()
210 // check optimization result (returned value is constant -2212) in HWTEST_F_L0()
224 // check optimization result (returned value is constant 1073739612) in HWTEST_F_L0()
244 // check optimization result (returned value is constant 144) in HWTEST_F_L0()
266 // check optimization result (returned value is constant 2.7) in HWTEST_F_L0()
|