/external/sfntly/cpp/src/sfntly/ |
H A D | tag.h | 34 static const int32_t head; member in struct:sfntly::Tag
|
/external/skia/include/core/ |
H A D | SkTInternalLList.h | 144 * at the head. 174 T* head() { return fHead; } function in class:SkTInternalLList
|
/external/skia/src/core/ |
H A D | 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/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...] |
/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/zlib/src/test/ |
H A D | infcover.c | 291 gz_header head; local 303 head.extra = out; 304 head.extra_max = len; 305 head.name = out; 306 head.name_max = len; 307 head.comment = out; 308 head.comm_max = len; 309 ret = inflateGetHeader(&strm, &head); assert(ret == Z_OK);
|
/external/bison/lib/ |
H A D | bitset.h | 70 struct lbitset_elt_struct *head; /* First element in linked list. */ member in struct:bitset_union::lbitset_struct
|
/external/bison/src/ |
H A D | reader.c | 84 merger_list head; 90 head.next = merge_functions; 91 for (syms = &head, n = 1; syms->next; syms = syms->next, n += 1) 102 merge_functions = head.next; 82 merger_list head; local
|
/external/chromium_org/chrome/renderer/ |
H A D | chrome_render_view_observer.cc | 118 WebElement head = document.isNull() ? WebElement() : document.head(); local 124 if (!head.isNull()) { 125 WebNodeList children = head.childNodes(); 453 WebElement head = frame->document().head(); 454 if (head.isNull() || !head.hasChildNodes()) 460 WebNodeList children = head.childNodes();
|
/external/chromium_org/components/translate/content/renderer/ |
H A D | translate_helper.cc | 332 WebElement head = document->head(); local 333 if (head.isNull() || !head.hasChildNodes()) 342 WebNodeList children = head.childNodes();
|
/external/chromium_org/content/browser/renderer_host/p2p/ |
H A D | socket_host_tcp.cc | 437 char* head = read_buffer_->StartOfBuffer(); // Purely a convenience. local 440 int consumed = ProcessInput(head + pos, read_buffer_->offset() - pos); 446 // bytes to the head of the buffer and set offset to reflect this. 448 memmove(head, head + pos, read_buffer_->offset() - pos);
|
/external/chromium_org/net/base/ |
H A D | nss_memio.c | 28 int head; /* where to take next byte out of buf */ member in struct:memio_buffer 92 mb->head = 0; 104 mb->head = 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); 170 memcpy(buf, &mb->buf[mb->head], le [all...] |
/external/chromium_org/sandbox/linux/seccomp-bpf/ |
H A D | codegen.cc | 277 BasicBlock* CodeGen::MakeBasicBlock(Instruction* head, Instruction* tail) { argument 278 // Iterate over all the instructions between "head" and "tail" and 281 for (;; head = head->next) { 282 bb->instructions.push_back(head); 283 if (head == tail) { 286 if (BPF_CLASS(head->code) == BPF_JMP) { 294 void CodeGen::AddBasicBlock(Instruction* head, argument 301 BranchTargets::const_iterator iter = branch_targets.find(head); 308 BasicBlock* bb = MakeBasicBlock(head, tai 328 Instruction* head = instructions; local [all...] |
/external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
H A D | HTMLConstructionSite.h | 195 Element* head() const { return m_head->element(); } function in class:blink::FINAL
|
/external/chromium_org/third_party/WebKit/Source/web/ |
H A D | WebDocument.cpp | 148 WebElement WebDocument::head() function in class:blink::WebDocument 150 return WebElement(unwrap<Document>()->head());
|
/external/chromium_org/third_party/libvpx/source/libvpx/vpx_mem/ |
H A D | vpx_mem_tracker.c | 98 struct mem_block *head, member in struct:memory_tracker 156 Allocates the head of the list 160 if ((memtrack.head = (struct mem_block *) 164 MEM_TRACK_MEMSET(memtrack.head, 0, sizeof(struct mem_block)); 166 memtrack.tail = memtrack.head; 193 MEM_TRACK_FREE(memtrack.head); 194 memtrack.head = NULL; 215 struct mem_block *p = memtrack.head, 216 * p2 = memtrack.head; 227 memtrack.head [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/pipebuffer/ |
H A D | pb_buffer_fenced.c | 122 struct list_head head; member in struct:fenced_buffer 209 fenced_buf = LIST_ENTRY(struct fenced_buffer, curr, head); 224 fenced_buf = LIST_ENTRY(struct fenced_buffer, curr, head); 250 assert(fenced_buf->head.prev); 251 assert(fenced_buf->head.next); 252 LIST_DEL(&fenced_buf->head); 278 LIST_DEL(&fenced_buf->head); 281 LIST_ADDTAIL(&fenced_buf->head, &fenced_mgr->fenced); 304 assert(fenced_buf->head.prev); 305 assert(fenced_buf->head [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/egl/common/ |
H A D | native_helper.c | 61 unsigned int head; member in struct:resource_surface 324 screen->fence_reference(screen, &rsurf->swap_fences[rsurf->head++], 326 rsurf->head &= EGL_SWAP_FENCES_MASK;
|
/external/chromium_org/third_party/mesa/src/src/glx/ |
H A D | dri_common.c | 357 struct glx_config head, *tail, *m; local 359 tail = &head; 360 head.next = NULL; 372 return head.next;
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkTLList.h | 112 iterator refers to a NULL location then the new element is added at the head */ 117 /** Convenience methods for getting an iterator initialized to the head/tail of the list. */ 121 T* head() { return Iter(*this, Iter::kHead_IterStart).get(); } function in class:SkTLList 123 const T* head() const { return Iter(*this, Iter::kHead_IterStart).get(); } function in class:SkTLList 128 Node* node = fList.head(); 137 Node* node = fList.head(); 194 //!< Start the iterator at the head of the list. 245 Node* node = fFreeList.head();
|
/external/chromium_org/third_party/tcmalloc/chromium/src/base/ |
H A D | low_level_alloc.cc | 135 // Return "atleast", the first element of AllocList *head s.t. *atleast >= *e. 136 // For 0 <= i < head->levels, set prev[i] to "no_greater", where no_greater 138 // head if no such element exists. 139 static AllocList *LLA_SkiplistSearch(AllocList *head, argument 141 AllocList *p = head; 142 for (int level = head->levels - 1; level >= 0; level--) { 147 return (head->levels == 0) ? 0 : prev[0]->next[0]; 150 // Insert element *e into AllocList *head. Set prev[] as LLA_SkiplistSearch. 153 static void LLA_SkiplistInsert(AllocList *head, AllocList *e, argument 155 LLA_SkiplistSearch(head, 168 LLA_SkiplistDelete(AllocList *head, AllocList *e, AllocList **prev) argument [all...] |
/external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
H A D | low_level_alloc.cc | 135 // Return "atleast", the first element of AllocList *head s.t. *atleast >= *e. 136 // For 0 <= i < head->levels, set prev[i] to "no_greater", where no_greater 138 // head if no such element exists. 139 static AllocList *LLA_SkiplistSearch(AllocList *head, argument 141 AllocList *p = head; 142 for (int level = head->levels - 1; level >= 0; level--) { 147 return (head->levels == 0) ? 0 : prev[0]->next[0]; 150 // Insert element *e into AllocList *head. Set prev[] as LLA_SkiplistSearch. 153 static void LLA_SkiplistInsert(AllocList *head, AllocList *e, argument 155 LLA_SkiplistSearch(head, 168 LLA_SkiplistDelete(AllocList *head, AllocList *e, AllocList **prev) argument [all...] |
/external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
H A D | bc-data.c | 560 yasm_dvs_print(const yasm_datavalhead *head, FILE *f, int indent_level) argument 565 STAILQ_FOREACH(cur, head, link) {
|
/external/chromium_org/third_party/zlib/ |
H A D | inflate.h | 90 gz_headerp head; /* where to save gzip header information */ member in struct:inflate_state
|
/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
H A D | example-bind.cpp | 74 : m_head(other.head()), inherited(other.tail()) { } 78 m_head = other.head(); 83 typename add_reference<Head>::type head() { return m_head; } function in class:tuple 84 typename add_reference<const Head>::type head() const { return m_head; } function in class:tuple 151 static RJ get(tuple<Head, Values...>& t) { return t.head(); } 152 static PJ get(const tuple<Head, Values...>& t) { return t.head(); } 172 return t.head() == u.head() && t.tail() == u.tail(); 184 return (t.head() < u.head() || (!( [all...] |