HomeSort by relevance Sort by last modified time
    Searched refs:head (Results 176 - 200 of 1084) sorted by null

1 2 3 4 5 6 78 91011>>

  /prebuilts/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/
traits.hpp 45 #include <ext/pb_ds/detail/pat_trie_/head.hpp>
118 head; typedef in struct:__gnu_pbds::detail::trie_traits
133 head,
144 head,
155 head,
166 head,
176 head,
188 head,
279 head; typedef in struct:__gnu_pbds::detail::trie_traits
294 head,
    [all...]
  /prebuilts/ndk/android-ndk-r7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/pat_trie_/
traits.hpp 45 #include <ext/pb_ds/detail/pat_trie_/head.hpp>
118 head; typedef in struct:__gnu_pbds::detail::trie_traits
133 head,
144 head,
155 head,
166 head,
176 head,
188 head,
279 head; typedef in struct:__gnu_pbds::detail::trie_traits
294 head,
    [all...]
  /external/blktrace/btt/
misc.c 35 struct list_head head; member in struct:file_info
41 struct list_head head; member in struct:buf_info
54 struct file_info *fip = list_entry(p, struct file_info, head);
60 list_del(&fip->head);
71 struct buf_info *bip = list_entry(p, struct buf_info, head);
73 list_del(&bip->head);
124 list_add_tail(&fip->head, &files_to_clean);
132 list_add_tail(&bip->head, &all_bufs);
dip_rb.c 69 struct list_head *head)
78 if (head)
79 list_add_tail(&this->f_head, head);
82 rb_foreach(n->rb_left, iop, fnc, head);
84 rb_foreach(n->rb_right, iop, fnc, head);
  /external/skia/src/views/
SkTagList.h 38 static SkTagList* Find(SkTagList* head, U8CPU tag);
40 static void DeleteAll(SkTagList* head);
  /external/webkit/Source/WebCore/rendering/
