Searched defs:tail (Results 51 - 75 of 240) sorted by relevance

12345678910

/external/iproute2/tc/
H A Dq_sfb.c55 struct rtattr *tail; local
137 tail = NLMSG_TAIL(n);
140 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
H A Df_flow.c138 struct rtattr *tail; local
153 tail = NLMSG_TAIL(n);
265 tail->rta_len = (void *)NLMSG_TAIL(n) - (void *)tail;
H A Df_rsvp.c176 struct rtattr *tail; local
191 tail = NLMSG_TAIL(n);
284 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
H A Dm_csum.c94 struct rtattr *tail; local
165 tail = NLMSG_TAIL(n);
168 tail->rta_len = (char *)NLMSG_TAIL(n) - (char *)tail;
H A Dm_mirred.c72 struct rtattr *tail; local
197 tail = NLMSG_TAIL(n);
200 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
H A Dm_police.c140 struct rtattr *tail; local
296 tail = NLMSG_TAIL(n);
308 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
H A Dm_xt.c120 struct rtattr *tail; local
224 tail = NLMSG_TAIL(n);
246 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
H A Dq_atm.c57 struct rtattr *tail; local
180 tail = NLMSG_TAIL(n);
185 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
H A Dq_htb.c64 struct rtattr *tail; local
94 tail = NLMSG_TAIL(n);
97 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
112 struct rtattr *tail; local
232 tail = NLMSG_TAIL(n);
237 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
H A Dq_tbf.c49 struct rtattr *tail; local
208 tail = NLMSG_TAIL(n);
214 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
H A Dtc_qdisc.c158 struct rtattr *tail; local
165 tail = NLMSG_TAIL(&req.n);
172 tail->rta_len = (void *)NLMSG_TAIL(&req.n) - (void *)tail;
/external/mesa3d/src/gallium/drivers/nouveau/
H A Dnouveau_screen.h32 struct nouveau_fence *tail; member in struct:nouveau_screen::__anon27229
/external/mesa3d/src/gallium/state_trackers/dri/common/
H A Ddri_drawable.h65 unsigned int tail; member in struct:dri_drawable
/external/valgrind/main/coregrind/m_scheduler/
H A Dticket-lock-linux.c60 volatile unsigned tail; member in struct:sched_lock
86 p->tail = 0;
107 * Acquire ticket lock. Increment the tail of the queue and use the original
123 ticket = __sync_fetch_and_add(&p->tail, 1);
154 * a thread wakeup signal if at least one thread is waiting. If the queue tail
157 * Note: tail will only be read after head has been incremented since both are
171 if (p->tail != wakeup_ticket) {
/external/arduino/hardware/arduino/cores/arduino/
H A DHardwareSerial.cpp50 int tail; member in struct:ring_buffer
71 // just before the tail (meaning that the head would advance to the
72 // current location of the tail), we're about to overflow the buffer
74 if (i != rx_buffer->tail) {
234 return (unsigned int)(RX_BUFFER_SIZE + _rx_buffer->head - _rx_buffer->tail) % RX_BUFFER_SIZE;
239 if (_rx_buffer->head == _rx_buffer->tail) {
242 return _rx_buffer->buffer[_rx_buffer->tail];
248 // if the head isn't ahead of the tail, we don't have any characters
249 if (_rx_buffer->head == _rx_buffer->tail) {
252 unsigned char c = _rx_buffer->buffer[_rx_buffer->tail];
[all...]
/external/bluetooth/bluedroid/osi/src/
H A Dlist.c13 list_node_t *tail; member in struct:list_t
71 return list->tail->data;
86 if (list->tail == prev_node)
87 list->tail = node;
106 if (list->tail == NULL)
107 list->tail = list->head;
125 if (list->tail == NULL) {
127 list->tail = node;
129 list->tail->next = node;
130 list->tail
[all...]
/external/chromium_org/third_party/WebKit/Source/modules/webdatabase/sqlite/
H A DSQLiteStatement.cpp72 const char* tail = 0; local
73 int error = sqlite3_prepare_v2(m_database.sqlite3Handle(), query.data(), lengthIncludingNullCharacter, &m_statement, &tail);
77 else if (tail && *tail)
/external/chromium_org/third_party/angle/src/third_party/murmurhash/
H A DMurmurHash3.cpp124 // tail
126 const uint8_t * tail = (const uint8_t*)(data + nblocks*4); local
132 case 3: k1 ^= tail[2] << 16;
133 case 2: k1 ^= tail[1] << 8;
134 case 1: k1 ^= tail[0];
196 // tail
198 const uint8_t * tail = (const uint8_t*)(data + nblocks*16); local
207 case 15: k4 ^= tail[14] << 16;
208 case 14: k4 ^= tail[13] << 8;
209 case 13: k4 ^= tail[1
289 const uint8_t * tail = (const uint8_t*)(data + nblocks*16); local
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Dulist.c27 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/chromium_org/third_party/libsrtp/srtp/crypto/hash/
H A Dsha1.c262 int tail = ctx->octets_in_buffer % 4; local
269 switch (tail) {
/external/chromium_org/third_party/smhasher/src/
H A DMurmurHash3.cpp124 // tail
126 const uint8_t * tail = (const uint8_t*)(data + nblocks*4); local
132 case 3: k1 ^= tail[2] << 16;
133 case 2: k1 ^= tail[1] << 8;
134 case 1: k1 ^= tail[0];
196 // tail
198 const uint8_t * tail = (const uint8_t*)(data + nblocks*16); local
207 case 15: k4 ^= tail[14] << 16;
208 case 14: k4 ^= tail[13] << 8;
209 case 13: k4 ^= tail[1
289 const uint8_t * tail = (const uint8_t*)(data + nblocks*16); local
[all...]
/external/chromium_org/v8/src/heap/
H A Dobjects-visiting.cc194 T* tail = NULL; local
207 DCHECK(tail != NULL);
208 WeakListVisitor<T>::SetWeakNext(tail, retained);
211 HeapObject::RawField(tail, WeakListVisitor<T>::WeakNextOffset());
215 // Retained object is new tail.
218 tail = candidate;
221 // tail is a live object, visit it.
222 WeakListVisitor<T>::VisitLiveObject(heap, tail, retainer);
232 if (tail != NULL) {
233 WeakListVisitor<T>::SetWeakNext(tail, undefine
[all...]
/external/icu/icu4c/source/common/
H A Dulist.c27 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/iproute2/ip/
H A Diplink_vlan.c48 struct rtattr *tail; local
50 tail = NLMSG_TAIL(n);
69 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *)tail;
/external/javassist/src/main/javassist/compiler/ast/
H A DASTList.java64 public ASTList tail() { return right; } method in class:ASTList

Completed in 4707 milliseconds

12345678910