/macosx-10.9.5/WebKit-7537.78.2/mac/Misc/ |
H A D | MailQuirksUserScript.js | 36 // <head> node if not explicitly specified in content. Remove this implicit 37 // <head> so that Mail.app's assumption remains true. 38 if (document.head && !document.head.childNodes.length && !document.head.attributes.length) 39 document.documentElement.removeChild(document.head);
|
H A D | OutlookQuirksUserScript.js | 27 // <html><head></head><body></body></html> 28 if (document.documentElement.outerHTML != "<html><head></head><body></body></html>") 33 document.documentElement.removeChild(document.head);
|
/macosx-10.9.5/ncurses-42/ncurses/ncurses/ |
H A D | fifo_defs.h | 43 #define head sp->_fifohead macro 48 #define h_inc() { head == FIFO_SIZE-1 ? head = 0 : head++; if (head == tail) head = -1, tail = 0;} 49 #define h_dec() { head == 0 ? head = FIFO_SIZE-1 : head--; if (head [all...] |
/macosx-10.9.5/Heimdal-323.92.1/lib/gssapi/mech/ |
H A D | mechqueue.h | 45 #define HEIM_SLIST_HEAD_INITIALIZER(head) \ 56 #define HEIM_SLIST_INIT(head) do { \ 57 (head)->slh_first = NULL; \ 65 #define HEIM_SLIST_INSERT_HEAD(head, elm, field) do { \ 66 (elm)->field.sle_next = (head)->slh_first; \ 67 (head)->slh_first = (elm); \ 70 #define HEIM_SLIST_REMOVE_HEAD(head, field) do { \ 71 (head)->slh_first = (head)->slh_first->field.sle_next; \ 74 #define HEIM_SLIST_REMOVE(head, el [all...] |
/macosx-10.9.5/OpenLDAP-491.1/OpenLDAP/include/ |
H A D | ldap_queue.h | 67 * added to the list after an existing element or at the head of the list. 68 * Elements being removed from the head of the list should use the explicit 75 * head of the list and the other to the tail of the list. The elements are 78 * to the list after an existing element, at the head of the list, or at the 79 * end of the list. Elements being removed from the head of the tail queue 89 * or after an existing element or at the head of the list. A list 92 * A tail queue is headed by a pair of pointers, one to the head of the 96 * after an existing element, at the head of the list, or at the end of 99 * A circle queue is headed by a pair of pointers, one to the head of the 103 * an existing element, at the head o [all...] |
/macosx-10.9.5/llvmCore-3425.0.33/utils/ |
H A D | findsym.pl | 24 my $head = 0; 28 if (!$head) { print "$lib:\n"; $head = 1; }
|
/macosx-10.9.5/Heimdal-323.92.1/base/ |
H A D | heimqueue.h | 47 #define HEIM_TAILQ_HEAD_INITIALIZER(head) \ 48 { NULL, &(head).tqh_first } 59 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \ 60 if ((head)->tqh_first && \ 61 (head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \ 62 panic("HEIM_TAILQ_INSERT_HEAD %p %s:%d", (head), __FILE__, __LINE__); 63 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) \ 64 if (*(head)->tqh_last != NULL) \ 65 panic("HEIM_TAILQ_INSERT_TAIL %p %s:%d", (head), __FILE_ [all...] |
/macosx-10.9.5/Heimdal-323.92.1/lib/asn1/ |
H A D | asn1_queue.h | 47 #define ASN1_TAILQ_HEAD_INITIALIZER(head) \ 48 { NULL, &(head).tqh_first } 59 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \ 60 if ((head)->tqh_first && \ 61 (head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \ 62 panic("ASN1_TAILQ_INSERT_HEAD %p %s:%d", (head), __FILE__, __LINE__); 63 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \ 64 if (*(head)->tqh_last != NULL) \ 65 panic("ASN1_TAILQ_INSERT_TAIL %p %s:%d", (head), __FILE_ [all...] |
/macosx-10.9.5/BerkeleyDB-21/db/dbinc/ |
H A D | queue.h | 51 * added to the list after an existing element or at the head of the list. 52 * Elements being removed from the head of the list should use the explicit 59 * head of the list and the other to the tail of the list. The elements are 62 * to the list after an existing element, at the head of the list, or at the 63 * end of the list. Elements being removed from the head of the tail queue 73 * or after an existing element or at the head of the list. A list 76 * A tail queue is headed by a pair of pointers, one to the head of the 80 * after an existing element, at the head of the list, or at the end of 184 /* Store the last 2 places the queue element or head was altered */ 195 #define QMD_TRACE_HEAD(head) d [all...] |
H A D | shqueue.h | 109 #define SH_LIST_HEAD_INITIALIZER(head) \ 121 #define SH_LIST_EMPTY(head) \ 122 ((head)->slh_first == -1) 124 #define SH_LIST_FIRSTP(head, type) \ 125 ((struct type *)(((u_int8_t *)(head)) + (head)->slh_first)) 127 #define SH_LIST_FIRST(head, type) \ 128 (SH_LIST_EMPTY(head) ? NULL : \ 129 ((struct type *)(((u_int8_t *)(head)) + (head) [all...] |
/macosx-10.9.5/OpenSSH-186/openssh/openbsd-compat/ |
H A D | sys-queue.h | 131 * added to the list after an existing element or at the head of the list. 132 * Elements being removed from the head of the list should use the explicit 142 * or after an existing element or at the head of the list. A list 145 * A simple queue is headed by a pair of pointers, one the head of the 148 * head of the list. New elements can be added to the list before or after 149 * an existing element, at the head of the list, or at the end of the 152 * A tail queue is headed by a pair of pointers, one to the head of the 156 * after an existing element, at the head of the list, or at the end of 159 * A circle queue is headed by a pair of pointers, one to the head of the 163 * an existing element, at the head o [all...] |
H A D | sys-tree.h | 84 #define SPLAY_ROOT(head) (head)->sph_root 85 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) 88 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ 89 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \ 90 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ 91 (head)->sph_root = tmp; \ 94 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ 95 SPLAY_RIGHT((head) [all...] |
/macosx-10.9.5/xnu-2422.115.4/bsd/sys/ |
H A D | queue.h | 69 * added to the list after an existing element or at the head of the list. 70 * Elements being removed from the head of the list should use the explicit 77 * head of the list and the other to the tail of the list. The elements are 80 * to the list after an existing element, at the head of the list, or at the 81 * end of the list. Elements being removed from the head of the tail queue 91 * or after an existing element or at the head of the list. A list 94 * A tail queue is headed by a pair of pointers, one to the head of the 98 * after an existing element, at the head of the list, or at the end of 101 * A circle queue is headed by a pair of pointers, one to the head of the 105 * an existing element, at the head o 809 *head = (struct quehead *)b; local [all...] |
/macosx-10.9.5/ipsec-258.100.1/ipsec-tools/racoon/ |
H A D | genlist.h | 49 /* This function returns an initialized list head. */ 53 struct genlist_entry *genlist_insert (struct genlist *head, void *data); 54 struct genlist_entry *genlist_append (struct genlist *head, void *data); 65 void *genlist_foreach (struct genlist *head, genlist_func_t func, void *arg); 67 /* Get first entry in list if head is not NULL, otherwise get next 70 void *genlist_next (struct genlist *head, struct genlist_entry **buf); 76 /* Free all storage associated with list at head using func to free any 78 void genlist_free (struct genlist *head, genlist_freedata_t func);
|
H A D | genlist.c | 48 genlist_insert (struct genlist *head, void *data) argument 52 TAILQ_INSERT_HEAD(head, entry, chain); 57 genlist_append (struct genlist *head, void *data) argument 61 TAILQ_INSERT_TAIL(head, entry, chain); 66 genlist_foreach (struct genlist *head, genlist_func_t func, void *arg) argument 70 TAILQ_FOREACH(p, head, chain) { 80 genlist_next (struct genlist *head, struct genlist_entry **buf) argument 84 if (head) 85 p = TAILQ_FIRST(head); 94 genlist_free (struct genlist *head, genlist_freedata_ argument [all...] |
/macosx-10.9.5/xnu-2422.115.4/tools/tests/xnu_quick_test/ |
H A D | atomic_fifo_queue_test.c | 14 OSFifoQueueHead head = OS_ATOMIC_FIFO_QUEUE_INIT; local 17 OSAtomicFifoEnqueue(&head, &node1, 0); 19 OSAtomicFifoEnqueue(&head, &node2, 0); 20 QueueNode *node_ptr = OSAtomicFifoDequeue(&head, 0); 25 node_ptr = OSAtomicFifoDequeue(&head, 0);
|
/macosx-10.9.5/postfix-252/postfix/src/global/ |
H A D | scache_multi.c | 83 * Storage for a destination or endpoint list head. Each list head knows its 85 * empty. List items are stored in a circular list under the list head. 97 * circular list, whose list head specifies the destination. 101 SCACHE_MULTI_HEAD *head; /* parent linkage: list head */ member in struct:__anon11783 112 * circular list, whose list head specifies the endpoint. 116 SCACHE_MULTI_HEAD *head; /* parent linkage: list head */ member in struct:__anon11784 139 SCACHE_MULTI_HEAD *head; local 184 SCACHE_MULTI_HEAD *head = (SCACHE_MULTI_HEAD *) ptr; local 207 SCACHE_MULTI_HEAD *head; local 253 SCACHE_MULTI_HEAD *head; local 294 SCACHE_MULTI_HEAD *head; local 337 SCACHE_MULTI_HEAD *head = (SCACHE_MULTI_HEAD *) ptr; local 361 SCACHE_MULTI_HEAD *head; local 420 SCACHE_MULTI_HEAD *head; local [all...] |
/macosx-10.9.5/ICU-511.35/icuSources/layout/ |
H A D | LEInsertionList.cpp | 26 : head(NULL), tail(NULL), growAmount(0), append(rightToLeft) 28 tail = (InsertionRecord *) &head; 38 while (head != NULL) { 39 InsertionRecord *record = head; 41 head = head->next; 45 tail = (InsertionRecord *) &head; 78 insertion->next = head; 79 head = insertion; 87 for (InsertionRecord *rec = head; re [all...] |
/macosx-10.9.5/JavaScriptCore-7537.78.1/heap/ |
H A D | MarkStackInlines.h | 42 ASSERT(result == m_segments.head()->m_top++); 49 ASSERT(result == --m_segments.head()->m_top); 55 ASSERT(m_segments.head()->m_top == s_segmentCapacity); 61 ASSERT(!m_segments.head()->m_top); 67 ASSERT(m_top == m_segments.head()->m_top); 77 for (MarkStackSegment* current = m_segments.head(); current; current = current->next()) 87 m_segments.head()->data()[postIncTop()] = cell; 97 return m_segments.head()->data()[preDecTop()]; 104 if (m_segments.head()->next()) { 105 ASSERT(m_segments.head() [all...] |
/macosx-10.9.5/curl-78.94.1/curl/tests/unit/ |
H A D | unit1300.c | 61 struct curl_llist_element *head; variable in typeref:struct:curl_llist_element 74 * 2: list head will be NULL 80 fail_unless(llist->head == NULL, "list head should initiate to NULL"); 91 * 2: list head will hold the data "unusedData_case1" 92 * 3: list tail will be the same as list head 95 curlErrCode = Curl_llist_insert_next(llist, llist->head, &unusedData_case1); 99 /*test that the list head data holds my unusedData */ 100 fail_unless(llist->head->ptr == &unusedData_case1, 103 fail_unless(llist->tail == llist->head, [all...] |
/macosx-10.9.5/xnu-2422.115.4/osfmk/kern/ |
H A D | queue.h | 120 /* Enqueue element to head of queue */ 130 /* Dequeue element from head of queue */ 344 #define queue_enter(head, elt, type, field) \ 348 __prev = (head)->prev; \ 349 if ((head) == __prev) { \ 350 (head)->next = (queue_entry_t) (elt); \ 357 (elt)->field.next = head; \ 358 (head)->prev = (queue_entry_t) elt; \ 364 * Insert a new element at the head of the queue. 372 #define queue_enter_first(head, el 624 struct queue_entry head; /* header for queue */ member in struct:mpqueue_head [all...] |
/macosx-10.9.5/WebCore-7537.78.1/inspector/ |
H A D | combine-javascript-resources.pl | 27 # the script tags in the head of an input HTML file. 59 $htmlContents =~ m/<head>(.*)<\/head>/si; 77 $htmlContents =~ s/<head>.*<\/head>/<head>$headContents<\/head>/si;
|
/macosx-10.9.5/ruby-104/ruby/benchmark/ |
H A D | bm_app_erb.rb | 19 <head> <%= title %> </head>
|
/macosx-10.9.5/BerkeleyDB-21/db/env/ |
H A D | env_alloc.c | 99 #define SET_QUEUE_FOR_SIZE(head, q, i, len) do { \ 101 q = &(head)->sizeq[i]; \ 121 ALLOC_LAYOUT *head; local 134 head = infop->addr; 135 memset(head, 0, sizeof(*head)); 136 SH_TAILQ_INIT(&head->addrq); 138 SH_TAILQ_INIT(&head->sizeq[i]); 139 COMPQUIET(head->unused, 0); 144 elp = (ALLOC_ELEMENT *)((u_int8_t *)head 204 ALLOC_LAYOUT *head; local 348 ALLOC_LAYOUT *head; local 472 ALLOC_LAYOUT *head; local [all...] |
/macosx-10.9.5/xnu-2422.115.4/libkern/libkern/ |
H A D | tree.h | 106 #define SPLAY_ROOT(head) (head)->sph_root 107 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL) 110 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \ 111 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \ 112 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \ 113 (head)->sph_root = tmp; \ 116 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \ 117 SPLAY_RIGHT((head) [all...] |