| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| ContainerNodeAlgorithms.h | 72 void addChildNodesToDeletionQueue(GenericNode*& head, GenericNode*& tail, GenericNodeContainer&);
82 GenericNode* head = 0; local
85 Private::addChildNodesToDeletionQueue<GenericNode, GenericNodeContainer>(head, tail, container);
89 while ((n = head) != 0) {
95 head = next;
100 Private::addChildNodesToDeletionQueue<GenericNode, GenericNodeContainer>(head, tail, static_cast<GenericNodeContainer&>(*n));
156 void addChildNodesToDeletionQueue(GenericNode*& head, GenericNode*& tail, GenericNodeContainer& container)
179 head = n;
|
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLViewSourceDocument.cpp | 70 RefPtr<HTMLHeadElement> head = HTMLHeadElement::create(*this); local
71 html->parserAppendChild(head);
|
| /external/chromium_org/third_party/icu/source/common/ |
| ulist.c | 26 UListNode *head; member in struct:UList
49 newList->head = NULL;
64 list->head = newItem;
115 newItem->next = list->head;
116 list->head->previous = newItem;
117 list->head = newItem;
129 pointer = list->head;
170 list->curr = list->head;
180 listHead = list->head;
|
| /external/chromium_org/third_party/libevent/ |
| kqueue.c | 282 struct event_list *head = local
284 TAILQ_FOREACH(ev, head, ev_signal_next) {
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/pipebuffer/ |
| pb_bufmgr_cache.c | 70 struct list_head head; member in struct:pb_cache_buffer
112 LIST_DEL(&buf->head);
122 * Free as many cache buffers from the list head as possible.
136 buf = LIST_ENTRY(struct pb_cache_buffer, curr, head);
162 LIST_ADDTAIL(&buf->head, &mgr->delayed);
280 curr_buf = LIST_ENTRY(struct pb_cache_buffer, curr, head);
297 curr_buf = LIST_ENTRY(struct pb_cache_buffer, curr, head);
312 LIST_DEL(&buf->head);
367 buf = LIST_ENTRY(struct pb_cache_buffer, curr, head);
|
| pb_bufmgr_pool.c | 90 struct list_head head; member in struct:pool_buffer
114 LIST_ADD(&pool_buf->head, &pool->free);
220 pool_buf = LIST_ENTRY(struct pool_buffer, item, head);
307 LIST_ADDTAIL(&pool_buf->head, &pool->free);
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_debug_memory.c | 54 struct list_head head; member in struct:debug_memory_header
139 LIST_ADDTAIL(&hdr->head, &list);
173 LIST_DEL(&hdr->head);
243 LIST_REPLACE(&old_hdr->head, &new_hdr->head);
279 hdr = LIST_ENTRY(struct debug_memory_header, entry, head);
|
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/radeon/ |
| radeon_dma.c | 455 void *head; local
488 head = (rmesa->swtcl.bo->ptr + rmesa->dma.current_vertexptr);
491 return head;
|
| /external/chromium_org/third_party/openssl/openssl/crypto/evp/ |
| e_rc4_hmac_md5.c | 74 MD5_CTX head,tail,md; member in struct:__anon13662
94 MD5_Init(&key->head); /* handy when benchmarking */
95 key->tail = key->head;
96 key->md = key->head;
234 MD5_Init(&key->head);
235 MD5_Update(&key->head,ptr,arg);
236 MD5_Final(hmac_key,&key->head);
243 MD5_Init(&key->head);
244 MD5_Update(&key->head,hmac_key,sizeof(hmac_key));
265 key->md = key->head;
[all...] |
| /external/chromium_org/third_party/skia/include/core/ |
| SkTInternalLList.h | 144 * at the head.
174 T* head() { return fHead; } function in class:SkTInternalLList
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkDeque.cpp | 58 Block* head = fFrontBlock; local
61 while (head) {
62 Block* next = head->fNext;
63 if (head != initialHead) {
64 this->freeBlock(head);
66 head = next;
|
| /external/chromium_org/third_party/sqlite/src/src/ |
| rowset.c | 209 struct RowSetEntry head; local
212 pTail = &head;
235 return head.pRight;
275 struct RowSetEntry **ppFirst, /* Write head of the output list here */
298 ** node taken from the head of *ppList. A depth of 2 means a tree with
|
| /external/chromium_org/tools/telemetry/third_party/davclient/ |
| davclient.py | 117 def head(self, path, headers=None): member in class:DAVClient
118 """Basic HEAD request"""
119 self._request('HEAD', path, headers=headers)
|
| /external/chromium_org/v8/src/ |
| zone.cc | 131 // Update the head segment to be the kept segment (if any).
187 Segment* head = segment_head_; local
188 const size_t old_size = (head == NULL) ? 0 : head->size();
|
| /external/fsck_msdos/ |
| fat.c | 420 clearchain(struct bootblock *boot, struct fatEntry *fat, cl_t head)
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)
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 = CLUST_FIRST; head < boot->NumClusters; head++)
663 cl_t head; local
[all...] |
| /external/icu4c/common/ |
| ulist.c | 26 UListNode *head; member in struct:UList
49 newList->head = NULL;
64 list->head = newItem;
115 newItem->next = list->head;
116 list->head->previous = newItem;
117 list->head = newItem;
129 pointer = list->head;
170 list->curr = list->head;
180 listHead = list->head;
|
| /external/ipsec-tools/src/racoon/ |
| getcertsbyname.c | 128 struct certinfo head, *cur; local
136 memset(&head, 0, sizeof(head));
137 cur = &head;
191 *res = head.ci_next;
197 if (error && head.ci_next)
198 freecertinfo(head.ci_next);
215 struct certinfo head, *cur; local
221 memset(&head, 0, sizeof(head));
[all...] |
| proposal.h | 47 * head ---> prop[.......] ---> prop[...] ---> prop[...] ---> ...
68 struct saproto *head; member in struct:saprop
93 struct satrns *head; /* header of transform */ member in struct:saproto
127 * | (head) | (head)
129 * | | (head) | (head)
136 * | (head)
|
| /external/javassist/src/main/javassist/compiler/ast/ |
| ASTList.java | 55 public ASTree head() { return left; } method in class:ASTList
|
| /external/kernel-headers/original/linux/ |
| hidraw.h | 65 int head; member in struct:hidraw_list
|
| /external/kernel-headers/original/linux/mtd/ |
| nftl.h | 34 int head,sect,cyl; member in struct:NFTLrecord
|
| /external/libpcap/ |
| grammar.y | 155 %type <blk> head
296 head: pqual dqual aqual { QSET($$.q, $1, $2, $3); } label
303 rterm: head id { $$ = $2; }
|
| /external/mesa3d/src/gallium/auxiliary/pipebuffer/ |
| pb_bufmgr_cache.c | 70 struct list_head head; member in struct:pb_cache_buffer
112 LIST_DEL(&buf->head);
122 * Free as many cache buffers from the list head as possible.
136 buf = LIST_ENTRY(struct pb_cache_buffer, curr, head);
162 LIST_ADDTAIL(&buf->head, &mgr->delayed);
280 curr_buf = LIST_ENTRY(struct pb_cache_buffer, curr, head);
297 curr_buf = LIST_ENTRY(struct pb_cache_buffer, curr, head);
312 LIST_DEL(&buf->head);
367 buf = LIST_ENTRY(struct pb_cache_buffer, curr, head);
|
| pb_bufmgr_pool.c | 90 struct list_head head; member in struct:pool_buffer
114 LIST_ADD(&pool_buf->head, &pool->free);
220 pool_buf = LIST_ENTRY(struct pool_buffer, item, head);
307 LIST_ADDTAIL(&pool_buf->head, &pool->free);
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_debug_memory.c | 54 struct list_head head; member in struct:debug_memory_header
139 LIST_ADDTAIL(&hdr->head, &list);
173 LIST_DEL(&hdr->head);
243 LIST_REPLACE(&old_hdr->head, &new_hdr->head);
279 hdr = LIST_ENTRY(struct debug_memory_header, entry, head);
|
