/external/flac/libFLAC/ |
H A D | 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 byte [all...] |
H A D | metadata_iterators.c | 904 FLAC__Metadata_Node *tail; member in struct:FLAC__Metadata_Chain 963 chain->head = chain->tail = 0; 996 if(0 != chain->tail) 997 chain->tail->data->is_last = false; 1002 FLAC__ASSERT(0 != chain->tail); 1003 chain->tail->next = node; 1004 node->prev = chain->tail; 1006 chain->tail = node; 1020 if(node == chain->tail) 1021 chain->tail [all...] |
H A D | stream_encoder.c | 105 unsigned tail; member in struct:__anon21527 1002 encoder->private_->verify.input_fifo.tail = 0; 4146 memcpy(&fifo->data[channel][fifo->tail], &input[channel][input_offset], sizeof(FLAC__int32) * wide_samples); 4148 fifo->tail += wide_samples; 4150 FLAC__ASSERT(fifo->tail <= fifo->size); 4157 unsigned tail = fifo->tail; local 4162 fifo->data[channel][tail] = input[sample++]; 4163 tail++; 4165 fifo->tail [all...] |
/external/freetype/include/ |
H A D | fttypes.h | 561 /* tail :: The tail (last element) of doubly-linked list. */ 566 FT_ListNode tail; member in struct:FT_ListRec_
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | 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 [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | BstPathTest.java | 30 private SimplePath(SimpleNode tip, SimplePath tail) { argument 31 super(tip, tail);
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | BstInOrderPath.java | 62 N tip, @Nullable BstSide sideExtension, @Nullable BstInOrderPath<N> tail) { 63 super(tip, tail); 65 assert (sideExtension == null) == (tail == null); 120 * Returns the direction this path went in relative to its tail path, or {@code null} if this 121 * path has no tail. 61 BstInOrderPath( N tip, @Nullable BstSide sideExtension, @Nullable BstInOrderPath<N> tail) argument
|
H A D | 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 [all...] |
/external/icu/icu4c/source/common/ |
H A D | ulist.c | 27 UListNode *tail; member in struct:UList 50 newList->tail = NULL; 65 list->tail = newItem; 88 newItem->previous = list->tail; 89 list->tail->next = newItem; 90 list->tail = newItem;
|
/external/icu/icu4c/source/layout/ |
H A D | LEInsertionList.h | 150 * The tail of the insertion list. 154 InsertionRecord *tail; member in class:LEInsertionList
|
/external/icu/icu4c/source/test/cintltst/ |
H A D | ccapitst.c | 3225 * The converter has to read the tail before it knows that 3228 * middle will be pending, and tail will not have been consumed. 3238 static const UChar tail[] = {0xDC07,0x0000};/* second half of \U00060007 */ local 3266 source = tail; 3267 sourceLimit = source + u_strlen(tail); 3274 /* middle[1] is pending, tail has not been consumed */ 3279 log_err("ucnv_fromUInputHeld did not return correct length for tail\n"); 3333 * The converter has to read the tail before it knows that 3336 * mid will be pending, and tail will not have been consumed. 3340 char tail[] local [all...] |
/external/icu/icu4c/source/tools/pkgdata/ |
H A D | pkgdata.cpp | 250 CharList *tail; local 451 tail = NULL; 453 o.fileListFiles = pkg_appendToList(o.fileListFiles, &tail, uprv_strdup(argv[n])); 1951 CharList *l, *tail = NULL, *tail2 = NULL; local 2040 o->files = pkg_appendToList(o->files, &tail, uprv_strdup(linePtr));
|
/external/iproute2/ip/ |
H A D | iplink_vlan.c | 48 struct rtattr *tail; local 50 tail = NLMSG_TAIL(n); 69 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *)tail;
|
/external/iproute2/tc/ |
H A D | f_basic.c | 42 struct rtattr *tail; local 59 tail = (struct rtattr*)(((void*)n)+NLMSG_ALIGN(n->nlmsg_len)); 105 tail->rta_len = (((void*)n)+n->nlmsg_len) - (void*)tail;
|
H A D | f_cgroup.c | 29 struct rtattr *tail; local 43 tail = (struct rtattr*)(((void*)n)+NLMSG_ALIGN(n->nlmsg_len)); 79 tail->rta_len = (((void*)n)+n->nlmsg_len) - (void*)tail;
|
H A D | f_flow.c | 138 struct rtattr *tail; local 153 tail = NLMSG_TAIL(n); 265 tail->rta_len = (void *)NLMSG_TAIL(n) - (void *)tail;
|
H A D | f_fw.c | 38 struct rtattr *tail; local 64 tail = NLMSG_TAIL(n); 115 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
H A D | f_route.c | 41 struct rtattr *tail; local 57 tail = NLMSG_TAIL(n); 124 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
H A D | f_rsvp.c | 176 struct rtattr *tail; local 191 tail = NLMSG_TAIL(n); 284 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
H A D | f_tcindex.c | 31 struct rtattr *tail; local 42 tail = NLMSG_TAIL(n); 116 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
H A D | f_u32.c | 983 struct rtattr *tail; local 999 tail = NLMSG_TAIL(n); 1169 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
H A D | m_action.c | 172 struct rtattr *tail, *tail2; local 183 tail = tail2 = NLMSG_TAIL(n); 223 tail = NLMSG_TAIL(n); 233 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail; 381 struct rtattr *tail; local 405 tail = NLMSG_TAIL(&req.n); 461 tail->rta_len = (void *) NLMSG_TAIL(&req.n) - (void *) tail; 489 struct rtattr *tail; local 527 struct rtattr *tail,*tail2; local [all...] |
H A D | m_csum.c | 94 struct rtattr *tail; local 165 tail = NLMSG_TAIL(n); 168 tail->rta_len = (char *)NLMSG_TAIL(n) - (char *)tail;
|
H A D | m_ematch.c | 179 struct rtattr *tail = NLMSG_TAIL(n); local 221 tail->rta_len = (void*) NLMSG_TAIL(n) - (void*) tail; 339 struct rtattr *tail, *tail_list; local 346 tail = NLMSG_TAIL(n); 357 tail->rta_len = (void*) NLMSG_TAIL(n) - (void*) tail;
|
H A D | m_gact.c | 104 struct rtattr *tail; local 190 tail = NLMSG_TAIL(n); 198 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|