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

1 2 3 4 5 67 8 91011>>

  /external/iproute2/tc/
q_hfsc.c 151 struct rtattr *tail; local
212 tail = NLMSG_TAIL(n);
222 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
  /external/javassist/src/main/javassist/compiler/ast/
ASTList.java 64 public ASTList tail() { return right; } method in class:ASTList
  /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/h264/read/
BitstreamReader.java 120 int tail = 1 << (8 - nBit - 1); local
121 int mask = ((tail << 1) - 1);
122 boolean hasTail = (curByte & mask) == tail;
  /external/mtpd/
mtpd.c 333 char *tail = envargs; local
339 *tail++ = 'A' + ((*p >> 4) & 0x0F);
340 *tail++ = 'A' + (*p & 0x0F);
343 *tail = 0;
  /external/okhttp/okio/src/main/java/okio/
Okio.java 111 Segment tail = sink.writableSegment(1); local
112 int maxToCopy = (int) Math.min(byteCount, Segment.SIZE - tail.limit);
113 int bytesRead = in.read(tail.data, tail.limit, maxToCopy);
115 tail.limit += bytesRead;
  /external/openssl/crypto/evp/
e_rc4_hmac_md5.c 74 MD5_CTX head,tail,md; member in struct:__anon32058
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/qemu/util/
iov.c 149 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/
SkTInternalLList.h 115 * at the tail.
175 T* tail() { return fTail; } function in class:SkTInternalLList
  /external/srtp/crypto/hash/
sha1.c 262 int tail = ctx->octets_in_buffer % 4; local
269 switch (tail) {
  /external/valgrind/main/coregrind/m_gdbserver/
server.h 191 struct inferior_list_entry *tail; member in struct:inferior_list
  /external/zopfli/src/zopfli/
katajainen.c 37 Node* tail; /* Previous node(s) of this chain, or 0 if none. */ member in struct:Node
54 static void InitNode(size_t weight, int count, Node* tail, Node* node) {
57 node->tail = tail;
78 for (node = lists[i / 2][i % 2]; node; node = node->tail) {
128 InitNode(leaves[lastcount].weight, lastcount + 1, oldchain->tail,
165 for (node = chain; node; node = node->tail) {
  /hardware/qcom/media/mm-video-legacy/vidc/vdec/inc/
Map.h 47 node* tail; member in class:Map
52 Map() : head( NULL ), tail ( NULL ),tmp(head),size_of_list(0) {}
53 bool empty() const { return ( !head || !tail ); }
144 tail = new node(data, data2,tail, NULL);
145 if( tail->prev )
146 tail->prev->next = tail;
150 head = tail;
167 if((head == tail) && (head->data == d)
    [all...]
  /hardware/qcom/media/mm-video-v4l2/vidc/vdec/inc/
Map.h 46 node* tail; member in class:Map
51 Map() : head( NULL ), tail ( NULL ),tmp(head),size_of_list(0) {}
53 return ( !head || !tail );
149 tail = new node(data, data2,tail, NULL);
151 if ( tail->prev )
152 tail->prev->next = tail;
155 head = tail;
172 if ((head == tail) && (head->data == d))
    [all...]
  /system/core/logd/
LogReader.cpp 51 unsigned long tail = 0; local
52 static const char _tail[] = " tail=";
55 tail = atol(cp + sizeof(_tail) - 1);
159 FlushCommand command(*this, nonBlock, tail, logMask, pid, start);
  /bootable/recovery/uncrypt/
uncrypt.c 223 int head = 0, tail = 0; local
243 if ((tail+1) % WINDOW_SIZE == head) {
261 // read next block to tail
265 ssize_t this_read = read(fd, buffers[tail] + so_far, sb.st_blksize - so_far);
279 tail = (tail+1) % WINDOW_SIZE;
282 while (head != tail) {
  /external/antlr/antlr-3.4/runtime/C/include/
antlr3commontreenodestream.h 255 /// Add new lookahead at lookahead[tail]. tail wraps around at the
256 /// end of the lookahead buffer so tail could be less than head.
258 ANTLR3_UINT32 tail; member in struct:ANTLR3_COMMON_TREE_NODE_STREAM_struct
327 ANTLR3_UINT32 tail; member in struct:ANTLR3_TREE_WALK_STATE_struct
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/
RubyTarget.java 298 String tail = value.substring( 1 ); local
299 return head.toString().concat( tail );
  /external/chromium_org/net/base/
nss_memio.c 29 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 - (mb->head == 0)
    [all...]
  /external/chromium_org/sandbox/linux/seccomp-bpf/
codegen.cc 198 void CodeGen::JoinInstructions(Instruction* head, Instruction* tail) {
207 head->jt_ptr = tail;
210 head->jt_ptr = tail;
212 head->jf_ptr = tail;
222 head->next = tail;
312 BasicBlock* CodeGen::MakeBasicBlock(Instruction* head, Instruction* tail) {
313 // Iterate over all the instructions between "head" and "tail" and
318 if (head == tail) {
330 Instruction* tail,
343 BasicBlock* bb = MakeBasicBlock(head, tail);
362 Instruction* tail = NULL; local
    [all...]
  /external/chromium_org/third_party/freetype/include/freetype/
fttypes.h 566 FT_ListNode tail; member in struct:FT_ListRec_
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
lp_scene.h 81 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->count
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
nv50_ir_build_util.h 38 // 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/
native_helper.c 62 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/glsl/
list.h 28 * 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/chromium_org/third_party/mesa/src/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;

Completed in 1133 milliseconds

1 2 3 4 5 67 8 91011>>