| /external/chromium_org/third_party/openssl/openssl/crypto/bn/ |
| bn_ctx.c | 102 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/chromium_org/third_party/openssl/openssl/crypto/evp/ |
| e_aes_cbc_hmac_sha1.c | 78 SHA_CTX head,tail,md; member in struct:__anon18446
130 key->tail = key->head;
231 key->md = key->tail;
402 key->md = key->tail;
481 SHA1_Init(&key->tail);
482 SHA1_Update(&key->tail,hmac_key,sizeof(hmac_key));
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| thread_cache.cc | 231 void *tail, *head; local
232 src->PopRange(batch_size, &head, &tail);
233 Static::central_cache()[cl].InsertRange(head, tail, batch_size);
236 void *tail, *head; local
237 src->PopRange(N, &head, &tail);
238 Static::central_cache()[cl].InsertRange(head, tail, N);
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| thread_cache.cc | 225 void *tail, *head; local
226 src->PopRange(batch_size, &head, &tail);
227 Static::central_cache()[cl].InsertRange(head, tail, batch_size);
230 void *tail, *head; local
231 src->PopRange(N, &head, &tail);
232 Static::central_cache()[cl].InsertRange(head, tail, N);
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
| file.c | 184 yasm__splitpath_unix(const char *path, /*@out@*/ const char **tail)
190 *tail = path;
193 *tail = s+1;
206 yasm__splitpath_win(const char *path, /*@out@*/ const char **tail)
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/ |
| perfect.c | 381 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].newval_q = (ub2)i; /* how to make parent (myb) use this hash *
[all...] |
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/ |
| dfa.h | 85 State *head, **tail; member in struct:DFA
|
| /external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
| example-bind.cpp | 59 template<typename Head, typename... Tail>
60 class tuple<Head, Tail...> : private tuple<Tail...> {
61 typedef tuple<Tail...> inherited;
69 typename add_const_reference<Tail>::type... vtail)
74 : m_head(other.head()), inherited(other.tail()) { }
79 tail() = other.tail();
85 inherited& tail() { return *this; } function in class:tuple
86 const inherited& tail() const { return *this; function in class:tuple
[all...] |
| example-tuple.cpp | 59 template<typename Head, typename... Tail>
60 class tuple<Head, Tail...> : private tuple<Tail...> {
61 typedef tuple<Tail...> inherited;
69 typename add_const_reference<Tail>::type... vtail)
74 : m_head(other.head()), inherited(other.tail()) { }
79 tail() = other.tail();
85 inherited& tail() { return *this; } function in class:tuple
86 const inherited& tail() const { return *this; function in class:tuple
[all...] |
| /external/e2fsprogs/util/ |
| symlinks.c | 165 char *p, *np, *lp, *tail, *msg; local
229 /* point tail at first part of lpath that differs from path */
232 tail = lp = lpath;
236 tail = lp;
241 /* now create new, with "../"s followed by tail */
251 strcpy (np, tail);
|
| /external/f2fs-tools/tools/ |
| f2fstat.c | 87 char *head, *tail; local
136 tail = strchr(head, ':');
137 if (!tail)
139 *tail = '\0';
142 *tail = ':';
143 tail = strchr(head, '\n');
144 head = tail + 1;
152 head = tail + 1;
156 *(found->val) = strtoul(head, &tail, 10);
159 tail = strstr(head, "in")
[all...] |
| /external/fio/engines/ |
| libaio.c | 82 unsigned tail; member in struct:aio_ring
104 if (head == ring->tail) {
|
| /external/freetype/include/ |
| fttypes.h | 566 FT_ListNode tail; member in struct:FT_ListRec_
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
| ListSubListTester.java | 213 List<E> tail = list.subList(1, size); local
216 assertEquals(list.get(1), tail.get(0));
217 assertEquals(list.get(size - 1), tail.get(size - 2));
220 for (List<E> subList : Arrays.asList(copy, head, tail)) {
237 List<E> tail = list.subList(1, size); local
240 assertTrue(tail.contains(list.get(1)));
244 assertTrue(tail.contains(list.get(size - 1)));
246 assertFalse(tail.contains(list.get(0)));
255 List<E> tail = list.subList(1, size); local
260 assertEquals(tail.indexOf(list.get(1))
281 List<E> tail = list.subList(1, size); local
[all...] |
| /external/iproute2/tc/ |
| 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...] |
| 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;
|
| m_pedit.c | 471 struct rtattr *tail; local
541 tail = NLMSG_TAIL(n);
544 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| m_xt_old.c | 212 struct rtattr *tail; local
310 tail = NLMSG_TAIL(n);
332 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| q_netem.c | 172 struct rtattr *tail; local
424 tail = NLMSG_TAIL(n);
492 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| /external/javassist/src/main/javassist/ |
| ClassPoolTail.java | 207 ClassPathList tail = new ClassPathList(cp, null); local
210 pathList = tail;
215 list.next = tail;
|
| /external/libmtp/src/ |
| playlist-spl.c | 342 text_t* tail = NULL; local
399 tail = head;
402 tail->next = malloc(sizeof(text_t));
403 tail = tail->next;
407 tail->text = utf16_to_utf8(device, (uint16_t*) w);
410 IF_DEBUG() printf("line: %s\n", tail->text);
437 tail->next = NULL;
|
| /external/mesa3d/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/mesa3d/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/mesa3d/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/mesa3d/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...] |
