| /arkcompiler/runtime_core/static_core/runtime/tooling/sampler/ |
| H A D | lock_free_queue.cpp | 26 Node *tail = tail_.load(std::memory_order_acquire); in Push() local
27 ASSERT(tail != nullptr); in Push()
29 Node *next = tail->next.load(std::memory_order_acquire); in Push()
32 if (tail != tail2) { in Push()
36 if (tail->next.compare_exchange_weak(next, newNode)) { in Push()
37 tail_.compare_exchange_strong(tail, newNode); in Push()
43 tail_.compare_exchange_strong(tail, newTail); in Push()
55 Node *tail = tail_.load(std::memory_order_acquire); in Pop() local
63 if (head == tail) { in Pop()
66 tail_.compare_exchange_strong(tail, newTai in Pop()
88 Node *tail = tail_.load(std::memory_order_acquire); FindValue() local
[all...] |
| /arkcompiler/runtime_core/static_core/plugins/ets/runtime/types/ |
| H A D | ets_waiters_list.h | 102 auto *tail = tail_.exchange(nullptr, std::memory_order_acq_rel); in RestockQueue() local
103 while (tail != nullptr) { in RestockQueue()
104 auto *newHead = std::exchange(tail, tail->next_); in RestockQueue()
|
| /arkcompiler/runtime_core/static_core/plugins/ets/tests/interop_js/tests/checked/js_call/ |
| H A D | js_call.js | 18 function cons(value, tail) {
19 return { value: value, tail: tail };
27 return node.tail;
|
| /arkcompiler/runtime_core/static_core/tests/tests-u-runner/runner/plugins/ets/ |
| H A D | preparation_step.py | 235 tail = [f"\nfunction main({param_line}){return_type} {throws}{{"]
237 tail.append(f"{self.__indent}let result = 0")
238 tail.append(f"{self.__indent}for(let i = 0; i < {self.num_repeats}; i++) {{")
240 tail.append(f"{self.__indent * 2}result += main_run({param_name})")
242 tail.append(f"{self.__indent * 2}main_run({param_name})")
243 tail.append(f"{self.__indent}}}")
245 tail.append(f"{self.__indent}return result;")
246 tail.append("}")
249 result += "\n".join(tail)
|
| /arkcompiler/ets_runtime/ecmascript/js_api/ |
| H A D | js_api_queue.cpp | 28 uint32_t tail = queue->GetTail(); in Add() local
30 elements->Set(thread, tail, value); in Add()
35 queue->SetTail((tail + 1) % elementsSize); in Add()
43 uint32_t tail = obj->GetTail(); in GrowCapacity() local
51 } else if ((tail + 1) % oldLength == front) { in GrowCapacity()
53 newElements = thread->GetEcmaVM()->GetFactory()->CopyQueue(oldElements, newCapacity, front, tail); in GrowCapacity()
55 tail = oldLength - 1; in GrowCapacity()
62 obj->SetTail(tail); in GrowCapacity()
165 uint32_t tail = obj->GetTail(); in OwnKeys() local
167 thread->GetEcmaVM()->GetFactory()->CopyQueue(oldElements, newCapacity, front, tail); in OwnKeys()
184 uint32_t tail = obj->GetTail(); OwnEnumKeys() local
[all...] |
| /arkcompiler/runtime_core/static_core/libpandabase/taskmanager/utils/ |
| H A D | sp_sc_lock_free_queue.h | 64 auto *tail = tail_.load(std::memory_order_acquire); in Push() local
70 tail->next.store(node, std::memory_order_release); in Push()
75 tail->buffer[GetNodeIndex(pushIndex)] = std::move(val); in Push()
|
| /arkcompiler/ets_runtime/ecmascript/ |
| H A D | tagged_node.cpp | 58 JSHandle<LinkedNode> &head, JSHandle<LinkedNode> &tail)
in InOrderTraverse()
62 InOrderTraverse(thread, leftChild, head, tail);
in InOrderTraverse()
64 if (tail.GetTaggedValue().IsHole()) {
in InOrderTraverse()
67 tail->SetNext(thread, linkedNode.GetTaggedValue());
in InOrderTraverse()
69 tail = linkedNode;
in InOrderTraverse()
71 InOrderTraverse(thread, rightChild, head, tail);
in InOrderTraverse()
78 JSHandle<LinkedNode> tail(thread, JSTaggedValue::Hole());
in Detreeing()
80 InOrderTraverse(thread, root, head, tail);
in Detreeing()
57 InOrderTraverse(JSThread *thread, const JSHandle<RBTreeNode> &treeNode, JSHandle<LinkedNode> &head, JSHandle<LinkedNode> &tail) InOrderTraverse() argument
|
| H A D | tagged_node.h | 147 JSHandle<LinkedNode> &head, JSHandle<LinkedNode> &tail);
|
| H A D | object_factory.h | 645 uint32_t front, uint32_t tail);
|
| H A D | object_factory.cpp | 4435 uint32_t front, uint32_t tail) in CopyQueue()
4448 while (curIndex != tail) { in CopyQueue()
4434 CopyQueue(const JSHandle<TaggedArray> &old, uint32_t newLength, uint32_t front, uint32_t tail) CopyQueue() argument
|
| /arkcompiler/ets_frontend/es2panda/util/ |
| H A D | symbolTable.cpp | 164 auto tail = input.substr(lastPos); in GetStringItems() local
165 if (!tail.empty()) { in GetStringItems()
166 items.push_back(tail); in GetStringItems()
|
| H A D | commonUtil.cpp | 38 std::string tail = str.substr(start); in Split() local
39 items.emplace_back(tail); in Split()
|
| /arkcompiler/ets_runtime/ecmascript/pgo_profiler/ap_file/ |
| H A D | pgo_proto_transition_type_pool.h | 63 auto tail = stream.tellp(); variable
66 stream.seekp(tail, std::ofstream::beg);
|
| H A D | pgo_record_pool.h | 155 auto tail = stream.tellp(); variable
158 stream.seekp(tail, std::ofstream::beg);
|
| H A D | pool_template.h | 135 auto tail = stream.tellp(); variable
138 stream.seekp(tail, std::ofstream::beg);
|
| /arkcompiler/ets_runtime/test/moduletest/arrayfrom/ |
| H A D | arrayfrom.js | 316 const tail = '_tail'
318 let res = Array.from(str, x => x + tail);
321 if (res[i] != head + tail) {
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/src/cg/ |
| H A D | cg_dominance.cpp | 35 bool tail = true; in PostOrderWalk()
38 tail = false; in PostOrderWalk()
44 if (tail) { in PostOrderWalk()
|
| /arkcompiler/toolchain/tooling/client/domain/ |
| H A D | heapprofiler_client.cpp | 295 std::string tail = "]\n}\n"; in SaveHeapSnapshotAndAllocationTrackData() local
296 std::string subStr = chunk.substr(chunk.length() - tail.length(), chunk.length()); in SaveHeapSnapshotAndAllocationTrackData()
297 if (!strncmp(subStr.c_str(), tail.c_str(), tail.length())) { in SaveHeapSnapshotAndAllocationTrackData()
|
| /arkcompiler/runtime_core/libpandabase/utils/ |
| H A D | murmur3_hash.h | 117 // Proceed the tail: in MurmurHash3()
119 auto tail = blocks; in MurmurHash3() local
122 // Get ((uint8_t*)tail)[i - 1]: in MurmurHash3()
123 uintptr_t block_pointer = tail + sizeof(uint8_t) * (i - 1); in MurmurHash3()
179 // Proceed the tail: in MurmurHash3String()
|
| /arkcompiler/runtime_core/static_core/libpandabase/utils/ |
| H A D | murmur3_hash.h | 114 // Proceed the tail: in MurmurHash3()
116 auto tail = blocks; in MurmurHash3() local
119 // Get ((uint8_t*)tail)[i - 1]: in MurmurHash3()
120 uintptr_t blockPointer = tail + sizeof(uint8_t) * (i - 1); in MurmurHash3()
176 // Proceed the tail: in MurmurHash3String()
|
| H A D | utf.cpp | 559 uint32_t tail = ((codePoint & MASK_10BIT) + U16_TAIL) & MASK_16BIT; in ConvertUtf8ToUtf16Pair() local
560 pair = U16_GET_SUPPLEMENTARY(lead, tail); // NOLINT(hicpp-signed-bitwise) in ConvertUtf8ToUtf16Pair()
|
| /arkcompiler/ets_runtime/ecmascript/base/ |
| H A D | utf_helper.cpp | 343 uint32_t tail = ((codePoint & utf::MASK_10BIT) + utf::U16_TAIL) & utf::MASK_16BIT; in ConvertUtf8ToUtf16Pair() local
344 pair = static_cast<uint32_t>(U16_GET_SUPPLEMENTARY(lead, tail)); // NOLINTNEXTLINE(hicpp-signed-bitwise) in ConvertUtf8ToUtf16Pair()
353 // drop the tail bytes if the remain length can't fill the length it represents.
|
| /arkcompiler/ets_runtime/ecmascript/module/ |
| H A D | module_path_helper.cpp | 1050 CString tail = ohmurl.substr(start); in SplitNormalizedOhmurl() local
1051 res.emplace_back(tail); in SplitNormalizedOhmurl()
|
| /arkcompiler/ets_frontend/es2panda/test/compiler/js/ |
| H A D | cocos_worker_test.js | [all...] |