Lines Matching refs:entry
54 * hash table entry is kcm_ops_queue structure which in turn contains a
100 /* If this was the last entry, remove the key (the UID) from the
116 static int kcm_op_queue_entry_destructor(struct kcm_ops_queue_entry *entry)
121 if (entry == NULL) {
125 /* Take the next entry from the queue */
126 next_entry = entry->next;
128 /* Remove the current entry from the queue */
129 DLIST_REMOVE(entry->queue->head, entry);
132 /* If there was no other entry, schedule removal of the queue. Do it
136 imm = tevent_create_immediate(entry->queue);
141 tevent_schedule_immediate(imm, entry->queue->ev, queue_removal_cb, entry->queue);
213 struct kcm_ops_queue_entry *entry;
289 state->entry = talloc_zero(kq->qctx->wait_queue_hash, struct kcm_ops_queue_entry);
290 if (state->entry == NULL) {
293 state->entry->req = req;
294 state->entry->queue = kq;
295 talloc_set_destructor(state->entry, kcm_op_queue_entry_destructor);
298 /* First entry, will run callback at once */
305 DLIST_ADD_END(kq->head, state->entry, struct kcm_ops_queue_entry *);
311 * entry should be allocated on the same memory context as the enqueued request
324 *_entry = talloc_steal(mem_ctx, state->entry);