Searched refs:head (Results 1 - 25 of 638) sorted by relevance

1234567891011>>

/external/kernel-headers/original/linux/
H A Dcirc_buf.h6 int head; member in struct:circ_buf
11 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
14 as a completely full buffer has head == tail, which is the same as
16 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
19 accessing head and tail more than once, so they can change
21 #define CIRC_CNT_TO_END(head,tail,size) \
23 int n = ((head) + end) & ((size)-1); \
27 #define CIRC_SPACE_TO_END(head,tai
[all...]
H A Dplist.h102 * @head: struct plist_head variable name
104 #define PLIST_HEAD_INIT(head, _lock) \
106 .prio_list = LIST_HEAD_INIT((head).prio_list), \
107 .node_list = LIST_HEAD_INIT((head).node_list), \
126 * @head: &struct plist_head pointer
129 plist_head_init(struct plist_head *head, spinlock_t *lock) argument
131 INIT_LIST_HEAD(&head->prio_list);
132 INIT_LIST_HEAD(&head->node_list);
134 head->lock = lock;
150 extern void plist_add(struct plist_node *node, struct plist_head *head);
200 plist_head_empty(const struct plist_head *head) argument
242 plist_first(const struct plist_head *head) argument
[all...]
/external/qemu/
H A Dqemu-queue.h51 * or after an existing element or at the head of the list. A list
54 * A simple queue is headed by a pair of pointers, one the head of the
57 * head of the list. New elements can be added to the list after
58 * an existing element, at the head of the list, or at the end of the
61 * A tail queue is headed by a pair of pointers, one to the head of the
65 * after an existing element, at the head of the list, or at the end of
68 * A circle queue is headed by a pair of pointers, one to the head of the
72 * an existing element, at the head of the list, or at the end of the list.
87 #define QLIST_HEAD_INITIALIZER(head) \
99 #define QLIST_INIT(head) d
[all...]
/external/chromium/net/base/
H A Daddress_list_net_log_param.cc21 for (const addrinfo* head = address_list_.head();
22 head != NULL ; head = head->ai_next) {
23 list->Append(Value::CreateStringValue(NetAddressToStringWithPort(head)));
/external/openssh/openbsd-compat/
H A Dsys-queue.h131 * 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...]
/external/doclava/res/assets/templates/
H A Dindex.cs2 <head>
4 </head>
/external/v8/tools/
H A Dprofile_view.js49 var head;
56 if (viewParent === head) {
62 var viewNode = createViewNode(node.label, totalWeight, selfWeight, head);
66 head = viewNode;
70 var view = this.createView(head);
78 * @param {ProfileView.Node} head View head node.
81 ViewBuilder.prototype.createView = function(head) {
82 return new ProfileView(head);
95 * @param {ProfileView.Node} head Profil
[all...]
/external/chromium/third_party/libevent/compat/sys/
H A Dqueue.h46 * added to the list after an existing element or at the head of the list.
47 * Elements being removed from the head of the list should use the explicit
57 * or after an existing element or at the head of the list. A list
60 * A simple queue is headed by a pair of pointers, one the head of the
63 * head of the list. New elements can be added to the list before or after
64 * an existing element, at the head of the list, or at the end of the
67 * A tail queue is headed by a pair of pointers, one to the head of the
71 * after an existing element, at the head of the list, or at the end of
74 * A circle queue is headed by a pair of pointers, one to the head of the
78 * an existing element, at the head o
[all...]
/external/ipsec-tools/src/include-glibc/sys/
H A Dqueue.h50 * added to the list after an existing element or at the head of the list.
51 * Elements being removed from the head of the list should use the explicit
58 * head of the list and the other to the tail of the list. The elements are
61 * to the list after an existing element, at the head of the list, or at the
62 * end of the list. Elements being removed from the head of the tail queue
72 * or after an existing element or at the head of the list. A list
75 * A tail queue is headed by a pair of pointers, one to the head of the
79 * after an existing element, at the head of the list, or at the end of
114 #define SLIST_HEAD_INITIALIZER(head) \
125 #define SLIST_EMPTY(head) ((hea
427 *head = (struct quehead *)b; local
[all...]
/external/libnl-headers/netlink/
H A Dlist.h38 struct nl_list_head *head)
40 __nl_list_add(obj, head->prev, head);
44 struct nl_list_head *head)
46 __nl_list_add(obj, head, head->next);
55 static inline int nl_list_empty(struct nl_list_head *head) argument
57 return head->next == head;
67 #define nl_list_at_tail(pos, head, membe
37 nl_list_add_tail(struct nl_list_head *obj, struct nl_list_head *head) argument
43 nl_list_add_head(struct nl_list_head *obj, struct nl_list_head *head) argument
[all...]
/external/javassist/src/main/javassist/bytecode/analysis/
H A DIntQueue.java27 private IntQueue.Entry head; field in class:IntQueue
37 if (head == null)
38 head = entry;
42 return head == null;
46 if (head == null)
49 int value = head.value;
50 head = head.next;
51 if (head == null)
/external/llvm/utils/
H A Dfindsym.pl24 my $head = 0;
28 if (!$head) { print "$lib:\n"; $head = 1; }
/external/eigen/doc/snippets/
H A DMatrixBase_start_int.cpp3 cout << "Here is v.head(2):" << endl << v.head(2) << endl;
4 v.head(2).setZero();
H A DMatrixBase_template_int_start.cpp3 cout << "Here is v.head(2):" << endl << v.head<2>() << endl;
4 v.head<2>().setZero();
/external/e2fsprogs/lib/ext2fs/
H A Dkernel-list.h48 * Insert a new entry after the specified head..
50 static __inline__ void list_add(struct list_head *new, struct list_head *head) argument
52 __list_add(new, head, head->next);
58 static __inline__ void list_add_tail(struct list_head *new, struct list_head *head) argument
60 __list_add(new, head->prev, head);
82 static __inline__ int list_empty(struct list_head *head) argument
84 return head->next == head;
90 list_splice(struct list_head *list, struct list_head *head) argument
[all...]
/external/ipsec-tools/src/racoon/
H A Dgenlist.h51 /* This function returns an initialized list head. */
55 struct genlist_entry *genlist_insert (struct genlist *head, void *data);
56 struct genlist_entry *genlist_append (struct genlist *head, void *data);
67 void *genlist_foreach (struct genlist *head, genlist_func_t func, void *arg);
69 /* Get first entry in list if head is not NULL, otherwise get next
72 void *genlist_next (struct genlist *head, struct genlist_entry **buf);
78 /* Free all storage associated with list at head using func to free any
80 void genlist_free (struct genlist *head, genlist_freedata_t func);
/external/iptables/libiptc/
H A Dlinux_list.h85 * @head: list head to add it after
87 * Insert a new entry after the specified head.
90 static inline void list_add(struct list_head *new, struct list_head *head) argument
92 __list_add(new, head, head->next);
98 * @head: list head to add it before
100 * Insert a new entry before the specified head.
103 static inline void list_add_tail(struct list_head *new, struct list_head *head) argument
140 list_add_rcu(struct list_head *new, struct list_head *head) argument
161 list_add_tail_rcu(struct list_head *new, struct list_head *head) argument
238 list_move(struct list_head *list, struct list_head *head) argument
249 list_move_tail(struct list_head *list, struct list_head *head) argument
260 list_empty(const struct list_head *head) argument
277 list_empty_careful(const struct list_head *head) argument
283 __list_splice(struct list_head *list, struct list_head *head) argument
302 list_splice(struct list_head *list, struct list_head *head) argument
315 list_splice_init(struct list_head *list, struct list_head *head) argument
[all...]
/external/e2fsprogs/lib/blkid/
H A Dlist.h56 * @head: list head to add it after
58 * Insert a new entry after the specified head.
61 _INLINE_ void list_add(struct list_head *add, struct list_head *head) argument
63 __list_add(add, head, head->next);
69 * @head: list head to add it before
71 * Insert a new entry before the specified head.
74 _INLINE_ void list_add_tail(struct list_head *add, struct list_head *head) argument
119 list_empty(struct list_head *head) argument
129 list_splice(struct list_head *list, struct list_head *head) argument
[all...]
/external/oprofile/libutil/
H A Dop_list.h32 * Init a list head to create an empty list from it
59 * @param head list head to add it after
61 * Insert a new entry after the specified head.
64 static __inline__ void list_add(struct list_head * new_entry, struct list_head * head) argument
66 __list_add(new_entry, head, head->next);
72 * @param head list head to add it before
74 * Insert a new entry before the specified head
77 list_add_tail(struct list_head * new_entry, struct list_head * head) argument
120 list_empty(struct list_head const * head) argument
130 list_splice(struct list_head * list, struct list_head * head) argument
[all...]
/external/blktrace/btt/
H A Dlist.h68 * @head: list head to add it after
70 * Insert a new entry after the specified head.
73 static inline void list_add(struct list_head *new, struct list_head *head) argument
75 __list_add(new, head, head->next);
81 * @head: list head to add it before
83 * Insert a new entry before the specified head.
86 static inline void list_add_tail(struct list_head *new, struct list_head *head) argument
165 list_empty(const struct list_head *head) argument
174 list_first(const struct list_head *head) argument
184 list_move_tail(struct list_head *list, struct list_head *head) argument
191 __list_splice(struct list_head *list, struct list_head *head) argument
210 list_splice(struct list_head *list, struct list_head *head) argument
[all...]
/external/compiler-rt/lib/interception/
H A Dinterception_win.cc66 // 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
[all...]
/external/icu4c/layout/
H A DLEInsertionList.cpp26 : 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...]
/external/linux-tools-perf/util/include/linux/added/
H A Dlist.h42 * @head: list head to add it after
44 * Insert a new entry after the specified head.
47 static inline void list_add(struct list_head *new, struct list_head *head) argument
49 __list_add(new, head, head->next);
56 * @head: list head to add it before
58 * Insert a new entry before the specified head.
61 static inline void list_add_tail(struct list_head *new, struct list_head *head) argument
134 list_move(struct list_head *list, struct list_head *head) argument
145 list_move_tail(struct list_head *list, struct list_head *head) argument
157 list_is_last(const struct list_head *list, const struct list_head *head) argument
167 list_empty(const struct list_head *head) argument
185 list_empty_careful(const struct list_head *head) argument
195 list_rotate_left(struct list_head *head) argument
209 list_is_singular(const struct list_head *head) argument
214 __list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
240 list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
273 list_splice(const struct list_head *list, struct list_head *head) argument
285 list_splice_tail(struct list_head *list, struct list_head *head) argument
299 list_splice_init(struct list_head *list, struct list_head *head) argument
316 list_splice_tail_init(struct list_head *list, struct list_head *head) argument
[all...]
/external/webkit/Source/WebCore/inspector/
H A Dcombine-javascript-resources.pl27 # 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;
/external/dropbear/
H A Dqueue.c31 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;

Completed in 1550 milliseconds

1234567891011>>