| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/h/ |
| slist.cpp | 52 if ( head == *cursor ) { *cursor = (*cursor)->next(); }
68 if ( head == NULL )
70 head = tail = p;
84 if ( head==NULL ) return; /* empty list */
85 for (p = head; p!=NULL; p=q)
98 for (p = head; p!=NULL; p=p->next())
|
| /external/iproute2/include/ |
| hlist.h | 38 #define hlist_for_each(pos, head) \
39 for (pos = (head)->first; pos ; pos = pos->next)
42 #define hlist_for_each_safe(pos, n, head) \
43 for (pos = (head)->first; pos && ({ n = pos->next; 1; }); \
51 #define hlist_for_each_entry(pos, head, member) \
52 for (pos = hlist_entry_safe((head)->first, typeof(*(pos)), member);\
|
| /external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/page/ |
| SourceFilePage.java | 68 protected void head(final HTMLElement head) throws IOException { method in class:SourceFilePage
69 super.head(head);
70 head.link(
74 head.script(
|
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| cons.h | 21 // have a "head" and a "tail" element. A cell's head element contains
31 // prepending new values to the front using the "Cons(head, tail)"
68 List<T> Cons(const T& head, List<T> tail) {
69 return std::make_shared<Cell<T>>(head, std::move(tail));
76 Cell(const T& head, List<T> tail) : head_(head), tail_(std::move(tail)) {}
78 // Head returns this cell's head element.
79 const T& head() const { return head_; function in class:sandbox::cons::Cell
[all...] |
| /external/mesa3d/src/gallium/drivers/swr/ |
| swr_scratch.cpp | 63 space->head = (void *)space->base;
68 if (((uint8_t *)space->head + size)
70 space->head = space->base;
73 ptr = space->head;
74 space->head = (uint8_t *)space->head + size;
|
| /external/e2fsprogs/contrib/android/ |
| basefs_allocator.c | 53 fs_reserve_blocks_range(fs, e->head);
80 if (e && e->head && ctx && (ctx->flags & BLOCK_ALLOC_DATA)) {
81 *ret = e->head->start;
82 e->head->start += 1;
83 if (e->head->start > e->head->end) {
84 next_range = e->head->next;
85 free(e->head);
86 e->head = next_range;
104 fs_free_blocks_range(fs, e->head);
[all...] |
| /external/syslinux/core/fs/ |
| cache.c | 22 struct cache *head, *cache; local
37 dev->cache_head = head = (struct cache *)
39 cache = head + 1; /* First cache descriptor */
41 head->prev = &cache[dev->cache_entries-1];
42 head->prev->next = head;
43 head->block = -1;
44 head->data = NULL;
46 prev = head;
80 struct cache *head = dev->cache_head local
[all...] |
| /external/syslinux/gpxe/src/arch/i386/core/ |
| aout_loader.c | 14 struct exec head; member in struct:aout_state
28 if (len < sizeof(astate.head)) {
31 memcpy(&astate.head, data, sizeof(astate.head));
32 if ((astate.head.a_midmag & 0xffff) != 0x010BL) {
40 start = astate.head.a_entry;
41 mid = (((start + astate.head.a_text) + 4095) & ~4095) + astate.head.a_data;
42 end = ((mid + 4095) & ~4095) + astate.head.a_bss;
64 astate.head.a_entry = astate.curaddr + 0x20
[all...] |
| /external/jemalloc/src/ |
| tsd.c | 168 tsd_init_check_recursion(tsd_init_head_t *head, tsd_init_block_t *block)
174 malloc_mutex_lock(TSDN_NULL, &head->lock);
175 ql_foreach(iter, &head->blocks, link) {
177 malloc_mutex_unlock(TSDN_NULL, &head->lock);
184 ql_tail_insert(&head->blocks, block, link);
185 malloc_mutex_unlock(TSDN_NULL, &head->lock);
190 tsd_init_finish(tsd_init_head_t *head, tsd_init_block_t *block)
193 malloc_mutex_lock(TSDN_NULL, &head->lock);
194 ql_remove(&head->blocks, block, link);
195 malloc_mutex_unlock(TSDN_NULL, &head->lock)
[all...] |
| /external/libnetfilter_conntrack/src/conntrack/ |
| build.c | 111 switch(ct->head.orig.protonum) {
116 if (!(test_bit(ATTR_TCP_STATE, ct->head.set) ||
117 test_bit(ATTR_TCP_FLAGS_ORIG, ct->head.set) ||
118 test_bit(ATTR_TCP_FLAGS_REPL, ct->head.set) ||
119 test_bit(ATTR_TCP_MASK_ORIG, ct->head.set) ||
120 test_bit(ATTR_TCP_MASK_REPL, ct->head.set) ||
121 test_bit(ATTR_TCP_WSCALE_ORIG, ct->head.set) ||
122 test_bit(ATTR_TCP_WSCALE_REPL, ct->head.set))) {
127 if (test_bit(ATTR_TCP_STATE, ct->head.set))
132 if (test_bit(ATTR_TCP_FLAGS_ORIG, ct->head.set) &
[all...] |
| grp_getter.c | 15 this->src = ct->head.orig.src.v4;
16 this->dst = ct->head.orig.dst.v4;
29 memcpy(this->src, &ct->head.orig.src.v6, sizeof(uint32_t)*4);
30 memcpy(this->dst, &ct->head.orig.dst.v6, sizeof(uint32_t)*4);
43 this->sport = ct->head.orig.l4src.all;
44 this->dport = ct->head.orig.l4dst.all;
57 this->type = ct->head.orig.l4dst.icmp.type;
58 this->code = ct->head.orig.l4dst.icmp.code;
59 this->id = ct->head.orig.l4src.icmp.id;
101 memcpy(&this->addr, &ct->head.orig.src, sizeof(ct->head.orig.src))
[all...] |
| /external/mesa3d/src/util/ |
| list.h | 186 #define LIST_FOR_EACH_ENTRY(pos, head, member) \
187 for (pos = NULL, pos = container_of((head)->next, pos, member); \
188 &pos->member != (head); \
191 #define LIST_FOR_EACH_ENTRY_SAFE(pos, storage, head, member) \
192 for (pos = NULL, pos = container_of((head)->next, pos, member), \
194 &pos->member != (head); \
197 #define LIST_FOR_EACH_ENTRY_SAFE_REV(pos, storage, head, member) \
198 for (pos = NULL, pos = container_of((head)->prev, pos, member), \
200 &pos->member != (head); \
203 #define LIST_FOR_EACH_ENTRY_FROM(pos, start, head, member)
[all...] |
| /device/google/contexthub/firmware/os/core/ |
| simpleQ.c | 32 uint32_t head, tail, num, freeHead, entrySz; member in struct:SimpleQueue
64 sq->head = SIMPLE_QUEUE_IDX_NONE;
85 for (i = sq->head; i != SIMPLE_QUEUE_IDX_NONE; i = cur->nextIdx) {
96 uint32_t head; local
98 if (!sq || sq->head == SIMPLE_QUEUE_IDX_NONE)
101 head = sq->head;
102 e = simpleQueueGetNth(sq, head);
104 sq->head = e->nextIdx;
105 if (sq->tail == head)
[all...] |
| /external/mesa3d/src/gallium/auxiliary/pipebuffer/ |
| pb_slab.c | 41 * However, when the head becomes full we purposefully keep it around
58 LIST_DEL(&entry->head); /* remove from reclaim list */
59 LIST_ADD(&entry->head, &slab->free);
63 if (!slab->head.next) {
65 LIST_ADDTAIL(&slab->head, &group->slabs);
69 LIST_DEL(&slab->head);
79 LIST_ENTRY(struct pb_slab_entry, slabs->reclaim.next, head);
118 LIST_IS_EMPTY(&LIST_ENTRY(struct pb_slab, group->slabs.next, head)->free))
123 slab = LIST_ENTRY(struct pb_slab, group->slabs.next, head);
127 LIST_DEL(&slab->head);
[all...] |
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| WnnSentence.java | 116 * @param head The top clause of this sentence
119 public WnnSentence(WnnClause head, WnnSentence tail) {
122 this.id = head.id;
123 this.candidate = head.candidate;
124 this.stroke = head.stroke;
125 this.frequency = head.frequency;
126 this.partOfSpeech = head.partOfSpeech;
127 this.attribute = head.attribute;
129 this.elements.add(head);
132 this.id = head.id
[all...] |
| /prebuilts/go/darwin-x86/src/runtime/ |
| lfstack.go | 6 // Initialize head to 0, compare with 0 to test for emptiness.
18 func lfstackpush(head *uint64, node *lfnode) {
26 old := atomic.Load64(head)
28 if atomic.Cas64(head, old, new) {
34 func lfstackpop(head *uint64) unsafe.Pointer {
36 old := atomic.Load64(head)
42 if atomic.Cas64(head, old, next) {
|
| /prebuilts/go/linux-x86/src/runtime/ |
| lfstack.go | 6 // Initialize head to 0, compare with 0 to test for emptiness.
18 func lfstackpush(head *uint64, node *lfnode) {
26 old := atomic.Load64(head)
28 if atomic.Cas64(head, old, new) {
34 func lfstackpop(head *uint64) unsafe.Pointer {
36 old := atomic.Load64(head)
42 if atomic.Cas64(head, old, next) {
|
| /external/fio/ |
| io_u_queue.h | 49 unsigned int head; member in struct:io_u_ring
60 if (r->head + 1 != r->tail) {
61 r->ring[r->head] = io_u;
62 r->head = (r->head + 1) & (r->max - 1);
71 if (r->head != r->tail) {
83 return ring->head == ring->tail;
|
| /external/okhttp/okio/okio/src/main/java/okio/ |
| InflaterSource.java | 77 sink.head = tail.pop();
104 Segment head = source.buffer().head;
105 bufferBytesHeldByInflater = head.limit - head.pos;
106 inflater.setInput(head.data, head.pos, bufferBytesHeldByInflater);
|
| /device/huawei/angler/camera/QCamera2/util/ |
| QCameraQueue.cpp | 167 * head of the queue
209 * DESCRIPTION: return the head element without removing it
219 struct cam_list *head = NULL; local
224 head = &m_head.list;
225 pos = head->next;
226 if (pos != head) {
245 * @bFromHead : if true, dequeue from the head
254 struct cam_list *head = NULL; local
259 head = &m_head.list;
261 pos = head->next
293 struct cam_list *head = NULL; local
335 struct cam_list *head = NULL; local
380 struct cam_list *head = NULL; local
[all...] |
| /device/lge/bullhead/camera/QCamera2/util/ |
| QCameraQueue.cpp | 167 * head of the queue
209 * DESCRIPTION: return the head element without removing it
219 struct cam_list *head = NULL; local
224 head = &m_head.list;
225 pos = head->next;
226 if (pos != head) {
245 * @bFromHead : if true, dequeue from the head
254 struct cam_list *head = NULL; local
259 head = &m_head.list;
261 pos = head->next
293 struct cam_list *head = NULL; local
335 struct cam_list *head = NULL; local
380 struct cam_list *head = NULL; local
[all...] |
| /external/libdrm/amdgpu/ |
| util_hash_table.c | 53 struct util_hash *head; member in struct:util_hash_table
85 ht->head = util_hash_create();
86 if(!ht->head) {
104 iter = util_hash_find(ht->head, key_hash);
122 iter = util_hash_find(ht->head, key_hash);
160 iter = util_hash_insert(ht->head, key_hash, item);
205 util_hash_erase(ht->head, iter);
217 iter = util_hash_first_node(ht->head);
219 item = (struct util_hash_table_item *)util_hash_take(ht->head, util_hash_iter_key(iter));
221 iter = util_hash_first_node(ht->head);
[all...] |
| /external/libdrm/ |
| util_double_list.h | 116 #define LIST_FOR_EACH_ENTRY(pos, head, member) \
117 for (pos = container_of((head)->next, pos, member); \
118 &pos->member != (head); \
121 #define LIST_FOR_EACH_ENTRY_SAFE(pos, storage, head, member) \
122 for (pos = container_of((head)->next, pos, member), \
124 &pos->member != (head); \
127 #define LIST_FOR_EACH_ENTRY_SAFE_REV(pos, storage, head, member) \
128 for (pos = container_of((head)->prev, pos, member), \
130 &pos->member != (head); \
133 #define LIST_FOR_EACH_ENTRY_FROM(pos, start, head, member)
[all...] |
| /external/valgrind/coregrind/m_gdbserver/ |
| inferiors.c | 48 list->head = new_inferior;
55 struct inferior_list_entry *cur = list->head, *next;
67 if (list->head != list->tail)
70 list->head->id = new_id;
78 if (list->head == entry) {
79 list->head = entry->next;
81 list->tail = list->head;
85 cur = &list->head;
119 struct inferior_list_entry *inf = all_threads.head;
138 struct inferior_list_entry *inf = all_threads.head;
[all...] |
| /device/google/marlin/camera/QCamera2/stack/mm-camera-test/src/ |
| mm_qcamera_queue.c | 111 struct cam_list *head = NULL; local
115 head = &queue->m_head.list;
117 pos = head->next;
119 pos = head->prev;
121 if (pos != head) {
139 struct cam_list *head = NULL; local
147 head = &queue->m_head.list;
148 pos = head->next;
150 while(pos != head) {
|
