Searched defs:head (Results 1 - 15 of 15) sorted by relevance

/system/core/adb/
H A Dtest_track_devices.cpp54 char head[5] = "0000"; local
56 if (!android::base::ReadFully(s, head, 4))
60 if (sscanf(head, "%04x", &len) != 1 )
66 printf( "received header %.*s (%d bytes):\n%.*s----\n", 4, head, len, len, buffer );
H A Dsocket_test.cpp63 auto connect = [](asocket* tail, asocket* head) {
64 tail->peer = head;
65 head->peer = tail;
72 asocket* head = create_local_socket(intermediate[0]); local
73 ASSERT_NE(nullptr, head);
78 connect(prev_tail, head);
H A Djdwp_service.cpp169 char head[5]; local
171 snprintf(head, sizeof head, "%04x", len);
172 memcpy(buffer, head, 4);
/system/bt/btif/src/
H A Dbtif_uid.c39 uid_set_node_t* head; member in struct:uid_set_t
50 uid_set_node_t* node = set->head;
56 set->head = NULL;
64 uid_set_node_t* node = set->head;
72 node->next = set->head;
73 set->head = node;
105 uid_set_node_t* node = set->head;
115 node = set->head;
/system/core/include/cutils/
H A Dlist.h58 static inline void list_add_tail(struct listnode *head, struct listnode *item) argument
60 item->next = head;
61 item->prev = head->prev;
62 head->prev->next = item;
63 head->prev = item;
66 static inline void list_add_head(struct listnode *head, struct listnode *item) argument
68 item->next = head->next;
69 item->prev = head;
70 head->next->prev = item;
71 head
[all...]
/system/bt/osi/src/
H A Dringbuffer.c29 uint8_t *head; member in struct:ringbuffer_t
37 p->head = p->tail = p->base;
82 rb->head += length;
83 if (rb->head >= (rb->base + rb->total))
84 rb->head -= rb->total;
96 uint8_t *b = ((rb->head - rb->base + offset) % rb->total) + rb->base;
113 rb->head += copied;
114 if (rb->head >= (rb->base + rb->total))
115 rb->head -= rb->total;
H A Dlist.c13 list_node_t *head; member in struct:list_t
72 return list->head->data;
114 node->next = list->head;
116 list->head = node;
118 list->tail = list->head;
133 list->head = node;
150 if (list->head->data == data) {
151 list_node_t *next = list_free_node_(list, list->head);
152 if (list->tail == list->head)
154 list->head
[all...]
/system/core/include/diskconfig/
H A Ddiskconfig.h57 uint8_t head; member in struct:chs
/system/extras/latencytop/
H A Dlatencytop.c56 static void print_latency_entries(struct latency_entry *head);
294 static struct latency_entry *find_latency_entry(struct latency_entry *head, char *reason) { argument
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) { argument
[all...]
/system/extras/showmap/
H A Dshowmap.cpp130 static void enqueue_map(mapinfo **head, mapinfo *map, int sort_by_address, int coalesce_by_name) { argument
132 mapinfo *current = *head;
158 *head = map;
174 mapinfo *head = NULL; local
197 enqueue_map(&head, current, sort_by_address, coalesce_by_name);
205 enqueue_map(&head, current, sort_by_address, coalesce_by_name);
209 if (!head) {
214 return head;
/system/extras/showslab/
H A Dshowslab.c58 * Returns the head of the new list of slab_info structures, or NULL on error.
62 struct slab_info *head = NULL, *p = NULL, *prev = NULL; local
100 head = NULL;
104 head = prev = p;
117 head = NULL;
153 return head;
/system/sepolicy/tools/fc_sort/
H A Dfc_sort.c322 file_context_node_t *head; local
347 /* Initialize the head of the linked list. */
348 head = current = (file_context_node_t*)malloc(sizeof(file_context_node_t));
349 head->next = NULL;
489 current = head->next;
/system/core/libutils/
H A DRefBase.cpp311 ref_entry* const head = *refs; local
312 ref_entry* ref = head;
327 ref = head;
/system/core/lmkd/
H A Dlmkd.c156 static void adjslot_insert(struct adjslot_list *head, struct adjslot_list *new) argument
158 struct adjslot_list *next = head->next;
159 new->prev = head;
162 head->next = new;
173 static struct adjslot_list *adjslot_tail(struct adjslot_list *head) { argument
174 struct adjslot_list *asl = head->prev;
176 return asl == head ? NULL : asl;
/system/sepolicy/tools/
H A Dcheck_seapp.c26 #define list_init(free_fn) { .head = NULL, .tail = NULL, .freefn = free_fn }
42 * @list The list head to walk
46 for(var = (list)->head; var != NULL; var = var->next)
88 list_element *head; member in struct:list
229 if (list->head == NULL ) {
230 list->head = list->tail = e;
246 list_element *cursor = list->head;
813 if (!input_file_list.head) {
1171 * stored in the ordered list, head first, which preserves the "first encountered"

Completed in 282 milliseconds