HomeSort by relevance Sort by last modified time
    Searched refs:head (Results 601 - 625 of 3044) sorted by null

<<21222324252627282930>>

  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/idlelib/
ColorDelegator.py 176 head, tail = item
177 self.tag_remove("SYNC", head, tail)
178 item = self.tag_prevrange("SYNC", head)
180 head = item[1]
182 head = "1.0"
185 next = head
195 ##print head, "get", mark, next, "->", repr(line)
207 head + "+%dc" % a,
208 head + "+%dc" % b)
214 head + "+%dc" % a
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/idlelib/
ColorDelegator.py 176 head, tail = item
177 self.tag_remove("SYNC", head, tail)
178 item = self.tag_prevrange("SYNC", head)
180 head = item[1]
182 head = "1.0"
185 next = head
195 ##print head, "get", mark, next, "->", repr(line)
207 head + "+%dc" % a,
208 head + "+%dc" % b)
214 head + "+%dc" % a
    [all...]
  /external/mesa3d/src/gallium/drivers/svga/
svga_screen_cache.c 137 LIST_DEL(&entry->head);
140 LIST_ADD(&entry->head, &cache->empty);
184 LIST_FOR_EACH_ENTRY_SAFE_REV(entry, next_entry, &cache->unused, head) {
194 LIST_DEL(&entry->head);
195 LIST_ADD(&entry->head, &cache->empty);
262 cache->empty.next, head);
265 LIST_DEL(&entry->head);
270 cache->unused.prev, head);
282 LIST_DEL(&entry->head);
292 LIST_ADD(&entry->head, &cache->validated)
    [all...]
  /external/openssh/openbsd-compat/
