Searched refs:element (Results 1 – 13 of 13) sorted by relevance
39 void *element; member73 void *element = pop(q); in free_queue_and_qelement() local74 if (element) in free_queue_and_qelement()75 free(element); in free_queue_and_qelement()79 int push(Queue *q, void * element) in push() argument86 new_node->element = element; in push()107 void *element; in pop() local113 element = temp->element; in pop()126 return element; in pop()
213 timestamp *element = NULL,*duplicate = NULL; in get_next_timestamp() local224 if (!element) in get_next_timestamp()225 element = &phead->input_timestamps[i]; in get_next_timestamp()227 if (element->timestamps > phead->input_timestamps[i].timestamps){ in get_next_timestamp()228 element = &phead->input_timestamps[i]; in get_next_timestamp()230 } else if(element->timestamps == phead->input_timestamps[i].timestamps) in get_next_timestamp()235 if (element) { in get_next_timestamp()237 header->nTimeStamp = element->timestamps; in get_next_timestamp()240 element->in_use = false; in get_next_timestamp()
36 int push(Queue *q, void * element);
59 void * element){ in enqueue() argument64 mContainer.add(element); in enqueue()
60 void * element){ in enqueue() argument65 mContainer.add(element); in enqueue()
73 bool enqueue(void *element);
364 bool add(struct msm_frame *element);
1187 struct msm_frame * element){ in add() argument1192 mContainer.add(element); in add()
58 bool enqueue(void *element);
63 bool enqueue(void *element);
306 uint32 element[1]; member
451 uint32 element[1]; member