RenderQuote.cpp 83 RenderQuote* head = this; local
84 ASSERT(!head->m_previous);
86 for (RenderObject* predecessor = head->previousInPreOrder(); predecessor; predecessor = predecessor->previousInPreOrder()) {
89 head->m_previous = toRenderQuote(predecessor);
90 if (head->m_previous->m_next) {
91 // We need to splice the list of quotes headed by head into the document's list of quotes.
92 tail = head;
95 tail->m_next = head->m_previous->m_next;
96 ASSERT(tail->m_next->m_previous == head->m_previous);
100 head->m_previous->m_next = head
    [all...]
  /external/svox/pico/lib/
picosa.c 70 - headx: array for extended item heads of fixed size (head plus
87 - number and sequence of items unchanged, item head info and content
172 - number of items unchanged, content unchanged, only head info changes
178 picodata_itemhead_t head; member in struct:__anon12925
277 sa->headx[i].head.type = 0;
278 sa->headx[i].head.info1 = PICODATA_ITEMINFO1_NA;
279 sa->headx[i].head.info2 = PICODATA_ITEMINFO2_NA;
280 sa->headx[i].head.len = 0;
499 if ((sa->headx[i].head.type == PICODATA_ITEM_WORDGRAPH) ||
500 (sa->headx[i].head.type == PICODATA_ITEM_WORDINDEX) |
    [all...]
picoacph.c 70 - headx : array for extended item heads of fixed size (head plus
119 - number of items unchanged, content unchanged, only head info changes
125 picodata_itemhead_t head; member in struct:__anon12888
184 acph->headx[i].head.type = 0;
185 acph->headx[i].head.info1 = 0;
186 acph->headx[i].head.info2 = 0;
187 acph->headx[i].head.len = 0;
336 for (i = 0; i < acph->headx[ind].head.len; i++) {
361 if ((acph->headx[i].head.type == PICODATA_ITEM_WORDPHON)) {
362 val = acph->headx[i].head.info1
    [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/fsck_msdos/
dir.c 249 || fat[boot->RootCl].head != boot->RootCl) {
267 rootDir->head = boot->RootCl;
398 if (dir->head == CLUST_FREE)
401 if (dir->head < CLUST_FIRST || dir->head >= boot->NumClusters)
403 physicalSize = fat[dir->head].length * boot->ClusterSize;
424 for (cl = dir->head; (sz += boot->ClusterSize) < dir->size;)
453 cl = dir->head;
541 cl = dir->head;
739 dirent.head = p[26] | (p[27] << 8)
    [all...]
  /dalvik/vm/compiler/codegen/
Optimizer.h 40 struct LIR *head,
  /external/dropbear/
queue.h 37 struct Link* head; member in struct:Queue
  /external/ipsec-tools/src/racoon/
logger.h 38 int head; member in struct:log
misc.h 55 #define RACOON_TAILQ_FOREACH_REVERSE(var, head, headname ,field) \
56 TAILQ_FOREACH_REVERSE(var, head, field, headname)
58 #define RACOON_TAILQ_FOREACH_REVERSE(var, head, headname ,field) \
59 TAILQ_FOREACH_REVERSE(var, head, headname, field)
  /external/jsilver/src/com/google/clearsilver/jsilver/data/
DefaultDataContext.java 38 * Head of the linked list of local variables, starting with the newest variable created.
40 private LocalVariable head = null; field in class:DefaultDataContext
85 head = head.nextScope;
119 if (head == null && !newScope) {
127 // We only look at the first local variable (head) if it is part of the
132 // single scope and thus head may not be the only local variable in the
138 if (!newScope && head != null && name.equals(head.name)) {
140 head.isFirst = true
    [all...]
  /external/srec/seti/sltsEngine/include/
linklist.h 30 struct LNode *head; member in struct:LList
  /external/kernel-headers/original/linux/
rcupdate.h 52 void (*func)(struct rcu_head *head);
56 #define RCU_HEAD(head) struct rcu_head head = RCU_HEAD_INIT
280 extern void FASTCALL(call_rcu(struct rcu_head *head,
281 void (*func)(struct rcu_head *head)));
282 extern void FASTCALL(call_rcu_bh(struct rcu_head *head,
283 void (*func)(struct rcu_head *head)));
  /external/qemu/
qemu-config.c 9 .head = QTAILQ_HEAD_INITIALIZER(qemu_drive_opts.head),
89 .head = QTAILQ_HEAD_INITIALIZER(qemu_chardev_opts.head),
162 .head = QTAILQ_HEAD_INITIALIZER(qemu_fsdev_opts.head),
181 .head = QTAILQ_HEAD_INITIALIZER(qemu_virtfs_opts.head),
204 .head = QTAILQ_HEAD_INITIALIZER(qemu_device_opts.head),
    [all...]
  /bionic/libc/private/isc/
list.h 24 #define LIST(type) struct { type *head, *tail; }
26 do { (list).head = NULL; (list).tail = NULL; } while (/*CONSTCOND*/0)
38 #define HEAD(list) ((list).head)
40 #define EMPTY(list) ((list).head == NULL)
45 if ((list).head != NULL) \
46 (list).head->link.prev = (elt); \
50 (elt)->link.next = (list).head; \
51 (list).head = (elt); \
60 (list).head = (elt);
    [all...]
  /external/libsepol/src/
nodes.c 152 ocontext_t *c, *head; local
155 head = policydb->ocontexts[OCON_NODE];
156 for (c = head; c != NULL; c = c->next)
159 head = policydb->ocontexts[OCON_NODE6];
160 for (c = head; c != NULL; c = c->next)
176 ocontext_t *c, *head; local
186 head = policydb->ocontexts[OCON_NODE];
187 for (c = head; c; c = c->next) {
202 head = policydb->ocontexts[OCON_NODE6];
203 for (c = head; c; c = c->next)
236 ocontext_t *c, *head; local
352 ocontext_t *c, *head; local
    [all...]
interfaces.c 115 ocontext_t *c, *head; local
120 head = policydb->ocontexts[OCON_NETIF];
121 for (c = head; c; c = c->next) {
140 ocontext_t *c, *head; local
145 head = policydb->ocontexts[OCON_NETIF];
146 for (c = head; c; c = c->next) {
172 ocontext_t *head, *prev, *c, *iface = NULL; local
181 head = policydb->ocontexts[OCON_NETIF];
182 for (c = head; c; c = c->next) {
224 ocontext_t *c, *head; local
244 ocontext_t *c, *head; local
    [all...]
  /external/chromium/net/base/
address_list_unittest.cc 39 addrlist->Append(second_list.head());
72 addrlist2.Copy(addrlist1.head(), true);
74 ASSERT_TRUE(addrlist2.head()->ai_next != NULL);
94 addrlist2.Copy(addrlist1.head(), false);
96 ASSERT_TRUE(addrlist2.head()->ai_next == NULL);
118 ASSERT_TRUE(addrlist1.head()->ai_next == NULL);
119 addrlist1.Append(addrlist2.head());
120 ASSERT_TRUE(addrlist1.head()->ai_next != NULL);
123 addrlist3.Copy(addrlist1.head()->ai_next, false);
147 const struct addrinfo* addrinfo1 = addrlist1.head();
    [all...]
  /external/skia/src/core/
SkGlyphCache.h 208 void detach(SkGlyphCache** head) {
212 *head = fNext;
220 void attachToHead(SkGlyphCache** head) {
222 if (*head) {
223 (*head)->fPrev = this;
224 fNext = *head;
226 *head = this;
278 inline static SkGlyphCache* FindTail(SkGlyphCache* head);
279 static size_t ComputeMemoryUsed(const SkGlyphCache* head);
  /external/e2fsprogs/lib/blkid/
tag.c 102 * We return the head tag for this tag type.
106 blkid_tag head = NULL, tmp; local
116 printf(" found cache tag head %s\n", type));
117 head = tmp;
121 return head;
132 blkid_tag t = 0, head = 0; local
177 head = blkid_find_head_cache(dev->bid_cache,
179 if (!head) {
180 head = blkid_new_tag();
181 if (!head)
332 blkid_tag head; local
    [all...]
  /external/skia/src/images/
SkImageDecoder_wbmp.cpp 104 wbmp_head head; local
106 if (!head.init(stream)) {
110 int width = head.fWidth;
111 int height = head.fHeight;
164 wbmp_head head; local
166 if (head.init(stream)) {

Completed in 571 milliseconds

1 2 3 4 5 6 78 91011>>