Searched full:basic (Results 1 – 25 of 193) sorted by relevance
12345678
| /arkcompiler/runtime_core/compiler/docs/ |
| D | ir_builder.md | 43 1. Iterate over all bytecode instructions and make basic block for all target instructions, i.e. in…
44 be entries to the basic blocks.
46 3. Connect the basic blocks, hereby making a CFG.
50 1. Get next basic block from the graph.
51 2. If basic block is a loop header, create SafePoint and OsrSaveState instructions.
53 4. Get next bytecode instruction from the current basic block.
92 # each pc holds the reference to the basic block
99 # Next instruction starts new basic block
102 # Add control flow edges between created basic blocks
|
| D | cleanup_doc.md | 5 It also removes empty basic blocks when it is possible and merges a linear basic block sequence to …
8 Picture of merging a linear basic block sequence:
22 After any optimization which deletes instructions some basic blocks may become empty or may contain…
24 There are two exceptions, where empty basic block should stay in control flow graph.
25 First case is loop pre-header, which may legally be an empty basic block.
27 …basic block on one of edges, see below. Certainly, that block is necessary only when there are Phi…
57 Walk through all basic blocks and check whether they are suitable to remove. If basic block contain…
72 At the same time removing dead instruction may create new empty basic blocks. That's why there are …
77 Finally, we visits basic blocks once again, and if:
78 1. basic block is not start or end block
[all …]
|
| D | try_catch_blocks_ir.md | 64 `Try-begin` and `Try-end` - are try boundaries basic blocks. Both of them have one normal control-f…
66 Edges form `Try-end` block to the catch-handlers are needed for correct linear order of basic block…
125 `CatchPhi` - pseudo instruction which is added to the `Catch-begin` basic block. Each `CatchPhi` co…
142 …added to the `Try-begin` basic block. It contains pointer to the `Try-end` and maps exceptions typ…
|
| D | avoid-calculating-start-of-array.md | 20 Detect multiple array accesses to an array that belong to one basic block or
21 a chain of basic blocks that comprise a single control flow path and are not
|
| /arkcompiler/runtime_core/static_core/compiler/docs/ |
| D | ir_builder.md | 43 1. Iterate over all bytecode instructions and make basic block for all target instructions, i.e. in…
44 be entries to the basic blocks.
46 3. Connect the basic blocks, hereby making a CFG.
50 1. Get next basic block from the graph.
51 2. If basic block is a loop header, create SafePoint and OsrSaveState instructions.
53 4. Get next bytecode instruction from the current basic block.
92 # each pc holds the reference to the basic block
99 # Next instruction starts new basic block
102 # Add control flow edges between created basic blocks
|
| D | cleanup_doc.md | 5 It also removes empty basic blocks when it is possible and merges a linear basic block sequence to …
8 Picture of merging a linear basic block sequence:
22 After any optimization which deletes instructions some basic blocks may become empty or may contain…
24 There are two exceptions, where empty basic block should stay in control flow graph.
25 First case is loop pre-header, which may legally be an empty basic block.
27 …basic block on one of edges, see below. Certainly, that block is necessary only when there are Phi…
57 Walk through all basic blocks and check whether they are suitable to remove. If basic block contain…
72 At the same time removing dead instruction may create new empty basic blocks. That's why there are …
77 Finally, we visits basic blocks once again, and if:
78 1. basic block is not start or end block
[all …]
|
| D | licm_conditions_doc.md | 4 `LICM` moves instructions outside the body of a loop. But complex conditions are encoded as basic b…
29 Basic blocks A & B is a condition chain.
30 Each basic block in the chain has S0 successor which is called `multiple_predecessor_successor' (al…
31 Only last basic block in chain (B) has S1 successor which is called `single_predecessor_successor`.
36 * Phis in condition chain successors must allow hoisting of condition chain basic blocks.
|
| D | memory_coalescing_doc.md | 54 The optimization tries to coalesce memory operations in a scope of a basic block. It needs that two…
58 Memory coalescing was implemented for array accesses. We process instructions of basic block in ord…
63 …basic implementation of scalar evolution that allows to track how variables evolves: basic value (…
65 Processing each instruction in basic block we do the following:
100 // Work in scope of basic block
|
| D | balance_expressions_doc.md | 15 Visit all basic blocks in PRO order.
21 …rs from the basic block, allocate them to expression's terms in an [optimal way](#operators-alloca…
27 …nt basic blocks but satisfy the conditions above (have single user and are arithmetic operations),…
55 insert new expression to the basic block;
|
| D | escape_analysis.md | 14 …basic blocks to check if an instruction can lead to object's materialization. If the object requir…
17 Escape analysis assigns a state to each basic block (BasicBlockState) that binds an object state to…
52 for each basic block:
|
| D | try_catch_blocks_ir.md | 64 `Try-begin` and `Try-end` - are try boundaries basic blocks. Both of them have one normal control-f…
66 Edges form `Try-end` block to the catch-handlers are needed for correct linear order of basic block…
125 `CatchPhi` - pseudo instruction which is added to the `Catch-begin` basic block. Each `CatchPhi` co…
142 …added to the `Try-begin` basic block. It contains pointer to the `Try-end` and maps exceptions typ…
|
| D | avoid-calculating-start-of-array.md | 20 Detect multiple array accesses to an array that belong to one basic block or
21 a chain of basic blocks that comprise a single control flow path and are not
|
| D | scheduler_doc.md | 21 * It rearranges instructions only inside the basic block, but not between them
26 For each basic block we first scan instructions in reverse order marking barriers and calculating t…
27 …e calculate priority as a longest (critical) path to leaf instructions in basic block dependency g…
62 // Rearranges instructions in the basic block using list scheduling algorithm.
128 ... // Here we rearrange instructions in basic block according to sched_
|
| D | branch_elimination_doc.md | 120 We reaches basic block `4` when the condition `PARAMETER(0) == PARAMETER(1)` is false, so that the …
121 No we can eliminate basic block `6` and conditional statement form basic block `4`:
|
| D | lse_doc.md | 29 …basic block has its own heap. The initial value of a heap for a basic block is a merged heap from …
31 …dependence on predecessors needs us to traverse basic blocks in reverse post order so that for eac…
33 Once a heap is initialized for a basic block we iterate over instructions and update heap by applyi…
|
| D | code_sink_doc.md | 39 …dominated by a block that the instruction is sunk into. Instructions in a basic block are iterated…
48 * Load instructions if they dominate in scope of current basic block:
65 // sunk to its basic block dominatee. Iterate sinking until no changes
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/ |
| D | condition_chain.h | 38 * Basic blocks A & B is a condition chain.
39 …* Each basic block in the chain has S0 successor which is called `multiple_predecessor_successor' …
41 …* Only last basic block in chain (B) has S1 successor which is called `single_predecessor_successo…
|
| D | code_sink.cpp | 56 * - Loads that may be aliased by following stores in a basic block
65 // sunk to it's basic block dominatee. Iterate sinking until no changes in RunImpl()
84 // Bounds analysis works with instructions in a particular basic block in InvalidateAnalyses()
92 * If instruction can be sunk, it is erased from it's basic block and inserted
|
| D | lse.h | 41 * Traversing basic blocks in RPO optimization does the following with
63 * - Heap is invalided at loop headers basic blocks because values can be
65 * - Heap for basic block is obtained by merging heaps from predecessors. If
|
| /arkcompiler/ets_frontend/es2panda/test/bytecode_file_size_comparison/test_cases/java_test_framework/java_cases/ |
| D | BasicDataTypesTest.java | 17 * Basic Data Types Test
39 // Print the values of basic data types in main()
|
| /arkcompiler/runtime_core/static_core/tests/tests-u-runner/test-lists/test262/ |
| D | test262-ignored-AOT-ASAN.txt | 25 intl402/Collator/prototype/compare/non-normative-basic.js
28 intl402/Collator/prototype/resolvedOptions/basic.js
34 intl402/Collator/supportedLocalesOf/basic.js
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/include/cg/aarch64/ |
| D | aarch64_mem_reference.h | 54 // Check memory overlap of same baseAddress in basic analysis and
133 // Only consider the BOI-mode for basic overlap analysis in HasBasicMemoryDep()
190 …// baseDefInsns: for basic memory dependency analysis, they define the base address and can be nul…
200 // 1. Do basic analysis of memory-related instructions based on cg-ir in NeedBuildMemoryDependency()
|
| /arkcompiler/ets_runtime/tools/circuit_viewer/dist/ |
| D | config.json | 60 "Build Basic Block",
|
| /arkcompiler/runtime_core/static_core/plugins/ets/stdlib/std/core/ |
| D | Char.sts | 175 * isInBasicMultilingualPlane(char) checks if the char is in Basic Multilingual Plane.
180 * @returns if the char is in Basic Multilingual Plane.
187 …* isInBasicMultilingualPlane(UTF_16_CodePoint) checks if the code point is in Basic Multilingual P…
192 * @returns if the code point is in Basic Multilingual Plane.
202 * isInBasicMultilingualPlane() checks if the underlying char is in Basic Multilingual Plane.
205 * @returns if the char is in Basic Multilingual Plane.
|
| /arkcompiler/runtime_core/compiler/optimizer/ir_builder/ |
| D | ir_builder.cpp | 64 … << " basic blocks, " << GetGraph()->GetCurrentInstructionId() << " instructions"; in RunImpl()
125 …// Break if current pc is pc of some basic block, that means that it is the end of the current blo… in BuildInstructionsForBB()
154 …// Break if we meet terminator instruction. If instruction in the middle of basic block we don't c… in BuildInstructionsForBB()
196 // Create basic blocks in BuildBasicBlocks()
218 …ER_LOG(DEBUG, IR_BUILDER) << "Created " << GetGraph()->GetVectorBlocks().size() << " basic blocks"; in BuildBasicBlocks()
426 …// Nested try-blocks can be removed, but referring to them basic blocks can be placed in the exter… in MarkTryCatchBlocks()
517 …* As a result all `catch` basic blocks will be eliminated together with outer's `try_end`, since i…
|
12345678