Searched refs:queue_node (Results 1 – 5 of 5) sorted by relevance
132 struct hid_queue_node *queue_node; in hid_queue_node_alloc() local134 queue_node = zalloc(sizeof(struct hid_queue_node)); in hid_queue_node_alloc()135 if (queue_node == NULL) in hid_queue_node_alloc()138 return queue_node; in hid_queue_node_alloc()141 queue_node->buf_len = len; in hid_queue_node_alloc()142 queue_node->buf_used = 0; in hid_queue_node_alloc()143 queue_node->buf = malloc(len); in hid_queue_node_alloc()144 if (queue_node->buf == NULL) in hid_queue_node_alloc()146 free(queue_node); in hid_queue_node_alloc()151 return queue_node; in hid_queue_node_alloc()
161 struct uac_queue_node *queue_node; in uac_queue_node_alloc() local163 queue_node = zalloc(sizeof(struct uac_queue_node)); in uac_queue_node_alloc()164 if (queue_node == NULL) in uac_queue_node_alloc()170 queue_node->buf_len = len; in uac_queue_node_alloc()171 queue_node->buf_used = 0; in uac_queue_node_alloc()172 queue_node->buf = malloc(len); in uac_queue_node_alloc()173 if (queue_node->buf == NULL) in uac_queue_node_alloc()175 free(queue_node); in uac_queue_node_alloc()180 return queue_node; in uac_queue_node_alloc()
65 LOS_DL_LIST queue_node; member130 LOS_ListDelete(&wait_node->queue_node); in destroy_poll_wait()143 LOS_ListDelete(&wait_node->queue_node); in destroy_poll_wait()193 LOS_ListAdd(&queue->poll_queue, &new_node->queue_node); in add_pollwait_queue()326 LOS_DL_LIST_FOR_EACH_ENTRY(curr, &(wait_address->poll_queue), poll_wait_node, queue_node) in notify_poll_with_key()
17 typedef struct queue_node *queue_node_ptr_t;19 typedef struct queue_node { struct
33 newnode = (queue_node_ptr_t) malloc(sizeof(struct queue_node)); in queue_insert()57 newnode = (queue_node_ptr_t) malloc(sizeof(struct queue_node)); in queue_push()