Searched defs:prev (Results 276 - 300 of 558) sorted by relevance

<<11121314151617181920>>

/external/freetype/src/autofit/
H A Dafhints.c655 /* compute coordinates & Bezier flags, next and prev */
660 AF_Point prev = end; local
683 point->prev = prev;
684 prev->next = point;
685 prev = point;
692 prev = end;
716 AF_Point prev = NULL; local
730 prev = first->prev;
[all...]
H A Dafhints.h262 AF_Point prev; /* previous point in contour */ member in struct:AF_PointRec_
/external/freetype/src/base/
H A Dftoutln.c852 FT_Vector* prev;
857 prev = ( xmin_point == first ) ? last : xmin_point - 1;
860 if ( FT_Atan2( prev->x - xmin_point->x, prev->y - xmin_point->y ) >
988 FT_Vector* prev; local
1072 prev = xmin_last;
1073 for ( point = xmin_first; point <= xmin_last; prev = point, ++point )
1078 if ( point->y == ray_y[i] || prev->y == ray_y[i] )
1084 if ( ( point->y < ray_y[i] && prev->y < ray_y[i] ) ||
1085 ( point->y > ray_y[i] && prev
[all...]
/external/icu4c/common/
H A Dbytestriebuilder.cpp236 StringPiece prev=elements[0].getString(*strings); local
239 if(prev==current) {
243 prev=current;
H A Dutrie.c1063 UChar32 c, prev; local
1088 prev=0;
1108 if(prev<c) {
1109 if(!enumRange(context, prev, c, prevValue)) {
1114 prev=c;
1123 if(prev<c) {
1124 if(!enumRange(context, prev, c, prevValue)) {
1132 prev=c;
1147 if(prev<c) {
1148 if(!enumRange(context, prev,
[all...]
/external/icu4c/layout/
H A DKhmerReordering.cpp336 le_int32 KhmerReordering::findSyllable(const KhmerClassTable *classTable, const LEUnicode *chars, le_int32 prev, le_int32 charCount) argument
338 le_int32 cursor = prev;
366 le_int32 i, prev = 0, coengRo; local
371 while (prev < charCount) {
372 le_int32 syllable = findSyllable(classTable, chars, prev, charCount);
380 for (i = prev; i < syllable; i += 1) {
417 if (classTable->getCharClass(chars[prev]) & KhmerClassTable::CF_DOTTED_CIRCLE) {
418 output.writeChar(C_DOTTED_CIRCLE, prev, tagDefault);
422 for (i = prev; i < syllable; i += 1) {
492 prev
[all...]
H A DLayoutEngine.cpp395 float ignore, prev; local
397 glyphStorage.getGlyphPosition(0, prev, ignore, success);
404 xAdvance = next - prev;
411 prev = next;
437 float ignore, prev; local
439 glyphStorage.getGlyphPosition(0, prev, ignore, success);
446 xAdvance = next - prev;
453 prev = next;
H A DTibetanReordering.cpp299 le_int32 TibetanReordering::findSyllable(const TibetanClassTable *classTable, const LEUnicode *chars, le_int32 prev, le_int32 charCount) argument
301 le_int32 cursor = prev;
329 le_int32 i, prev = 0; local
333 while (prev < charCount) {
334 le_int32 syllable = findSyllable(classTable, chars, prev, charCount);
342 if (classTable->getCharClass(chars[prev]) & TibetanClassTable::CF_DOTTED_CIRCLE) {
343 output.writeChar(C_DOTTED_CIRCLE, prev, tagDefault);
347 for (i = prev; i < syllable; i += 1) {
382 prev = syllable; // move the pointer to the start of next syllable
/external/icu4c/test/cintltst/
H A Dbocu1tst.c55 * Additionally, "prev" is moved from anywhere in the Unihan and Hangul
59 * "prev" is reset for C0 controls but not for space.
62 /* initial value for "prev": middle of the ASCII range */
225 int32_t prev, count, diff; member in struct:Bocu1Rx
255 /* compute new prev */
366 int32_t prev; local
373 prev=*pPrev;
374 if(prev==0) {
376 prev=*pPrev=BOCU1_ASCII_PREV;
393 * are encoded with the difference c-prev
530 int32_t prev, c, count; local
712 int32_t c, prev, i; local
791 uint8_t prev[5], level[5]; local
[all...]
/external/icu4c/tools/makeconv/
H A Dgencnvex.c419 int32_t low, high, prev; local
432 prev=high=low;
438 if(high!=prev) {
439 prev=high;
471 prev=low-1; /* just before low to prevent empty subsections before low */
478 if(high!=prev) {
482 while(++prev<high) {
483 section[j++]=((uint32_t)prev<<UCNV_EXT_TO_U_BYTE_SHIFT)|(uint32_t)i;
486 prev=high;
716 UChar32 low, high, prev; local
[all...]
/external/iproute2/misc/
H A Darpd.c241 static struct timeval prev; local
246 if (prev.tv_sec) {
247 int diff = (now.tv_sec-prev.tv_sec)*1000+(now.tv_usec-prev.tv_usec)/1000;
256 prev = now;
/external/jmonkeyengine/engine/src/core/com/jme3/font/
H A DLetterQuad.java60 * @param prev previous character
62 protected LetterQuad(char c, LetterQuad prev) { argument
63 this.font = prev.font;
64 this.rightToLeft = prev.rightToLeft;
66 this.index = prev.index+1;
69 prev.insert(this);
/external/kernel-headers/original/linux/
H A Dlist.h16 * sometimes we already know the next/prev entries and we can
22 struct list_head *next, *prev; member in struct:list_head
33 list->prev = list;
40 * the prev/next entries already!
43 struct list_head *prev,
46 next->prev = new;
48 new->prev = prev;
49 prev->next = new;
75 __list_add(new, head->prev, hea
42 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
84 __list_add_rcu(struct list_head * new, struct list_head * prev, struct list_head * next) argument
144 __list_del(struct list_head * prev, struct list_head * next) argument
798 hlist_add_after_rcu(struct hlist_node *prev, struct hlist_node *n) argument
[all...]
/external/libselinux/src/
H A Davc.c252 struct avc_node *prev, *cur; local
259 prev = NULL;
267 prev = cur;
280 if (prev == NULL)
283 prev->next = cur->next;
/external/opencv/cv/src/
H A Dcvinpaint.cpp72 struct CvHeapElem* prev; member in struct:CvHeapElem
99 head->prev = NULL;
104 mem[i].prev = mem+i-1;
111 tail->prev = mem+i-1;
132 while (tmp->prev->T>T) tmp = tmp->prev;
134 add->prev->next = add->next;
135 add->next->prev = add->prev;
137 add->prev
[all...]
/external/opencv/cvaux/src/
H A Dcvsegment.cpp354 int prev = ptr[rect.x - 1] & -2; local
360 //assert( exterior || ((p | prev) & -4) == 0 );
362 if( p != prev )
371 if( !(prev == 0 && p == 2) ) /* if not external contour */
374 if( p != 0 || prev < 1 )
376 prev = p;
466 prev = ptr[x] & -2;
/external/qemu/android/skin/
H A Dimage.c215 SkinImage* prev; member in struct:SkinImage
265 image->next = image->prev = image;
365 cache->mru_head.next = cache->mru_head.prev = &cache->mru_head;
393 image->prev->next = image->next;
394 image->next->prev = image->prev;
406 SkinImage* prev = image->prev; local
410 prev->next = next;
411 next->prev
433 SkinImage* prev = image->prev; local
[all...]
/external/qemu/distrib/sdl-1.2.15/src/cdrom/macosx/
H A DAudioFileReaderThread.c88 FileData *prev = NULL; local
94 while (i != NULL) { prev = i; i = i->next; }
95 if (prev == NULL)
98 prev->next = newfd;
128 FileData *prev = NULL; local
133 prev = i;
136 if (prev == NULL)
139 prev->next = next;
/external/qemu/distrib/zlib-1.2.3/
H A Ddeflate.c191 match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \
197 * prev[] will be initialized on the fly.
288 s->prev = (Posf *) ZALLOC(strm, s->w_size, sizeof(Pos));
297 if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL ||
880 TRY_FREE(strm, strm->state->prev);
921 ds->prev = (Posf *) ZALLOC(dest, ds->w_size, sizeof(Pos));
926 if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL ||
933 zmemcpy(ds->prev, ss->prev, ds->w_size * sizeof(Pos));
1042 Posf *prev local
[all...]
H A Ddeflate.h128 Posf *prev; member in struct:internal_state
/external/qemu/hw/
H A Dbt-hid.c444 int prev = hid->connected; local
452 if (hid->connected && !prev) {
/external/quake/quake/src/QW/client/
H A Dzone.c34 struct memblock_s *next, *prev; member in struct:memblock_s
80 zone->blocklist.next = zone->blocklist.prev = block =
87 block->prev = block->next = &zone->blocklist;
114 other = block->prev;
119 other->next->prev = other;
130 block->next->prev = block;
172 start = base->prev;
193 new->prev = base;
196 new->next->prev = new;
234 if ( block->next->prev !
567 struct cache_system_s *prev, *next; member in struct:cache_system_s
635 cache_system_t *c, *prev; local
[all...]
/external/quake/quake/src/WinQuake/
H A Dnet_main.cpp960 PollProcedure *pp, *prev; local
963 for (pp = pollProcedureList, prev = NULL; pp; pp = pp->next)
967 prev = pp;
970 if (prev == NULL)
978 prev->next = proc;
H A Dsnd_android.cpp457 static size_t prev(size_t value, size_t mod) { function
H A Dzone.cpp34 struct memblock_s *next, *prev; member in struct:memblock_s
80 zone->blocklist.next = zone->blocklist.prev = block =
87 block->prev = block->next = &zone->blocklist;
114 other = block->prev;
119 other->next->prev = other;
130 block->next->prev = block;
172 start = base->prev;
193 newm->prev = base;
196 newm->next->prev = newm;
234 if ( block->next->prev !
562 struct cache_system_s *prev, *next; member in struct:cache_system_s
630 cache_system_t *c, *prev; local
[all...]

Completed in 1866 milliseconds

<<11121314151617181920>>