/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | TreeScopeTest.cpp | 52 RefPtrWillBeRawPtr<Element> head = document->createElement("head", nullAtom, ASSERT_NO_EXCEPTION); local 53 html->appendChild(head); 57 RefPtrWillBeRawPtr<ShadowRoot> shadowRootA = head->createShadowRoot(ASSERT_NO_EXCEPTION); 75 RefPtrWillBeRawPtr<Element> head = document->createElement("head", nullAtom, ASSERT_NO_EXCEPTION); local 76 html->appendChild(head); 80 RefPtrWillBeRawPtr<ShadowRoot> shadowRootY = head->createShadowRoot(ASSERT_NO_EXCEPTION);
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
H A D | dso.h | 139 void dsos__add(struct list_head *head, struct dso *dso); 140 struct dso *dsos__find(struct list_head *head, const char *name, 142 struct dso *__dsos__findnew(struct list_head *head, const char *name); 143 bool __dsos__read_build_ids(struct list_head *head, bool with_hits); 145 size_t __dsos__fprintf_buildid(struct list_head *head, FILE *fp, 147 size_t __dsos__fprintf(struct list_head *head, FILE *fp);
|
H A D | vdso.c | 92 struct dso *vdso__dso_findnew(struct list_head *head) argument 94 struct dso *dso = dsos__find(head, VDSO__MAP_NAME, true); 105 dsos__add(head, dso);
|
/external/blktrace/btt/ |
H A D | trace_issue.c | 25 LIST_HEAD(head); 39 dip_foreach_list(d_iop, IOP_Q, &head); 40 list_for_each_safe(p, q, &head) {
|
/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
H A D | example-tuple.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 194 static RJ get(tuple<Head, Values...>& t) { return t.head(); } 195 static PJ get(const tuple<Head, Values...>& t) { return t.head(); } 224 return t.head() == u.head() && t.tail() == u.tail(); 236 return (t.head() < u.head() || (!( [all...] |
/external/libsepol/src/ |
H A D | ports.c | 148 ocontext_t *c, *head; local 151 head = policydb->ocontexts[OCON_PORT]; 152 for (c = head; c != NULL; c = c->next) 168 ocontext_t *c, *head; local 178 head = policydb->ocontexts[OCON_PORT]; 179 for (c = head; c; c = c->next) { 206 ocontext_t *c, *head; local 216 head = policydb->ocontexts[OCON_PORT]; 217 for (c = head; c; c = c->next) { 283 ocontext_t *c, *head; local [all...] |
/external/checkpolicy/ |
H A D | queue.h | 25 queue_node_ptr_t head; member in struct:queue_info
|
/external/chromium_org/media/formats/common/ |
H A D | offset_byte_queue.h | 17 // of many different meanings of "offset", "head", etc. 32 // It is an error if the offset is before the current head. It's not an error 42 // including the case where |max_offset| is less than the current head. 47 // The head and tail positions, in terms of the file's absolute offsets. 49 int64 head() { return head_; } function in class:media::OffsetByteQueue
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/ |
H A D | closebrackets.js | 47 var around = charsAround(cm, ranges[i].head); 51 var cur = ranges[i].head; 63 var range = ranges[i], cur = range.head, curType; 113 cm.getRange(range.head, Pos(range.head.line, range.head.ch + 1)) != right) 128 var around = charsAround(cm, ranges[i].head); 136 var line = ranges[i].head.line;
|
/external/chromium_org/third_party/WebKit/Source/platform/graphics/ |
H A D | Canvas2DLayerManager.cpp | 53 ASSERT(!m_layerList.head()); 84 Canvas2DLayerBridge* layer = m_layerList.head(); 97 if (layer != m_layerList.head()) { 152 return layer->prev() || m_layerList.head() == layer;
|
/external/chromium_org/third_party/libusb/src/libusb/ |
H A D | libusbi.h | 87 * head - list head 91 #define list_for_each_entry(pos, head, member, type) \ 92 for (pos = list_entry((head)->next, type, member); \ 93 &pos->member != (head); \ 96 #define list_for_each_entry_safe(pos, n, head, member, type) \ 97 for (pos = list_entry((head)->next, type, member), \ 99 &pos->member != (head); \ 109 static inline void list_add(struct list_head *entry, struct list_head *head) argument 111 entry->next = head 118 list_add_tail(struct list_head *entry, struct list_head *head) argument [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
H A D | memory_pool.h | 38 unsigned char * head; member in struct:memory_pool
|
/external/chromium_org/third_party/mesa/src/src/glsl/ |
H A D | ir_function.cpp | 43 const exec_node *node_a = list_a->head; 44 const exec_node *node_b = list_b->head; 183 const exec_node *node_a = list_a->head; 184 const exec_node *node_b = list_b->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/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
H A D | ListSubListTester.java | 212 List<E> head = list.subList(0, size - 1); 218 assertEquals(list.get(0), head.get(0)); 219 assertEquals(list.get(size - 2), head.get(size - 2)); 220 for (List<E> subList : Arrays.asList(copy, head, tail)) { 236 List<E> head = list.subList(0, size - 1); 239 assertTrue(head.contains(list.get(0))); 243 assertTrue(head.contains(list.get(size - 2))); 245 assertFalse(head.contains(list.get(size - 1))); 254 List<E> head = list.subList(0, size - 1); 258 assertEquals(head [all...] |
/external/harfbuzz_ng/src/ |
H A D | check-includes.sh | 17 grep '#.*\<include\>' "$x" /dev/null | head -n 1 30 grep '#.*\<include\>' "$x" /dev/null | head -n 1
|
/external/libcap-ng/libcap-ng-0.7/utils/ |
H A D | proc-llist.h | 43 /* This is the linked list head. Only data elements that are 1 per 46 lnode *head; // List head member in struct:__anon23579
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | memory_pool.h | 38 unsigned char * head; member in struct:memory_pool
|
/external/mesa3d/src/glsl/ |
H A D | ir_function.cpp | 43 const exec_node *node_a = list_a->head; 44 const exec_node *node_b = list_b->head; 183 const exec_node *node_a = list_a->head; 184 const exec_node *node_b = list_b->head;
|
/external/valgrind/main/coregrind/m_scheduler/ |
H A D | ticket-lock-linux.c | 59 volatile unsigned head; member in struct:sched_lock 85 p->head = 0; 108 * value as the ticket value. Wait until the head of the queue equals the 131 if (ticket == p->head) 153 * Release a ticket lock by incrementing the head of the queue. Only generate 157 * Note: tail will only be read after head has been incremented since both are 170 wakeup_ticket = __sync_fetch_and_add(&p->head, 1) + 1;
|
/external/chromium_org/third_party/icu/source/common/ |
H A D | 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/icu/icu4c/source/common/ |
H A D | 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/ |
H A D | proposal.c | 105 inssaprop(head, new) 106 struct saprop **head; 111 if (*head == NULL) { 112 *head = new; 116 for (p = *head; p->next; p = p->next) 131 for (p = pp->head; p && p->next; p = p->next) 134 pp->head = new; 147 new->next = pp->head; 148 pp->head = new; 173 for (tr = pr->head; t [all...] |
/external/lldb/source/Core/ |
H A D | ConnectionMachPort.cpp | 28 mach_msg_header_t head; member in struct:MessageType 272 message.head.msgh_bits = MACH_MSGH_BITS_REMOTE (MACH_MSG_TYPE_MAKE_SEND) | 274 message.head.msgh_size = sizeof(MessageType); 275 message.head.msgh_local_port = MACH_PORT_NULL; 276 message.head.msgh_remote_port = m_port; 291 kern_return_t kret = ::mach_msg (&message.head, 293 message.head.msgh_size, 306 message.head.msgh_size = sizeof(MessageType); 308 kern_return_t kret = ::mach_msg (&message.head,
|