| /external/selinux/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)
175 ocontext_t *c, *head; local
185 head = policydb->ocontexts[OCON_NODE];
186 for (c = head; c; c = c->next) {
201 head = policydb->ocontexts[OCON_NODE6];
202 for (c = head; c; c = c->next)
235 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) {
139 ocontext_t *c, *head; local
144 head = policydb->ocontexts[OCON_NETIF];
145 for (c = head; c; c = c->next) {
171 ocontext_t *head, *prev, *c, *iface = NULL; local
180 head = policydb->ocontexts[OCON_NETIF];
181 for (c = head; c; c = c->next) {
223 ocontext_t *c, *head; local
242 ocontext_t *c, *head; local
[all...] |
| /external/libnetfilter_conntrack/src/conntrack/ |
| compare.c | 21 int a = test_bit(attr, ct1->head.set);
22 int b = test_bit(attr, ct2->head.set);
28 test_bit(attr, ct1->head.set)) {
41 return (ct1->head.orig.l3protonum == ct2->head.orig.l3protonum);
49 return (ct1->head.orig.l4src.icmp.id == ct2->head.orig.l4src.icmp.id);
57 return (ct1->head.orig.l4dst.icmp.type ==
58 ct2->head.orig.l4dst.icmp.type);
66 return (ct1->head.orig.l4dst.icmp.code =
[all...] |
| snprintf_xml.c | 295 tuple = &ct->head.orig;
338 if (test_bit(ATTR_ORIG_COUNTER_PACKETS, ct->head.set) &&
339 test_bit(ATTR_ORIG_COUNTER_BYTES, ct->head.set)) {
407 test_bit(ATTR_ORIG_ZONE, ct->head.set));
411 test_bit(ATTR_REPL_ZONE, ct->head.set));
414 if (test_bit(ATTR_TCP_STATE, ct->head.set) ||
415 test_bit(ATTR_SCTP_STATE, ct->head.set) ||
416 test_bit(ATTR_DCCP_STATE, ct->head.set) ||
417 test_bit(ATTR_TIMEOUT, ct->head.set) ||
418 test_bit(ATTR_MARK, ct->head.set) |
[all...] |
| /external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/ |
| GroupedLinkedMap.java | 18 private final LinkedEntry<K, V> head = new LinkedEntry<K, V>(); field in class:GroupedLinkedMap
50 LinkedEntry<K, V> last = head.prev;
52 while (!last.equals(head)) {
75 LinkedEntry<K, V> current = head.next;
77 while (!current.equals(head)) {
91 entry.prev = head;
92 entry.next = head.next;
99 entry.prev = head.prev;
100 entry.next = head;
|
| /libcore/ojluni/src/main/java/java/lang/ref/ |
| ReferenceQueue.java | 46 private Reference<? extends T> head = null; field in class:ReferenceQueue
84 head = r;
122 if (head != null) {
123 Reference<? extends T> r = head;
124 if (head == tail) {
126 head = null;
128 head = head.queueNext;
150 if (head == null)
|
| /system/bt/osi/src/ |
| ringbuffer.cc | 29 uint8_t* head; member in struct:ringbuffer_t
38 p->head = p->tail = p->base;
79 rb->head += length;
80 if (rb->head >= (rb->base + rb->total)) rb->head -= rb->total;
93 uint8_t* b = ((rb->head - rb->base + offset) % rb->total) + rb->base;
111 rb->head += copied;
112 if (rb->head >= (rb->base + rb->total)) rb->head -= rb->total;
|
| /system/nfc/src/adaptation/ |
| ringbuffer.cc | 28 uint8_t* head; member in struct:ringbuffer_t
38 p->head = p->tail = p->base;
79 rb->head += length;
80 if (rb->head >= (rb->base + rb->total)) rb->head -= rb->total;
93 uint8_t* b = ((rb->head - rb->base + offset) % rb->total) + rb->base;
111 rb->head += copied;
112 if (rb->head >= (rb->base + rb->total)) rb->head -= rb->total;
|
| /toolchain/binutils/binutils-2.25/binutils/ |
| coffgrok.c | 129 do_sections_p1 (struct coff_ofile *head)
135 head->nsections = abfd->section_count + 1;
136 head->sections = all;
155 head->sections[i].name = (char *) (section->name);
156 head->sections[i].code = section->flags & SEC_CODE;
157 head->sections[i].data = section->flags & SEC_DATA;
159 head->sections[i].data = 1;
160 head->sections[i].address = section->lma;
161 head->sections[i].size = bfd_get_section_size (section);
162 head->sections[i].number = idx
600 struct coff_ofile *head = local
[all...] |
| /external/e2fsprogs/lib/blkid/ |
| tag.c | 103 * We return the head tag for this tag type.
107 blkid_tag head = NULL, tmp; local
117 printf(" found cache tag head %s\n", type));
118 head = tmp;
122 return head;
133 blkid_tag t = 0, head = 0; local
178 head = blkid_find_head_cache(dev->bid_cache,
180 if (!head) {
181 head = blkid_new_tag();
182 if (!head)
333 blkid_tag head; local
[all...] |
| /external/ImageMagick/MagickCore/ |
| linked-list.c | 76 *head,
132 list_info->head=next;
180 next=list_info->head;
189 list_info->head=(ElementInfo *) NULL;
234 for (next=list_info->head; next != (ElementInfo *) NULL; )
406 value=list_info->head->value;
416 next=list_info->head;
478 list_info->head=next;
485 if (list_info->next == list_info->head)
487 next->next=list_info->head;
74 *head, member in struct:_LinkedListInfo
[all...] |
| /external/linux-kselftest/tools/testing/selftests/timers/ |
| clocksource-switch.c | 56 char *head, *tmp; local
67 head = buf;
69 while (head - buf < size) {
71 for (tmp = head; *tmp != ' '; tmp++) {
78 strcpy(list[i], head);
79 head = tmp + 1;
|
| /external/ipsec-tools/src/racoon/ |
| racoonctl.c | 402 struct admin_com *head; local
404 buf = vmalloc(sizeof(*head));
408 head = (struct admin_com *)buf->v;
409 head->ac_len = buf->l;
410 head->ac_cmd = ADMIN_RELOAD_CONF;
411 head->ac_errno = 0;
412 head->ac_proto = 0;
423 struct admin_com *head; local
441 buf = vmalloc(sizeof(*head));
445 head = (struct admin_com *)buf->v
460 struct admin_com *head; local
481 struct admin_com *head; local
510 struct admin_com *head; local
539 struct admin_com *head; local
594 struct admin_com *head; local
649 struct admin_com *head; local
835 struct admin_com *head; local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/distutils/ |
| dir_util.py | 49 (head, tail) = os.path.split(name)
52 while head and tail and not os.path.isdir(head):
53 (head, tail) = os.path.split(head)
56 # now 'head' contains the deepest directory that already exists
57 # (that is, the child of 'head' in 'name' is the highest directory
60 #print "head = %s, d = %s: " % (head, d),
61 head = os.path.join(head, d)
[all...] |
| /external/python/cpython2/Lib/distutils/ |
| dir_util.py | 49 (head, tail) = os.path.split(name)
52 while head and tail and not os.path.isdir(head):
53 (head, tail) = os.path.split(head)
56 # now 'head' contains the deepest directory that already exists
57 # (that is, the child of 'head' in 'name' is the highest directory
60 #print "head = %s, d = %s: " % (head, d),
61 head = os.path.join(head, d
[all...] |
| /external/tremolo/Tremolo/ |
| misc.c | 59 } head; typedef in typeref:struct:__anon35659
65 ((head *)ptr)->file=file;
66 ((head *)ptr)->line=line;
67 ((head *)ptr)->ptr=pinsert;
68 ((head *)ptr)->bytes=bytes-HEAD_ALIGN;
151 char *file =((head *)ptr)->file;
152 long bytes =((head *)ptr)->bytes;
159 global_bytes-((head *)ptr)->bytes);
180 global_bytes-=((head *)ptr)->bytes;
182 insert=((head *)ptr)->ptr
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/distutils/ |
| dir_util.py | 49 (head, tail) = os.path.split(name)
52 while head and tail and not os.path.isdir(head):
53 (head, tail) = os.path.split(head)
56 # now 'head' contains the deepest directory that already exists
57 # (that is, the child of 'head' in 'name' is the highest directory
60 #print "head = %s, d = %s: " % (head, d),
61 head = os.path.join(head, d
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/distutils/ |
| dir_util.py | 49 (head, tail) = os.path.split(name)
52 while head and tail and not os.path.isdir(head):
53 (head, tail) = os.path.split(head)
56 # now 'head' contains the deepest directory that already exists
57 # (that is, the child of 'head' in 'name' is the highest directory
60 #print "head = %s, d = %s: " % (head, d),
61 head = os.path.join(head, d
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/distutils/ |
| dir_util.py | 49 (head, tail) = os.path.split(name)
52 while head and tail and not os.path.isdir(head):
53 (head, tail) = os.path.split(head)
56 # now 'head' contains the deepest directory that already exists
57 # (that is, the child of 'head' in 'name' is the highest directory
60 #print "head = %s, d = %s: " % (head, d),
61 head = os.path.join(head, d
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/distutils/ |
| dir_util.py | 49 (head, tail) = os.path.split(name)
52 while head and tail and not os.path.isdir(head):
53 (head, tail) = os.path.split(head)
56 # now 'head' contains the deepest directory that already exists
57 # (that is, the child of 'head' in 'name' is the highest directory
60 #print "head = %s, d = %s: " % (head, d),
61 head = os.path.join(head, d
[all...] |
| /art/test/370-dex-v37/ |
| build | 24 if test -f classes.dex && head -c 7 classes.dex | grep -q 035; then
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| commands.py | 69 def mk2arg(head, x):
71 return mkarg(os.path.join(head, x))
|
| dircache.py | 37 def annotate(head, list):
40 if os.path.isdir(os.path.join(head, list[i])):
|
| /external/curl/lib/ |
| if2ip.c | 101 struct ifaddrs *iface, *head; local
103 if(getifaddrs(&head) >= 0) {
104 for(iface=head; iface != NULL; iface=iface->ifa_next) {
110 freeifaddrs(head);
119 struct ifaddrs *iface, *head; local
131 if(getifaddrs(&head) >= 0) {
132 for(iface = head; iface != NULL; iface=iface->ifa_next) {
189 freeifaddrs(head);
|
| /external/eigen/bench/btl/data/ |
| mk_new_gnuplot.sh | 7 echo "set title " `grep ${WHAT} ../action_settings.txt | head -n 1 | cut -d ";" -f 2` >> $WHAT.gnuplot
8 echo "set xlabel " `grep ${WHAT} ../action_settings.txt | head -n 1 | cut -d ";" -f 3` " offset 0,0" >> $WHAT.gnuplot
9 echo "set xrange [" `grep ${WHAT} ../action_settings.txt | head -n 1 | cut -d ";" -f 4` "]" >> $WHAT.gnuplot
39 echo "'"$FILE"'" `grep $TITLE ../perlib_plot_settings.txt | head -n 1 | cut -d ";" -f 2` "\\" >> $WHAT.gnuplot
|
