| /packages/apps/Settings/assets/html/pl/ |
| tethering_wifi_help.html | 3 <head>
18 </head>
|
| /packages/apps/Settings/assets/html/pt_br/ |
| tethering_wifi_help.html | 3 <head>
18 </head>
|
| /packages/apps/Settings/assets/html/pt_pt/ |
| tethering_wifi_help.html | 3 <head>
18 </head>
|
| /packages/apps/Settings/assets/html/ru/ |
| tethering_help.html | 3 <head>
18 </head>
|
| /packages/apps/Settings/assets/html/sv/ |
| tethering_wifi_help.html | 3 <head>
18 </head>
|
| /packages/apps/Settings/assets/html/tr/ |
| tethering_usb_help.html | 3 <head>
18 </head>
|
| tethering_wifi_help.html | 3 <head>
18 </head>
|
| /external/ipsec-tools/src/racoon/ |
| getcertsbyname.c | 128 struct certinfo head, *cur; local
136 memset(&head, 0, sizeof(head));
137 cur = &head;
191 *res = head.ci_next;
197 if (error && head.ci_next)
198 freecertinfo(head.ci_next);
215 struct certinfo head, *cur; local
221 memset(&head, 0, sizeof(head));
[all...] |
| 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;
|
| 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/apache-http/src/org/apache/http/client/methods/ |
| HttpHead.java | 37 * HTTP HEAD method.
39 * The HTTP HEAD method is defined in section 9.4 of
42 * The HEAD method is identical to GET except that the server MUST NOT
44 * in the HTTP headers in response to a HEAD request SHOULD be identical
59 public final static String METHOD_NAME = "HEAD";
|
| /frameworks/base/libs/ui/ |
| Region.cpp | 241 Rect* head;
247 : bounds(reg.mBounds), storage(reg.mStorage), head(), tail(), cur() {
291 if (tail-head == ssize_t(span.size())) {
293 Rect const* q = head;
307 Rect* r = head;
317 head = tail - span.size();
423 Region::const_iterator head = dst.begin();
427 if (head != tail) {
429 head->left != it.rect().fLeft ||
430 head->top != it.rect().fTop ||
[all...] |
| /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/ |
| LinkedBlockingQueue.java | 20 * The <em>head</em> of the queue is that element that has been on the
25 * operations obtain elements at the head of the queue.
78 /** Head of linked list */
79 private transient Node<E> head; field in class:LinkedBlockingQueue
132 * Removes a node from head of queue,
136 Node<E> h = head;
139 head = first;
180 last = head = new Node<E>(null);
440 Node<E> first = head.next;
466 Node<E> trail = head;
[all...] |
| /external/tremolo/Tremolo/ |
| framing.c | 182 ogg_reference *ret=0,*head=0; local
187 if(head)
188 head->next=temp;
191 head=temp;
192 head->buffer=or->buffer;
193 head->begin=or->begin;
194 head->length=length;
195 if(head->length>or->length)
196 head->length=or->length;
198 length-=head->length
207 ogg_reference *ret=0,*head=0; local
[all...] |
| /bionic/libc/kernel/common/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)
|
| /ndk/build/platforms/android-3/arch-arm/usr/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)
|
| /ndk/build/platforms/android-4/arch-arm/usr/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)
|
| /ndk/build/platforms/android-5/arch-arm/usr/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)
|
| /ndk/build/platforms/android-5/arch-x86/usr/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)
|
| /ndk/build/platforms/android-8/arch-arm/usr/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)
|
| /ndk/build/platforms/android-8/arch-x86/usr/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)
|
| /dalvik/docs/ |
| heap-profiling.html | 2 <head>
4 </head>
82 <code>.hprof-head</code>, where BLAH is a runtime-generated value
88 $ adb pull /data/misc/heap-dump-BLAH-BLAH.hprof-head head.hprof
89 $ adb shell rm /data/misc/heap-dump-BLAH-BLAH.hprof /data/misc/heap-dump-BLAH-BLAH.hprof-head
96 $ cat head.hprof tail.hprof > dump.hprof
97 $ rm head.hprof tail.hprof
115 appear in <code>/data/misc</code> (no <code>-head</code>), and upon
|
| /external/skia/src/core/ |
| SkGlyphCache.h | 169 void detach(SkGlyphCache** head) {
173 *head = fNext;
181 void attachToHead(SkGlyphCache** head) {
183 if (*head) {
184 (*head)->fPrev = this;
185 fNext = *head;
187 *head = this;
239 inline static SkGlyphCache* FindTail(SkGlyphCache* head);
240 static size_t ComputeMemoryUsed(const SkGlyphCache* head);
|
| /external/blktrace/btt/ |
| trace_issue.c | 25 LIST_HEAD(head);
39 dip_foreach_list(d_iop, IOP_Q, &head);
40 list_for_each_safe(p, q, &head) {
|
| /external/dbus/dbus/ |
| dbus-list.c | 161 * points back to the head of the list. The empty list is
181 * @param list address of the list head.
203 * @param list address of the list head.
241 * @param list address of the list head.
263 * @param list address of the list head.
287 * @param list address of the list head.
305 * @param list address of the list head.
417 * @param list address of the list head.
448 * @param list address of the list head.
474 * @param list address of the list head
[all...] |
