Searched defs:last (Results 201 - 225 of 400) sorted by relevance

1234567891011>>

/external/bluetooth/glib/tests/
H A Dqueue-test.c17 GList *last; local
32 last = NULL;
36 last = list;
40 g_assert (last == queue->tail);
43 last = NULL;
47 last = list;
51 g_assert (last == queue->head);
/external/chromium/chrome/browser/chromeos/
H A Dboot_times_loader.cc260 base::Time last = login_times.back().time(); local
261 base::TimeDelta total = last - first;
/external/dropbear/
H A Dloginrec.c39 (utmp and friends) and last login time retrieval.
70 Retrieving the time of last login ('lastlog') is in some ways even
76 we look backwards in the wtmp or wtmpx file for the last login entry
109 getlast_entry(), which tries one of three methods to find the last
432 * form of the line (Just use the last <dstsize> characters of the
1014 /* Seek to the start of the last struct utmp */
1170 /* Seek to the start of the last struct utmpx */
1284 lastlog_construct(struct logininfo *li, struct lastlog *last) argument
1287 memset(last, '\0', sizeof(*last));
1361 struct lastlog last; local
[all...]
/external/elfutils/src/
H A Dld.c230 /* The last file we processed. */
366 /* Process the last file. */
419 struct scninfo *runp = h->last;
429 while ((runp = runp->next) != h->last);
777 pointer in the record for the last object of the group. If
979 struct file_list *last = input_file_list; local
981 last->next = NULL;
1151 runp = h->last;
1170 while (runp != h->last);
/external/freetype/src/autofit/
H A Dafhints.c828 AF_Point point, first, last; local
835 last = seg->last;
842 if ( point == last )
854 AF_Point point, first, last; local
861 last = seg->last;
868 if ( point == last )
949 /* is the point after the last edge? */
1241 else /* interpolate the last par
[all...]
H A Dafhints.h286 AF_Point last; /* last point in edge segment */ member in struct:AF_SegmentRec_
308 AF_Segment last; /* last segment in edge */ member in struct:AF_EdgeRec_
/external/freetype/src/base/
H A Dftoutln.c84 FT_Int last; /* index of last point in contour */ local
89 last = outline->contours[n];
90 if ( last < 0 )
92 limit = outline->points + last;
98 v_last = outline->points[last];
116 if ( FT_CURVE_TAG( outline->tags[last] ) == FT_CURVE_TAG_ON )
118 /* start at last point if it is on the curve */
124 /* if both first and last points are conic, */
278 first = last
538 FT_Int first, last; local
918 int last = outline->contours[c]; local
987 FT_Vector* last; local
[all...]
/external/fsck_msdos/
H A Ddir.c447 int last; local
461 last = boot->RootDirEnts * 32;
464 last = boot->SecPerClust * boot->BytesPerSec;
469 buf = malloc(last);
479 if (read(f, buf, last) != last) {
483 last /= 32;
529 int i, j, k, last; local
553 last = boot->RootDirEnts * 32;
556 last
[all...]
/external/guava/src/com/google/common/collect/
H A DSynchronized.java339 public E last() { method in class:Synchronized.SynchronizedSortedSet
341 return delegate().last();
/external/icu4c/i18n/
H A Dbmsearch.cpp70 void setLast(int32_t last);
302 void Target::setLast(int32_t last) argument
310 ceb[0].lowOffset = last;
311 ceb[0].highOffset = last;
313 ucol_setOffset(elements, last, &status);
498 // (i > start) means we're inside the last suffix match we found
502 // so if any suffix match at that character doesn't extend beyond the last match,
H A Ducol_tok.h51 UColToken* last; member in struct:__anon4810
132 uint32_t lastStarredCharIndex; /* Index to the last character in the starred expression. */
137 UChar32 lastRangeCp; /* The last code point in the range. */
/external/icu4c/test/intltest/
H A Dcitrtest.cpp67 virtual UChar last(){return DONE;}; function in class:SCharacterIterator
424 c = iter.last();
522 c = iter.last();
1097 virtual UChar last() { function in class:SubCharIter
/external/icu4c/tools/gencase/
H A Dstore.c438 addCaseSensitive(UChar32 first, UChar32 last) { argument
440 upvec_setValue(pv, first, last, 0, UCASE_SENSITIVE, UCASE_SENSITIVE, &errorCode);
957 /* lengths of full case mapping strings, stored in the last slot */
/external/kernel-headers/original/linux/
H A Dlist.h268 * list_is_last - tests whether @list is the last entry in list @head
310 struct list_head *last = list->prev; local
316 last->next = at;
317 at->prev = last;
/external/llvm/lib/CodeGen/
H A DMachineBasicBlock.cpp124 MachineBasicBlock::iterator last) {
133 for (; first != last; ++first)
474 // If we couldn't analyze the branch, examine the last instruction.
122 transferNodesFromList(ilist_traits<MachineInstr> &fromList, MachineBasicBlock::iterator first, MachineBasicBlock::iterator last) argument
/external/opencv/cv/src/
H A Dcvsegmentation.cpp59 CvWSNode* last; member in struct:CvWSQueue
124 if( q[idx].last ) \
125 q[idx].last->next=node; \
128 q[idx].last = node; \
136 q[idx].last = 0; \
/external/opencv/cxcore/src/
H A Dcxswitcher.cpp349 CvModuleInfo *CvModule::first = 0, *CvModule::last = 0; member in class:CvModule
354 info = last;
368 if( last == info )
369 last = p;
519 CvModule::last->next = module_copy;
520 CvModule::last = module_copy; member in class:CvModule
522 if( CvModule::first == CvModule::last )
/external/openssl/crypto/des/
H A Ddes.c370 int num=0,j,k,l,rem,ll,len,last,ex=0; local
622 last=obuf[l-1];
624 if ((last > 7) || (last < 0))
629 last=0;
631 l=l-8+last;
/external/oprofile/daemon/
H A Dopd_ibs.c753 struct sfile * last = trans->last; local
780 hash = last->hashval & (CG_HASH_SIZE - 1);
783 * 'last', we use its hash.
787 if (sfile_equal(last, &cg->to)) {
794 sfile_dup(&cg->to, last);
800 opd_open_sample_file(file, last, sf, counter, is_cg);
/external/oprofile/gui/
H A Doprof_start.cpp404 static time_t last = time(0); local
424 if (curr - last)
425 ss << " (" << dstat.nr_interrupts / (curr - last) << " interrupts / second, total " << total_nr_interrupts << ")";
429 last = curr;
519 // The deal is simple: QT lack of a way to know what item was the last
1042 "reset your last profile session ?", "Yes", "No", 0, 0, 1);
/external/qemu/block/
H A Dqcow2-refcount.c462 int64_t start, last, cluster_offset; local
479 last = (offset + length - 1) & ~(s->cluster_size - 1);
480 for(cluster_offset = start; cluster_offset <= last;
535 /* Write last changed block to disk */
730 int64_t start, last, cluster_offset; local
734 last = (offset + size - 1) & ~(s->cluster_size - 1);
735 for(cluster_offset = start; cluster_offset <= last;
896 int64_t start, last, cluster_offset; local
903 last = (offset + size - 1) & ~(s->cluster_size - 1);
904 for(cluster_offset = start; cluster_offset <= last;
[all...]
/external/skia/gpu/src/
H A DGrRedBlackTree.h58 * legal to decerement end() if the tree is not empty to get the last
59 * element. However, a last() helper is provided.
90 * Gets the last valid iterator. This is always valid, even on an empty.
92 * @return an iterator that is just beyond the last item in sorted order.
96 * @return an iterator that to the last item in sorted order, or end() if
99 Iter last();
115 * Finds the last of an item in iterator order.
117 * @return an iterator to the last element equal to t or end() if
215 *this = fTree->last();
255 typename GrRedBlackTree<T,C>::Iter GrRedBlackTree<T,C>::last() { function in class:GrRedBlackTree
367 bool last = true; local
[all...]
/external/skia/samplecode/
H A DSamplePatch.cpp61 fPts[12] = pts[0]; // the last shall be first
149 edge3[nv] = edge0[0]; // the last shall be first
171 // last row
172 SkPoint* last = verts + nv * (nu + 1); local
174 last[i] = edge2[nu - i];
/external/skia/src/animator/
H A DSkDisplayApply.cpp472 SkOperand* last = new SkOperand[count]; local
473 SkAutoTDelete<SkOperand> autoLast(last);
475 info->getValue(target, last, count);
483 last[0] = scriptValue.fOperand;
489 memcpy(save, last, count * sizeof(SkOperand));
757 SkTDOperandArray last; local
762 last.setCount(count);
763 memcpy(last.begin(), fActive->fSaveRestore[activeIndex], count * sizeof(SkOperand));
768 info->setValue(target, last.begin(), count);
778 scriptValue.fOperand = last[
[all...]
/external/srec/srec/cfront/
H A Dsp_fft.c241 when we compute two point butterflieswe at the last stage
550 /* Compute 2 point butterflies of the last stage */
603 ** queeze the real valued first and last component of
642 fftdata tr, ti, last; local
682 /* compute the real input fft, the real valued first and last component of
756 last = himul32(tr, tr);
757 maxval |= last;
772 data[n1] = last; /* now the Nyquist freq can be put in place */

Completed in 5259 milliseconds

1234567891011>>