Home
last modified time | relevance | path

Searched defs:tree (Results 1 – 9 of 9) sorted by relevance

/arkcompiler/ets_runtime/ecmascript/
Dtagged_tree.cpp30 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()
481 JSTaggedValue TaggedTree<Derived>::GetLowerKey(JSThread *thread, const JSHandle<Derived> &tree, in GetLowerKey()
504 JSTaggedValue TaggedTree<Derived>::GetHigherKey(JSThread *thread, const JSHandle<Derived> &tree, in GetHigherKey()
[all …]
Decma_string.cpp1381 JSHandle<TreeEcmaString> tree(string); in SlowFlatten() local
1395 JSHandle<TreeEcmaString> tree = JSHandle<TreeEcmaString>::Cast(string); in Flatten() local
1411 JSHandle<TreeEcmaString> tree = JSHandle<TreeEcmaString>::Cast(string); in FlattenAllString() local
1431 TreeEcmaString *tree = TreeEcmaString::Cast(string); in FlattenNoGCForSnapshot() local
Ddump.cpp1845 void DumpTaggedTreeEntry(T tree, std::ostream &os, int index, bool isMap = false) in DumpTaggedTreeEntry()
4611 void DumpForSnapshotTaggedTreeEntry(T tree, int index, std::vector<Reference> &vec, bool isMap = fa… in DumpForSnapshotTaggedTreeEntry()
/arkcompiler/runtime_core/static_core/libllvmbackend/transforms/passes/
Dark_gvn.cpp59 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/
Dlive_registers_test.cpp55 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/tests/
Dtagged_hash_array_test.cpp284 bool CheckRBTreeOfAllPaths(JSHandle<T> &tree, int numsOfBlack, JSTaggedValue hashTreeNodeVa, int co… in CheckRBTreeOfAllPaths()
320 bool CheckBlackNodeNumbers(JSHandle<T> &tree, JSHandle<RBTreeNode> hashTreeNode) in CheckBlackNodeNumbers()
338 bool IsVaildRBTree(JSThread *thread, JSHandle<T> &tree, JSHandle<RBTreeNode> hashTreeNode) in IsVaildRBTree()
Dtagged_tree_test.cpp49 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/ecmascript/dfx/hprof/
Dheap_snapshot_json_serializer.cpp245 TraceTree* tree = snapshot->GetTraceTree(); in SerializeTraceTree() local
Dheap_snapshot.cpp780 TraceNode::TraceNode(TraceTree* tree, uint32_t nodeIndex) in TraceNode()