linux-master/crypto/algapi.c

15 #include <linux/list.h>
99  * This function adds a spawn to the list secondary_spawns which
114 	spawn = list_first_entry_or_null(stack, struct crypto_spawn, list);
118 	n = list_prev_entry(spawn, list);
119 	list_move(&spawn->list, secondary_spawns);
121 	if (list_is_last(&n->list, stack))
124 	n = list_next_entry(n, list);
132 				   struct list_head *list)
144 	list_move(&inst->alg.cra_list, list);
145 	hlist_del(&inst->list);
157 void crypto_remove_spawns(struct crypto_alg *alg, struct list_head *list,
168 	list_for_each_entry_safe(spawn, n, spawns, list) {
172 		list_move(&spawn->list, &top);
177 	 * the cra_users tree.  The list stack records the path
186 						 list);
189 			list_move(&spawn->list, &stack);
226 	 * back to the cra_users list.
228 	list_for_each_entry_safe(spawn, n, &secondary_spawns, list) {
230 			list_move(&spawn->list, &spawn->alg->cra_users);
232 			crypto_remove_instance(spawn->inst, list);
378 	LIST_HEAD(list);
429 	crypto_alg_finish_registration(alg, best, &list);
437 	crypto_remove_final(&list);
441 void crypto_remove_final(struct list_head *list)
446 	list_for_each_entry_safe(alg, n, list, cra_list) {
482 static int crypto_remove_alg(struct crypto_alg *alg, struct list_head *list)
490 	crypto_remove_spawns(alg, list, NULL);
498 	LIST_HEAD(list);
501 	ret = crypto_remove_alg(alg, &list);
513 	crypto_remove_final(&list);
555 	list_for_each_entry(q, &crypto_template_list, list) {
560 	list_add(&tmpl->list, &crypto_template_list);
590 	struct hlist_head *list;
595 	BUG_ON(list_empty(&tmpl->list));
596 	list_del_init(&tmpl->list);
598 	list = &tmpl->instances;
599 	hlist_for_each_entry(inst, list, list) {
607 	hlist_for_each_entry_safe(inst, n, list, list) {
629 	list_for_each_entry(q, &crypto_template_list, list) {
694 	hlist_add_head(&inst->list, &tmpl->instances);
711 	LIST_HEAD(list);
715 	crypto_remove_spawns(&inst->alg, &list, NULL);
716 	crypto_remove_instance(inst, &list);
720 	crypto_remove_final(&list);
744 		list_add(&spawn->list, &alg->cra_users);
767 		list_del(&spawn->list);
944 	INIT_LIST_HEAD(&queue->list);
945 	queue->backlog = &queue->list;
962 		if (queue->backlog == &queue->list)
963 			queue->backlog = &request->list;
967 	list_add_tail(&request->list, &queue->list);
981 	list_add(&request->list, &queue->list);
994 	if (queue->backlog != &queue->list)
997 	request = queue->list.next;
1000 	return list_entry(request, struct crypto_async_request, list);