Home
last modified time | relevance | path

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

/external/webkit/JavaScriptCore/wtf/
DAVLTree.h65 template<unsigned maxDepth>
68 bool& operator[](unsigned i) { ASSERT(i < maxDepth); return m_data[i]; }
69 void set() { for (unsigned i = 0; i < maxDepth; ++i) m_data[i] = true; } in set()
70 void reset() { for (unsigned i = 0; i < maxDepth; ++i) m_data[i] = false; } in reset()
73 bool m_data[maxDepth];
126 template <class Abstractor, unsigned maxDepth = 32, class BSet = AVLTreeDefaultBSet<maxDepth> >
334 handle path_h[maxDepth - 1];
588 template <class Abstractor, unsigned maxDepth, class BSet>
589 inline typename AVLTree<Abstractor, maxDepth, BSet>::handle
590 AVLTree<Abstractor, maxDepth, BSet>::insert(handle h) in insert()
[all …]
/external/webkit/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/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/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/WebCore/inspector/front-end/
Dtreeoutline.js711 TreeElement.prototype.expandRecursively = function(maxDepth) argument
720 if (typeof maxDepth === "undefined" || typeof maxDepth === "null")
721 maxDepth = 3;
724 if (depth < maxDepth)
726 item = item.traverseNextTreeElement(false, this, (depth >= maxDepth), info);
/external/webkit/WebCore/bindings/v8/
DSerializedScriptValue.cpp85 static const int maxDepth = 20000; variable
451 if (m_depth > maxDepth) in checkComposite()
/external/webkit/WebKit/chromium/src/js/
DHeapProfilerPanel.js267 var maxDepth = 2;
272 current = current.traverseNextNode(false, null, (depth >= maxDepth), info);
/external/webkit/WebCore/bindings/scripts/
DCodeGeneratorJS.pm2067 my $maxDepth = 0;
2091 $maxDepth = $depth if ($depth > $maxDepth);
/external/webkit/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.