/dalvik/vm/mterp/armv5te/ |
OP_GOTO_16.S | 16 bmi common_testUpdateProfile @ (r0) hot trace head?
|
/dalvik/vm/mterp/x86-atom/ |
OP_APUT_OBJECT.S | 53 movl %eax, sReg1 # save object head 70 movl sReg1, %edx # restore object head 71 shrl $$GC_CARD_SHIFT, %edx # object head to card number 72 movb %al, (%eax, %edx) # mark card using object head
|
/external/chromium/base/debug/ |
leak_tracker.h | 85 for (LinkNode<LeakTracker<T> >* node = instances()->head(); 113 for (LinkNode<LeakTracker<T> >* node = instances()->head();
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/builderTemplate/publishingFiles/staticDropFiles/ |
buildNotes.php | 2 <head>
25 </head>
|
/external/freetype/include/freetype/ |
fttypes.h | 565 FT_ListNode head; member in struct:FT_ListRec_ [all...] |
/external/fsck_msdos/ |
dosfs.h | 91 cl_t head; /* pointer to start of chain */ member in struct:fatEntry 128 cl_t head; /* cluster no */ member in struct:dosDirEntry
|
/external/ipsec-tools/src/racoon/ |
var.h | 99 #define LIST_FOREACH(elm, head, field) \ 100 for (elm = LIST_FIRST(head); elm; elm = LIST_NEXT(elm, field))
|
logger.c | 108 if (p->buf[p->head]) 109 racoon_free(p->buf[p->head]); 110 p->buf[p->head] = racoon_strdup(str); 111 p->tbuf[p->head] = time(NULL); 112 p->head++; 113 p->head %= p->siz; 195 j = (p->head + i) % p->siz;
|
/external/qemu/distrib/sdl-1.2.12/src/events/ |
SDL_events.c | 45 int head; member in struct:__anon10728 219 SDL_EventQ.head = 0; 268 if ( tail == SDL_EventQ.head ) { 291 if ( spot == SDL_EventQ.head ) { 292 SDL_EventQ.head = (SDL_EventQ.head+1)%MAXEVENTS; 293 return(SDL_EventQ.head); 343 spot = SDL_EventQ.head;
|
/external/webkit/Source/JavaScriptCore/wtf/ |
DoublyLinkedList.h | 37 Node* head(); 58 template <typename Node> inline Node* DoublyLinkedList<Node>::head() function in class:WTF::DoublyLinkedList
|
/external/libvpx/vpx_mem/ |
vpx_mem_tracker.c | 102 struct mem_block *head, member in struct:memory_tracker 163 Allocates the head of the list 169 if ((memtrack.head = (struct mem_block *) 174 MEM_TRACK_MEMSET(memtrack.head, 0, sizeof(struct mem_block)); 176 memtrack.tail = memtrack.head; 207 MEM_TRACK_FREE(memtrack.head); 208 memtrack.head = NULL; 233 struct mem_block *p = memtrack.head, 234 * p2 = memtrack.head; 246 memtrack.head = NULL [all...] |
/external/oprofile/libpp/ |
profile.cpp | 77 opd_header head = read_header(filename); local 79 if (head.version != OPD_VERSION) { 100 opd_header const & head = local 105 op_check_header(head, *file_header, filename); 107 file_header.reset(new opd_header(head));
|
/external/skia/src/core/ |
SkRegion_rects.cpp | 197 // fillout edge[] from rects[], sorted. Return the head, and set the tail 237 VEdge* tail, *head = (VEdge*)(edgePtr + edgeCount); 238 head = sort_edges(edgePtr, head, rects, rectCount, &tail); 240 if (NULL == head) { 250 headEdge.fNext = head; 253 head->fPrev = &headEdge; 260 int32_t currY = head->fTop; 263 while (head->fNext) { 264 VEdge* edge = head; [all...] |
/external/qemu/distrib/zlib-1.2.3/ |
inflate.c | 113 state->mode = HEAD; 117 state->head = Z_NULL; 589 case HEAD: 604 if (state->head != Z_NULL) 605 state->head->done = -1; 647 if (state->head != Z_NULL) 648 state->head->text = (int)((hold >> 8) & 1); 654 if (state->head != Z_NULL) 655 state->head->time = hold; 661 if (state->head != Z_NULL) [all...] |
/external/zlib/ |
inflate.c | 114 state->mode = HEAD; 118 state->head = Z_NULL; 644 case HEAD: 659 if (state->head != Z_NULL) 660 state->head->done = -1; 704 if (state->head != Z_NULL) 705 state->head->text = (int)((hold >> 8) & 1); 711 if (state->head != Z_NULL) 712 state->head->time = hold; 718 if (state->head != Z_NULL) [all...] |
/frameworks/native/libs/ui/ |
Region.cpp | 263 Rect* head; 269 : bounds(reg.mBounds), storage(reg.mStorage), head(), tail(), cur() { 313 if (tail-head == ssize_t(span.size())) { 315 Rect const* q = head; 329 Rect* r = head; 339 head = tail - span.size(); 452 Region::const_iterator head = dst.begin(); 456 if (head != tail) { 458 head->left != it.rect().fLeft || 459 head->top != it.rect().fTop || [all...] |
/external/mesa3d/src/glsl/glcpp/ |
glcpp-parse.y | 565 list->head = NULL; 581 if (list->head == NULL) { 582 list->head = node; 599 for (i = 0, node = list->head; node; i++, node = node->next) { 619 for (node = list->head; node; node = node->next) 636 for (node_a = a->head, node_b = b->head; 656 list->head = NULL; 672 if (list->head == NULL) { 673 list->head = node [all...] |
/external/openssl/ssl/ |
ssl_ciph.c | 663 static void ll_append_tail(CIPHER_ORDER **head, CIPHER_ORDER *curr, 667 if (curr == *head) 668 *head=curr->next; 679 static void ll_append_head(CIPHER_ORDER **head, CIPHER_ORDER *curr, 682 if (curr == *head) return; 689 (*head)->prev=curr; 690 curr->next= *head; 692 *head=curr; 855 CIPHER_ORDER *head) 869 ciph_curr = head; 927 CIPHER_ORDER *head, *tail, *curr, *curr2, *last; local 1361 CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr; local [all...] |
/external/chromium/third_party/libevent/ |
evrpc.c | 106 struct evrpc_hook_list *head = NULL; local 110 head = &base->in_hooks; 113 head = &base->out_hooks; 124 TAILQ_INSERT_TAIL(head, hook, next); 130 evrpc_remove_hook_internal(struct evrpc_hook_list *head, void *handle) 133 TAILQ_FOREACH(hook, head, next) { 135 TAILQ_REMOVE(head, hook, next); 152 struct evrpc_hook_list *head = NULL; local 155 head = &base->in_hooks; 158 head = &base->out_hooks [all...] |
/external/webkit/Source/WebKit/gtk/tests/ |
testdomdocument.c | 29 #define HTML_DOCUMENT_TITLE "<html><head><title>This is the title</title></head><body></body></html>" 33 #define HTML_DOCUMENT_LINKS "<html><head><title>Title</title></head><body><a href=\"about:blank\">blank</a><a href=\"http://www.google.com\">google</a><a href=\"http://www.webkit.org\">webkit</a></body></html>" 34 #define HTML_DOCUMENT_IFRAME "<html><head><title>IFrame</title></head><body><iframe id='iframe'></iframe><div id='test'></div></body></html>" 205 WebKitDOMHTMLHeadElement* head = webkit_dom_document_get_head(document); local 206 g_assert(head); 207 g_object_weak_ref(G_OBJECT(head), (GWeakNotify)weak_notify, &count); 230 head = webkit_dom_document_get_head(document) [all...] |
testdomnode.c | 29 #define HTML_DOCUMENT_HIERARCHY_NAVIGATION "<html><head><title>This is the title</title></head><body><p>1</p><p>2</p><p>3</p></body></html>" 67 WebKitDOMHTMLHeadElement* head; local 76 head = webkit_dom_document_get_head(document); 77 g_assert(head); 78 g_assert(WEBKIT_DOM_IS_HTML_HEAD_ELEMENT(head)); 80 /* Title, head's child */ 81 g_assert(webkit_dom_node_has_child_nodes(WEBKIT_DOM_NODE(head))); 82 list = webkit_dom_node_get_child_nodes(WEBKIT_DOM_NODE(head)); 89 /* Body, Head sibling * [all...] |
/external/tremolo/Tremolo/ |
bitwiseARM.s | 88 LDR r11,[r0,#12] @ r11= head = b->head 92 LDR r11,[r11,#12] @ r11= head = head->next 134 LDR r11,[r0,#12] @ r11 = head = b->head 138 LDR r11,[r11,#12] @ r11 = head->next 176 LDR r14,[r0,#12] @ r14= head 180 LDR r10,[r14,#8] @ r10= head->length 181 LDR r14,[r14,#12] @ r14= head->nex [all...] |
/bionic/libc/kernel/common/linux/sunrpc/ |
sched.h | 94 #define task_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, u.tk_wait.list)),1) 95 #define task_for_first(task, head) if (!list_empty(head) && ((task=list_entry((head)->next, struct rpc_task, u.tk_wait.list)),1)) 96 #define alltask_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, tk_task)),1)
|
/development/ndk/platforms/android-3/include/linux/sunrpc/ |
sched.h | 83 #define task_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, u.tk_wait.list)),1) 85 #define task_for_first(task, head) if (!list_empty(head) && ((task=list_entry((head)->next, struct rpc_task, u.tk_wait.list)),1)) 87 #define alltask_for_each(task, pos, head) list_for_each(pos, head) if ((task=list_entry(pos, struct rpc_task, tk_task)),1)
|
/external/kernel-headers/original/linux/sunrpc/ |
sched.h | 103 #define task_for_each(task, pos, head) \ 104 list_for_each(pos, head) \ 107 #define task_for_first(task, head) \ 108 if (!list_empty(head) && \ 109 ((task=list_entry((head)->next, struct rpc_task, u.tk_wait.list)),1)) 112 #define alltask_for_each(task, pos, head) \ 113 list_for_each(pos, head) \
|