Home
last modified time | relevance | path

Searched refs:maxDepth (Results 1 – 15 of 15) sorted by relevance

/external/webkit/Source/JavaScriptCore/wtf/
DAVLTree.h66 template<unsigned maxDepth>
69 bool& operator[](unsigned i) { ASSERT(i < maxDepth); return m_data[i]; }
70 void set() { for (unsigned i = 0; i < maxDepth; ++i) m_data[i] = true; } in set()
71 void reset() { for (unsigned i = 0; i < maxDepth; ++i) m_data[i] = false; } in reset()
74 FixedArray<bool, maxDepth> m_data;
127 template <class Abstractor, unsigned maxDepth = 32, class BSet = AVLTreeDefaultBSet<maxDepth> >
335 handle path_h[maxDepth - 1];
589 template <class Abstractor, unsigned maxDepth, class BSet>
590 inline typename AVLTree<Abstractor, maxDepth, BSet>::handle
591 AVLTree<Abstractor, maxDepth, BSet>::insert(handle h) in insert()
[all …]
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/
Daccess-binary-trees.js33 var maxDepth = Math.max(minDepth + 2, n); variable
34 var stretchDepth = maxDepth + 1;
38 var longLivedTree = bottomUpTree(0,maxDepth);
39 for (var depth=minDepth; depth<=maxDepth; depth+=2){
40 var iterations = 1 << (maxDepth - depth + minDepth);
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/
Daccess-binary-trees.js33 var maxDepth = Math.max(minDepth + 2, n); variable
34 var stretchDepth = maxDepth + 1;
38 var longLivedTree = bottomUpTree(0,maxDepth);
39 for (var depth=minDepth; depth<=maxDepth; depth+=2){
40 var iterations = 1 << (maxDepth - depth + minDepth);
/external/chromium/chrome/common/extensions/docs/examples/extensions/benchmark/
Dscript.js14 var maxDepth = 0;
30 if (maxDepth < tempDepth) {
31 maxDepth = tempDepth;
42 depths[0] = maxDepth;
/external/dexmaker/src/dx/java/com/android/dx/dex/file/
DClassDefsSection.java158 private int orderItems0(Type type, int idx, int maxDepth) { in orderItems0() argument
165 if (maxDepth < 0) { in orderItems0()
169 maxDepth--; in orderItems0()
174 idx = orderItems0(superclass, idx, maxDepth); in orderItems0()
180 idx = orderItems0(interfaces.getType(i), idx, maxDepth); in orderItems0()
/external/clang/bindings/python/examples/cindex/
Dcindex-dump.py40 if opts.maxDepth is not None and depth >= opts.maxDepth:
/external/srec/tools/grxmlcompile/
Dsub_min.cpp122 int ii, jj, dd, maxDepth, count, itCnt; in IdentifyEquivalence() local
124 maxDepth= 0; in IdentifyEquivalence()
126 if (maxDepth < depthMap[ii]) in IdentifyEquivalence()
127 maxDepth= depthMap[ii]; in IdentifyEquivalence()
133 for (dd= 0; dd <= maxDepth; dd++) in IdentifyEquivalence()
/external/webkit/Source/WebCore/inspector/front-end/
Dtreeoutline.js750 TreeElement.prototype.expandRecursively = function(maxDepth) argument
759 if (typeof maxDepth === "undefined" || typeof maxDepth === "null")
760 maxDepth = 3;
763 if (depth < maxDepth)
765 item = item.traverseNextTreeElement(false, this, (depth >= maxDepth), info);
DHeapSnapshotView.js262 const maxDepth = 2;
267 current = current.traverseNextNode(false, null, (depth >= maxDepth), info);
DDetailedHeapshotView.js638 const maxDepth = 1;
643 current = current.traverseNextNode(false, null, (depth >= maxDepth), info);
/external/clang/lib/AST/
DStmtDumper.cpp44 StmtDumper(SourceManager *sm, raw_ostream &os, unsigned maxDepth) in StmtDumper() argument
45 : SM(sm), OS(os), IndentLevel(0-1), MaxDepth(maxDepth) { in StmtDumper()
/external/webkit/Source/WebCore/bindings/v8/
DSerializedScriptValue.cpp95 static const int maxDepth = 20000; variable
609 if (m_depth > maxDepth) in checkComposite()
/external/webkit/Source/WebCore/bindings/scripts/
DCodeGeneratorJS.pm2647 my $maxDepth = 0;
2671 $maxDepth = $depth if ($depth > $maxDepth);
/external/clang/lib/StaticAnalyzer/Checkers/
DRetainCountChecker.cpp1858 unsigned maxDepth = 4; in isPropertyAccess() local
1859 while (S && maxDepth) { in isPropertyAccess()
1866 --maxDepth; in isPropertyAccess()
/external/webkit/Source/WebCore/
DChangeLog-2008-08-1020728 compute a current depth. If the depth exceeds the maxDepth argument, the
20730 is called until the depth goes below the maxDepth.