| /arkcompiler/runtime_core/static_core/runtime/mem/gc/heap-space-misc/ |
| D | crossing_map.h | 29 // If enabled - we will manage elements, which cross map borders.
40 // which will be dynamically allocated/deallocated via internal allocator:
58 // This element (or map) can be used to get the first object address, which starts inside this page…
59 // or an object address, which crosses the borders of this page.
65 * @param start_addr - first bit of the memory which must be covered by the Crossing Map.
66 * @param size - size of the memory which must be covered by the Crossing Map.
98 * @brief Find and return the first object, which starts in an interval inclusively
99 * or an object, which crosses the interval border.
101 * we find the first object, which crosses the border of this interval.
104 * @return Returns the first object which starts inside an interval,
[all …]
|
| /arkcompiler/runtime_core/static_core/libpandabase/taskmanager/task_statistics/ |
| D | task_statistics.h | 56 * @param status - status of task which counter you want to increment.
57 * @param properties - TaskProperties of tasks which counter will be incremented.
58 * @param count - value by which the counter will be increased.
64 * @param status - status of task which counter you want to return.
65 * @param properties - TaskProperties of tasks which counter will be return.
80 * @param properties - TaskProperties of tasks which counter will be return.
94 * @param properties - TaskProperties of tasks which counters will be reset.
|
| /arkcompiler/runtime_core/static_core/runtime/include/ |
| D | method.h | 169 …h acquire order reason: data race with access_flags_ with dependecies on reads after the load which in Method()
187 // store which should become visible acquire in Method()
361 …h acquire order reason: data race with access_flags_ with dependecies on reads after the load which in GetCompiledEntryPoint()
368 …h acquire order reason: data race with access_flags_ with dependecies on reads after the load which in GetCompiledEntryPoint()
376 // store which should become visible acquire in SetCompiledEntryPoint()
396 …h acquire order reason: data race with access_flags_ with dependecies on reads after the load which in GetCompilationStatus()
409 …h acquire order reason: data race with access_flags_ with dependecies on reads after the load which in SetCompilationStatus()
414 // which should become visible acquire in SetCompilationStatus()
420 …h acquire order reason: data race with access_flags_ with dependecies on reads after the load which in AtomicSetCompilationStatus()
468 …h acquire order reason: data race with access_flags_ with dependecies on reads after the load which in GetAccessFlags()
[all …]
|
| /arkcompiler/runtime_core/static_core/libpandabase/mem/ |
| D | base_mem_stats.cpp | 64 …quire order reason: data race with allocated_ with dependecies on reads after the load which should in GetAllocated()
71 …quire order reason: data race with allocated_ with dependecies on reads after the load which should in GetFreed()
83 // which should become visible in GetAllocatedHeap()
97 // which should become visible in GetFreedHeap()
112 …quire order reason: data race with allocated_ with dependecies on reads after the load which should in GetFootprint()
117 …with acquire order reason: data race with allocated_ with dependecies on reads after the load which in GetFootprint()
121 …with acquire order reason: data race with allocated_ with dependecies on reads after the load which in GetFootprint()
124 …quire order reason: data race with allocated_ with dependecies on reads after the load which should in GetFootprint()
|
| /arkcompiler/runtime_core/libpandabase/mem/ |
| D | base_mem_stats.cpp | 65 …quire order reason: data race with allocated_ with dependecies on reads after the load which should in GetAllocated()
72 …quire order reason: data race with allocated_ with dependecies on reads after the load which should in GetFreed()
84 // which should become visible in GetAllocatedHeap()
98 // which should become visible in GetFreedHeap()
113 …quire order reason: data race with allocated_ with dependecies on reads after the load which should in GetFootprint()
118 …with acquire order reason: data race with allocated_ with dependecies on reads after the load which in GetFootprint()
122 …with acquire order reason: data race with allocated_ with dependecies on reads after the load which in GetFootprint()
125 …quire order reason: data race with allocated_ with dependecies on reads after the load which should in GetFootprint()
|
| D | mem_pool.h | 76 * @param space_type - type of the space which arena allocated for
77 * @param allocator_type - type of the allocator which arena allocated for
105 * @param space_type - type of the space which pool allocated for
106 * @param allocator_type - type of the allocator which arena allocated for
128 * Get info about the allocator in which this address is used
138 * Get space type which this address used for
|
| /arkcompiler/runtime_core/static_core/docs/ |
| D | cfi_directives.md | 7 `CFI` (**Call Frame Information**) is a subset of these debug symbols which is responsible for corr…
34 There are bridges which `hack` stack memory (setting `stack pointer` to other stack frame), i.e.:
38 These bridges return control flow to code which has not called them.
41 … going to return to previous frame. So we directly specify other frame in which we will return + s…
|
| D | rationale-for-bytecode.md | 47 In _stack-based_ approach, operands are implicitly encoded in the operation, which results in
60 In _register-based approach_, operands are explicitly encoded in the operation, which results in
79 more _dispatch overhead_. Which means that the stack-based bytecode is slower by nature.
99 Panda bytecode has a dedicated register called _accumulator_, which is addressed implicitly
129 which also saves us encoding space and improves performance
148 It easy to see that to address virtual registers 4 and 5 we need just 3 bits which allows to encode
156 This trick gives us just `1 + 0.5 + 0.5 = 2` bytes for a single instructions, which get us closer
178 (which is rare) and which is supposed to have only acc-reg form. Another good candidates for
205 and Python-style addition within a single instruction, which would eventually lead us to an
220 which do not distinguish between integers and pointers on many platforms). The key constraint is
|
| D | code_metainfo.md | 9 registers which are live during this call instruction. Since all virtual regisetrs should be saved …
10 we call the runtime, we can save information in which stack slot specific vreg is live.
51 Header is followed by data, which is a rows with fixed length. Row length is equal to sum of column…
118 | NATIVE_PC | Native address to which this stackmap corresponds |
119 | BYTECODE_PC | Bytecode address to which this stackmap corresponds |
133 | BYTECODE_PC | Bytecode address to which this inline info corresponds |
156 This is a Bitmap table, where column is a bit mask, that determines which CPU register holds a mana…
160 This is a Bitmap table, where column is a bit mask, that determines which stack slot holds a manage…
168 This is a Bitmap table, where column is a bit mask, that determines which virtual register is modif…
|
| /arkcompiler/runtime_core/docs/ |
| D | cfi_directives.md | 7 `CFI` (**Call Frame Information**) is a subset of these debug symbols which is responsible for corr…
34 There are bridges which `hack` stack memory (setting `stack pointer` to other stack frame), i.e.:
38 These bridges return control flow to code which has not called them.
41 … going to return to previous frame. So we directly specify other frame in which we will return + s…
|
| D | rationale-for-bytecode.md | 47 In _stack-based_ approach, operands are implicitly encoded in the operation, which results in
60 In _register-based approach_, operands are explicitly encoded in the operation, which results in
79 more _dispatch overhead_. Which means that the stack-based bytecode is slower by nature.
99 Panda bytecode has a dedicated register called _accumulator_, which is addressed implicitly
129 which also saves us encoding space and improves performance
148 It easy to see that to address virtual registers 4 and 5 we need just 3 bits which allows to encode
156 This trick gives us just `1 + 0.5 + 0.5 = 2` bytes for a single instructions, which get us closer
178 (which is rare) and which is supposed to have only acc-reg form. Another good candidates for
205 and Python-style addition within a single instruction, which would eventually lead us to an
220 which do not distinguish between integers and pointers on many platforms). The key constraint is
|
| D | code_metainfo.md | 9 registers which are live during this call instruction. Since all virtual regisetrs should be saved …
10 we call the runtime, we can save information in which stack slot specific vreg is live.
51 Header is followed by data, which is a rows with fixed length. Row length is equal to sum of column…
118 | NATIVE_PC | Native address to which this stackmap corresponds |
119 | BYTECODE_PC | Bytecode address to which this stackmap corresponds |
133 | BYTECODE_PC | Bytecode address to which this inline info corresponds |
156 This is a Bitmap table, where column is a bit mask, that determines which CPU register holds a mana…
160 This is a Bitmap table, where column is a bit mask, that determines which stack slot holds a manage…
168 This is a Bitmap table, where column is a bit mask, that determines which virtual register is modif…
|
| /arkcompiler/ets_frontend/test/scripts/ |
| D | readme.md | 5 2. Run xts test which in auto_xts_test
6 3. Run sdk_test which in sdk_test
7 4. Run performance test which in performance_test
|
| /arkcompiler/runtime_core/static_core/isa/ |
| D | README | 9 and tools, faster changes (which is important on early stages of development),
14 Directory with example template files which show how could one generate needed
19 API for quering parsed yaml data which could be used for template generation.
|
| /arkcompiler/runtime_core/isa/ |
| D | README | 9 and tools, faster changes (which is important on early stages of development),
14 Directory with example template files which show how could one generate needed
19 API for quering parsed yaml data which could be used for template generation.
|
| /arkcompiler/runtime_core/static_core/plugins/ets/doc/spec/ |
| D | 18_stdlib.rst | 25 Standard Library has two parts: the common one, which provides |TS| compatibility,
26 and the other one, which is |LANG|-specific while adding more advanced features.
29 a separate document which is a part of the |LANG| distribution package.
|
| /arkcompiler/runtime_core/libpandabase/utils/ |
| D | hash_base.h | 32 * @param key - a key which should be hashed
34 * @param seed - seed which is used to calculate hash
43 * @param key - a key which should be hashed
63 * @param seed - seed which is used to calculate hash
|
| /arkcompiler/runtime_core/static_core/libpandabase/utils/ |
| D | hash_base.h | 31 * @param key - a key which should be hashed
33 * @param seed - seed which is used to calculate hash
42 * @param key - a key which should be hashed
62 * @param seed - seed which is used to calculate hash
|
| /arkcompiler/runtime_core/static_core/runtime/tests/intrusive-tests/ |
| D | README.md | 7 Each intrusive test contains a map from control points to the testing code which controls the seque…
11 - implementing synchronization points, which are source code modules with parameterized functions, …
23 - <INTRISIVE_TEST_NAME>, which represents index of this test (e.g., `CLASS_GET_BASE_INTRUSIVE_TEST`…
24 - <intrusive_test_name>, which is the name of a directory with this test (e.g., `class_get_base_int…
97 …race checker to see this data race by organizing a thread interleaving on which the data race can …
|
| /arkcompiler/runtime_core/libziparchive/ |
| D | zip_archive.h | 159 …* Add a new file filename(resident in memory pbuf which has size of size |buf_size|) to the archiv…
160 …* append takes value from APPEND_STATUS_CREATE(which will create the archive zipname for first tim…
161 * APPEND_STATUS_ADDINZIP(which will append filename into exsisted zip archive zipname).
162 …* level takes value from Z_BEST_COMPRESSION(which will deflate the pbuf with best compression effe…
163 * Z_NO_COMPRESSION(which will store the pbuf into zipname without compression).
|
| /arkcompiler/runtime_core/static_core/compiler/docs/ |
| D | licm_conditions_doc.md | 7 Conditions which have been hoisted out of a loop are executed less often, providing a speedup
15 Condition chain is graph which looks like
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`.
32 Both S0 and S1 successors can have predeccessors which are not part of the chain.
34 …, skipping irreducible and OSR loops. In each loop it finds condition chains, which can be hoisted:
|
| D | if_conversion_doc.md | 34 `JBB`(Join BB) -- true or false successor of `BB`, which will be joined to BB
35 `PBB`(Phi BB) -- false or true successor of `BB`, which contain PHI instruction for BB and JBB
48 `JBB`(Join BB), `JBB 2` -- true and false successors of BB, which will be joined to `BB `
49 `PBB`(Phi BB) -- the successor of `JBB` and `JBB 2`, which contain PHI instruction for `JBB` and `J…
59 6. The number of Phi instruction in `PBB`, which have different inputs from corresponding predecess…
|
| /arkcompiler/runtime_core/static_core/libziparchive/ |
| D | zip_archive.h | 162 …* Add a new file filename(resident in memory pbuf which has size of size |buf_size|) to the archiv…
163 …* append takes value from APPEND_STATUS_CREATE(which will create the archive zipname for first tim…
164 * APPEND_STATUS_ADDINZIP(which will append filename into exsisted zip archive zipname).
165 …* level takes value from Z_BEST_COMPRESSION(which will deflate the pbuf with best compression effe…
166 * Z_NO_COMPRESSION(which will store the pbuf into zipname without compression).
|
| /arkcompiler/runtime_core/static_core/runtime/mem/ |
| D | alloc_config.h | 83 * @brief Find and return the first object, which starts in an interval inclusively
84 * or an object, which crosses the interval border.
86 * we find the first object, which crosses the border of this interval.
89 * @return Returns the first object which starts inside an interval,
90 * or an object which crosses a border of this interval
274 * @brief Find and return the first object, which starts in an interval inclusively
275 * or an object, which crosses the interval border.
277 * we find the first object, which crosses the border of this interval.
280 * @return Returns the first object which starts inside an interval,
281 * or an object which crosses a border of this interval
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_ir/include/ |
| D | metadata_layout.h | 23 // which can be negative
30 // DataRefOffset aims to represent a reference to data in maple file, which is already an offset.
69 …// MethodFieldRef aims to represent a reference to fields/methods in maple file, which is already …
93 // this format aims to support lld which does not support expression "global_symbol - ."
105 // be careful when *refVal* is treated as an offset which is a signed integer actually.
124 // GctibRef aims to represent a reference to gctib in maple file, which is an offset by default.
129 // this format aims to support lld which does not support expression "global_symbol - ."
139 // be careful when *refVal* is treated as an offset which is a signed integer actually.
266 // yieldpoind test address globalPollingPage which is defined in yieldpoint.cpp.
|