Lines Matching refs:list
14 #include <linux/list.h>
93 * This function adds a spawn to the list secondary_spawns which
108 spawn = list_first_entry_or_null(stack, struct crypto_spawn, list);
112 n = list_prev_entry(spawn, list);
113 list_move(&spawn->list, secondary_spawns);
115 if (list_is_last(&n->list, stack))
118 n = list_next_entry(n, list);
126 struct list_head *list)
138 list_move(&inst->alg.cra_list, list);
139 hlist_del(&inst->list);
151 void crypto_remove_spawns(struct crypto_alg *alg, struct list_head *list,
162 list_for_each_entry_safe(spawn, n, spawns, list) {
166 list_move(&spawn->list, &top);
171 * the cra_users tree. The list stack records the path
180 list);
183 list_move(&spawn->list, &stack);
220 * back to the cra_users list.
222 list_for_each_entry_safe(spawn, n, &secondary_spawns, list) {
224 list_move(&spawn->list, &spawn->alg->cra_users);
226 crypto_remove_instance(spawn->inst, list);
301 LIST_HEAD(list);
380 crypto_remove_spawns(q, &list, alg);
389 crypto_remove_final(&list);
393 void crypto_remove_final(struct list_head *list)
398 list_for_each_entry_safe(alg, n, list, cra_list) {
447 static int crypto_remove_alg(struct crypto_alg *alg, struct list_head *list)
455 crypto_remove_spawns(alg, list, NULL);
463 LIST_HEAD(list);
466 ret = crypto_remove_alg(alg, &list);
478 crypto_remove_final(&list);
520 list_for_each_entry(q, &crypto_template_list, list) {
525 list_add(&tmpl->list, &crypto_template_list);
555 struct hlist_head *list;
560 BUG_ON(list_empty(&tmpl->list));
561 list_del_init(&tmpl->list);
563 list = &tmpl->instances;
564 hlist_for_each_entry(inst, list, list) {
572 hlist_for_each_entry_safe(inst, n, list, list) {
594 list_for_each_entry(q, &crypto_template_list, list) {
651 hlist_add_head(&inst->list, &tmpl->instances);
671 LIST_HEAD(list);
675 crypto_remove_spawns(&inst->alg, &list, NULL);
676 crypto_remove_instance(inst, &list);
680 crypto_remove_final(&list);
703 list_add(&spawn->list, &alg->cra_users);
726 list_del(&spawn->list);
921 INIT_LIST_HEAD(&queue->list);
922 queue->backlog = &queue->list;
939 if (queue->backlog == &queue->list)
940 queue->backlog = &request->list;
944 list_add_tail(&request->list, &queue->list);
955 list_add(&request->list, &queue->list);
968 if (queue->backlog != &queue->list)
971 request = queue->list.next;
974 return list_entry(request, struct crypto_async_request, list);