/external/webkit/Source/JavaScriptCore/parser/ |
H A D | ParserArena.cpp | 74 ParserArenaRefCounted* ParserArena::last() const function in class:JSC::ParserArena 76 return m_refCountedObjects.last().get();
|
/external/webkit/Source/WebCore/platform/text/ |
H A D | TextBoundaries.cpp | 54 int last = i; local 58 return last;
|
/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
H A D | ContextNodeList.java | 122 * Get the index of the last node in this list. 125 * @return the index of the last node in this list. 130 * Set the index of the last node in this list. 133 * @param last the index of the last node in this list. 135 public void setLast(int last); argument
|
/external/chromium/third_party/libevent/ |
H A D | min_heap.h | 89 struct event *last = s->p[--s->n]; local 91 /* we replace e with the last element in the heap. We might need to 96 if (e->min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], last)) 97 min_heap_shift_up_(s, e->min_heap_idx, last); 99 min_heap_shift_down_(s, e->min_heap_idx, last);
|
/external/dhcpcd/ |
H A D | control.c | 55 struct fd_list *l, *last = NULL; local 61 if (last == NULL) 64 last->next = l->next; 68 last = l;
|
/external/e2fsprogs/lib/blkid/ |
H A D | list.h | 134 struct list_head *last = list->prev; local 140 last->next = at; 141 at->prev = last;
|
/external/e2fsprogs/lib/ext2fs/ |
H A D | kernel-list.h | 95 struct list_head *last = list->prev; local 101 last->next = at; 102 at->prev = last;
|
H A D | res_gdt.c | 126 unsigned int grp, last = 0; local 170 if (!gdt_buf[last]) { 173 expect, grp, gdt_blk, last); 175 gdt_buf[last] = expect; 178 } else if (gdt_buf[last] != expect) { 181 gdt_buf[last], expect, gdt_blk, last); 186 last++;
|
/external/e2fsprogs/misc/ |
H A D | findsuper.c | 80 * has the last time e2fsck or tune2fs wrote to the filesystem. 119 time_t tm, last = time(0); local 198 diff = now - last; 211 last = now;
|
/external/freetype/src/cache/ |
H A D | ftcmru.c | 37 FTC_MruNode last = first->prev; local 59 last->next = node; 61 node->prev = last; 83 FTC_MruNode prev, next, last; local 108 last = first->prev; 110 last->next = node; 114 node->prev = last;
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | ForwardingSortedSet.java | 81 public E last() { method in class:ForwardingSortedSet 82 return delegate().last();
|
/external/libffi/testsuite/libffi.call/ |
H A D | pyobjc-tc.c | 25 int doit(int o, char* s, Point p, Rect r, int last) argument 28 o, s, p.x, p.y, r.o.x, r.o.y, r.s.h, r.s.w, last);
|
/external/oprofile/libpp/ |
H A D | profile.cpp | 172 ordered_samples_t::const_iterator last = local 176 const_iterator(last, start_offset)); 183 ordered_samples_t::const_iterator last = ordered_samples.end(); local 186 const_iterator(last, start_offset));
|
/external/oprofile/libutil/ |
H A D | op_list.h | 135 struct list_head * last = list->prev; local 141 last->next = at; 142 at->prev = last;
|
/external/qemu/distrib/zlib-1.2.3/ |
H A D | inffast.c | 73 unsigned char FAR *last; /* while in < last, enough input available */ local 100 last = in + (strm->avail_in - 5); 285 } while (in < last && out < end); 296 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
|
/external/regex-re2/util/ |
H A D | stringpiece.cc | 22 // Test last byte in case strings share large common prefix 65 const char* last = ptr_ + min(ulen - s.length_, pos) + s.length_; local 66 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_); 67 return result != last ? result - ptr_ : npos;
|
/external/webkit/Source/WebCore/bindings/gobject/ |
H A D | DOMObjectCache.cpp | 83 Vector<DOMObjectCacheData*>::iterator last = toUnref.end(); local 84 for (Vector<DOMObjectCacheData*>::iterator it = toUnref.begin(); it != last; ++it) { 97 // If this is the last unref we are going to do,
|
/external/webkit/Source/WebKit2/UIProcess/ |
H A D | WebBackForwardList.cpp | 75 m_page->backForwardRemovedItem(m_entries.last()->itemID()); 76 removedItems.append(m_entries.last().release()); 204 unsigned last = m_current + size; local 205 ASSERT(last < m_entries.size()); 206 for (unsigned i = m_current + 1; i <= last; ++i)
|
/external/zlib/contrib/masmx64/ |
H A D | inffas8664.c | 87 /* 24 12 */ unsigned char FAR *last; /* r9 while in < last */
member in struct:inffast_ar 128 ar.last = ar.in + (strm->avail_in - PAD_AVAIL_IN);
175 strm->avail_in = (unsigned)(ar.in < ar.last ?
176 PAD_AVAIL_IN + (ar.last - ar.in) :
177 PAD_AVAIL_IN - (ar.in - ar.last));
|
/external/zlib/ |
H A D | inffast.c | 73 unsigned char FAR *last; /* while in < last, enough input available */ local 100 last = in + (strm->avail_in - 5); 307 } while (in < last && out < end); 318 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
|
/external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
H A D | AttributedStringTest.java | 111 public char last() { method in class:AttributedStringTest.testAttributedCharacterIterator
|
/external/apache-xml/src/main/java/org/apache/xml/serializer/ |
H A D | EncodingInfo.java | 343 private EncodingImpl(String encoding, int first, int last, int codePoint) { argument 347 m_last = last;
|
/external/blktrace/btt/ |
H A D | list.h | 195 struct list_head *last = list->prev; local 201 last->next = at; 202 at->prev = last;
|
/external/bluetooth/glib/gio/ |
H A D | gpollfilemonitor.c | 93 calc_event_type (GFileInfo *last, argument 96 if (last == NULL && new == NULL) 99 if (last == NULL && new != NULL) 102 if (last != NULL && new == NULL) 105 if (safe_strcmp (g_file_info_get_etag (last), 109 if (g_file_info_get_size (last) !=
|
/external/chromium/base/memory/ |
H A D | linked_ptr.h | 6 // particular object is kept on a circular linked list. When the last pointer 9 // Used properly, this deletes the object when the last reference goes away. 64 // last member of the circle. Once this is done, you can join() another. 121 bool last = link_.depart(); local 122 CHECK(last);
|