| /external/chromium_org/native_client_sdk/src/libraries/xray/ |
| symtable.c | 37 struct XRaySymbolPoolNode* next; member in struct:XRaySymbolPoolNode
77 sympool->current->next = new_pool;
103 n = n->next;
|
| /external/chromium_org/net/disk_cache/ |
| disk_format.h | 103 CacheAddr next; // Next entry with the same hash or bucket. member in struct:disk_cache::EntryStore
141 CacheAddr next; // LRU list. member in struct:disk_cache::RankingsNode
|
| eviction.cc | 124 Rankings::ScopedRankingsBlock next(
128 while ((header_->num_bytes > target_size || test_mode_) && next.get()) {
130 if (!next->HasData())
132 node.reset(next.release());
133 next.reset(rankings_->GetPrev(node.get(), Rankings::NO_USE));
319 Rankings::ScopedRankingsBlock next[kListsToSearch]; local
325 next[i].set_rankings(rankings_);
328 next[i].reset(rankings_->GetPrev(NULL, static_cast<Rankings::List>(i)));
329 if (!empty && NodeIsOldEnough(next[i].get(), i)) {
337 list = SelectListByLength(next);
[all...] |
| /external/chromium_org/net/disk_cache/v3/ |
| eviction_v3.cc | 123 Rankings::ScopedRankingsBlock next(
127 while ((header_->num_bytes > target_size || test_mode_) && next.get()) {
129 if (!next->HasData())
131 node.reset(next.release());
132 next.reset(rankings_->GetPrev(node.get(), Rankings::NO_USE));
302 Rankings::ScopedRankingsBlock next[kListsToSearch]; local
308 next[i].set_rankings(rankings_);
311 next[i].reset(rankings_->GetPrev(NULL, static_cast<Rankings::List>(i)));
312 if (!empty && NodeIsOldEnough(next[i].get(), i)) {
320 list = SelectListByLength(next);
[all...] |
| /external/chromium_org/net/dns/ |
| dns_response.cc | 135 const char* next = cur_ + consumed + 2 * sizeof(uint16); // QTYPE + QCLASS local
136 if (next > packet_ + length_)
139 cur_ = next;
|
| /external/chromium_org/remoting/host/win/ |
| host_service.cc | 165 std::list<RegisteredObserver>::iterator next = i; local
166 ++next;
174 i = next;
191 std::list<RegisteredObserver>::iterator j = next;
199 i = next;
|
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| SelectorQuery.cpp | 45 virtual Node* next() = 0;
54 Node* next() function in class:WebCore::SingleNodeList
74 Node* next() function in class:WebCore::ClassRootNodeList
85 for (; element; element = ElementTraversal::next(*element, &m_rootNode)) {
106 Node* next() function in class:WebCore::ClassElementList
110 m_currentElement = nextInternal(ElementTraversal::next(*m_currentElement, &m_rootNode));
117 for (; element; element = ElementTraversal::next(*element, &m_rootNode)) {
134 for (const CSSSelector* selector = selectorList.first(); selector; selector = CSSSelectorList::next(selector))
138 for (const CSSSelector* selector = selectorList.first(); selector; selector = CSSSelectorList::next(selector))
183 for (Element* element = ElementTraversal::firstWithin(rootNode); element; element = ElementTraversal::next(*element, &rootNode))
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| VisibleSelection.cpp | 169 // previous text node, or to the beginning of the next text node, each of which has a
235 return !nonBoundaryShadowTreeRootNode() && visibleStart().previous(rule).isNull() && visibleEnd().next(rule).isNull();
314 // the next one) to match TextEdit.
315 end = wordEnd.next();
321 end = end.next(CannotCrossEditingBoundary);
345 VisiblePosition next = end.next(); local
346 if (next.isNotNull())
347 end = next;
364 // of the next one) in the selection
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderCounter.cpp | 99 Element* next = skipDescendants ? ElementTraversal::nextIncludingPseudoSkippingChildren(*self, stayWithin) : ElementTraversal::nextIncludingPseudo(*self, stayWithin); local
100 while (next && !next->renderer())
101 next = skipDescendants ? ElementTraversal::nextIncludingPseudoSkippingChildren(*next, stayWithin) : ElementTraversal::nextIncludingPseudo(*next, stayWithin);
102 return next ? next->renderer() : 0;
190 // we are trying to find a place for. This is the next renderer to be checked.
206 // hence we are the next sibling of that counter if that reset is not a root o
[all...] |
| RenderLineBoxList.cpp | 132 InlineFlowBox* next; local
133 for (InlineFlowBox* curr = m_firstLineBox; curr; curr = next) {
134 next = curr->nextLineBox();
344 // the address of the first object on the next line after a BR, which we may be
|
| /external/chromium_org/third_party/WebKit/Source/core/rendering/svg/ |
| RenderSVGText.cpp | 131 static inline bool findPreviousAndNextAttributes(RenderObject* start, RenderSVGInlineText* locateElement, bool& stopAfterNext, SVGTextLayoutAttributes*& previous, SVGTextLayoutAttributes*& next)
141 next = text->layoutAttributes();
156 if (findPreviousAndNextAttributes(child, locateElement, stopAfterNext, previous, next))
183 // cache, as the next buildLayoutAttributesForTextRenderer() call rebuilds it.
206 SVGTextLayoutAttributes* next = 0; local
208 findPreviousAndNextAttributes(this, attributes->context(), stopAfterNext, previous, next);
213 if (next)
214 m_layoutAttributesBuilder.buildLayoutAttributesForTextRenderer(next->context());
263 SVGTextLayoutAttributes* next = 0; local
265 findPreviousAndNextAttributes(this, text, stopAfterNext, previous, next);
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XPathParser.cpp | 163 // Returns next char if it's there and interesting, 0 otherwise
168 UChar next = m_data[m_nextPos + 1];
169 if (next >= 0xff)
171 return next;
178 UChar next = m_data[m_nextPos];
179 if (next >= 0xff)
181 return next;
250 // If the next character is :, what we just got it the prefix, if not,
284 char next = peekAheadHelper(); local
285 if (next == '.'
[all...] |
| /external/chromium_org/third_party/WebKit/Source/platform/fonts/ |
| Font.cpp | 452 UChar next = characters[++i]; local
453 if (!U16_IS_TRAIL(next))
456 UChar32 supplementaryCharacter = U16_GET_SUPPLEMENTARY(c, next);
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| PartitionAlloc.h | 163 PartitionFreelistEntry* next; member in struct:WTF::PartitionFreelistEntry
174 // free and full pages may briefly be present in the list until we next do a
206 // next extent (if there is one) at the very start of a superpage's metadata
211 PartitionSuperPageExtentEntry* next; member in struct:WTF::PartitionSuperPageExtentEntry
404 PartitionSuperPageExtentEntry* entry = root->firstExtent.next;
408 entry = entry->next;
440 PartitionFreelistEntry* newHead = partitionFreelistMask(static_cast<PartitionFreelistEntry*>(ret)->next);
491 ASSERT(!partitionPageFreelistHead(page) || ptr != partitionFreelistMask(partitionPageFreelistHead(page)->next)); // Look for double free one level deeper in debug.
493 entry->next = partitionFreelistMask(partitionPageFreelistHead(page));
|
| /external/chromium_org/third_party/freetype/include/freetype/ |
| fttypes.h | 543 FT_ListNode next; member in struct:FT_ListNodeRec_
[all...] |
| /external/chromium_org/third_party/freetype/src/pfr/ |
| pfrload.c | 590 item->next = NULL;
592 phy_font->kern_items_tail = &item->next;
693 PFR_KernItem item, next; local
699 next = item->next;
701 item = next;
|
| /external/chromium_org/third_party/harfbuzz-ng/src/ |
| hb-common.cc | 216 struct hb_language_item_t *next; member in struct:hb_language_item_t
243 hb_language_item_t *next = langs->next; local
246 langs = next;
256 for (hb_language_item_t *lang = first_lang; lang; lang = lang->next)
264 lang->next = first_lang;
|
| hb-graphite2.cc | 49 struct hb_graphite2_tablelist_t *next; member in struct:hb_graphite2_tablelist_t
67 for (hb_graphite2_tablelist_t *p = tlist; p; p = p->next)
87 p->next = face_data->tlist;
134 tlist = tlist->next;
|
| /external/chromium_org/third_party/icu/source/common/ |
| caniter.cpp | 126 *@return the next string that is canonically equivalent. The value null is returned when
129 UnicodeString CanonicalIterator::next() { function in class:CanonicalIterator
147 // find next value for next time
366 //String item = (String) it.next();
377 //String possible = (String) it2.next();
453 while (iter.next()) {
|
| umutex.c | 177 ICUMutex *next; /* All ICUMutexes are chained into a list so that */ member in struct:ICUMutex
204 * Linked list is through ICUMutex::next
302 m->next = NULL; /* List of mutexes is maintained at a higher level. */
364 m->next = mutexListHead;
403 mutexListHead = m->next;
406 for (prev = mutexListHead; prev!=NULL && prev->next!=m; prev = prev->next);
409 prev->next = m->next;
608 nextMutex = thisMutex->next;
[all...] |
| /external/chromium_org/third_party/icu/source/i18n/ |
| anytrans.cpp | 73 * The code of the current run, valid after next() returns. May
80 * The start of the run, inclusive, valid after next() returns.
85 * The end of the run, exclusive, valid after next() returns.
100 UBool next();
122 UBool ScriptRunIterator::next() { function in class:ScriptRunIterator
235 while (it.next()) {
|
| /external/chromium_org/third_party/icu/source/test/thaitest/ |
| thaitest.cpp | 46 // return next break position
47 int32_t next();
232 nextSpaceBreak = spaceIter.next();
233 nextBreak = breakIter->next();
250 nextSpaceBreak = spaceIter.next();
254 nextBreak = breakIter->next();
412 int32_t nextbreak = breakIter->next();
522 * Return the next break, counting words and spaces.
524 int32_t SpaceBreakIterator::next() function in class:SpaceBreakIterator
532 nextBreak = fBreakIter->next();
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/util/ |
| cache.cc | 29 LRUHandle* next; member in struct:leveldb::__anon11714::LRUHandle
40 if (next == this) {
118 LRUHandle* next = h->next_hash; local
123 h = next;
164 // lru.prev is newest entry, lru.next is oldest entry.
173 lru_.next = &lru_;
178 for (LRUHandle* e = lru_.next; e != &lru_; ) {
179 LRUHandle* next = e->next; local
182 e = next;
[all...] |
| /external/chromium_org/third_party/libevent/ |
| evhttp.h | 190 TAILQ_ENTRY(evhttp_request) next; member in struct:evhttp_request
195 } next;
|
| evrpc.h | 75 TAILQ_ENTRY(evrpc) next; member in struct:evrpc
341 TAILQ_ENTRY(evrpc_request_wrapper) next; member in struct:evrpc_request_wrapper
|
