| /arkcompiler/runtime_core/static_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 | lse.h | 29 * Load Store Elimination (Lse) optimization is aimed to eliminate redundant
35 * Generally, this optimization tries to:
39 * stored (optimization keep track what was stored previously)
41 * Traversing basic blocks in RPO optimization does the following with
86 class Lse : public Optimization {
87 using Optimization::Optimization;
106 : Optimization(graph), in Optimization() function
|
| D | savestate_optimization.h | 28 class SaveStateOptimization : public Optimization, public GraphVisitor {
29 using Optimization::Optimization;
32 explicit SaveStateOptimization(Graph *graph) : Optimization(graph) {} in SaveStateOptimization()
|
| D | object_type_check_elimination.h | 27 class ObjectTypeCheckElimination : public Optimization, public GraphVisitor {
29 using Optimization::Optimization;
33 : Optimization(graph), checksMustThrow_(graph->GetLocalAllocator()->Adapter()) in ObjectTypeCheckElimination()
|
| D | memory_coalescing.h | 24 class MemoryCoalescing : public Optimization {
25 using Optimization::Optimization;
33 …explicit MemoryCoalescing(Graph *graph, bool aligned = true) : Optimization(graph), alignedOnly_(a… in Optimization() function
|
| D | deoptimize_elimination.h | 28 class DeoptimizeElimination : public Optimization, public GraphVisitor {
29 using Optimization::Optimization;
33 : Optimization(graph), in DeoptimizeElimination()
|
| D | inline_intrinsics.h | 29 * - If all inputs have undefined assumes type, the optimization isn't applied.
32 …* Next, optimization tries to replace the intrinsic with static instructions, taking into account …
35 class InlineIntrinsics : 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 | vn.h | 89 * Optimization assigns numbers(named vn) to all instructions.
93 * The optimization creates VnObject for instruction without NO_CSE.
97 class ValNum : public Optimization {
|
| /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()
|
| /arkcompiler/runtime_core/compiler/optimizer/optimizations/ |
| D | lowering.h | 26 class Lowering : public Optimization, public GraphVisitor {
27 using Optimization::Optimization;
30 explicit Lowering(Graph *graph) : Optimization(graph) {} in Lowering()
|
| 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 {
|
| /arkcompiler/runtime_core/static_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), accMarker_(graph->Ne… in RegAccAlloc()
|
| D | canonicalization.h | 31 class Canonicalization : public compiler::Optimization, public compiler::GraphVisitor {
33 explicit Canonicalization(compiler::Graph *graph) : compiler::Optimization(graph) {} in Canonicalization()
|
| D | bytecodeopt_peepholes.h | 43 class BytecodeOptPeepholes : public compiler::Optimization, public compiler::GraphVisitor {
45 explicit BytecodeOptPeepholes(compiler::Graph *graph) : compiler::Optimization(graph) {} in BytecodeOptPeepholes()
|
| /arkcompiler/runtime_core/static_core/compiler/docs/ |
| D | loop_unswitch_doc.md | 4 `Loop Unswitch` optimization moves a conditional inside a loop outside of it by duplicating the loo…
23 Optimization settings:
52 Constant conditions should be eliminated with `Branch elimination` optimization.
|
| 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 | constant_folding_doc.md | 3 **Constant folding** - optimization which calculate instructions with constant inputs in compile ti…
15 Constant folding is called in Peephole optimization.
|
| D | inlining.md | 2 # Inlining optimization
6 Inlining optimization replaces a method call site with the body of the called method.
104 After target method is determined, Inlining optimization call IrBuilderInliningAnalysis that check …
157 [Inlining optimization source code](../optimizer/optimizations/inlining.cpp)
|
| /arkcompiler/runtime_core/static_core/libllvmbackend/ |
| D | llvmbackend.yaml | 32 Enable inlining optimization. Default value is overridden by explicit
39 Level of pre-optimization that LLVMAOT does.
50 description: Whether generated LLVM module should be dumped before optimization passes are run
54 description: Whether generated LLVM module should be dumped after optimization passes are run
90 File with a sequence of llvm's passes, that will be involved into optimization
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/src/cg/ |
| D | global.cpp | 29 * This phase do some optimization using use-def chain and def-use chain.
30 * each function in Run() is a optimization. mainly include 2 parts:
35 * this optimization aim to optimize following:
46 * this optimization aim to optimize following:
|
| D | cg_options.cpp | 84 " --ebo \tPerform Extend block optimization\n"
89 " --cfgo \tPerform control flow optimization\n"
94 " --ico \tPerform if-conversion optimization\n"
99 … " --storeloadopt \tPerform global store-load optimization\n"
104 " --globalopt \tPerform global optimization\n"
109 " --hotcoldsplit \tPerform HotColdSplit optimization\n"
136 … " --prepeep \tPerform peephole optimization before RA\n"
141 … " --peep \tPerform peephole optimization after RA\n"
198 " --proepilogue \tDo tail call optimization and"
303 maplecl::Option<bool> o0({"-O0", "--O0"}, " -O0 \tNo optimization.\n", {cg…
[all …]
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/analysis/ |
| D | catch_inputs.h | 25 * Analysis is aimed to help optimization passes to decide whether or not an instruction
28 * For example, scalar replacement optimization may eliminate allocation of
|
| /arkcompiler/runtime_core/static_core/plugins/ets/compiler/optimizer/optimizations/interop_js/ |
| D | interop_intrinsic_optimization.h | 28 class InteropIntrinsicOptimization : public Optimization, public GraphVisitor {
29 using Optimization::Optimization;
33 : Optimization(graph), in Optimization() function
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/include/cg/ |
| D | optimize_common.h | 29 inline const std::string kIcoIte = "blue"; /* if conversion optimization, if-then-else */
30 inline const std::string kIcoIt = "grey"; /* if conversion optimization, if-then-else */
31 inline const std::string kDup = "maize"; /* dup optimization */
|