/external/chromium_org/v8/src/ |
D | conversions-inl.h | 111 bool SubStringEquals(Iterator* current, in SubStringEquals() argument 114 ASSERT(**current == *substring); in SubStringEquals() 116 ++*current; in SubStringEquals() 117 if (*current == end || **current != *substring) return false; in SubStringEquals() 119 ++*current; in SubStringEquals() 128 Iterator* current, in AdvanceToNonspace() argument 130 while (*current != end) { in AdvanceToNonspace() 131 if (!unicode_cache->IsWhiteSpace(**current)) return true; in AdvanceToNonspace() 132 ++*current; in AdvanceToNonspace() 141 Iterator current, in InternalStringToIntDouble() argument [all …]
|
D | handles-inl.h | 113 v8::ImplementationUtilities::HandleScopeData* current = in HandleScope() local 116 prev_next_ = current->next; in HandleScope() 117 prev_limit_ = current->limit; in HandleScope() 118 current->level++; in HandleScope() 130 v8::ImplementationUtilities::HandleScopeData* current = in CloseScope() local 133 std::swap(current->next, prev_next); in CloseScope() 134 current->level--; in CloseScope() 135 if (current->limit != prev_limit) { in CloseScope() 136 current->limit = prev_limit; in CloseScope() 139 ZapRange(current->next, prev_limit); in CloseScope() [all …]
|
/external/v8/src/ |
D | conversions-inl.h | 106 bool SubStringEquals(Iterator* current, in SubStringEquals() argument 109 ASSERT(**current == *substring); in SubStringEquals() 111 ++*current; in SubStringEquals() 112 if (*current == end || **current != *substring) return false; in SubStringEquals() 114 ++*current; in SubStringEquals() 123 Iterator* current, in AdvanceToNonspace() argument 125 while (*current != end) { in AdvanceToNonspace() 126 if (!unicode_cache->IsWhiteSpace(**current)) return true; in AdvanceToNonspace() 127 ++*current; in AdvanceToNonspace() 136 Iterator current, in InternalStringToIntDouble() argument [all …]
|
D | handles-inl.h | 72 v8::ImplementationUtilities::HandleScopeData* current = in HandleScope() local 75 prev_next_ = current->next; in HandleScope() 76 prev_limit_ = current->limit; in HandleScope() 77 current->level++; in HandleScope() 83 v8::ImplementationUtilities::HandleScopeData* current = in HandleScope() local 86 prev_next_ = current->next; in HandleScope() 87 prev_limit_ = current->limit; in HandleScope() 88 current->level++; in HandleScope() 98 v8::ImplementationUtilities::HandleScopeData* current = in CloseScope() local 100 current->next = prev_next_; in CloseScope() [all …]
|
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
D | DTMDefaultBaseTraversers.java | 211 public int next(int context, int current) in next() argument 213 return getParent(current); in next() 226 public int next(int context, int current, int expandedTypeID) in next() argument 229 current = makeNodeIdentity(current); in next() 231 while (DTM.NULL != (current = m_parent.elementAt(current))) in next() 233 if (m_exptype.elementAt(current) == expandedTypeID) in next() 234 return makeNodeHandle(current); in next() 294 public int next(int context, int current) in next() argument 296 return (context == current) in next() 297 ? getFirstAttribute(context) : getNextAttribute(current); in next() [all …]
|
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
D | NodeTraversal.cpp | 33 Node* previousIncludingPseudo(const Node& current, const Node* stayWithin) in previousIncludingPseudo() argument 35 if (current == stayWithin) in previousIncludingPseudo() 37 if (Node* previous = current.pseudoAwarePreviousSibling()) { in previousIncludingPseudo() 42 return current.parentNode(); in previousIncludingPseudo() 45 Node* nextIncludingPseudo(const Node& current, const Node* stayWithin) in nextIncludingPseudo() argument 47 if (Node* next = current.pseudoAwareFirstChild()) in nextIncludingPseudo() 49 if (current == stayWithin) in nextIncludingPseudo() 51 if (Node* next = current.pseudoAwareNextSibling()) in nextIncludingPseudo() 53 for (Node* parent = current.parentNode(); parent; parent = parent->parentNode()) { in nextIncludingPseudo() 62 Node* nextIncludingPseudoSkippingChildren(const Node& current, const Node* stayWithin) in nextIncludingPseudoSkippingChildren() argument [all …]
|
D | NodeTraversal.h | 71 inline Node* traverseNextTemplate(NodeType& current) in traverseNextTemplate() argument 73 if (current.firstChild()) in traverseNextTemplate() 74 return current.firstChild(); in traverseNextTemplate() 75 if (current.nextSibling()) in traverseNextTemplate() 76 return current.nextSibling(); in traverseNextTemplate() 77 return nextAncestorSibling(current); in traverseNextTemplate() 79 inline Node* next(const Node& current) { return traverseNextTemplate(current); } in next() argument 80 inline Node* next(const ContainerNode& current) { return traverseNextTemplate(current); } in next() argument 83 inline Node* traverseNextTemplate(NodeType& current, const Node* stayWithin) in traverseNextTemplate() argument 85 if (current.firstChild()) in traverseNextTemplate() [all …]
|
D | ElementTraversal.h | 60 inline Element* firstElementWithinTemplate(NodeType& current) in firstElementWithinTemplate() argument 63 Node* node = current.firstChild(); in firstElementWithinTemplate() 68 inline Element* firstWithin(const ContainerNode& current) { return firstElementWithinTemplate(curre… in firstWithin() argument 69 inline Element* firstWithin(const Node& current) { return firstElementWithinTemplate(current); } in firstWithin() argument 72 inline Element* traverseNextElementTemplate(NodeType& current) in traverseNextElementTemplate() argument 74 Node* node = NodeTraversal::next(current); in traverseNextElementTemplate() 79 inline Element* next(const ContainerNode& current) { return traverseNextElementTemplate(current); } in next() argument 80 inline Element* next(const Node& current) { return traverseNextElementTemplate(current); } in next() argument 83 inline Element* traverseNextElementTemplate(NodeType& current, const Node* stayWithin) in traverseNextElementTemplate() argument 85 Node* node = NodeTraversal::next(current, stayWithin); in traverseNextElementTemplate() [all …]
|
/external/chromium_org/third_party/WebKit/Source/core/html/ |
D | HTMLNameCollection.cpp | 57 Element* current; in virtualItemAfter() local 59 current = ElementTraversal::firstWithin(*ownerNode()); in virtualItemAfter() 61 current = ElementTraversal::next(*previous, ownerNode()); in virtualItemAfter() 63 for (; current; current = ElementTraversal::next(*current, ownerNode())) { in virtualItemAfter() 68 if (current->hasTagName(imgTag) in virtualItemAfter() 69 || current->hasTagName(formTag) in virtualItemAfter() 70 || current->hasTagName(appletTag) in virtualItemAfter() 71 || current->hasTagName(embedTag) in virtualItemAfter() 72 || current->hasTagName(objectTag)) { in virtualItemAfter() 73 if (current->getNameAttribute() == m_name) in virtualItemAfter() [all …]
|
/external/chromium_org/third_party/angle/src/libEGL/ |
D | main.cpp | 46 egl::Current *current = (egl::Current*)LocalAlloc(LPTR, sizeof(egl::Current)); in DllMain() local 48 if (current) in DllMain() 50 TlsSetValue(currentTLS, current); in DllMain() 52 current->error = EGL_SUCCESS; in DllMain() 53 current->API = EGL_OPENGL_ES_API; in DllMain() 54 current->display = EGL_NO_DISPLAY; in DllMain() 55 current->drawSurface = EGL_NO_SURFACE; in DllMain() 56 current->readSurface = EGL_NO_SURFACE; in DllMain() 62 void *current = TlsGetValue(currentTLS); in DllMain() local 64 if (current) in DllMain() [all …]
|
/external/chromium_org/v8/tools/ |
D | splaytree.js | 147 var current = this.root_; 148 while (current.left) { 149 current = current.left; 151 return current; 162 var current = opt_startNode || this.root_; 163 while (current.right) { 164 current = current.right; 166 return current; 235 var current = this.root_; 237 if (key < current.key) { [all …]
|
/external/chromium-trace/trace-viewer/src/tracing/importer/v8/ |
D | splaytree.js | 130 var current = this.root_; 131 while (current.left) { 132 current = current.left; 134 return current; 145 var current = opt_startNode || this.root_; 146 while (current.right) { 147 current = current.right; 149 return current; 219 var current = this.root_; 221 if (key < current.key) { [all …]
|
/external/v8/tools/ |
D | splaytree.js | 147 var current = this.root_; 148 while (current.left) { 149 current = current.left; 151 return current; 162 var current = opt_startNode || this.root_; 163 while (current.right) { 164 current = current.right; 166 return current; 235 var current = this.root_; 237 if (key < current.key) { [all …]
|
/external/v8/benchmarks/spinning-balls/ |
D | splay-tree.js | 145 var current = opt_startNode || this.root_; 146 while (current.right) { 147 current = current.right; 149 return current; 209 var current = this.root_; 211 if (key < current.key) { 212 if (!current.left) { 215 if (key < current.left.key) { 217 var tmp = current.left; 218 current.left = tmp.right; [all …]
|
/external/chromium_org/v8/benchmarks/spinning-balls/ |
D | splay-tree.js | 145 var current = opt_startNode || this.root_; 146 while (current.right) { 147 current = current.right; 149 return current; 209 var current = this.root_; 211 if (key < current.key) { 212 if (!current.left) { 215 if (key < current.left.key) { 217 var tmp = current.left; 218 current.left = tmp.right; [all …]
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
D | v8-splay.js | 235 var current = opt_startNode || this.root_; 236 while (current.right) { 237 current = current.right; 239 return current; 299 var current = this.root_; 301 if (key < current.key) { 302 if (!current.left) { 305 if (key < current.left.key) { 307 var tmp = current.left; 308 current.left = tmp.right; [all …]
|
/external/chromium_org/v8/benchmarks/ |
D | splay.js | 240 var current = opt_startNode || this.root_; 241 while (current.right) { 242 current = current.right; 244 return current; 304 var current = this.root_; 306 if (key < current.key) { 307 if (!current.left) { 310 if (key < current.left.key) { 312 var tmp = current.left; 313 current.left = tmp.right; [all …]
|
/external/v8/benchmarks/ |
D | splay.js | 240 var current = opt_startNode || this.root_; 241 while (current.right) { 242 current = current.right; 244 return current; 304 var current = this.root_; 306 if (key < current.key) { 307 if (!current.left) { 310 if (key < current.left.key) { 312 var tmp = current.left; 313 current.left = tmp.right; [all …]
|
/external/chromium_org/third_party/skia/src/pathops/ |
D | SkPathOpsSimplify.cpp | 20 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kUnaryWinding, &firstContour, in bridgeWinding() local 22 if (!current) { in bridgeWinding() 33 if (current->activeWinding(index, endIndex)) { in bridgeWinding() 35 if (!unsortable && current->done()) { in bridgeWinding() 44 SkASSERT(unsortable || !current->done()); in bridgeWinding() 47 SkOpSegment* next = current->findNextWinding(&chaseArray, &nextStart, &nextEnd, in bridgeWinding() 51 && current->verb() != SkPath::kLine_Verb in bridgeWinding() 53 current->addCurveTo(index, endIndex, simple, true); in bridgeWinding() 60 current->debugID(), current->xyAtT(index).fX, current->xyAtT(index).fY, in bridgeWinding() 61 current->xyAtT(endIndex).fX, current->xyAtT(endIndex).fY); in bridgeWinding() [all …]
|
/external/skia/src/pathops/ |
D | SkPathOpsSimplify.cpp | 20 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kUnaryWinding, &firstContour, in bridgeWinding() local 22 if (!current) { in bridgeWinding() 33 if (current->activeWinding(index, endIndex)) { in bridgeWinding() 35 if (!unsortable && current->done()) { in bridgeWinding() 44 SkASSERT(unsortable || !current->done()); in bridgeWinding() 47 SkOpSegment* next = current->findNextWinding(&chaseArray, &nextStart, &nextEnd, in bridgeWinding() 51 && current->verb() != SkPath::kLine_Verb in bridgeWinding() 53 current->addCurveTo(index, endIndex, simple, true); in bridgeWinding() 60 current->debugID(), current->xyAtT(index).fX, current->xyAtT(index).fY, in bridgeWinding() 61 current->xyAtT(endIndex).fX, current->xyAtT(endIndex).fY); in bridgeWinding() [all …]
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
D | v8-splay.js | 283 var current = this.root_; 285 if (key < current.key) { 286 if (!current.left) { 289 if (key < current.left.key) { 291 var tmp = current.left; 292 current.left = tmp.right; 293 tmp.right = current; 294 current = tmp; 295 if (!current.left) { 300 right.left = current; [all …]
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
D | v8-splay.js | 283 var current = this.root_; 285 if (key < current.key) { 286 if (!current.left) { 289 if (key < current.left.key) { 291 var tmp = current.left; 292 current.left = tmp.right; 293 tmp.right = current; 294 current = tmp; 295 if (!current.left) { 300 right.left = current; [all …]
|
/external/ceres-solver/internal/ceres/ |
D | line_search.cc | 151 const FunctionSample& current, in InterpolatingPolynomialMinimizingStepSize() argument 154 if (!current.value_is_valid || in InterpolatingPolynomialMinimizingStepSize() 156 max_step_size <= current.x)) { in InterpolatingPolynomialMinimizingStepSize() 159 return min(max(current.x * 0.5, min_step_size), max_step_size); in InterpolatingPolynomialMinimizingStepSize() 161 CHECK_GT(max_step_size, current.x); in InterpolatingPolynomialMinimizingStepSize() 177 << ", current: " << current; in InterpolatingPolynomialMinimizingStepSize() 187 samples.push_back(ValueSample(current.x, current.value)); in InterpolatingPolynomialMinimizingStepSize() 196 samples.push_back(current); in InterpolatingPolynomialMinimizingStepSize() 237 FunctionSample current = ValueAndGradientSample(step_size_estimate, 0.0, 0.0); in Search() local 238 current.value_is_valid = false; in Search() [all …]
|
/external/chromium_org/third_party/WebKit/Source/wtf/dtoa/ |
D | double-conversion.cc | 432 const char* current = input; in StringToDouble() local 444 if (current == end) return 0.0; in StringToDouble() 459 if (*current == '+' || *current == '-') { in StringToDouble() 460 sign = (*current == '-'); in StringToDouble() 461 ++current; in StringToDouble() 462 if (current == end) return 0.0; in StringToDouble() 466 if (*current == '0') { in StringToDouble() 467 ++current; in StringToDouble() 468 if (current == end) { in StringToDouble() 469 *processed_characters_count = current - input; in StringToDouble() [all …]
|
/external/android-clat/ |
D | checksum.c | 35 uint32_t ip_checksum_add(uint32_t current, const void *data, int len) { in ip_checksum_add() argument 36 uint32_t checksum = current; in ip_checksum_add() 96 uint32_t current = 0; in ipv6_pseudo_header_checksum() local 97 current = ip_checksum_add(current, &(ip6->ip6_src), sizeof(struct in6_addr)); in ipv6_pseudo_header_checksum() 98 current = ip_checksum_add(current, &(ip6->ip6_dst), sizeof(struct in6_addr)); in ipv6_pseudo_header_checksum() 99 current = ip_checksum_add(current, &checksum_len, sizeof(checksum_len)); in ipv6_pseudo_header_checksum() 100 current = ip_checksum_add(current, &checksum_next, sizeof(checksum_next)); in ipv6_pseudo_header_checksum() 102 return current; in ipv6_pseudo_header_checksum() 116 uint32_t current = 0; in ipv4_pseudo_header_checksum() local 117 current = ip_checksum_add(current, &(ip->saddr), sizeof(uint32_t)); in ipv4_pseudo_header_checksum() [all …]
|