/external/chromium_org/third_party/skia/src/views/ |
H A D | SkTagList.h | 38 static SkTagList* Find(SkTagList* head, U8CPU tag); 40 static void DeleteAll(SkTagList* head);
|
/external/chromium_org/tools/ |
H A D | roll_swarming_client.py | 36 head = subprocess.check_output( 42 if not head in deps_content: 50 head = m.group(1) 54 head, key) 57 print('Found old revision %s' % head) 64 if master == head: 68 commit_range = '%s..%s' % (head[:9], master[:9]) 93 deps_content = deps_content.replace(head, master)
|
/external/skia/src/views/ |
H A D | SkTagList.h | 38 static SkTagList* Find(SkTagList* head, U8CPU tag); 40 static void DeleteAll(SkTagList* head);
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/ |
H A D | nouveau_mm.c | 36 struct list_head head; member in struct:mm_slab 138 LIST_INITHEAD(&slab->head); 144 LIST_ADD(&slab->head, &mm_bucket_by_order(cache, chunk_order)->free); 178 slab = LIST_ENTRY(struct mm_slab, bucket->used.next, head); 183 slab = LIST_ENTRY(struct mm_slab, bucket->free.next, head); 185 LIST_DEL(&slab->head); 186 LIST_ADD(&slab->head, &bucket->used); 198 LIST_DEL(&slab->head); 199 LIST_ADD(&slab->head, &bucket->full); 218 LIST_DEL(&slab->head); 260 nouveau_mm_free_slabs(struct list_head *head) argument [all...] |
/external/mesa3d/src/gallium/drivers/nouveau/ |
H A D | nouveau_mm.c | 36 struct list_head head; member in struct:mm_slab 138 LIST_INITHEAD(&slab->head); 144 LIST_ADD(&slab->head, &mm_bucket_by_order(cache, chunk_order)->free); 178 slab = LIST_ENTRY(struct mm_slab, bucket->used.next, head); 183 slab = LIST_ENTRY(struct mm_slab, bucket->free.next, head); 185 LIST_DEL(&slab->head); 186 LIST_ADD(&slab->head, &bucket->used); 198 LIST_DEL(&slab->head); 199 LIST_ADD(&slab->head, &bucket->full); 218 LIST_DEL(&slab->head); 260 nouveau_mm_free_slabs(struct list_head *head) argument [all...] |
/external/fsck_msdos/ |
H A D | dir.c | 249 || fat[boot->RootCl].head != boot->RootCl) { 267 rootDir->head = boot->RootCl; 398 if (dir->head == CLUST_FREE) 401 if (dir->head < CLUST_FIRST || dir->head >= boot->NumClusters) 403 physicalSize = fat[dir->head].length * boot->ClusterSize; 424 for (cl = dir->head; (sz += boot->ClusterSize) < dir->size;) 453 cl = dir->head; 541 cl = dir->head; 739 dirent.head 1019 reconnect(int dosfs, struct bootblock *boot, struct fatEntry *fat, cl_t head) argument [all...] |
/external/bluetooth/bluedroid/osi/src/ |
H A D | list.c | 12 list_node_t *head; member in struct:list_t 62 return list->head->data; 103 node->next = list->head; 105 list->head = node; 107 list->tail = list->head; 126 list->head = node; 148 if (list->head->data == data) { 149 list_node_t *next = list_free_node_(list, list->head); 150 if (list->tail == list->head) 152 list->head [all...] |
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
H A D | externs.js | 7 Document.prototype.documentElement.head;
|
/external/chromium_org/media/formats/common/ |
H A D | offset_byte_queue.cc | 25 DVLOG(4) << "Buffer pushed. head=" << head() << " tail=" << tail(); 40 DCHECK(offset >= head()); 41 if (offset < head() || offset >= tail()) { 46 *buf = &buf_[offset - head()];
|
/external/chromium_org/native_client_sdk/src/libraries/xray/ |
H A D | stringpool.c | 28 struct XRayStringPoolNode* head; member in struct:XRayStringPool 76 pool->head = XRayStringPoolAllocNode(); 77 pool->current = pool->head; 84 struct XRayStringPoolNode* n = pool->head;
|
/external/eigen/doc/examples/ |
H A D | Tutorial_BlockOperations_vector.cpp | 10 cout << "v.head(3) =" << endl << v.head(3) << endl << endl;
|
/external/ipsec-tools/src/racoon/ |
H A D | logger.h | 38 int head; member in struct:log
|
H A D | misc.h | 55 #define RACOON_TAILQ_FOREACH_REVERSE(var, head, headname ,field) \ 56 TAILQ_FOREACH_REVERSE(var, head, field, headname) 58 #define RACOON_TAILQ_FOREACH_REVERSE(var, head, headname ,field) \ 59 TAILQ_FOREACH_REVERSE(var, head, headname, field)
|
/external/jsilver/src/com/google/clearsilver/jsilver/data/ |
H A D | DefaultDataContext.java | 40 private LocalVariable head = null; field in class:DefaultDataContext 85 head = head.nextScope; 119 if (head == null && !newScope) { 127 // We only look at the first local variable (head) if it is part of the 132 // single scope and thus head may not be the only local variable in the 138 if (!newScope && head != null && name.equals(head.name)) { 140 head.isFirst = true; 141 head [all...] |
/external/llvm/utils/ |
H A D | GetRepositoryPath | 22 git remote -v | grep 'fetch' | awk '{ print $2 }' | head -n1
|
/external/srec/seti/sltsEngine/include/ |
H A D | linklist.h | 30 struct LNode *head; member in struct:LList
|
/external/qemu/util/ |
H A D | qemu-config.c | 9 .head = QTAILQ_HEAD_INITIALIZER(qemu_drive_opts.head), 89 .head = QTAILQ_HEAD_INITIALIZER(qemu_chardev_opts.head), 162 .head = QTAILQ_HEAD_INITIALIZER(qemu_fsdev_opts.head), 181 .head = QTAILQ_HEAD_INITIALIZER(qemu_virtfs_opts.head), 204 .head = QTAILQ_HEAD_INITIALIZER(qemu_device_opts.head), [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkRegionPriv.h | 68 RunHead* head = (RunHead*)sk_malloc_throw(sizeof(RunHead) + count * sizeof(RunType)); local 69 head->fRefCnt = 1; 70 head->fRunCount = count; 72 head->fYSpanCount = 0; 73 head->fIntervalCount = 0; 74 return head; 81 RunHead* head = Alloc(count); local 82 head->fYSpanCount = yspancount; 83 head->fIntervalCount = intervalCount; 84 return head; [all...] |
/external/skia/src/core/ |
H A D | SkRegionPriv.h | 68 RunHead* head = (RunHead*)sk_malloc_throw(sizeof(RunHead) + count * sizeof(RunType)); local 69 head->fRefCnt = 1; 70 head->fRunCount = count; 72 head->fYSpanCount = 0; 73 head->fIntervalCount = 0; 74 return head; 81 RunHead* head = Alloc(count); local 82 head->fYSpanCount = yspancount; 83 head->fIntervalCount = intervalCount; 84 return head; [all...] |
/external/blktrace/btt/ |
H A D | dip_rb.c | 69 struct list_head *head) 78 if (head) 79 list_add_tail(&this->f_head, head); 82 rb_foreach(n->rb_left, iop, fnc, head); 84 rb_foreach(n->rb_right, iop, fnc, head); 67 rb_foreach(struct rb_node *n, struct io *iop, void (*fnc)(struct io *iop, struct io *this), struct list_head *head) argument
|
/external/chromium_org/net/base/ |
H A D | address_list.cc | 61 AddressList AddressList::CreateFromAddrinfo(const struct addrinfo* head) { argument 62 DCHECK(head); 64 if (head->ai_canonname) 65 list.set_canonical_name(std::string(head->ai_canonname)); 66 for (const struct addrinfo* ai = head; ai; ai = ai->ai_next) {
|
/external/libsepol/src/ |
H A D | nodes.c | 152 ocontext_t *c, *head; local 155 head = policydb->ocontexts[OCON_NODE]; 156 for (c = head; c != NULL; c = c->next) 159 head = policydb->ocontexts[OCON_NODE6]; 160 for (c = head; c != NULL; c = c->next) 176 ocontext_t *c, *head; local 186 head = policydb->ocontexts[OCON_NODE]; 187 for (c = head; c; c = c->next) { 202 head = policydb->ocontexts[OCON_NODE6]; 203 for (c = head; 236 ocontext_t *c, *head; local 352 ocontext_t *c, *head; local [all...] |
H A D | interfaces.c | 115 ocontext_t *c, *head; local 120 head = policydb->ocontexts[OCON_NETIF]; 121 for (c = head; c; c = c->next) { 140 ocontext_t *c, *head; local 145 head = policydb->ocontexts[OCON_NETIF]; 146 for (c = head; c; c = c->next) { 172 ocontext_t *head, *prev, *c, *iface = NULL; local 181 head = policydb->ocontexts[OCON_NETIF]; 182 for (c = head; c; c = c->next) { 224 ocontext_t *c, *head; local 244 ocontext_t *c, *head; local [all...] |
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/dbgfmts/dwarf2/ |
H A D | dwarf2-dbgfmt.c | 193 dwarf2_head *head; local 196 head = yasm_xmalloc(sizeof(dwarf2_head)); 197 head->start_prevbc = yasm_section_bcs_last(sect); 199 bc = yasm_bc_create_common(&dwarf2_head_bc_callback, head, 0); 205 head->debug_ptr = debug_ptr; 208 head->debug_ptr = NULL; 210 head->with_address = with_address; 211 head->with_segment = with_segment; 217 head->end_prevbc = bc; 219 return head; 223 yasm_dwarf2__set_head_end(dwarf2_head *head, yasm_bytecode *end_prevbc) argument 257 dwarf2_head *head = (dwarf2_head *)bc->contents; local [all...] |
/external/smack/src/org/jivesoftware/smack/util/ |
H A D | Cache.java | 502 private LinkedListNode head = new LinkedListNode("head", null, null); field in class:Cache.LinkedList 508 head.next = head.previous = head; 517 LinkedListNode node = head.next; 518 if (node == head) { 530 LinkedListNode node = head.previous; 531 if (node == head) { 544 node.next = head [all...] |