Searched refs:last (Results 76 - 100 of 742) sorted by relevance

1234567891011>>

/external/webkit/Source/WebCore/bindings/v8/
H A DIntrusiveDOMWrapperMap.h79 Chunk* last = m_chunks; local
81 Chunk* previous = last->m_previous;
84 delete last;
86 last = previous;
89 m_chunks = last;
111 static void clearEntries(T* first, T* last) argument
113 for (T* entry = first; entry < last; entry++)
117 static void visitEntries(DOMDataStore* store, T* first, T* last, typename Traits::Visitor* visitor) argument
119 for (T* entry = first; entry < last; entry++)
/external/stlport/test/eh/
H A Dtest_insert.h96 key_iterator last = EH_STD::unique( keys.begin(), keys.end() ); local
99 for ( key_iterator tmp = keys.begin(); tmp != last; ++tmp )
452 Iter first, Iter last, sequence_container_tag )
457 c_inst.insert( pos, first, last );
462 Iter first, Iter last, associative_container_tag )
464 c.insert( first, last );
468 void do_insert_range( C& c, Position, Iter first, Iter last, multiset_tag ) argument
470 c.insert( first, last );
474 void do_insert_range( C& c, Position, Iter first, Iter last, multimap_tag ) argument
476 c.insert( first, last );
451 do_insert_range( C& c_inst, Position offset, Iter first, Iter last, sequence_container_tag ) argument
461 do_insert_range( C& c, Position, Iter first, Iter last, associative_container_tag ) argument
480 do_insert_range( C& c, Position, Iter first, Iter last, set_tag ) argument
486 do_insert_range( C& c, Position, Iter first, Iter last, map_tag ) argument
499 test_insert_range( const C& orig, Iter first, Iter last, int pos=-1 ) argument
[all...]
/external/e2fsprogs/lib/blkid/
H A Ddevname.c404 int which = 0, last = 0; local
428 last = which;
466 * If last was a whole disk and we just found a partition
470 if (lens[last] && !strncmp(ptnames[last], ptname, lens[last])) {
477 if (tmp->bid_devno == devs[last]) {
486 lens[last] = 0;
489 * If last was not checked because it looked like a whole-disk
491 * check last a
[all...]
/external/zlib/contrib/infback9/
H A Dinfback9.c230 int lastblock; /* true if processing last block */
246 code last; /* parent table entry */ local
274 /* Inflate until end of block marked as last */
290 lastblock ? " (last)" : ""));
299 lastblock ? " (last)" : ""));
304 lastblock ? " (last)" : ""));
477 last = here;
479 here = lencode[last.val +
480 (BITS(last.bits + last
[all...]
/external/valgrind/main/drd/
H A Ddrd_thread.c190 tl_assert(DRD_(g_threadinfo)[i].last == 0);
250 if (p->next == 0 && p != ti->last)
253 for (p = ti->last; p; p = p->prev) {
287 tl_assert(DRD_(g_threadinfo)[created].last == 0);
461 for (sg = DRD_(g_threadinfo)[tid].last; sg; sg = sg_prev)
475 DRD_(g_threadinfo)[tid].last = 0;
481 * Called after a thread performed its last memory access and before
710 sg->prev = DRD_(g_threadinfo)[tid].last;
712 if (DRD_(g_threadinfo)[tid].last)
713 DRD_(g_threadinfo)[tid].last
[all...]
/external/webkit/Source/WebKit/android/jni/
H A DPictureSet.cpp207 BucketPicture* last = bucket->end(); local
208 for (BucketPicture* current = first; current != last; current++) {
240 BucketPicture* last = bucket->end(); local
249 for (BucketPicture* current = first; current != last; current++) {
289 last = bucket->end();
292 if (last - first > MAX_ADDITIONAL_PICTURES) {
299 for (BucketPicture* current = first; current != last; current++) {
315 for (BucketPicture* current = first; current != last; current++) {
325 for (BucketPicture* current = first; current != last; current++) {
335 last
458 Pictures* last = mPictures.end(); local
596 Pictures* last = mPictures.end(); local
676 BucketPicture* last = bucket->end(); local
686 Pictures* last = mPictures.end(); local
831 const Pictures* last = mPictures.end(); local
992 BucketPicture* last = sourceBucket->end(); local
1007 const Pictures* last = src.mPictures.end(); local
1097 const Pictures* last = mPictures.end(); local
[all...]
/external/valgrind/main/callgrind/
H A Ddump.c262 Context* last; local
272 last = 0;
283 last = cxt->fn[i-1]->pure_cxt;
285 /* If the last context was the context to print, we are finished */
286 if ((last == cxt) && (rec_index == 0)) return;
332 * the <last> position, update <last>
335 static Bool print_fn_pos(int fd, FnPos* last, BBCC* bbcc) argument
345 if (last->rec_index != bbcc->rec_index) {
348 last
520 fprint_apos(Int fd, AddrPos* curr, AddrPos* last, file_node* func_file) argument
555 fprint_pos(Int fd, AddrPos* curr, AddrPos* last) argument
631 fprint_fcost(Int fd, AddrCost* c, AddrPos* last) argument
651 fprint_jcc(Int fd, jCC* jcc, AddrPos* curr, AddrPos* last, ULong ecounter) argument
777 fprint_bbcc(Int fd, BBCC* bbcc, AddrPos* last) argument
[all...]
/external/srec/portable/src/
H A Dpmemory.c84 * Pointer to last memory allocation associated with the same tag.
86 struct MemoryData_t* last; member in struct:MemoryData_t
110 MemoryData* last; member in struct:MemMapEntry_t
191 gMemoryMap[idx].last = NULL;
418 if (e->last != NULL && e->last == data)
419 e->last = data->last;
420 if (data->last != NULL)
421 data->last
[all...]
/external/libxml2/
H A Dnanohttp.c147 int last; /* return code for last operation */ member in struct:xmlNanoHTTPCtxt
513 ctxt->last = -1;
539 ctxt->last = -1;
546 ctxt->last = recv(ctxt->fd, ctxt->inptr, XML_NANO_HTTP_CHUNK, 0);
547 if (ctxt->last > 0) {
548 ctxt->inptr += ctxt->last;
549 return(ctxt->last);
551 if (ctxt->last == 0) {
554 if (ctxt->last
690 const xmlChar *charset, *last, *mime; local
716 const xmlChar *charset, *last, *mime; local
[all...]
/external/e2fsprogs/lib/uuid/
H A Dgen_uuid.c309 THREAD_LOCAL struct timeval last = {0, 0}; local
354 last.tv_sec = tv1;
355 last.tv_usec = tv2;
360 if ((last.tv_sec == 0) && (last.tv_usec == 0)) {
363 gettimeofday(&last, 0);
364 last.tv_sec--;
369 if ((tv.tv_sec < last.tv_sec) ||
370 ((tv.tv_sec == last.tv_sec) &&
371 (tv.tv_usec < last
[all...]
/external/qemu/distrib/zlib-1.2.3/
H A Dinfback.c257 code last; /* parent table entry */ local
271 state->last = 0;
280 /* Inflate until end of block marked as last */
285 if (state->last) {
291 state->last = BITS(1);
296 state->last ? " (last)" : ""));
302 state->last ? " (last)" : ""));
307 state->last
[all...]
/external/zlib/
H A Dinfback.c257 code last; /* parent table entry */ local
271 state->last = 0;
280 /* Inflate until end of block marked as last */
285 if (state->last) {
291 state->last = BITS(1);
296 state->last ? " (last)" : ""));
302 state->last ? " (last)" : ""));
307 state->last
[all...]
/external/e2fsprogs/lib/ext2fs/
H A Dres_gdt.c126 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/oprofile/daemon/
H A Dopd_trans.h44 struct sfile * last; member in struct:transient
67 trans->last = trans->current;
/external/pcre/
H A Dpcre_get.c111 lastptr where to put the pointer to the last entry
145 uschar *last = entry; local
151 while (last < lastentry)
153 if (strcmp(stringname, (char *)(last + entrysize + 2)) != 0) break;
154 last += entrysize;
157 *lastptr = (char *)last;
181 or the number of the last one if none are set,
190 char *first, *last; local
194 entrysize = pcre_get_stringtable_entries(code, stringname, &first, &last);
196 for (entry = (uschar *)first; entry <= (uschar *)last; entr
[all...]
/external/v8/src/
H A Dliveobjectlist-inl.h64 if (last()) DoProcessNonLive(obj);
96 LiveObjectList *lol = last();
/external/valgrind/main/include/
H A Dpub_tool_xarray.h80 index of the first, and *last to be the index of the last matching
82 False, and don't change *first or *last. Bomb if the array is not
85 /*OUT*/Word* first, /*OUT*/Word* last );
96 /*OUT*/Word* first, /*OUT*/Word* last,
111 /* Drop the last n elements of an XArray. Bombs if there are less
/external/webkit/Source/JavaScriptCore/parser/
H A DParserArena.cpp74 ParserArenaRefCounted* ParserArena::last() const function in class:JSC::ParserArena
76 return m_refCountedObjects.last().get();
/external/webkit/Source/WebCore/platform/graphics/cairo/
H A DPlatformContextCairo.cpp40 const ImageMaskInformation& maskInformation = m_maskImageStack.last();
63 m_maskImageStack.last().update(surface, rect);
/external/webkit/Source/WebCore/platform/text/
H A DTextBoundaries.cpp54 int last = i; local
58 return last;
/external/llvm/include/llvm/ADT/
H A Dilist.h118 ilist_iterator<NodeTy> /*last*/) {}
307 /// of the first node in the list always points to the last node in the list,
470 // [first, last) into position.
472 void transfer(iterator position, iplist &L2, iterator first, iterator last) { argument
473 assert(first != last && "Should be checked by callers");
475 if (position != last) {
483 // Remove [first, last) from its old position.
485 NodeTy *Next = last.getNodePtrUnchecked(), *Last = this->getPrev(Next);
492 // Splice [first, last) into its new position.
526 iterator erase(iterator first, iterator last) { argument
547 insert(iterator where, InIt first, InIt last) argument
557 iterator last = first; ++last; local
561 splice(iterator where, iplist &L2, iterator first, iterator last) argument
636 ilist(InIt first, InIt last) argument
656 insert(iterator where, InIt first, InIt last) argument
[all...]
/external/llvm/lib/CodeGen/
H A DScoreboardHazardRecognizer.cpp87 unsigned last = Depth - 1; local
88 while ((last > 0) && ((*this)[last] == 0))
89 last--;
91 for (unsigned i = 0; i <= last; i++) {
/external/skia/src/core/
H A DSkTSearch.cpp147 static void SkQSort_Partition(char* first, char* last, size_t elemSize, SkQSortCompareProc compare) argument
150 char* rite = last;
155 while (left < last && compare(left, pivot) < 0)
172 if (left < last)
173 SkQSort_Partition(left, last, elemSize, compare);
/external/zlib/contrib/masmx64/
H A Dinffas8664.c87 /* 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/webkit/Tools/android/flex-2.5.4a/
H A Dnfa.c153 int last = lastst[mach]; local
155 for ( i = firstst[mach]; i <= last; ++i )
281 * new = link_machines( first, last );
283 * new - a machine constructed by connecting first to last
284 * first - the machine whose successor is to be last
285 * last - the machine whose predecessor is to be first
288 * last to produce a machine new which will pattern-match first first
289 * and then last, and will fail if either of the sub-patterns fails.
290 * FIRST is set to new by the operation. last is unmolested.
293 int link_machines( first, last )
[all...]

Completed in 801 milliseconds

1234567891011>>