HomeSort by relevance Sort by last modified time
    Searched defs:tail (Results 126 - 150 of 486) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/iproute2/tc/
m_mirred.c 72 struct rtattr *tail; local
197 tail = NLMSG_TAIL(n);
200 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
q_atm.c 57 struct rtattr *tail; local
180 tail = NLMSG_TAIL(n);
185 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
q_gred.c 54 struct rtattr *tail; local
109 tail = NLMSG_TAIL(n);
112 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
128 struct rtattr *tail; local
252 tail = NLMSG_TAIL(n);
258 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
q_htb.c 64 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;
q_tbf.c 49 struct rtattr *tail; local
208 tail = NLMSG_TAIL(n);
214 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
tc_qdisc.c 158 struct rtattr *tail; local
165 tail = NLMSG_TAIL(&req.n);
172 tail->rta_len = (void *)NLMSG_TAIL(&req.n) - (void *)tail;
m_police.c 140 struct rtattr *tail; local
296 tail = NLMSG_TAIL(n);
308 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
m_xt.c 120 struct rtattr *tail; local
224 tail = NLMSG_TAIL(n);
246 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
q_cbq.c 60 struct rtattr *tail; local
166 tail = NLMSG_TAIL(n);
177 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
197 struct rtattr *tail; local
412 tail = NLMSG_TAIL(n);
432 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
  /external/jemalloc/include/jemalloc/internal/
hash.h 116 /* tail */
118 const uint8_t *tail = (const uint8_t *) (data + nblocks*4); local
123 case 3: k1 ^= tail[2] << 16;
124 case 2: k1 ^= tail[1] << 8;
125 case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15);
188 /* tail */
190 const uint8_t *tail = (const uint8_t *) (data + nblocks*16); local
197 case 15: k4 ^= tail[14] << 16;
198 case 14: k4 ^= tail[13] << 8;
199 case 13: k4 ^= tail[12] << 0
276 const uint8_t *tail = (const uint8_t*)(data + nblocks*16); local
    [all...]
  /external/mesa3d/src/gallium/drivers/nouveau/
nouveau_screen.h 32 struct nouveau_fence *tail; member in struct:nouveau_screen::__anon30997
  /external/mesa3d/src/gallium/state_trackers/dri/common/
dri_drawable.h 65 unsigned int tail; member in struct:dri_drawable
  /external/okhttp/okio/src/main/java/okio/
InflaterSource.java 66 Segment tail = sink.writableSegment(1); local
67 int bytesInflated = inflater.inflate(tail.data, tail.limit, Segment.SIZE - tail.limit);
69 tail.limit += bytesInflated;
  /external/valgrind/main/coregrind/m_scheduler/
ticket-lock-linux.c 60 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) {
  /libcore/luni/src/main/java/java/lang/ref/
ReferenceQueue.java 31 private Reference<? extends T> tail; field in class:ReferenceQueue
54 if (head == tail) {
55 tail = null;
135 if (tail == null) {
138 tail.queueNext = reference;
141 // The newly enqueued reference becomes the new tail, and always
143 tail = reference;
144 tail.queueNext = reference;
  /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/decoder/
UnboundedFifoByteBuffer.java 59 protected int tail; field in class:UnboundedFifoByteBuffer
86 tail = 0;
97 if (tail < head) {
98 size = buffer.length - head + tail;
100 size = tail - head;
127 for (int i = head; i != tail;) {
140 tail = j;
143 buffer[tail] = b;
144 tail++;
145 if (tail >= buffer.length)
    [all...]
  /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/x509/
EDIPartyNameTest.java 42 String tail = Integer.toHexString(0x000000ff & data[i]); local
43 if (tail.length() == 1) {
44 tail = "0" + tail;
46 System.out.print(prefix + "0x" + tail + delimiter);
  /external/chromium_org/net/websockets/
websocket_inflater.cc 129 std::pair<char*, size_t> tail = output_buffer_.GetTail(); local
130 if (!tail.second)
133 stream_->next_out = reinterpret_cast<Bytef*>(tail.first);
134 stream_->avail_out = tail.second;
136 output_buffer_.AdvanceTail(tail.second - stream_->avail_out);
140 } else if (tail.second == stream_->avail_out) {
  /external/chromium_org/third_party/icu/source/common/
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/chromium_org/third_party/libsrtp/srtp/crypto/hash/
sha1.c 262 int tail = ctx->octets_in_buffer % 4; local
269 switch (tail) {
  /external/chromium_org/third_party/openssl/openssl/crypto/evp/
e_rc4_hmac_md5.c 74 MD5_CTX head,tail,md; member in struct:__anon18457
95 key->tail = key->head;
163 key->md = key->tail;
204 key->md = key->tail;
248 MD5_Init(&key->tail);
249 MD5_Update(&key->tail,hmac_key,sizeof(hmac_key));
  /external/chromium_org/third_party/skia/include/core/
SkTInternalLList.h 115 * at the tail.
175 T* tail() { return fTail; } function in class:SkTInternalLList
  /external/chromium_org/third_party/smhasher/src/
MurmurHash3.cpp 124 // 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[12] << 0
289 const uint8_t * tail = (const uint8_t*)(data + nblocks*16); local
    [all...]
  /external/eigen/Eigen/src/plugins/
BlockMethods.h 833 inline SegmentReturnType tail(Index n) function
839 /** This is the const version of tail(Index).*/
840 inline ConstSegmentReturnType tail(Index n) const function
923 inline typename FixedSegmentReturnType<N>::Type tail(Index n = N) function
931 inline typename ConstFixedSegmentReturnType<N>::Type tail(Index n = N) const function
    [all...]
  /external/icu/icu4c/source/common/
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;

Completed in 1309 milliseconds

1 2 3 4 56 7 8 91011>>