getrrsetbyname.c 450 struct dns_query *head, *curr, *prev; local
454 for (i = 1, head = NULL, prev = NULL; i <= count; i++, prev = curr) {
459 free_dns_query(head);
462 if (head == NULL)
463 head = curr;
471 free_dns_query(head);
476 free_dns_query(head);
490 return (head);
497 struct dns_rr *head, *curr, *prev; local
501 for (i = 1, head = NULL, prev = NULL; i <= count; i++, prev = curr)
    [all...]
  /external/boringssl/src/ssl/
ssl_cipher.cc 775 static void ll_append_tail(CIPHER_ORDER **head, CIPHER_ORDER *curr,
780 if (curr == *head) {
781 *head = curr->next;
795 static void ll_append_head(CIPHER_ORDER **head, CIPHER_ORDER *curr,
797 if (curr == *head) {
809 (*head)->prev = curr;
810 curr->next = *head;
812 *head = curr;
860 * head and tail of the list to |*head_p| and |*tail_p|, respectively.
872 CIPHER_ORDER *head, *tail, *curr, *next, *last local
1217 CIPHER_ORDER *co_list = NULL, *head = NULL, *tail = NULL, *curr; local
    [all...]
  /external/flatbuffers/go/
builder.go 17 head UOffsetT
31 b.head = UOffsetT(initialSize)
53 b.head = UOffsetT(len(b.Bytes))
64 return b.Bytes[b.Head():]
175 b.head = UOffsetT(objectStart)
179 WriteSOffsetT(b.Bytes[b.head:],
217 // Head gives the start of useful data in the underlying byte buffer.
219 func (b *Builder) Head() UOffsetT {
220 return b.head
225 return UOffsetT(len(b.Bytes)) - b.head
    [all...]
  /external/freetype/src/base/
ftrfork.c 58 unsigned char head[16], head2[16]; local
70 error = FT_Stream_Read( stream, (FT_Byte*)head, 16 );
75 if ( head[0] >= 0x80 ||
76 head[4] >= 0x80 ||
77 head[8] >= 0x80 ||
78 head[12] >= 0x80 )
81 *rdata_pos = ( head[ 0] << 24 ) |
82 ( head[ 1] << 16 ) |
83 ( head[ 2] << 8 ) |
84 head[ 3]
    [all...]
  /external/libevent/
event-internal.h 315 #define TAILQ_FIRST(head) ((head)->tqh_first)
318 #define TAILQ_END(head) NULL
325 #define TAILQ_FOREACH(var, head, field) \
326 for ((var) = TAILQ_FIRST(head); \
327 (var) != TAILQ_END(head); \
  /external/libmicrohttpd/src/examples/
mhd2spdy_structures.h 191 * Insert an element at the head of a DLL. Assumes that head, tail and
194 * @param head pointer to the head of the DLL (struct ? *)
198 #define DLL_insert(head,tail,element) do { \
199 (element)->next = (head); \
204 (head)->prev = element; \
205 (head) = (element); } while (0)
210 * that head, tail and element are structs
213 * @param head pointer to the head of the DLL (struct ? *
    [all...]
  /external/libnetfilter_conntrack/src/conntrack/
copy.c 15 dest->head.orig.src.v4 = orig->head.orig.src.v4;
21 dest->head.orig.dst.v4 = orig->head.orig.dst.v4;
39 memcpy(&dest->head.orig.src,
40 &orig->head.orig.src,
47 memcpy(&dest->head.orig.dst,
48 &orig->head.orig.dst,
71 dest->head.orig.l4src.all = orig->head.orig.l4src.all
    [all...]
getter.c 14 return &ct->head.orig.src.v4;
19 return &ct->head.orig.dst.v4;
34 return &ct->head.orig.src.v6;
39 return &ct->head.orig.dst.v6;
54 return &ct->head.orig.l4src.all;
59 return &ct->head.orig.l4dst.all;
74 return &ct->head.orig.zone;
84 return &ct->head.orig.l4dst.icmp.type;
89 return &ct->head.orig.l4dst.icmp.code;
94 return &ct->head.orig.l4src.icmp.id
    [all...]
  /external/libxml2/python/
setup.py 110 head = open("libxml.py", "r") variable
113 for line in head.readlines():
120 head.close()
135 head = open("libxsl.py", "r")
138 for line in head.readlines():
145 head.close()
setup.py.in 110 head = open("libxml.py", "r") variable
113 for line in head.readlines():
120 head.close()
135 head = open("libxsl.py", "r")
138 for line in head.readlines():
145 head.close()
  /frameworks/base/obex/javax/obex/
ServerSession.java 302 byte[] head = null;
388 head = ObexHelper.createHeader(reply, false);
389 totalLength += head.length;
393 head = null;
404 if (head != null) {
405 System.arraycopy(head, 0, replyData, 3, head.length);
427 byte[] head = null;
488 head = ObexHelper.createHeader(reply, false);
489 totalLength += head.length
    [all...]
  /prebuilts/go/darwin-x86/test/chan/
sieve2.go 47 head int
51 // Heap of PeekCh, sorting by head values, satisfies Heap interface.
55 return (*h)[i].head < (*h)[j].head
131 head := <-m
132 for min < head {
135 min = minchan.head
136 minchan.head = <-minchan.ch
139 for min == head {
141 min = minchan.head
    [all...]
  /prebuilts/go/linux-x86/test/chan/
sieve2.go 47 head int
51 // Heap of PeekCh, sorting by head values, satisfies Heap interface.
55 return (*h)[i].head < (*h)[j].head
131 head := <-m
132 for min < head {
135 min = minchan.head
136 minchan.head = <-minchan.ch
139 for min == head {
141 min = minchan.head
    [all...]
  /system/core/liblog/
local_logger.c 122 struct listnode head; member in struct:LogBuffer
130 struct listnode* last[NUMBER_OF_LOG_BUFFERS]; /* init &head */
132 .head = { &logbuf.head, &logbuf.head }, .listLock = PTHREAD_RWLOCK_INITIALIZER,
139 list_init(&log->head);
144 log->last[i] = &log->head;
165 log->last[i] = &log->head;
167 while ((node = list_head(&log->head)) != &log->head) {
    [all...]
  /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/clang/test/CXX/temp/temp.decls/temp.variadic/
example-tuple.cpp 59 template<typename Head, typename... Tail>
60 class tuple<Head, Tail...> : private tuple<Tail...> {
68 tuple(typename add_const_reference<Head>::type v,
74 : m_head(other.head()), inherited(other.tail()) { }
78 m_head = other.head();
83 typename add_reference<Head>::type head() { return m_head; } function in class:tuple
84 typename add_reference<const Head>::type head() const { return m_head; } function in class:tuple
89 Head m_head
    [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/fio/engines/
libaio.c 27 * Basic ring buffer. 'head' is incremented in _queue(), and
30 * 'head' == 'tail'. 'entries' is the ring size, and
37 unsigned int head; member in struct:libaio_data
107 unsigned head; member in struct:aio_ring
124 unsigned head; local
128 head = ring->head;
130 if (head == ring->tail) {
135 events[i] = ring->events[head];
137 ring->head = (head + 1) % ring->nr
    [all...]
  /external/libcap/libcap/
cap_alloc.c 31 result->head.version = _LIBCAP_CAPABILITY_VERSION;
32 capget(&result->head, NULL); /* load the kernel-capability version */
34 switch (result->head.version) {
  /external/selinux/libsepol/src/
ports.c 155 ocontext_t *c, *head; local
158 head = policydb->ocontexts[OCON_PORT];
159 for (c = head; c != NULL; c = c->next)
174 ocontext_t *c, *head; local
184 head = policydb->ocontexts[OCON_PORT];
185 for (c = head; c; c = c->next) {
212 ocontext_t *c, *head; local
222 head = policydb->ocontexts[OCON_PORT];
223 for (c = head; c; c = c->next) {
289 ocontext_t *c, *head; local
    [all...]
  /hardware/qcom/msm8998/json-c/
linkhash.h 128 struct lh_entry *head; member in struct:lh_table
160 for(entry = table->head; entry; entry = entry->next)
166 for(entry = table->head; entry && ((tmp = entry->next) || 1); entry = tmp)
  /system/extras/latencytop/
latencytop.c 56 static void print_latency_entries(struct latency_entry *head);
294 static struct latency_entry *find_latency_entry(struct latency_entry *head, char *reason) {
297 e = head;
327 struct latency_entry *e, *head; local
332 head = list;
348 e = find_latency_entry(head, reason);
360 e->next = head;
361 head = e;
366 return head;
369 static void print_latency_entries(struct latency_entry *head) {
    [all...]

Completed in 1638 milliseconds

<<21222324252627282930>>