/system/chre/core/tests/ |
H A D | memory_manager_test.cc | 78 node *head = static_cast<node*>(manager.nanoappAlloc(&app, sizeof(node))); local 79 node *curr = nullptr, *prev = head; 90 curr = head;
|
/system/bt/btif/src/ |
H A D | btif_uid.cc | 37 uid_set_node_t* head; member in struct:uid_set_t 47 uid_set_node_t* node = set->head; 53 set->head = NULL; 60 uid_set_node_t* node = set->head; 68 node->next = set->head; 69 set->head = node; 95 uid_set_node_t* node = set->head; 107 node = set->head;
|
/system/core/include/cutils/ |
H A D | list.h | 58 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/core/libcutils/include/cutils/ |
H A D | list.h | 58 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/core/libcutils/include_vndk/cutils/ |
H A D | list.h | 58 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 D | 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;
|
H A D | list.cc | 13 list_node_t* head; member in struct:list_t 72 return list->head->data; 111 node->next = list->head; 113 list->head = node; 114 if (list->tail == NULL) list->tail = list->head; 128 list->head = node; 144 if (list->head->data == data) { 145 list_node_t* next = list_free_node_(list, list->head); 146 if (list->tail == list->head) list->tail = next; 147 list->head [all...] |
/system/nfc/src/adaptation/ |
H A D | 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;
|
/system/netd/libnetdutils/include/netdutils/ |
H A D | Slice.h | 120 inline size_t extract(const Slice src, Head& head) { argument 121 return copy(makeSlice(head), src); 128 inline size_t extract(const Slice src, Head& head, Tail... tail) { argument 129 const auto extracted = extract(src, head);
|
/system/core/adb/ |
H A D | socket_test.cpp | 63 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 D | jdwp_service.cpp | 212 char head[header_len + 1]; local 214 snprintf(head, sizeof head, "%04zx", len); 215 memcpy(buffer, head, header_len);
|
/system/core/libdiskconfig/include/diskconfig/ |
H A D | diskconfig.h | 57 uint8_t head; member in struct:chs
|
/system/core/liblog/ |
H A D | 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...] |
/system/extras/latencytop/ |
H A D | 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) { 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 D | showmap.cpp | 133 static void enqueue_map(mapinfo **head, mapinfo *map, int sort_by_address, int coalesce_by_name) { argument 135 mapinfo *current = *head; 162 *head = map; 178 mapinfo *head = NULL; local 201 enqueue_map(&head, current, sort_by_address, coalesce_by_name); 209 enqueue_map(&head, current, sort_by_address, coalesce_by_name); 213 if (!head) { 218 return head;
|
/system/extras/showslab/ |
H A D | showslab.c | 58 * 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/security/keystore/include/keystore/ |
H A D | keymaster_tags.h | 328 std::remove_reference_t<Head> NullOrOr(Head&& head, Tail&&... tail) { argument 329 if (head.isOk()) return head;
|
/system/sepolicy/tools/fc_sort/ |
H A D | fc_sort.c | 322 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; 487 current = head->next; 488 free(head);
|
/system/tools/hidl/ |
H A D | ConstantExpression.cpp | 201 const char* head = value, *tail = head + strlen(value) - 1; local 204 while(tail >= head && (*tail == 'u' || *tail == 'U' || *tail == 'l' || *tail == 'L')) { 209 char *newVal = strndup(value, tail - head + 1);
|
/system/core/libmemunreachable/ |
H A D | Allocator.cpp | 90 void MoveToList(Chunk* chunk, LinkedList<Chunk*>* head); 424 void HeapImpl::MoveToList(Chunk* chunk, LinkedList<Chunk*>* head) { argument 428 LinkedList<Chunk*>* node = head; 430 while (node->next() != head && node->data() != nullptr &&
|
/system/core/libutils/ |
H A D | RefBase.cpp | 326 ref_entry* const head = *refs; local 327 ref_entry* ref = head; 342 ref = head;
|
/system/core/lmkd/ |
H A D | lmkd.c | 166 static void adjslot_insert(struct adjslot_list *head, struct adjslot_list *new) argument 168 struct adjslot_list *next = head->next; 169 new->prev = head; 172 head->next = new; 183 static struct adjslot_list *adjslot_tail(struct adjslot_list *head) { argument 184 struct adjslot_list *asl = head->prev; 186 return asl == head ? NULL : asl;
|
/system/sepolicy/tools/ |
H A D | check_seapp.c | 26 #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) /*NOLINT*/ 88 list_element *head; member in struct:list 232 if (list->head == NULL ) { 233 list->head = list->tail = e; 249 list_element *cursor = list->head; 842 if (!input_file_list.head) { 1200 * stored in the ordered list, head first, which preserves the "first encountered"
|