| /arkcompiler/ets_runtime/ecmascript/ |
| D | tagged_tree.cpp | 30 auto tree = JSHandle<Derived>::Cast(factory->NewTaggedArray(length)); in Create() local
135 …TaggedTree<Derived>::AdjustTaggedTree(const JSThread *thread, const JSHandle<Derived> &tree, int l… in AdjustTaggedTree()
193 void TaggedTree<Derived>::Remove(const JSThread *thread, const JSHandle<Derived> &tree, int entry) in Remove()
311 int TaggedTree<Derived>::FindEntry(JSThread *thread, const JSHandle<Derived> &tree, const JSHandle<… in FindEntry()
341 const JSHandle<JSTaggedValue> valueY, JSHandle<Derived> tree) in EntryCompare()
396 …ggedArray> TaggedTree<Derived>::GetSortArray(const JSThread *thread, const JSHandle<Derived> &tree) in GetSortArray()
417 JSHandle<Derived> TaggedTree<Derived>::Insert(JSThread *thread, JSHandle<Derived> &tree, in Insert()
465 JSHandle<Derived> TaggedTree<Derived>::GrowCapacity(const JSThread *thread, JSHandle<Derived> &tree) in GrowCapacity()
488 JSTaggedValue TaggedTree<Derived>::GetLowerKey(JSThread *thread, const JSHandle<Derived> &tree, in GetLowerKey()
511 JSTaggedValue TaggedTree<Derived>::GetHigherKey(JSThread *thread, const JSHandle<Derived> &tree, in GetHigherKey()
[all …]
|
| D | ecma_string.cpp | 887 JSHandle<TreeEcmaString> tree(string); in SlowFlatten() local
902 JSHandle<TreeEcmaString> tree = JSHandle<TreeEcmaString>::Cast(string); in Flatten() local
919 JSHandle<TreeEcmaString> tree = JSHandle<TreeEcmaString>::Cast(string); in FlattenAllString() local
939 TreeEcmaString *tree = TreeEcmaString::Cast(string); in FlattenNoGCForSnapshot() local
|
| D | dump.cpp | 1935 void DumpTaggedTreeEntry(const JSThread *thread, T tree, std::ostream &os, int index, bool isMap = … in DumpTaggedTreeEntry()
4738 void DumpForSnapshotTaggedTreeEntry(const JSThread *thread, T tree, int index, std::vector<Referenc… in DumpForSnapshotTaggedTreeEntry()
|
| /arkcompiler/runtime_core/static_core/libllvmbackend/transforms/passes/ |
| D | ark_gvn.cpp | 59 auto &tree = analysisManager.getResult<llvm::DominatorTreeAnalysis>(function); in run() local
97 bool ArkGVN::RunOnFunction(const llvm::DominatorTree &tree, const GvnBuiltins &builtins) in RunOnFunction()
112 bool ArkGVN::RunOnBasicBlock(llvm::BasicBlock *block, const llvm::DominatorTree &tree, const GvnBui… in RunOnBasicBlock()
207 const llvm::DominatorTree &tree) in FindDominantCall()
|
| /arkcompiler/runtime_core/static_core/compiler/tests/ |
| D | live_registers_test.cpp | 55 auto tree = LifeIntervalsTree::BuildIntervalsTree(intervals, GetGraph()); in TEST_F() local
107 auto tree = LifeIntervalsTree::BuildIntervalsTree(intervals, GetGraph()); in TEST_F() local
143 auto tree = LifeIntervalsTree::BuildIntervalsTree(intervals, GetGraph()); in TEST_F() local
170 auto tree = LifeIntervalsTree::BuildIntervalsTree(intervals, GetGraph()); in TEST_F() local
226 auto tree = LifeIntervalsTree::BuildIntervalsTree(intervals, GetGraph()); in TEST_F() local
|
| /arkcompiler/ets_runtime/ecmascript/dfx/hprof/ |
| D | heap_snapshot_json_serializer.cpp | 190 TraceTree* tree = snapshot->GetTraceTree(); in SerializeTraceTree() local
|
| D | heap_snapshot.cpp | 879 TraceNode::TraceNode(TraceTree* tree, uint32_t nodeIndex) in TraceNode()
|
| /arkcompiler/ets_runtime/ecmascript/tests/ |
| D | tagged_hash_array_test.cpp | 285 bool CheckRBTreeOfAllPaths(const JSThread *thread, JSHandle<T> &tree, int numsOfBlack, in CheckRBTreeOfAllPaths()
322 bool CheckBlackNodeNumbers(const JSThread *thread, JSHandle<T> &tree, JSHandle<RBTreeNode> hashTree… in CheckBlackNodeNumbers()
340 bool IsVaildRBTree(JSThread *thread, JSHandle<T> &tree, JSHandle<RBTreeNode> hashTreeNode) in IsVaildRBTree()
|
| D | tagged_tree_test.cpp | 49 bool CheckRBTreeOfAllPaths(JSHandle<T> &tree, int numsOfBlack, int index, int count) in CheckRBTreeOfAllPaths()
65 bool CheckBlackNodeNumbers(JSHandle<T> &tree, int index) in CheckBlackNodeNumbers()
79 bool IsVaildRBTree(JSThread *thread, JSHandle<T> &tree, int nodeIndex) in IsVaildRBTree()
|
| /arkcompiler/ets_runtime/common_components/heap/allocator/ |
| D | treap.h | 191 explicit Iterator(Treap& tree) : localQueue_(tree.traversalSud_) in Iterator()
224 explicit CopyIterator(Treap& tree) : localQueue_(tree.sud_) in CopyIterator()
|