Searched defs:tail (Results 101 - 125 of 240) sorted by relevance

12345678910

/external/iproute2/tc/
H A Dq_hfsc.c151 struct rtattr *tail; local
212 tail = NLMSG_TAIL(n);
222 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
H A Dq_netem.c172 struct rtattr *tail; local
424 tail = NLMSG_TAIL(n);
492 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
/external/javassist/src/main/javassist/
H A DCtMember.java46 private CtMember consTail; // constructor tail
93 static int count(CtMember head, CtMember tail) { argument
95 while (head != tail) {
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/
H A Devlist.h177 unsigned long tail)
182 * ensure all reads are done before we write the tail out.
185 pc->data_tail = tail;
176 perf_mmap__write_tail(struct perf_mmap *md, unsigned long tail) argument
/external/mesa3d/src/gallium/drivers/llvmpipe/
H A Dlp_scene.h81 struct cmd_block *tail; member in struct:cmd_block_list
100 struct cmd_block *tail; member in struct:cmd_bin
298 struct cmd_block *tail = bin->tail; local
304 if (tail == NULL || tail->count == CMD_BLOCK_MAX) {
305 tail = lp_scene_new_cmd_block( scene, bin );
306 if (!tail) {
309 assert(tail->count == 0);
313 unsigned i = tail
[all...]
/external/mesa3d/src/glsl/
H A Dlist.h28 * Each doubly-linked list has a sentinel head and tail node. These nodes
30 * pointer being \c NULL. The tail sentinel can be identified by its
34 * tail sentinel or the tail sentinel's \c prev poiner points to the head
45 * - A \c tail pointer that represents the \c prev pointer of the head
46 * sentinel node and the \c next pointer of the tail sentinel node. This
49 * tail sentinel node.
183 * Is this the sentinel at the tail of the list?
284 struct exec_node *tail; member in struct:exec_list
314 head = (exec_node *) & tail;
[all...]
/external/mtpd/
H A Dmtpd.c333 char *tail = envargs; local
339 *tail++ = 'A' + ((*p >> 4) & 0x0F);
340 *tail++ = 'A' + (*p & 0x0F);
343 *tail = 0;
/external/openssl/crypto/bn/
H A Dbn_ctx.c102 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/
H A De_aes_cbc_hmac_sha1.c78 SHA_CTX head,tail,md; member in struct:__anon28290
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/
H A Dfttypes.h561 /* tail :: The tail (last element) of doubly-linked list. */
566 FT_ListNode tail; member in struct:FT_ListRec_
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/include/freetype/
H A Dfttypes.h561 /* tail :: The tail (last element) of doubly-linked list. */
566 FT_ListNode tail; member in struct:FT_ListRec_
/external/qemu/distrib/mini-glib/include/
H A Dglib.h164 GQueueNode* tail; member in struct:_GQueue
/external/qemu/distrib/sdl-1.2.15/src/events/
H A DSDL_events.c46 int tail; member in struct:__anon29405
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...]
/external/qemu/util/
H A Diov.c149 size_t orig_len, tail; local
173 tail = bytes;
174 for (niov = 0; niov < iov_cnt && iov[niov].iov_len <= tail; ++niov) {
175 tail -= iov[niov].iov_len;
177 if (tail) {
181 assert(iov[niov].iov_len > tail);
183 iov[niov++].iov_len = tail;
/external/skia/include/core/
H A DSkTInternalLList.h115 * at the tail.
175 T* tail() { return fTail; } function in class:SkTInternalLList
/external/bison/lib/
H A Dbitset.h71 struct lbitset_elt_struct *tail; /* Last element in linked list. */ member in struct:bitset_union::lbitset_struct
/external/chromium_org/net/base/
H A Dnss_memio.c29 int tail; /* where to put next byte into buf */ member in struct:memio_buffer
93 mb->tail = 0;
105 mb->tail = 0;
111 return (((mb->tail >= mb->head) ? mb->tail : mb->bufsize) - mb->head);
117 return (mb->tail >= mb->head) ? 0 : mb->tail;
123 if (mb->head > mb->tail) return mb->head - mb->tail - 1;
124 return mb->bufsize - mb->tail
[all...]
/external/chromium_org/sandbox/linux/seccomp-bpf/
H A Dcodegen.cc277 BasicBlock* CodeGen::MakeBasicBlock(Instruction* head, Instruction* tail) { argument
278 // Iterate over all the instructions between "head" and "tail" and
283 if (head == tail) {
295 Instruction* tail,
308 BasicBlock* bb = MakeBasicBlock(head, tail);
327 Instruction* tail = NULL; local
336 if (tail && branch_targets.find(insn) != branch_targets.end()) {
339 AddBasicBlock(head, tail, branch_targets, basic_blocks, &first_block);
367 tail = NULL;
372 tail
294 AddBasicBlock(Instruction* head, Instruction* tail, const BranchTargets& branch_targets, TargetsToBlocks* basic_blocks, BasicBlock** firstBlock) argument
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vpx_mem/
H A Dvpx_mem_tracker.c99 * 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/mesa/src/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_build_util.h38 // keeps inserting at head/tail of block
39 inline void setPosition(BasicBlock *, bool tail);
178 bool tail; member in class:nv50_ir::BuildUtil
203 tail = atTail;
213 tail = after;
237 tail ? bb->insertTail(i) : bb->insertHead(i);
239 if (tail) {
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/egl/common/
H A Dnative_helper.c62 unsigned int tail; member in struct:resource_surface
303 screen->fence_reference(screen, &fence, rsurf->swap_fences[rsurf->tail]);
304 screen->fence_reference(screen, &rsurf->swap_fences[rsurf->tail++], NULL);
305 rsurf->tail &= EGL_SWAP_FENCES_MASK;
/external/chromium_org/third_party/mesa/src/src/glx/
H A Ddri_common.c357 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/chromium_org/third_party/skia/src/core/
H A DSkTLList.h106 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/chromium_org/third_party/yasm/source/patched-yasm/libyasm/
H A Dfile.c184 yasm__splitpath_unix(const char *path, /*@out@*/ const char **tail) argument
190 *tail = path;
193 *tail = s+1;
206 yasm__splitpath_win(const char *path, /*@out@*/ const char **tail) argument
221 *tail = basepath;
227 *tail = s+1;
287 const char *tail; local
305 pathlen = yasm__splitpath_unix(from, &tail);
357 /* Copy "to" to tail of output, and we're done */
372 const char *tail; local
[all...]
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/genperf/
H A Dperfect.c381 ub4 tail,
392 for (child=tail-1; child; child=parent)
423 apply(tabb, tabh, tabq, blen, scramble, tail, TRUE);
465 ub4 tail; /* tail of the queue. 0 is the head of the queue. */ local
472 tail = 1;
474 /* construct the spanning tree by walking the queue, add children to tail */
475 for (q=0; q<tail; ++q)
515 tabq[tail].b_q = childb;
516 tabq[tail]
375 apply( bstuff *tabb, hstuff *tabh, qstuff *tabq, ub4 blen, ub4 *scramble, ub4 tail, int rollback) argument
[all...]

Completed in 1874 milliseconds

12345678910