HomeSort by relevance Sort by last modified time
    Searched defs:next (Results 901 - 925 of 3921) sorted by null

<<31323334353637383940>>

  /external/chromium_org/third_party/WebKit/Tools/gdb/
webkit.py 254 def next(self): member in class:WTFVectorPrinter.Iterator
  /external/chromium_org/third_party/freetype/src/cache/
ftccache.c 364 FTC_Node *pnode = cache->buckets + i, next, node = *pnode; local
369 next = node->link;
379 node = next;
  /external/chromium_org/third_party/freetype/src/sfnt/
ttkern.c 199 FT_Byte* next = base; local
209 next = base + length;
211 if ( next > p_limit ) /* handle broken table */
212 next = p_limit;
217 if ( p + 8 > next )
223 if ( ( next - p ) < 6 * (int)num_pairs ) /* handle broken count */
224 num_pairs = (FT_UInt)( ( next - p ) / 6 );
298 p = next;
  /external/chromium_org/third_party/harfbuzz-ng/src/
hb-face.cc 233 hb_face_t::plan_node_t *next = node->next; local
236 node = next;
  /external/chromium_org/third_party/icu/source/common/
normlzr.cpp 258 * Return the next character in the normalized text and advance
262 UChar32 Normalizer::next() { function in class:Normalizer
305 return next();
326 * {@link #next} and {@link #previous} iterate through characters in the
328 * correspondence between characters returned by <tt>next</tt> and
uchriter.cpp 150 UCharCharacterIterator::next() { function in class:UCharCharacterIterator
ulist.c 17 UListNode *next; member in struct:UListNode
62 newItem->next = NULL;
87 newItem->next = NULL;
89 list->tail->next = newItem;
115 newItem->next = list->head;
139 pointer = pointer->next;
154 list->curr = curr->next;
183 listPointer = listHead->next;
ustrenum.cpp 42 StringEnumeration::next(int32_t *resultLength, UErrorCode &status) { function in class:StringEnumeration
201 return THIS(en)->next(resultLength, *ec);
  /external/chromium_org/third_party/icu/source/common/unicode/
uiter.h 147 * Check if current() and next() can still
151 * @return boolean value for whether current() and next() can still return another code unit
189 * Function type declaration for UCharIterator.next().
325 * The current() and next() functions only check the current index against the
402 * (public) Check if current() and next() can still
435 UCharIteratorNext *next; member in struct:UCharIterator
497 * Helper function for UCharIterator to get the next code point.
  /external/chromium_org/third_party/icu/source/i18n/
search.cpp 236 int32_t SearchIterator::next(UErrorCode &status) function in class:SearchIterator
262 // the next call to next will set the offset.
299 // setOffset has been called or that next ran off the text
  /external/chromium_org/third_party/icu/source/i18n/unicode/
smpdtfmt.h 1103 NSOverride *next; member in struct:SimpleDateFormat::NSOverride
    [all...]
  /external/chromium_org/third_party/icu/source/test/intltest/
canittst.cpp 157 //UnicodeString *result = new UnicodeString(it.next());
158 UnicodeString result(it.next());
195 UnicodeString item = it.next();
271 //String item = (String) it.next();
294 result.append(it.next().toString());
320 UnicodeString next = can.next(); local
321 logln("CanonicalIterator::next returned "+next);
325 UnicodeString afterReset = can.next();
    [all...]
  /external/chromium_org/third_party/icu/source/tools/pkgdata/
pkgtypes.h 31 struct _CharList *next; member in struct:_CharList
  /external/chromium_org/third_party/jinja2/
_compat.py 69 cls.next = cls.__next__
78 get_next = lambda x: x.next
86 next = next variable
88 def next(it): function
89 return it.next()
  /external/chromium_org/third_party/leveldatabase/src/db/
skiplist.h 19 // (2) The contents of a Node except for the next/prev pointers are
25 // ... prev vs. next pointer ordering ...
69 // Advances to the next position.
71 void Next();
151 Node* Next(int n) {
205 inline void SkipList<Key,Comparator>::Iterator::Next() {
207 node_ = node_->Next(0);
228 node_ = list_->head_->Next(0);
244 while (height < kMaxHeight && ((rnd_.Next() % kBranching) == 0)) {
264 Node* next = x->Next(level) local
287 Node* next = x->Next(level); local
307 Node* next = x->Next(level); local
    [all...]
  /external/chromium_org/third_party/libjingle/source/talk/base/
autodetectproxy.cc 73 Next();
103 int next = next_; local
135 LOG(LS_SENSITIVE) << agent << " " << next << " " << type << " "
163 void AutoDetectProxy::Next() {
290 Next();
296 Next();
  /external/chromium_org/third_party/libva/va/x11/
va_dricommon.h 13 * next paragraph) shall be included in all copies or substantial portions
69 struct dri_drawable *next; member in struct:dri_drawable
  /external/chromium_org/third_party/libxml/src/include/libxml/
entities.h 45 struct _xmlNode *next; /* next sibling link */ member in struct:_xmlEntity
  /external/chromium_org/third_party/libxslt/libxslt/
attrvt.c 39 struct _xsltAttrVT *next; /* next xsltAttrVT */ member in struct:_xsltAttrVT
78 cur->next = style->attVTs;
126 xsltAttrVTPtr cur = (xsltAttrVTPtr) avt, next; local
129 next = cur->next;
131 cur = next;
137 * @ val: the value to be set to the next available segment
182 (attr->children->next != NULL)) {
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/
lp_bld_flow.c 15 * next paragraph) shall be included in all copies or substantial portions
46 * performance reasons, as frequently run blocks should be laid out next to
67 /* insert the new block before the next block */
246 LLVMValueRef next; local
253 next = LLVMBuildAdd(builder, state->counter, step, "");
255 LLVMBuildStore(builder, next, state->counter_var);
257 cond = LLVMBuildICmp(builder, llvm_cond, next, end, "");
324 LLVMValueRef next, cond; local
327 next = LLVMBuildAdd(builder, state->counter, state->step, "");
328 LLVMBuildStore(builder, next, state->counter_var)
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/pipebuffer/
pb_bufmgr_cache.c 15 * next paragraph) shall be included in all copies or substantial portions
127 struct list_head *curr, *next; local
133 curr = mgr->delayed.next;
134 next = curr->next;
143 curr = next;
144 next = curr->next;
267 struct list_head *curr, *next; local
274 curr = mgr->delayed.next;
360 struct list_head *curr, *next; local
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
u_cache.c 15 * next paragraph) shall be included in all copies or substantial portions
53 struct util_cache_entry *next; member in struct:util_cache_entry
338 struct util_cache_entry *header = cache->lru.next;
344 header = header->next;
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
lp_scene.c 15 * next paragraph) shall be included in all copies or substantial portions
45 struct resource_ref *next; member in struct:resource_ref
79 assert(scene->data.head->next == NULL);
128 bin->tail->next = NULL;
223 for (ref = scene->resources; ref; ref = ref->next) {
248 for (block = list->head->next; block; block = tmp) {
249 tmp = block->next;
253 list->head->next = NULL;
281 bin->tail->next = block;
289 block->next = NULL
    [all...]
lp_texture.h 15 * next paragraph) shall be included in all copies or substantial portions
125 struct llvmpipe_resource *prev, *next; member in struct:llvmpipe_resource
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r600/
compute_memory_pool.c 9 * The above copyright notice and this permission notice (including the next
136 for (item = pool->item_list; item; item = item->next) {
166 for (item = pool->item_list; item; item = item->next) {
167 if (item->next) {
169 && item->next->start_in_dw > start_in_dw) {
239 chunk.prev = chunk.next = NULL;
251 struct compute_memory_item *item, *next; local
258 for (item = pool->item_list; item; item = item->next) {
259 COMPUTE_DBG("list: %i %p\n", item->start_in_dw, item->next);
262 for (item = pool->item_list; item; item = next) {
353 struct compute_memory_item *item, *next; local
    [all...]

Completed in 690 milliseconds

<<31323334353637383940>>