/external/chromium_org/sandbox/linux/bpf_dsl/ |
H A D | cons.h | 22 // Return this node's head element. 23 const T& head() const { return head_; } function in class:sandbox::Cons 28 // Construct a new List using |head| and |tail|. 29 static List Make(const T& head, List tail) { argument 30 return make_scoped_refptr(new const Cons<T>(head, tail)); 34 Cons(const T& head, List tail) : head_(head), tail_(tail) {} argument
|
/external/jemalloc/src/ |
H A D | tsd.c | 112 tsd_init_check_recursion(tsd_init_head_t *head, tsd_init_block_t *block) argument 118 malloc_mutex_lock(&head->lock); 119 ql_foreach(iter, &head->blocks, link) { 121 malloc_mutex_unlock(&head->lock); 128 ql_tail_insert(&head->blocks, block, link); 129 malloc_mutex_unlock(&head->lock); 134 tsd_init_finish(tsd_init_head_t *head, tsd_init_block_t *block) argument 137 malloc_mutex_lock(&head->lock); 138 ql_remove(&head->blocks, block, link); 139 malloc_mutex_unlock(&head [all...] |
/external/checkpolicy/ |
H A D | queue.c | 21 q->head = q->tail = NULL; 40 if (q->head == NULL) { 41 q->head = q->tail = newnode; 64 if (q->head == NULL) { 65 q->head = q->tail = newnode; 67 newnode->next = q->head; 68 q->head = newnode; 82 if (q->head == NULL) 85 node = q->head; 86 q->head [all...] |
/external/yaffs2/yaffs2/ |
H A D | devextras.h | 88 * @head: list head to add it after 90 * Insert a new entry after the specified head. 93 static __inline__ void list_add(struct list_head *new, struct list_head *head) argument 95 __list_add(new, head, head->next); 101 * @head: list head to add it before 103 * Insert a new entry before the specified head. 107 struct list_head *head) 106 list_add_tail(struct list_head *new, struct list_head *head) argument 151 list_empty(struct list_head *head) argument 161 list_splice(struct list_head *list, struct list_head *head) argument [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
H A D | memory_pool.c | 65 pool->head = (unsigned char*)(newblock + 1); 76 if (pool->head + bytes > pool->end) 79 assert(pool->head + bytes <= pool->end); 81 ptr = pool->head; 83 pool->head += bytes; 84 pool->head = (unsigned char*)(((unsigned long)pool->head + POOL_ALIGN - 1) & ~(POOL_ALIGN - 1));
|
/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-2073.js | 43 this.head = null; 59 child.head = null; 62 if (this.head) { 66 this.head = this.tail = child; 74 if (parent.head == this) parent.head = this.right; 94 if (i > m) $root.head.destroy();
|
/external/fio/ |
H A D | io_u_queue.h | 38 unsigned int head; member in struct:io_u_ring 49 if (r->head + 1 != r->tail) { 50 r->ring[r->head] = io_u; 51 r->head = (r->head + 1) & (r->max - 1); 60 if (r->head != r->tail) { 72 return ring->head == ring->tail;
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | memory_pool.c | 65 pool->head = (unsigned char*)(newblock + 1); 76 if (pool->head + bytes > pool->end) 79 assert(pool->head + bytes <= pool->end); 81 ptr = pool->head; 83 pool->head += bytes; 84 pool->head = (unsigned char*)(((unsigned long)pool->head + POOL_ALIGN - 1) & ~(POOL_ALIGN - 1));
|
/external/apache-xml/src/main/java/org/apache/xalan/templates/ |
H A D | TemplateList.java | 140 TemplateSubPatternAssociation head = 143 while (null != head) 145 System.out.print("(" + head.getTargetString() + ", " 146 + head.getPattern() + ")"); 148 head = head.getNext(); 154 TemplateSubPatternAssociation head = m_wildCardPatterns; 158 while (null != head) 160 System.out.print("(" + head.getTargetString() + ", " 161 + head 224 insertAssociationIntoList(TemplateSubPatternAssociation head, TemplateSubPatternAssociation item, boolean isWildCardInsert) argument 726 checkConflicts(TemplateSubPatternAssociation head, XPathContext xctxt, int targetNode, QName mode) argument [all...] |
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/intel/ |
H A D | intel_resolve_map.h | 54 * In the intel_resolve_map*() functions, the \c head argument is not 85 intel_resolve_map_set(struct intel_resolve_map *head, 91 intel_resolve_map_get(struct intel_resolve_map *head, 99 intel_resolve_map_clear(struct intel_resolve_map *head);
|
/external/fio/lib/ |
H A D | flist_sort.c | 11 * sentinel head node, "prev" links not maintained. 18 struct flist_head head, *tail = &head; local 32 return head.next; 45 struct flist_head *head, 48 struct flist_head *tail = head; 78 tail->next = head; 79 head->prev = tail; 85 * @head: the list to sort 96 void flist_sort(void *priv, struct flist_head *head, argument 42 merge_and_restore_back_links(void *priv, int (*cmp)(void *priv, struct flist_head *a, struct flist_head *b), struct flist_head *head, struct flist_head *a, struct flist_head *b) argument [all...] |
/external/mesa3d/src/mesa/drivers/dri/intel/ |
H A D | intel_resolve_map.h | 54 * In the intel_resolve_map*() functions, the \c head argument is not 85 intel_resolve_map_set(struct intel_resolve_map *head, 91 intel_resolve_map_get(struct intel_resolve_map *head, 99 intel_resolve_map_clear(struct intel_resolve_map *head);
|
/external/okhttp/okio/src/main/java/okio/ |
H A D | DeflaterSink.java | 51 // Share bytes from the head segment of 'source' with the deflater. 52 Segment head = source.head; 53 int toDeflate = (int) Math.min(byteCount, head.limit - head.pos); 54 deflater.setInput(head.data, head.pos, toDeflate); 61 head.pos += toDeflate; 62 if (head.pos == head [all...] |
/external/fsck_msdos/ |
H A D | fat.c | 420 clearchain(struct bootblock *boot, struct fatEntry *fat, cl_t head) argument 424 for (p = head; p >= CLUST_FIRST && p < boot->NumClusters; p = q) { 425 if (fat[p].head != head) 428 fat[p].next = fat[p].head = CLUST_FREE; 434 tryclear(struct bootblock *boot, struct fatEntry *fat, cl_t head, cl_t *trunc) argument 436 if (ask(1, "Clear chain starting at %u", head)) { 437 clearchain(boot, fat, head); 452 cl_t head, p, h, n, wdk; local 460 for (head 663 cl_t head; local [all...] |
/external/srec/seti/sltsEngine/src/ |
H A D | linklist_impl.c | 131 if(list->head == NULL){ 132 /* if list is empty, assign to head */ 133 list->head = newnode; 134 (list->head)->next = NULL; 135 (list->head)->prev = NULL; 138 list->curr = list->head; 139 list->tail = list->head; 160 }else if(list->curr == list->head){ 161 /* insert at head */ 162 newnode->next = list->head; [all...] |
/external/chromium_org/third_party/mesa/src/src/mapi/mapi/ |
H A D | u_execmem.c | 44 static unsigned int head = 0; variable 132 if (head + size > EXEC_MAP_SIZE) 136 addr = exec_mem + head; 137 head += size;
|
/external/javassist/src/main/javassist/compiler/ast/ |
H A D | MethodDecl.java | 34 public Declarator getReturn() { return (Declarator)tail().head(); } 36 public ASTList getParams() { return (ASTList)sublist(2).head(); } 38 public ASTList getThrows() { return (ASTList)sublist(3).head(); } 40 public Stmnt getBody() { return (Stmnt)sublist(4).head(); }
|
H A D | FieldDecl.java | 27 public Declarator getDeclarator() { return (Declarator)tail().head(); } 29 public ASTree getInit() { return (ASTree)sublist(2).head(); }
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
H A D | vdso.h | 15 struct dso *vdso__dso_findnew(struct list_head *head);
|
/external/mesa3d/src/mapi/mapi/ |
H A D | u_execmem.c | 44 static unsigned int head = 0; variable 132 if (head + size > EXEC_MAP_SIZE) 136 addr = exec_mem + head; 137 head += size;
|
/external/pdfium/core/src/fxcrt/ |
H A D | plex.h | 13 static CFX_Plex* Create(IFX_Allocator* pAllocator, CFX_Plex*& head, FX_DWORD nMax, FX_DWORD cbElement);
|
/external/qemu/include/qemu/ |
H A D | notify.h | 32 #define NOTIFIER_LIST_INITIALIZER(head) \ 33 { QLIST_HEAD_INITIALIZER((head).notifiers) } 59 #define NOTIFIER_WITH_RETURN_LIST_INITIALIZER(head) \ 60 { QLIST_HEAD_INITIALIZER((head).notifiers) }
|
/external/wpa_supplicant_8/hs20/server/www/ |
H A D | free-remediation.php | 2 <head> 4 </head>
|
/external/compiler-rt/lib/interception/ |
H A D | interception_win.cc | 154 // wrapper, in this case we need to keep the leading 5+ bytes ('head') 155 // of the original code somewhere with a "jmp <old_func+head>". 156 // We call these 'head'+5 bytes of instructions a "trampoline". 160 size_t head = 5; local 163 // to the trampoline and store it in 'head'. 164 head = RoundUpToInstrBoundary(head, old_bytes); 165 if (!head) 169 char *trampoline = GetMemoryForTrampoline(head + 5); 172 _memcpy(trampoline, old_bytes, head); [all...] |
/external/qemu/qobject/ |
H A D | qlist.c | 35 QTAILQ_INIT(&qlist->head); 70 QTAILQ_INSERT_TAIL(&qlist->head, entry, next); 84 QTAILQ_FOREACH(entry, &qlist->head, next) 93 if (qlist == NULL || QTAILQ_EMPTY(&qlist->head)) { 97 entry = QTAILQ_FIRST(&qlist->head); 98 QTAILQ_REMOVE(&qlist->head, entry, next); 111 if (qlist == NULL || QTAILQ_EMPTY(&qlist->head)) { 115 entry = QTAILQ_FIRST(&qlist->head); 124 return QTAILQ_EMPTY(&qlist->head); 163 QTAILQ_FOREACH_SAFE(entry, &qlist->head, nex [all...] |