| /arkcompiler/runtime_core/static_core/runtime/tooling/sampler/ |
| H A D | lock_free_queue.cpp | 53 Node *head = head_.load(std::memory_order_acquire); in Pop() local
57 Node *next = head->next.load(std::memory_order_acquire); in Pop()
60 if (head != head2) { in Pop()
63 if (head == tail) { in Pop()
74 if (head_.compare_exchange_weak(head, newHead)) { in Pop()
75 delete head; in Pop()
86 Node *head = head_.load(std::memory_order_acquire); in FindValue() local
91 ASSERT(head != nullptr); in FindValue()
93 if (head->data == nullptr) { in FindValue()
94 if (head in FindValue()
[all...] |
| /arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/ |
| H A D | adjust_arefs.cpp | 97 auto head = heads_.back(); in ProcessArrayUses() local
99 ASSERT(IsRefAdjustable(head)); in ProcessArrayUses()
100 ASSERT(head->IsMarked(worksetMarker_)); in ProcessArrayUses()
101 ASSERT(head->GetBasicBlock() != nullptr); in ProcessArrayUses()
102 loop_ = head->GetBasicBlock()->GetLoop(); in ProcessArrayUses()
106 ASSERT(!head->GetBasicBlock()->IsMarked(blockProcessed_)); in ProcessArrayUses()
107 WalkChainDown(head->GetBasicBlock(), head, head); in ProcessArrayUses()
109 ProcessChain(head); in ProcessArrayUses()
131 WalkChainDown(BasicBlock *bb, Inst *startFrom, Inst *head) WalkChainDown() argument
169 ProcessChain(Inst *head) ProcessChain() argument
[all...] |
| H A D | adjust_arefs.h | 45 void WalkChainDown(BasicBlock *bb, Inst *startFrom, Inst *head);
46 void ProcessChain(Inst *head);
|
| /arkcompiler/runtime_core/static_core/runtime/tooling/ |
| H A D | debug_inf.cpp | 45 std::atomic<PCodeItem *> head {nullptr};
121 auto *head = metaInfo->head.load(std::memory_order_relaxed); in AddCodeMetaInfoImpl() local
129 codeItem->next.store(head, std::memory_order_relaxed); in AddCodeMetaInfoImpl()
134 if (head != nullptr) { in AddCodeMetaInfoImpl()
135 head->prev = codeItem; in AddCodeMetaInfoImpl()
140 metaInfo->head.store(codeItem, std::memory_order_relaxed); in AddCodeMetaInfoImpl()
168 metaInfo->head.store(next, std::memory_order_relaxed); in DelCodeMetaInfoImpl()
|
| /arkcompiler/runtime_core/static_core/plugins/ets/tests/interop_js/tests/proxies/ets_proxy/ |
| H A D | check_proxy_objects.js | 53 let head = new ListNode(0, null);
54 head.next = new ListNode(1, new ListNode(2, new ListNode(3, head)));
56 for (let n = head, i = 0; i < 256; ++i, n = n.next) {
|
| /arkcompiler/ets_runtime/ecmascript/tests/ |
| H A D | linked_node_test.cpp | 45 JSHandle<LinkedNode> head(thread, JSTaggedValue::Hole());
in CreateLinkedList()
52 head = factory->NewLinkedNode(hash, key, value, head);
in CreateLinkedList()
54 return head;
in CreateLinkedList()
74 JSHandle<LinkedNode> head = CreateLinkedList();
in HWTEST_F_L0() local
75 JSHandle<RBTreeNode> root = LinkedNode::Treeing(thread, head);
in HWTEST_F_L0()
|
| H A D | rb_tree_node_test.cpp | 181 JSHandle<LinkedNode> head = RBTreeNode::Detreeing(thread, rootNode);
in HWTEST_F_L0() local
184 for (; !head.GetTaggedValue().IsHole(); head = JSHandle<LinkedNode>(thread, head->GetNext())) {
in HWTEST_F_L0()
|
| /arkcompiler/runtime_core/static_core/libpandabase/taskmanager/utils/ |
| H A D | sp_sc_lock_free_queue.h | 85 auto *head = head_.load(std::memory_order_acquire); in Pop() local
97 auto *nextHead = head->next.load(std::memory_order_acquire); in Pop()
101 DeleteQueueNode(head); in Pop()
104 val = std::move(head->buffer[GetNodeIndex(popIndex)]); in Pop()
132 auto head = head_.load(std::memory_order_acquire); in ~SPSCLockFreeQueue() local
133 DeleteQueueNode(head); in ~SPSCLockFreeQueue()
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/mempool/src/ |
| H A D | mempool.cpp | 191 MemBlock **head = nullptr; in AllocNewMemBlock() local
194 head = &fixedMemHead; in AllocNewMemBlock()
196 head = &bigMemHead; in AllocNewMemBlock()
199 newMemBlock->nextMemBlock = *head; in AllocNewMemBlock()
200 *head = newMemBlock; in AllocNewMemBlock()
271 MemBlock **head = nullptr; in AllocTailMemBlock() local
276 head = &fixedMemHead; in AllocTailMemBlock()
280 head = &bigMemHead; in AllocTailMemBlock()
288 *head = newMemBlock; in AllocTailMemBlock()
|
| /arkcompiler/ets_runtime/ecmascript/stackmap/ |
| H A D | ark_stackmap.h | 49 CallsiteHeader head; member
54 return head.calliteOffsetInTxtSec < x.head.calliteOffsetInTxtSec; in operator <()
|
| H A D | ark_stackmap_builder.cpp | 48 LOG_COMPILER(INFO) << "total callsite head size: " in Dump()
116 ASSERT(callSite.head.stackmapOffsetInSMSec == writer.GetOffset()); in SaveArkStackMap()
124 ASSERT((callSite.head.stackmapOffsetInSMSec + callSite.CalStackMapSize(triple)) == writer.GetOffset()); in SaveArkStackMap()
139 ASSERT(it.head.deoptOffset == writer.GetOffset()); in SaveArkDeopt()
184 writer.WriteBuffer(reinterpret_cast<const uint8_t *>(&(it.head)), sizeof(CallsiteHeader)); in SaveArkCallsiteAOTFileInfo()
316 callsite.head.calliteOffsetInTxtSec = x.first; in GenArkCallsiteAOTFileInfo()
318 callsite.head.stackmapNum = i.size(); in GenArkCallsiteAOTFileInfo()
319 callsite.head.stackmapOffsetInSMSec = stackmapOffset; in GenArkCallsiteAOTFileInfo()
320 callsite.head.deoptOffset = 0; in GenArkCallsiteAOTFileInfo()
321 callsite.head in GenArkCallsiteAOTFileInfo()
[all...] |
| H A D | ark_stackmap_parser.cpp | 54 ArkStackMapHeader *head = reinterpret_cast<ArkStackMapHeader *>(stackmapAddr); in GetArkDeopt() local
55 ASSERT(head != nullptr); in GetArkDeopt()
56 if (head == nullptr) { in GetArkDeopt()
59 uint32_t callsiteNum = head->callsiteNum; in GetArkDeopt()
160 ArkStackMapHeader *head = reinterpret_cast<ArkStackMapHeader *>(stackmapAddr); in IteratorStackMap() local
161 ASSERT(head != nullptr); in IteratorStackMap()
162 uint32_t callsiteNum = head->callsiteNum; in IteratorStackMap()
|
| /arkcompiler/ets_frontend/arkguard/test/grammar/export_obfuscation/ |
| H A D | export_obfuscation_3.js | 18 this.head = false;
21 if (!this.head) {
|
| /arkcompiler/runtime_core/static_core/plugins/ets/runtime/types/ |
| H A D | ets_finalizable_weak_ref_list.h | 31 auto *head = GetHead(); in Push() local
32 if (head == nullptr) { in Push()
36 head->SetPrev(coro, weakRef); in Push()
37 weakRef->SetNext(coro, head); in Push()
|
| /arkcompiler/ets_runtime/ecmascript/mem/ |
| H A D | chunk.cpp | 41 Area *head = currentArea_; in Expand() local
43 if (head != nullptr) { in Expand()
45 newSize = size + (head->GetSize() << 1); in Expand()
|
| /arkcompiler/ets_runtime/ecmascript/stackmap/llvm/ |
| H A D | llvm_stackmap_parser.h | 58 llvmStackMap_.head.stackmapversion = 0; in LLVMStackMapParser()
59 llvmStackMap_.head.reserved0 = 0; in LLVMStackMapParser()
60 llvmStackMap_.head.reserved1 = 0; in LLVMStackMapParser()
|
| H A D | llvm_stackmap_parser.cpp | 73 struct StkMapRecordHeadTy &recordHead = record.head; in CalcCallSite()
184 llvmStackMap_.head = dataInfo_->Read<struct Header>(); in CalculateStackMap()
200 auto head = dataInfo_->Read<struct StkMapRecordHeadTy>(); in CalculateStackMap() local
201 stkSizeRecord.head = head; in CalculateStackMap()
202 for (uint16_t j = 0; j < head.numLocations; j++) { in CalculateStackMap()
227 uint32_t headSize = sizeof(head); in CalHeadSize()
|
| H A D | llvm_stackmap_type.h | 119 LOG_COMPILER(DEBUG) << "----- head ----"; in Print()
121 LOG_COMPILER(DEBUG) << "+++++ head ++++"; in Print()
172 struct StkMapRecordHeadTy head; member
177 head.Print(); in Print()
215 struct Header head; member
221 head.Print(); in Print()
|
| /arkcompiler/ets_runtime/ecmascript/compiler/ |
| H A D | loop_analysis.h | 26 LoopInfo(Chunk* chunk, GateRef head) in LoopInfo()
27 : loopHead(head), loopBacks(chunk), loopExits(chunk), loopBodys(chunk) {} in LoopInfo()
|
| /arkcompiler/runtime_core/scripts/ |
| H A D | install-deps-qemu | 155 | head -n1)
159 | head -n1)
|
| /arkcompiler/runtime_core/static_core/scripts/ |
| H A D | install-deps-qemu | 161 | head -n1)
165 | head -n1)
|
| /arkcompiler/ets_runtime/ecmascript/ |
| H A D | tagged_node.cpp | 22 JSHandle<RBTreeNode> LinkedNode::Treeing(JSThread *thread, const JSHandle<LinkedNode> &head)
in Treeing() argument
25 JSMutableHandle<LinkedNode> next(thread, head);
in Treeing()
58 JSHandle<LinkedNode> &head, JSHandle<LinkedNode> &tail)
in InOrderTraverse()
62 InOrderTraverse(thread, leftChild, head, tail);
in InOrderTraverse()
65 head = linkedNode;
in InOrderTraverse()
71 InOrderTraverse(thread, rightChild, head, tail);
in InOrderTraverse()
77 JSHandle<LinkedNode> head(thread, JSTaggedValue::Hole());
in Detreeing()
80 InOrderTraverse(thread, root, head, tail);
in Detreeing()
82 return head;
in Detreeing()
57 InOrderTraverse(JSThread *thread, const JSHandle<RBTreeNode> &treeNode, JSHandle<LinkedNode> &head, JSHandle<LinkedNode> &tail) InOrderTraverse() argument
|
| H A D | tagged_hash_array.cpp | 226 LinkedNode *head = LinkedNode::Cast(node.GetTaggedObject()); in RemoveNode() local
227 JSTaggedValue newKey = head->GetKey(); in RemoveNode()
228 if (head->GetHash().GetInt() == hash && (!key.IsHole() && JSTaggedValue::SameValue(key, newKey))) { in RemoveNode()
229 Set(thread, index, head->GetNext()); in RemoveNode()
230 return head->GetValue(); in RemoveNode()
232 JSTaggedValue nodeNextVa = head->GetNext(); in RemoveNode()
233 LinkedNode *previousNode = head; in RemoveNode()
|
| /arkcompiler/runtime_core/compiler/optimizer/analysis/ |
| H A D | liveness_analyzer.cpp | 642 for (auto head = this; head != nullptr; head = head->GetSibling()) { in FindSiblingAt()
643 if (head->GetBegin() <= ln && ln <= head->GetEnd()) { in FindSiblingAt()
644 return head; in FindSiblingAt()
|
| /arkcompiler/runtime_core/static_core/runtime/mem/ |
| H A D | freelist_allocator-inl.h | 245 // NOTE: We add each new pool at the mempool_tail_. Therefore, we can read it once and iterate to head. in IterateOverObjects()
368 LOG_FREELIST_ALLOCATOR(DEBUG) << "VisitAndRemoveFreePools: Change pools head pointer"; in VisitAndRemoveFreePools()
492 LOG_FREELIST_ALLOCATOR(DEBUG) << "It is a memory with padding at head"; in GetFreeListMemoryHeader()
616 FreeListHeader *head = GetFirstBlock(index); in FindMemoryBlock() local
618 if (head != nullptr) { in FindMemoryBlock()
623 suitableBlock = FindSuitableBlockInList(head, size); in FindMemoryBlock()
628 suitableBlock = TryGetSuitableBlockBySize(head, size, index); in FindMemoryBlock()
633 // We didn't find the block in the head list. Try to find block in other lists. in FindMemoryBlock()
658 freelist::FreeListHeader *head, size_t size) in FindSuitableBlockInList()
661 for (FreeListHeader *current = head; curren in FindSuitableBlockInList()
657 FindSuitableBlockInList( freelist::FreeListHeader *head, size_t size) FindSuitableBlockInList() argument
684 TryGetSuitableBlockBySize( freelist::FreeListHeader *head, size_t size, size_t index) TryGetSuitableBlockBySize() argument
[all...] |