| /external/bluetooth/glib/glib/ |
| gunidecomp.c | 96 int last; local
98 last = COMBINING_CLASS (string[0]);
102 if (next != 0 && last > next)
118 next = last;
120 last = next;
|
| /external/chromium/third_party/libjingle/source/talk/xmpp/ |
| jid.cc | 402 std::string::const_iterator last = start; local
413 prepDomainLabel(str, last, i, buf, &label_valid);
415 last = i + 1;
422 prepDomainLabel(str, last, end, buf, valid);
|
| /external/dbus/dbus/ |
| dbus-marshal-validate.c | 57 int last; local
92 last = DBUS_TYPE_INVALID;
148 if (last == DBUS_STRUCT_BEGIN_CHAR)
160 if (last != DBUS_TYPE_ARRAY)
251 if (last == DBUS_DICT_ENTRY_BEGIN_CHAR)
260 last = *p;
283 _dbus_assert (last != DBUS_TYPE_ARRAY);
284 _dbus_assert (last != DBUS_STRUCT_BEGIN_CHAR);
285 _dbus_assert (last != DBUS_DICT_ENTRY_BEGIN_CHAR);
[all...] |
| /external/e2fsprogs/lib/blkid/ |
| devname.c | 404 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 as well
[all...] |
| /external/e2fsprogs/misc/ |
| filefrag.c | 179 int last = 0; local
241 last = 1;
247 } while (last == 0);
|
| /external/guava/src/com/google/common/collect/ |
| RegularImmutableSortedSet.java | 47 * The index after the last element that's in the sorted set (exclusive
218 public E last() { method in class:RegularImmutableSortedSet
|
| /external/hyphenation/ |
| substrings.c | 127 char last = '.';
local
131 if ( (last<'0' || last>'9')
137 last = c;
139 if (last<'0' || last>'9') expr[el++] = '0';
156 // to the last substring-length bytes of expr except for the (single byte)
|
| /external/icu4c/test/intltest/ |
| cpdtrtst.cpp | 332 int32_t last = 0; local
336 str.extractBetween(last, i, result[current]);
337 last = i+1;
341 str.extractBetween(last, i, result[current]);
|
| /external/icu4c/tools/genprops/ |
| genprops.c | 283 uint32_t first, last, props; member in struct:__anon6516
438 /* first or last entry of a Unicode area */
458 } else if(0==uprv_memcmp(", Last>", fields[1][1]-7, 7)) {
459 /* check that the current area matches, and complete it with the last code point */
466 unicodeAreas[unicodeAreaIndex].last=p.code;
470 (unsigned long)unicodeAreas[unicodeAreaIndex].last,
475 /* error: different properties between first & last, different area name, first>=last */
476 fprintf(stderr, "genprops: error - Last of area \"%s\" is incorrect\n", unicodeAreas[unicodeAreaIndex].name);
526 unicodeAreas[i].last,
[all...] |
| /external/iproute2/netem/ |
| maketable.c | 96 int i, index, first=DISTTABLESIZE, last=0; local
113 if (index > last)
114 last = index +1;
162 int i, j, last, lasti = -1; local
164 last = MINSHORT;
171 table[i] = last + (i-lasti)*(table[j]-last)/(j-lasti);
173 table[i] = last + (i-lasti)*(MAXSHORT-last)/(limit-lasti);
176 last = table[i]
[all...] |
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.h | 33 SlotIndex Last;
193 /// last - Return the ending index of the last interfering range in the
195 SlotIndex last() { function in class:llvm::InterferenceCache::Cursor
196 return Current->Last;
|
| /external/opencv/cxcore/include/ |
| cxcore.hpp | 360 static CvModuleInfo* last; member in struct:CvModule
372 static CvTypeInfo* last; member in struct:CvType
|
| /external/openssl/crypto/bio/ |
| bio_lib.c | 458 BIO *b,*last; local
460 b=last=bio;
464 last=b;
468 if (reason != NULL) *reason=last->retry_reason;
469 return(last);
|
| /external/oprofile/daemon/ |
| opd_sfile.c | 300 struct sfile * last = trans->last; local
320 hash = last->hashval & (CG_HASH_SIZE - 1);
323 * 'last', we use its hash.
327 if (sfile_equal(last, &cg->to)) {
334 sfile_dup(&cg->to, last);
340 opd_open_sample_file(file, last, sf, trans->event, is_cg);
400 if (trans->last->kernel)
401 to -= trans->last->kernel->start;
406 if (trans->last->anon
[all...] |
| /external/oprofile/libpp/ |
| profile_spec.cpp | 345 vector<string>::const_iterator last = temp_image_or_lib.end(); local
346 for (; im != last; ++im)
395 * the memory mappings for the last process for which it recorded
|
| /external/oprofile/libregex/ |
| op_regex.cpp | 117 string last, expanded(input); local
120 last = expanded;
121 expanded = substitute_definition(last);
122 if (expanded == last)
129 return last;
|
| /external/qemu/android/utils/ |
| path.c | 119 const char* last; local
142 /* find last separator */
143 last = end;
144 while (last > path && !ispathsep(last[-1]))
145 last -= 1;
148 if (last == path) {
157 if (last == path+1) {
166 basename = substring_dup(last,end);
180 *pdirname = substring_dup(path,last-1)
[all...] |
| /external/qemu/distrib/sdl-1.2.12/src/cdrom/macos/ |
| SDL_syscdrom.c | 80 SInt16 first, last; local
102 last = 0 - LMGetUnitTableEntryCount();
103 for(dRefNum = first; dRefNum >= last; dRefNum--) {
241 /* Apparently SDL wants a fake last entry */
|
| /external/qemu/distrib/sdl-1.2.12/src/stdlib/ |
| SDL_qsort.c | 92 typedef struct { char * first; char * last; } stack_entry; member in struct:__anon9648
93 #define pushLeft {stack[stacktop].first=ffirst;stack[stacktop++].last=last;}
94 #define pushRight {stack[stacktop].first=first;stack[stacktop++].last=llast;}
95 #define doLeft {first=ffirst;llast=last;continue;}
96 #define doRight {ffirst=first;last=llast;continue;}
99 last=llast=stack[stacktop].last;\
115 * 3. We choose a pivot by looking at the first, last
169 { size_t l=last-ffirst,r=llast-first;
307 char *first,*last; local
338 char *first,*last; local
369 char *first,*last; local
[all...] |
| /external/qemu/distrib/zlib-1.2.3/ |
| inflate.c | 46 * - Unroll last copy for window match in inflate_fast()
114 state->last = 0;
310 Update the window with the last wsize (normally 32K) bytes written before
318 advantage, since only the last 32K of output is copied to the sliding window
538 When there is a window, goto inf_leave will update the window with the last
568 code last; /* parent table entry */ local
776 if (state->last) {
782 state->last = BITS(1);
787 state->last ? " (last)" : ""))
[all...] |
| inflate.h | 32 TYPE, /* i: waiting for type bits, including last-flag bit */
79 int last; /* true if processing last block */ member in struct:inflate_state
|
| /external/qemu/hw/ |
| goldfish_events_device.c | 57 unsigned last; member in struct:__anon10064
84 QFIELD_INT32(last),
107 int enqueued = s->last - s->first;
117 if(s->first == s->last) {
127 s->events[s->last] = type;
128 s->last = (s->last + 1) & (MAX_EVENTS-1);
129 s->events[s->last] = code;
130 s->last = (s->last + 1) & (MAX_EVENTS-1)
[all...] |
| /external/quake/quake/src/WinQuake/ |
| gl_mesh.cpp | 62 mtriangle_t *last, *check; local
67 last = &triangles[starttri];
69 stripverts[0] = last->vertindex[(startv)%3];
70 stripverts[1] = last->vertindex[(startv+1)%3];
71 stripverts[2] = last->vertindex[(startv+2)%3];
76 m1 = last->vertindex[(startv+2)%3];
77 m2 = last->vertindex[(startv+1)%3];
83 if (check->facesfront != last->facesfront)
131 mtriangle_t *last, *check; local
136 last = &triangles[starttri]
202 mtriangle_t *last, *check; local
[all...] |
| /external/skia/src/utils/ |
| SkParseColor.cpp | 31 // !!! the bit to end the word (last) is at the low bit for binary search
199 bool last = false; local
214 if (len <= 6) { // last
216 last = true;
221 } while (last == false);
383 bool last = false; local
405 last = ch < 'a' || ch > 'z';
406 if (last)
410 } while (last == false && len > 0);
421 if ((*sixMatchPtr & 1) == 0) { // last
[all...] |
| /external/stlport/test/eh/ |
| test_insert.h | 96 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 )
470 c.insert( first, last );
474 void do_insert_range( C& c, Position, Iter first, Iter last, multimap_tag )
476 c.insert( first, last );
[all...] |
