| /external/yaffs2/yaffs2/ |
| 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)
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)
[all...] |
| /external/chromium_org/content/browser/resources/media/ |
| tab_view.js | 19 this.ACTIVE_TAB_HEAD_CLASS_ = 'active-tab-head';
21 this.TAB_HEAD_CLASS_ = 'tab-head';
36 // Creates a simple object containing the tab head and body elements.
38 this.head = h;
53 var head = document.createElement('div');
54 head.className = this.TAB_HEAD_CLASS_;
55 head.textContent = id;
56 head.title = title;
57 this.headBar_.appendChild(head);
58 head.addEventListener('click', this.switchTab_.bind(this, id))
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| list.h | 28 * Each doubly-linked list has a sentinel head and tail node. These nodes
29 * contain no data. The head sentinel can be identified by its \c prev
33 * A list is empty if either the head sentinel's \c next pointer points to the
34 * tail sentinel or the tail sentinel's \c prev poiner points to the head
43 * - A \c head pointer that represents the \c next pointer of the
44 * head sentinel node.
45 * - A \c tail pointer that represents the \c prev pointer of the head
51 * Therefore, if \c head->next is \c NULL or \c tail_prev->prev is \c NULL,
191 * Is this the sentinel at the head of the list?
283 struct exec_node *head; member in struct:exec_list
[all...] |
| /external/clang/test/SemaTemplate/ |
| example-typelist.cpp | 7 template<typename Head, typename Tail = nil>
9 typedef Head head; typedef in struct:cons
27 template<typename Head, typename Tail>
28 struct length<cons<Head, Tail> > {
55 typedef cons<typename reversed_tail::head,
56 typename reverse<cons<typename T::head, most_of_tail> >::type> type;
59 template<typename Head>
60 class reverse<cons<Head> > {
62 typedef cons<Head> type
[all...] |
| /external/llvm/test/Transforms/LICM/ |
| 2007-09-17-PromoteValue.ll | 28 br label %loop.head
30 loop.head: ; preds = %cond.true, %entry
35 cond.true: ; preds = %loop.head
38 br label %loop.head
40 exit: ; preds = %loop.head
46 br label %loop.head
48 loop.head: ; preds = %cond.true, %entry
52 cond.true: ; preds = %loop.head
55 br label %loop.head
57 exit: ; preds = %loop.head
[all...] |
| /external/mesa3d/src/glsl/ |
| list.h | 28 * Each doubly-linked list has a sentinel head and tail node. These nodes
29 * contain no data. The head sentinel can be identified by its \c prev
33 * A list is empty if either the head sentinel's \c next pointer points to the
34 * tail sentinel or the tail sentinel's \c prev poiner points to the head
43 * - A \c head pointer that represents the \c next pointer of the
44 * head sentinel node.
45 * - A \c tail pointer that represents the \c prev pointer of the head
51 * Therefore, if \c head->next is \c NULL or \c tail_prev->prev is \c NULL,
191 * Is this the sentinel at the head of the list?
283 struct exec_node *head; member in struct:exec_list
[all...] |
| /external/chromium/base/ |
| linked_list_unittest.cc | 34 // Checks that when iterating |list| (either from head to tail, or from
35 // tail to head, as determined by |forward|), we get back |node_ids|,
40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail());
55 SCOPED_TRACE("Iterating forward (from head to tail)");
59 SCOPED_TRACE("Iterating backward (from tail to head)");
66 EXPECT_EQ(list.end(), list.head());
78 EXPECT_EQ(&n1, list.head());
88 EXPECT_EQ(&n1, list.head());
98 EXPECT_EQ(&n1, list.head());
121 EXPECT_EQ(&n1, list.head());
[all...] |
| /external/chromium_org/base/containers/ |
| linked_list_unittest.cc | 34 // Checks that when iterating |list| (either from head to tail, or from
35 // tail to head, as determined by |forward|), we get back |node_ids|,
40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail());
55 SCOPED_TRACE("Iterating forward (from head to tail)");
59 SCOPED_TRACE("Iterating backward (from tail to head)");
66 EXPECT_EQ(list.end(), list.head());
78 EXPECT_EQ(&n1, list.head());
88 EXPECT_EQ(&n1, list.head());
98 EXPECT_EQ(&n1, list.head());
121 EXPECT_EQ(&n1, list.head());
[all...] |
| /external/compiler-rt/lib/interception/ |
| interception_win.cc | 66 // the wrapper, so we need to keep the leading 5+ bytes ('head') of the
67 // original instructions somewhere with a "jmp old_func+head".
68 // We call these 'head'+5 bytes of instructions a "trampoline".
88 // island and store it in 'head'.
89 size_t head = 0; local
90 while (head < 5) {
91 switch (old_bytes[head]) {
95 head++;
98 switch (*(unsigned short*)(old_bytes + head)) { // NOLINT
102 head += 2
[all...] |
| /device/asus/flo/camera/QCamera2/stack/common/ |
| cam_queue.h | 38 cam_node_t head; /* dummy head */ member in struct:__anon1634
46 cam_list_init(&queue->head.list);
63 cam_list_add_tail_node(&node->list, &queue->head.list);
74 struct cam_list *head = NULL; local
78 head = &queue->head.list;
79 pos = head->next;
80 if (pos != head) {
98 struct cam_list *head = NULL local
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| linked_list.h | 62 // Remove N elements from a linked list to which head points. head will be
63 // modified to point to the new head. start and end will point to the first
66 inline void SLL_PopRange(void **head, int N, void **start, void **end) {
73 void *tmp = *head;
78 *start = *head;
80 *head = SLL_Next(tmp);
85 inline void SLL_PushRange(void **head, void *start, void *end) {
87 SLL_SetNext(end, *head);
88 *head = start
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| linked_list.h | 62 // Remove N elements from a linked list to which head points. head will be
63 // modified to point to the new head. start and end will point to the first
66 inline void SLL_PopRange(void **head, int N, void **start, void **end) {
73 void *tmp = *head;
78 *start = *head;
80 *head = SLL_Next(tmp);
85 inline void SLL_PushRange(void **head, void *start, void *end) {
87 SLL_SetNext(end, *head);
88 *head = start
[all...] |
| /hardware/qcom/camera/QCamera2/stack/common/ |
| cam_queue.h | 38 cam_node_t head; /* dummy head */ member in struct:__anon31252
46 cam_list_init(&queue->head.list);
63 cam_list_add_tail_node(&node->list, &queue->head.list);
74 struct cam_list *head = NULL; local
78 head = &queue->head.list;
79 pos = head->next;
80 if (pos != head) {
98 struct cam_list *head = NULL local
[all...] |
| /libcore/luni/src/main/java/java/lang/ref/ |
| ReferenceQueue.java | 30 private Reference<? extends T> head; field in class:ReferenceQueue
47 if (head == null) {
53 ret = head;
55 if (head == head.queueNext) {
56 head = null;
58 head = head.queueNext;
95 if (head != null) {
103 } while (head == null)
[all...] |
| /bionic/libc/kernel/common/linux/ |
| notifier.h | 34 struct notifier_block *head; member in struct:atomic_notifier_head
39 struct notifier_block *head; member in struct:blocking_notifier_head
42 struct notifier_block *head; member in struct:raw_notifier_head
45 #define ATOMIC_INIT_NOTIFIER_HEAD(name) do { spin_lock_init(&(name)->lock); (name)->head = NULL; } while (0)
46 #define BLOCKING_INIT_NOTIFIER_HEAD(name) do { init_rwsem(&(name)->rwsem); (name)->head = NULL; } while (0)
47 #define RAW_INIT_NOTIFIER_HEAD(name) do { (name)->head = NULL; } while (0)
49 #define ATOMIC_NOTIFIER_INIT(name) { .lock = __SPIN_LOCK_UNLOCKED(name.lock), .head = NULL }
50 #define BLOCKING_NOTIFIER_INIT(name) { .rwsem = __RWSEM_INITIALIZER((name).rwsem), .head = NULL }
51 #define RAW_NOTIFIER_INIT(name) { .head = NULL }
|
| /external/dropbear/ |
| queue.c | 31 queue->head = NULL;
38 return (queue->head == NULL);
47 ret = queue->head->item;
48 oldhead = queue->head;
51 queue->head = oldhead->link;
53 queue->head = NULL;
66 return queue->head->item;
84 if (queue->head == NULL) {
85 queue->head = newlink;
|
| /external/chromium_org/media/mp4/ |
| offset_byte_queue.cc | 25 DVLOG(4) << "Buffer pushed. head=" << head() << " tail=" << tail();
40 DCHECK(offset >= head());
41 if (offset < head() || offset >= tail()) {
46 *buf = &buf_[offset - head()];
|
| /system/core/libcutils/ |
| list.c | 25 void list_add_tail(struct listnode *head, struct listnode *item)
27 item->next = head;
28 item->prev = head->prev;
29 head->prev->next = item;
30 head->prev = item;
|
| /external/apache-xml/src/main/java/org/apache/xalan/templates/ |
| TemplateList.java | 140 TemplateSubPatternAssociation head = local
143 while (null != head)
145 System.out.print("(" + head.getTargetString() + ", "
146 + head.getPattern() + ")");
148 head = head.getNext();
154 TemplateSubPatternAssociation head = m_wildCardPatterns; local
158 while (null != head)
160 System.out.print("(" + head.getTargetString() + ", "
161 + head.getPattern() + ")")
188 TemplateSubPatternAssociation head = local
356 TemplateSubPatternAssociation head = isWildCard local
434 TemplateSubPatternAssociation head; local
502 TemplateSubPatternAssociation head; local
601 TemplateSubPatternAssociation head = getHead(xctxt, targetNode, dtm); local
666 TemplateSubPatternAssociation head = getHead(xctxt, targetNode, dtm); local
[all...] |
| /device/lge/mako/camera/QCamera/stack/mm-jpeg-interface/src/ |
| mm_jpeg_queue.c | 37 cam_list_init(&queue->head.list);
55 cam_list_add_tail_node(&node->list, &queue->head.list);
67 struct cam_list *head = NULL; local
71 head = &queue->head.list;
72 pos = head->next;
73 if (pos != head) {
111 struct cam_list *head = NULL; local
115 head = &queue->head.list
[all...] |
| /external/chromium_org/chrome_frame/crash_reporting/ |
| nt_loader.cc | 17 LIST_ENTRY* head = &peb->Ldr->InLoadOrderModuleList; local
18 for (LIST_ENTRY* entry = head->Flink; entry != head; entry = entry->Flink) {
|
| /external/chromium_org/third_party/WebKit/ManualTests/blackberry/ |
| head-xhr-nonexistant-file.html | 2 <head>
5 xhr.open("HEAD", "nothing.txt", true);
22 </head>
|
| /external/chromium_org/third_party/WebKit/ManualTests/ |
| load-deferrer-script-element.html | 2 <head>
14 document.getElementsByTagName("head")[0].appendChild(s);
33 </head>
|
| /external/chromium_org/third_party/skia/src/views/ |
| SkTagList.cpp | 29 void SkTagList::DeleteTag(SkTagList** head, U8CPU tag)
33 SkTagList* rec = *head;
45 *head = next;
|
| /external/chromium_org/tools/git/ |
| post-checkout | 9 old_ref=$1 # Previous HEAD.
10 new_ref=$2 # Current HEAD.
14 if ! git diff-index --quiet HEAD $(git rev-parse --show-cdup)DEPS; then
|
