| /prebuilts/ndk/r11/platforms/android-8/arch-arm/usr/include/linux/ |
| genhd.h | 44 unsigned char head; member in struct:partition
|
| /prebuilts/ndk/r11/platforms/android-9/arch-arm/usr/include/linux/ |
| genhd.h | 44 unsigned char head; member in struct:partition
|
| /prebuilts/ndk/r11/platforms/android-9/arch-mips/usr/include/linux/ |
| genhd.h | 44 unsigned char head; member in struct:partition
|
| /prebuilts/ndk/r11/platforms/android-9/arch-x86/usr/include/linux/ |
| genhd.h | 44 unsigned char head; member in struct:partition
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_dict.py | 46 power< head=any+
56 head = results["head"]
66 head = [n.clone() for n in head]
69 args = head + [pytree.Node(syms.trailer,
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/fixes/ |
| fix_dict.py | 46 power< head=any+
56 head = results["head"]
66 head = [n.clone() for n in head]
69 args = head + [pytree.Node(syms.trailer,
|
| /toolchain/binutils/binutils-2.25/gprof/ |
| search_list.c | 56 list->head = new_el;
|
| /external/ipsec-tools/src/racoon/ |
| 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; tr && tr->next; tr = tr->next
[all...] |
| /external/libdrm/ |
| xf86drmSL.c | 68 SLEntryPtr head; member in struct:SkipList
109 list->head = SLCreateEntry(SL_MAX_LEVEL, 0, NULL);
112 for (i = 0; i <= SL_MAX_LEVEL; i++) list->head->forward[i] = NULL;
125 for (entry = list->head; entry; entry = next) {
145 for (i = list->level, entry = list->head; i >= 0; i--) {
172 update[level] = list->head;
209 while (list->level && !list->head->forward[list->level]) --list->level;
281 list->p0 = list->head->forward[0];
299 for (entry = list->head; entry; entry = entry->forward[0]) {
|
| /external/libnfnetlink/src/ |
| iftable.c | 28 struct list_head head; member in struct:ifindex_node
72 list_for_each_entry(this, &h->ifindex_hash[hash], head) {
102 list_add(&this->head, &h->ifindex_hash[hash]);
131 list_for_each_entry_safe(this, tmp, &h->ifindex_hash[hash], head) {
133 list_del(&this->head);
165 list_for_each_entry(this, &h->ifindex_hash[hash], head) {
199 list_for_each_entry(this, &h->ifindex_hash[hash], head) {
273 list_for_each_entry_safe(this, tmp, &h->ifindex_hash[i], head) {
274 list_del(&this->head);
|
| /external/llvm/lib/Support/ |
| CrashRecoveryContext.cpp | 85 CrashRecoveryContextCleanup *i = head;
120 if (head)
121 head->prev = cleanup;
122 cleanup->next = head;
123 head = cleanup;
130 if (cleanup == head) {
131 head = cleanup->next;
132 if (head)
133 head->prev = nullptr;
|
| /hardware/qcom/audio/legacy/libalsa-intf/ |
| msm8960_use_cases.h | 287 static int snd_ucm_add_ident_to_list(struct snd_ucm_ident_node **head, const char *value);
288 static char *snd_ucm_get_value_at_index(struct snd_ucm_ident_node *head, int index);
289 static int snd_ucm_get_size_of_list(struct snd_ucm_ident_node *head);
290 static int snd_ucm_del_ident_from_list(struct snd_ucm_ident_node **head, const char *value);
291 static int snd_ucm_free_list(struct snd_ucm_ident_node **head);
292 static void snd_ucm_print_list(struct snd_ucm_ident_node *head);
293 static void snd_ucm_set_status_at_index(struct snd_ucm_ident_node *head, const char *ident, int status, int capability);
294 static int snd_ucm_get_status_at_index(struct snd_ucm_ident_node *head, const char *ident);
295 struct snd_ucm_ident_node *snd_ucm_get_device_node(struct snd_ucm_ident_node *head, int index);
|
| /external/eigen/Eigen/src/OrderingMethods/ |
| Amd.h | 60 StorageIndex cs_tdfs(StorageIndex j, StorageIndex k, StorageIndex *head, const StorageIndex *next, StorageIndex *post, StorageIndex *stack)
63 if(!head || !next || !post || !stack) return (-1); /* check inputs */
68 i = head[p]; /* i = youngest child of p */
76 head[p] = next[i]; /* remove i from children of p */
116 StorageIndex* head = W + 3*(n+1); local
133 head[i] = -1; // degree list i is empty
173 if(head[d] != -1) last[head[d]] = i;
174 next[i] = head[d]; /* put node i in degree list d */
175 head[d] = i
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/PyMod-2.7.2/Lib/ |
| os.py | 159 head, tail = path.split(name)
161 head, tail = path.split(head)
162 if head and tail and not path.exists(head):
164 makedirs(head, mode)
185 head, tail = path.split(name)
187 head, tail = path.split(head)
188 while head and tail:
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/PyMod-2.7.10/Lib/ |
| os.py | 172 head, tail = path.split(name)
174 head, tail = path.split(head)
175 if head and tail and not path.exists(head):
177 makedirs(head, mode)
198 head, tail = path.split(name)
200 head, tail = path.split(head)
201 while head and tail:
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| os.py | 145 head, tail = path.split(name)
147 head, tail = path.split(head)
148 if head and tail and not path.exists(head):
150 makedirs(head, mode)
171 head, tail = path.split(name)
173 head, tail = path.split(head)
174 while head and tail:
[all...] |
| /external/python/cpython2/Lib/ |
| os.py | 145 head, tail = path.split(name)
147 head, tail = path.split(head)
148 if head and tail and not path.exists(head):
150 makedirs(head, mode)
171 head, tail = path.split(name)
173 head, tail = path.split(head)
174 while head and tail
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| LinkedBlockingQueue.java | 57 * The <em>head</em> of the queue is that element that has been on the
62 * operations obtain elements at the head of the queue.
116 * self-link implicitly means to advance to head.next.
128 * - this Node, meaning the successor is head.next
143 * Head of linked list.
144 * Invariant: head.item == null
146 transient Node<E> head; field in class:LinkedBlockingQueue
205 * Removes a node from head of queue.
211 // assert head.item == null;
212 Node<E> h = head;
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| os.py | 145 head, tail = path.split(name)
147 head, tail = path.split(head)
148 if head and tail and not path.exists(head):
150 makedirs(head, mode)
171 head, tail = path.split(name)
173 head, tail = path.split(head)
174 while head and tail
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| os.py | 145 head, tail = path.split(name)
147 head, tail = path.split(head)
148 if head and tail and not path.exists(head):
150 makedirs(head, mode)
171 head, tail = path.split(name)
173 head, tail = path.split(head)
174 while head and tail
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| os.py | 145 head, tail = path.split(name)
147 head, tail = path.split(head)
148 if head and tail and not path.exists(head):
150 makedirs(head, mode)
171 head, tail = path.split(name)
173 head, tail = path.split(head)
174 while head and tail
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| os.py | 145 head, tail = path.split(name)
147 head, tail = path.split(head)
148 if head and tail and not path.exists(head):
150 makedirs(head, mode)
171 head, tail = path.split(name)
173 head, tail = path.split(head)
174 while head and tail
[all...] |
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_rast_debug.c | 107 const struct cmd_block *head = bin->head; local
112 while (head) {
113 for (i = 0; i < head->count; i++, j++) {
114 if (head->cmd[i] == LP_RAST_OP_SET_STATE)
115 state = head->arg[i].state;
118 cmd_name(head->cmd[i]),
119 is_blend(state, head, i) ? "blended" : "");
121 head = head->next
[all...] |
| /frameworks/compile/mclinker/unittests/ |
| GraphTest.cpp | 58 ListDigraph::Node* head = NULL; local
59 graph.getHead(head);
60 ASSERT_TRUE(head == u3);
79 graph.getHead(head);
80 ASSERT_TRUE(head == u3);
105 ListDigraph::Node* head = NULL; local
106 graph.getHead(head);
107 ASSERT_TRUE(head == u3);
126 graph.getHead(head);
127 ASSERT_TRUE(head == u3)
152 ListDigraph::Node* head = NULL; local
[all...] |
| /external/ImageMagick/MagickCore/ |
| segment.c | 264 *head,
299 head=(Cluster *) NULL;
314 if (head != (Cluster *) NULL)
323 head=cluster;
339 if (head == (Cluster *) NULL)
356 head=cluster;
378 for (cluster=head; cluster != (Cluster *) NULL; cluster=cluster->next)
426 last_cluster=head;
427 next_cluster=head;
428 for (cluster=head; cluster != (Cluster *) NULL; cluster=next_cluster
258 *head, local
937 *head, local
1343 *head, local
[all...] |
