| /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
|
| D | gc_barrier.h | 76 * store obj.field <- new_val // STORE for which barrier generated
79 …* CONCURRENT_MARKING_ADDR - address of bool flag which indicates that we have concurrent marking on
87 * store obj.field <- new_val // STORE for which barrier generated
108 * store obj.field <- new_val // STORE for which barrier generated
121 * UPDATE_CARD_FUNC - function which updates card corresponding to the obj.field
|
| /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…
|
| D | design-of-interpreter.md | 42 1. There is a dedicated register called accumulator, which is addressed implicitly by some
100 may introduce a new issue: a single file will require larger identifiers, which obviously consume
146 1. According to our experiments, a stackless interpreter for a stack-based bytecode (which is by
148 bytecode (which is by nature faster).
168 metadata (a "tag"), which allows at least distinguish between garbage collectable and other
171 but this is an implementation detail which is hidden behind the interfaces
190 managed application have to think about this limitation, which contradicts the idea of
192 constraint, which can be relaxed even further with the stackless interpreter (see above).
|
| D | 2022-08-18-isa-changelog.md | 17 5. We add prefix "wide" to support opcodes which need larger immediate number.
23 As we merge some "define-function" opcodes as one opcode, in function we add one field which record…
47 5. The literalarray which is referenced by TypeSummary contains the offsets of all type-literalarra…
|
| D | ir_format.md | 112 * Information about the method for which transformations are made
124 * A double-linked list of instructions, which are contained in the block
125 …* List of predecessors: vector of pointers to the BasicBlocks from which we can get into the curre…
126 …* List of successors: vector of pointers to the BasicBlocks in which we can get from the current b…
184 * List of users (instructions which use result from the Inst)
202 **Mixin** are classes with properties or data which uses different instruction classes. For example:
236 …or is reached by a back edge. **RPO** is implemented as a separate class, which returns the vector…
243 …sicBlock has a pointer on dominate block and vector of pointers to blocks which he dominates. **Ba…
258 **Input** is the object that describes which instruction defines value for corresponding operand of…
282 …of def-use storage. Instead of indirect call we have one condition branch which has good branch pr…
[all …]
|
| D | runtime-compiled_code-interaction.md | 24 `panda::CompilerInterface::CompileMethodSync` which starts compilation. When the function gets comp…
29 … function must accept one extra argumnent: the pointer to `panda::Method` which describes this fun…
57 Runtime serves compiled code via runtime entrypoints. A runtime entrypoint is a function which conf…
58 A table of the entrypoints is located in `panda::ManagedThread::runtime_entrypoints_` which could b…
76 Entrypoint is a pointer to native code which can execute the function. This code must conform to th…
80 …oint_` must point to a runtime function `CompiledCodeToInterpreterBridge` which calls the interpre…
135 - `panda::Method*` - a pointer to `panda::Method` which describes the called function.
137 - return address - address to which control will be transfered after the function gets returned.
161 // r0 contains a pointer to `panada::Method` which describes `int max(int, int)` function.
222 …he target calling convention. The function uses the bytecode instruction (which must be a variant …
[all …]
|
| /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/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/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
|
| D | hash.h | 27 // Default seed which is used in hash functions.
37 * @param key - a key which should be hashed
39 * @param seed - seed which is used to calculate hash
49 * @param key - a key which should be hashed
71 * @param seed - seed which is used to calculate hash
|
| /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/libpandabase/ |
| D | README.md | 23 …two major entities: template class `PandArg`, which represents an argument and `PandArgParser` cla…
25 Instead of `PandArg`, `PandArgCompound` can be used, which serves for creation of the compound argu…
46 - Argument name, is a name, which will appear in a command line.
64 `arg_list_t` is a type, declared in `pandargs.h` under `panda` namespace, which is an alias for `st…
82 Tail arguments are positional arguments, which should be introduced with help of parser API
85 Compound argument is a boolean argument, which can contains sub-arguments, followed by symbol `:`,
|
| /arkcompiler/ets_frontend/es2panda/test/hotfix/hotfix-throwerror/add-dup-name-function/ |
| D | base_mod.js | 16 // Test scenario: add function which has same name as exits functions, es2abc can specify and throw…
20 function B() { // add function B, which has a duplicate name
|
| /arkcompiler/ets_frontend/es2panda/test/hotreload/hotreload-noerror/add-dup-name-function/ |
| D | base_mod.js | 16 // Test scenario: add function which has same name as exits functions, es2abc can specify and throw…
20 function B() { // add function B, which has a duplicate name
|
| /arkcompiler/ets_frontend/es2panda/test/coldfix/coldfix-noerror/add-dup-name-function/ |
| D | base_mod.js | 16 // Test scenario: add function which has same name as exits functions, es2abc can support it.
20 function B() { // add function B, which has a duplicate name
|
| /arkcompiler/runtime_core/docs/diagrams/ |
| D | static-analyzer-gc-func-list-gen.puactivity | 20 :List of functions which can have GC inside;
33 :Generate list of all functions which can call GC (GC FUNCTION LIST);
|
| /arkcompiler/ets_runtime/ecmascript/mem/ |
| D | heap.h | 544 // record lastRegion for each space, which will be used in ReclaimRegions()
611 * Semi sapce GC which collects garbage only in young spaces.
617 * The mostly used partial GC which collects garbage in young spaces,
622 // Full collector which collects garbage in all valid heap spaces.
625 // Concurrent marker which coordinates actions of GC markers and mutators.
628 …// Concurrent sweeper which coordinates actions of sweepers (in spaces excluding young semi spaces…
631 // Parallel evacuator which evacuates objects from one space to another one.
634 // Incremental marker which coordinates actions of GC markers in idle time.
680 * which is used for GC heuristics.
|
| /arkcompiler/runtime_core/assembler/ |
| D | assembly-file-location.h | 23 std::string whole_line = ""; /* The line in which the field is defined */
24 /* Or line in which the field met, if the field is not defined */
|
| D | assembly-field.h | 33 std::string whole_line = ""; /* The line in which the field is defined */
34 /* Or line in which the field met, if the field is not defined */
|
| /arkcompiler/ets_runtime/test/aottest/vtable/regression_tests/fix_duplicate_gen_class_prototype/ |
| D | fix_duplicate_gen_class_prototype.ts | 17 // be entered duplicatly, which causes the actual class prototype in runtime is the last time creat…
37 // different(due to variable hoisting), child class firstly, and parent class nextly, which exposed…
|
| /arkcompiler/runtime_core/compiler/docs/ |
| D | deoptimize_elimination_doc.md | 3 **Deoptimize Elimination** - optimization which try to reduce number of DeoptimizeIf instructions.
29 For another inputs, algorithm try to replaced by `NOP` all `DeoptimizeIf` instruction which is domi…
|