| /external/mesa3d/src/glx/ |
| dri_common.c | 357 struct glx_config head, *tail, *m; local
359 tail = &head;
362 tail->next = createDriMode(core, m, driConfigs);
363 if (tail->next == NULL) {
369 tail = tail->next;
|
| /external/openssl/crypto/bn/ |
| bn_ctx.c | 102 BN_POOL_ITEM *head, *current, *tail; member in struct:bignum_pool
362 p->head = p->current = p->tail = NULL;
415 item->prev = p->tail;
419 p->head = p->current = p->tail = item;
422 p->tail->next = item;
423 p->tail = item;
|
| /external/openssl/crypto/evp/ |
| e_aes_cbc_hmac_sha1.c | 78 SHA_CTX head,tail,md; member in struct:__anon32047
130 key->tail = key->head;
231 key->md = key->tail;
403 key->md = key->tail;
482 SHA1_Init(&key->tail);
483 SHA1_Update(&key->tail,hmac_key,sizeof(hmac_key));
|
| /external/pdfium/core/include/thirdparties/freetype/freetype/ |
| fttypes.h | 566 FT_ListNode tail; member in struct:FT_ListRec_
[all...] |
| /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/include/freetype/ |
| fttypes.h | 566 FT_ListNode tail; member in struct:FT_ListRec_
[all...] |
| /external/qemu/distrib/mini-glib/include/ |
| glib.h | 164 GQueueNode* tail; member in struct:_GQueue
|
| /external/qemu/distrib/sdl-1.2.15/src/events/ |
| SDL_events.c | 46 int tail; member in struct:__anon33123
222 SDL_EventQ.tail = 0;
267 int tail, added; local
269 tail = (SDL_EventQ.tail+1)%MAXEVENTS;
270 if ( tail == SDL_EventQ.head ) {
274 SDL_EventQ.event[SDL_EventQ.tail] = *event;
279 SDL_EventQ.event[SDL_EventQ.tail].syswm.msg =
283 SDL_EventQ.tail = tail;
[all...] |
| /frameworks/base/core/java/android/util/ |
| Base64.java | 515 // Account for the tail of the data and the padding bytes, if any.
572 final private byte[] tail; field in class:Base64.Encoder
589 tail = new byte[2];
614 // First we need to concatenate the tail of the previous call
616 // the tail.
620 // There was no tail.
625 // A 1-byte tail with at least 2 bytes of
627 v = ((tail[0] & 0xff) << 16) |
636 // A 2-byte tail with at least 1 byte of input.
637 v = ((tail[0] & 0xff) << 16)
[all...] |
| /frameworks/native/cmds/dumpstate/ |
| dumpstate.c | 172 int tail = strlen(anr_traces_path)-1; local
173 while (tail > 0 && anr_traces_path[tail] != '/') {
174 tail--;
178 sprintf(anr_traces_path+tail+1, "slow%02d.txt", i);
|
| /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/ |
| Builder.java | 193 Token tail = node.lastToken; local
196 while (head != tail) {
202 out.append(tail.image);
|
| /system/core/libutils/ |
| String8.cpp | 420 size_t tail = index; local
427 memcpy(buf + tail, buf + index + skip, next - index - skip);
428 tail += next - index - skip;
431 unlockBuffer(tail);
|
| /frameworks/base/services/core/java/com/android/server/ |
| DropBoxManagerService.java | 655 SortedSet<EntryFile> tail = mAllFiles.contents.tailSet(new EntryFile(t + 10000)); local
657 if (!tail.isEmpty()) {
658 future = tail.toArray(new EntryFile[tail.size()]);
659 tail.clear(); // Remove from mAllFiles
|
| /bionic/libc/bionic/ |
| fts.c | 549 FTSENT *cur, *tail; local
650 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
736 head = tail = p;
738 tail->fts_link = p;
739 tail = p;
|
| /bionic/libc/upstream-netbsd/lib/libc/regex/ |
| engine.c | 366 const char *tail; /* string unmatched by rest of RE */ local
426 tail = slow(m, rest, stop, es, stopst);
427 if (tail == stop)
455 tail = slow(m, rest, stop, es, stopst);
456 if (tail == stop)
496 tail = slow(m, rest, stop, es, stopst);
497 if (tail == stop)
|
| /dalvik/docs/ |
| prettify.js | 567 var tail = sourceCode; variable
569 while (tail.length) {
574 var patternParts = shortcuts[tail.charAt(0)];
576 match = tail.match(patternParts[1]);
587 match = tail.match(patternParts[1]);
597 token = tail.substring(0, 1);
603 tail = tail.substring(token.length);
[all...] |
| /external/bison/lib/ |
| bitset.h | 71 struct lbitset_elt_struct *tail; /* Last element in linked list. */ member in struct:bitset_union::lbitset_struct
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vpx_mem/ |
| vpx_mem_tracker.c | 99 * tail; member in struct:memory_tracker
166 memtrack.tail = memtrack.head;
228 memtrack.tail = NULL;
539 p->prev = memtrack.tail;
548 memtrack.tail = p;
590 memtrack.tail = p->prev;
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| SkAntiEdge.cpp | 503 SkAntiEdge* tail = fEdges.end(); local
507 for (active = prev + 1; active != tail; ++active) {
523 if (++prev == tail) {
527 for (active = prev + 1; active != tail; ++active) {
601 SkAntiEdge tail; local
602 tail.fFirstY = tail.fLastY = kEDGE_TAIL_XY;
603 *list.append() = &tail;
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkString.cpp | 605 size_t tail = size - offset - length; local
606 SkASSERT((int32_t)tail >= 0);
607 if (tail) {
609 memcpy(dst + offset, src + offset + length, tail);
|
| SkTLList.h | 106 iterator refers to a NULL location then the new element is added at the tail */
117 /** Convenience methods for getting an iterator initialized to the head/tail of the list. */
122 T* tail() { return Iter(*this, Iter::kTail_IterStart).get(); } function in class:SkTLList
124 const T* tail() const { return Iter(*this, Iter::kTail_IterStart).get(); } function in class:SkTLList
196 //!< Start the iterator at the tail of the list.
|
| /external/flac/libFLAC/ |
| bitreader.c | 138 /* any incomplete word at the tail will be left-justified, and bytes from the read callback are added on the right */
233 * bitstream : 11 22 33 44 55 br->words=1 br->bytes=1 (partial tail word is left-justified)
237 * on LE machines, have to byteswap the odd tail word so nothing is
411 /* CRC any tail bytes in a partially-consumed word */
413 const brword tail = br->buffer[br->consumed_words]; local
415 br->read_crc16 = FLAC__CRC16_UPDATE((unsigned)((tail >> (FLAC__BITS_PER_WORD-8-br->crc16_align)) & 0xff), br->read_crc16);
456 if(br->consumed_words < br->words) { /* if we've not consumed up to a partial tail word... */
494 /* in this case we're starting our read at a partial tail word;
631 /* step 3: skip any remainder from partial tail bytes */
686 /* step 3: read any remainder from partial tail bytes *
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| LinkedListMultimap.java | 130 private transient Node<K, V> tail; // the tail for all keys field in class:LinkedListMultimap
133 private transient Map<K, Node<K, V>> keyToKeyTail; // the tail for a given key
193 head = tail = node;
196 } else if (nextSibling == null) { // non-empty list, add to tail
197 tail.next = node;
198 node.previous = tail;
207 tail = node;
243 } else { // node was tail
244 tail = node.previous
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| LinkedListMultimap.java | 126 private transient Node<K, V> tail; // the tail for all keys field in class:LinkedListMultimap
129 private transient Map<K, Node<K, V>> keyToKeyTail; // the tail for a given key
189 head = tail = node;
192 } else if (nextSibling == null) { // non-empty list, add to tail
193 tail.next = node;
194 node.previous = tail;
203 tail = node;
239 } else { // node was tail
240 tail = node.previous
[all...] |
| /external/iproute2/tc/ |
| f_u32.c | 983 struct rtattr *tail; local
999 tail = NLMSG_TAIL(n);
1169 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| m_ipt.c | 393 struct rtattr *tail; local
493 tail = NLMSG_TAIL(n);
515 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
