/hardware/nxp/secure_element/libese-spi/p73/utils/ |
ringbuffer.cpp | 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;
|
/hardware/qcom/camera/msm8998/QCamera2/util/ |
QCameraQueue.cpp | 174 * head of the queue 216 * DESCRIPTION: return the head element without removing it 226 struct cam_list *head = NULL; local 231 head = &m_head.list; 232 pos = head->next; 233 if (pos != head) { 252 * @bFromHead : if true, dequeue from the head 261 struct cam_list *head = NULL; local 266 head = &m_head.list; 268 pos = head->next 301 struct cam_list *head = NULL; local 345 struct cam_list *head = NULL; local 387 struct cam_list *head = NULL; local 432 struct cam_list *head = NULL; local [all...] |
/system/bt/btif/src/ |
btif_uid.cc | 38 uid_set_node_t* head; member in struct:uid_set_t 48 uid_set_node_t* node = set->head; 54 set->head = NULL; 61 uid_set_node_t* node = set->head; 69 node->next = set->head; 70 set->head = node; 96 uid_set_node_t* node = set->head; 108 node = set->head;
|
/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/utils/ |
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.27/gprof/ |
cg_dfn.c | 92 Sym *head = 0; local 99 head = dfn_stack[cycle_top].sym; 100 if (child == head) 104 if (child->cg.cyc.head != child && child->cg.cyc.head == head) 111 fprintf (stderr, "[find_cycle] couldn't find head of cycle\n"); 119 if (head) 121 print_name (head); 149 * field points to the head of the cycle they are glomme [all...] |
/art/runtime/gc/ |
reference_queue.cc | 50 ObjPtr<mirror::Reference> head = list_->GetPendingNext<kWithoutReadBarrier>(); local 51 DCHECK(head != nullptr); 52 ref->SetPendingNext(head); 183 ObjPtr<mirror::Reference> const head = list_; local 184 ObjPtr<mirror::Reference> ref = head; 193 } while (LIKELY(ref != head));
|
/bionic/tests/ |
search_test.cpp | 171 q_node* head = &zero; local 174 ASSERT_EQ(0, head->i); 175 ASSERT_EQ(2, head->next->i); 176 ASSERT_EQ(nullptr, head->next->next); 179 ASSERT_EQ(0, head->i); 180 ASSERT_EQ(nullptr, head->next); 192 ASSERT_EQ(0, head->i); 193 ASSERT_EQ(1, head->next->i); 194 ASSERT_EQ(2, head->next->next->i); 195 ASSERT_EQ(0, head->next->next->next->i) [all...] |
/device/google/contexthub/firmware/os/core/ |
eventQ.c | 29 #define for_each_item_safe(head, pos, tmp) \ 30 for (pos = (head)->next; tmp = (pos)->next, (pos) != (head); pos = (tmp)) 46 struct EvtList head; member in struct:EvtQueue 72 q->head.next = &q->head; 73 q->head.prev = &q->head; 89 for_each_item_safe (&q->head, pos, tmp) { 116 for (pos = q->head.next; pos != &q->head; pos = pos->next) [all...] |
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...] |
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Demo/pdist/ |
rcslib.py | 63 def head(self, name_rev):
member in class:RCS 64 """Return the head revision for NAME_REV"""
66 return dict['head']
72 (e.g. 'head' and its values are the corresponding data
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/misc/ |
FastQueue.java | 72 public T head() { return elementAt(0); } method in class:FastQueue
|
/external/blktrace/btt/ |
misc.c | 35 struct list_head head; member in struct:file_info 41 struct list_head head; member in struct:buf_info 54 struct file_info *fip = list_entry(p, struct file_info, head); 60 list_del(&fip->head); 71 struct buf_info *bip = list_entry(p, struct buf_info, head); 73 list_del(&bip->head); 124 list_add_tail(&fip->head, &files_to_clean); 132 list_add_tail(&bip->head, &all_bufs);
|
/external/clang/test/Modules/Inputs/ |
templates-top.h | 8 node *head; member in class:List
|
/external/eigen/Eigen/src/OrderingMethods/ |
Amd.h | 60 StorageIndex cs_tdfs(StorageIndex j, StorageIndex k, StorageIndex *head, const StorageIndex *next, StorageIndex *post, StorageIndex *stack) 63 if(!head || !next || !post || !stack) return (-1); /* check inputs */ 68 i = head[p]; /* i = youngest child of p */ 76 head[p] = next[i]; /* remove i from children of p */ 116 StorageIndex* head = W + 3*(n+1); local 133 head[i] = -1; // degree list i is empty 173 if(head[d] != -1) last[head[d]] = i; 174 next[i] = head[d]; /* put node i in degree list d */ 175 head[d] = i [all...] |
/external/harfbuzz_ng/src/ |
hb-ot-head-table.hh | 39 * head -- Font Header 44 struct head struct in namespace:OT 51 /* If no valid head table found, assume 1000, which matches typical Type1 usage. */ 64 FixedVersion<>version; /* Version of the head table--currently
|
/external/jemalloc/test/unit/ |
ql.c | 15 test_empty_list(list_head_t *head) 20 assert_ptr_null(ql_first(head), "Unexpected element for empty list"); 21 assert_ptr_null(ql_last(head, link), 25 ql_foreach(t, head, link) { 31 ql_reverse_foreach(t, head, link) { 39 list_head_t head; local 41 ql_new(&head); 42 test_empty_list(&head); 58 test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) 63 assert_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch") 96 list_head_t head; local 111 list_head_t head; local 130 list_head_t head; local 145 list_head_t head; local 164 list_head_t head; local [all...] |
/external/libunwind_llvm/src/ |
Unwind_AppleExtras.cpp | 153 libgcc_object_info *head = (libgcc_object_info *) local 155 if (head != NULL) { 157 for (libgcc_object *ob = head->unseen_objects; ob != NULL; ob = ob->next) { 168 head); 175 _keymgr_set_and_unlock_processwide_ptr(KEYMGR_GCC3_DW2_OBJ_LIST, head);
|
/external/libvncserver/libvncserver/ |
auth.c | 51 rfbSecurityHandler *head = securityHandlers, *next = NULL; local 58 while(head != NULL) { 59 if(head == handler) { 64 head = head->next;
|
/external/libxcam/xcore/base/ |
xcam_smart_result.h | 43 * head.type = XCAM_3A_RESULT_FACE_DETECTION; 44 * head.process_type = XCAM_IMAGE_PROCESS_POST; 45 * head.destroy = free fd result. 49 XCam3aResultHead head; member in struct:_XCamFDResult 56 * head.type = XCAM_3A_RESULT_DVS; 57 * head.process_type = XCAM_IMAGE_PROCESS_POST; 58 * head.destroy = free dvs result. 62 XCam3aResultHead head; member in struct:_XCamDVSResult
|
/external/mesa3d/src/gallium/auxiliary/pipebuffer/ |
pb_slab.h | 62 struct list_head head; member in struct:pb_slab_entry 74 struct list_head head; member in struct:pb_slab
|
/external/mesa3d/src/gallium/auxiliary/util/ |
u_queue.h | 72 struct list_head head; member in struct:util_queue
|
/external/mesa3d/src/gallium/state_trackers/nine/ |
swapchain9.h | 63 unsigned int head; member in struct:NineSwapChain9
|
/external/python/cpython2/Demo/pdist/ |
rcslib.py | 63 def head(self, name_rev): member in class:RCS 64 """Return the head revision for NAME_REV""" 66 return dict['head'] 72 (e.g. 'head' and its values are the corresponding data
|
/external/selinux/libsepol/src/ |
ibendports.c | 113 ocontext_t *c, *head; local 116 head = policydb->ocontexts[OCON_IBENDPORT]; 117 for (c = head; c; c = c->next) 131 ocontext_t *c, *head; local 137 head = policydb->ocontexts[OCON_IBENDPORT]; 138 for (c = head; c; c = c->next) { 159 ocontext_t *c, *head; local 165 head = policydb->ocontexts[OCON_IBENDPORT]; 166 for (c = head; c; c = c->next) { 225 ocontext_t *c, *head; local [all...] |