Home
last modified time | relevance | path

Searched full:basic (Results 1 – 25 of 219) sorted by relevance

123456789

/arkcompiler/runtime_core/libabckit/include/cpp/headers/
Dbasic_block.h72 …* @brief Enumerates basic blocks successing to the basicBlock, invoking callback `cb` for each bas…
80 …* @brief Enumerates basic blocks predcessing to the basicBlock, invoking callback `cb` for each ba…
88 * @brief Returns the number of basic blocks successing the basicBlock.
89 * @return Number of successor basic blocks.
174 * @brief Returns the number of basic blocks preceding the basicBlock.
175 * @return Number of predecessor basic blocks.
181 * @brief Returns basic block predcessing to basicBlock under given `index`.
183 * @param [ in ] index - Index of predecessor basic block.
185 …* @note Set `ABCKIT_STATUS_BAD_ARGUMENT` error if there is no predecessor basic block under given …
190 * @brief Returns the number of basic blocks successing the basicBlock.
[all …]
Dgraph.h94 * @brief Get start basic block
100 * @brief Returns end basic block of current `Graph`.
106 * @brief Returns number of basic blocks in a `graph`.
107 * @return Number of basic blocks in a `graph`.
131 * @brief Returns basic blocks with given `id` of a graph.
133 * @param [ in ] bbId - ID of basic block.
134 …* @note Set `ABCKIT_STATUS_BAD_ARGUMENT` error if there is no basic block with given `id` in `grap…
153 * @brief Wraps basic blocks from `tryFirstBB` to `tryLastBB` into try,
154 * inserts basic blocks from `catchBeginBB` to `catchEndBB` into graph.
155 * Basic blocks from `catchBeginBB` to `catchEndBB` are used for exception handling.
[all …]
/arkcompiler/runtime_core/libabckit/include/c/
Dir_core.h92 * @brief Returns start basic block of given `graph`.
100 * @brief Returns end basic block of given `graph`.
108 * @brief Returns number of basic blocks in given `graph`.
109 * @return Number of basic blocks in given `graph`.
116 …* @brief Enumerates basic blocks of the `graph` in reverse postorder, invoking callback `cb` for e…
129 * @brief Returns basic blocks with given `id` of the given `graph`.
132 * @param [ in ] id - ID of basic block.
134 …* @note Set `ABCKIT_STATUS_BAD_ARGUMENT` error if there is no basic block with given `id` in `grap…
157 * @brief Wraps basic blocks from `tryFirstBB` to `tryLastBB` into try,
158 * inserts basic blocks from `catchBeginBB` to `catchEndBB` into graph.
[all …]
/arkcompiler/runtime_core/compiler/docs/
Dir_builder.md43 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
Dcleanup_doc.md5 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.
27basic 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 …]
Dtry_catch_blocks_ir.md64 `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…
Davoid-calculating-start-of-array.md20 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/
Dir_builder.md43 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
Dcleanup_doc.md5 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.
27basic 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 …]
Dlicm_conditions_doc.md4 `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.
Dmemory_coalescing_doc.md54 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…
63basic 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
Dbalance_expressions_doc.md15 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;
Descape_analysis.md14basic 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:
Dtry_catch_blocks_ir.md64 `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…
Davoid-calculating-start-of-array.md20 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
Dscheduler_doc.md21 * 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_
Dbranch_elimination_doc.md120 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`:
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/
Dcondition_chain.h38 * 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…
Dcode_sink.cpp56 * - 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
/arkcompiler/ets_runtime/test/aottest/forof_map_test/
Dforof_map_test.ts21 // Test basic for of map.entries()
29 // Test basic for of map.keys()
37 // Test basic for of map.values()
/arkcompiler/ets_runtime/test/aottest/forof_set_test/
Dforof_set_test.ts21 // Test basic for of set.entries()
29 // Test basic for of set.keys()
37 // Test basic for of set.values()
/arkcompiler/ets_frontend/es2panda/test/bytecode_file_size_comparison/test_cases/java_test_framework/java_cases/
DBasicDataTypesTest.java17 * Basic Data Types Test
39 // Print the values of basic data types in main()
/arkcompiler/runtime_core/static_core/tests/test-lists/test262/
Dtest262-ignored-AOT-ASAN.txt25 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/src/cg/
Dcfgo.cpp20 * This phase traverses all basic block of cgFunc and finds special
21 * basic block patterns, like continuous fallthrough basic block, continuous
22 * uncondition jump basic block, unreachable basic block and empty basic block,
23 * then do basic mergering, basic block placement transformations,
24 * unnecessary jumps elimination, and remove unreachable or empty basic block.
237 * 1. Basic block merging
239 * 3. Remove duplicates Basic block.
479 /* remove a basic block that contains nothing */
/arkcompiler/ets_frontend/test/sdk_test_projects/bytecodehar_out_project/entry/
Doh-package.json519 "description": "Please describe the basic information.",

123456789