api.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607
  1. /*
  2. * Scatterlist Cryptographic API.
  3. *
  4. * Copyright (c) 2002 James Morris <jmorris@intercode.com.au>
  5. * Copyright (c) 2002 David S. Miller (davem@redhat.com)
  6. * Copyright (c) 2005 Herbert Xu <herbert@gondor.apana.org.au>
  7. *
  8. * Portions derived from Cryptoapi, by Alexander Kjeldaas <astor@fast.no>
  9. * and Nettle, by Niels Möller.
  10. *
  11. * This program is free software; you can redistribute it and/or modify it
  12. * under the terms of the GNU General Public License as published by the Free
  13. * Software Foundation; either version 2 of the License, or (at your option)
  14. * any later version.
  15. *
  16. */
  17. #include <linux/err.h>
  18. #include <linux/errno.h>
  19. #include <linux/kernel.h>
  20. #include <linux/kmod.h>
  21. #include <linux/module.h>
  22. #include <linux/param.h>
  23. #include <linux/sched.h>
  24. #include <linux/slab.h>
  25. #include <linux/string.h>
  26. #include "internal.h"
  27. LIST_HEAD(crypto_alg_list);
  28. EXPORT_SYMBOL_GPL(crypto_alg_list);
  29. DECLARE_RWSEM(crypto_alg_sem);
  30. EXPORT_SYMBOL_GPL(crypto_alg_sem);
  31. BLOCKING_NOTIFIER_HEAD(crypto_chain);
  32. EXPORT_SYMBOL_GPL(crypto_chain);
  33. static inline struct crypto_alg *crypto_alg_get(struct crypto_alg *alg)
  34. {
  35. atomic_inc(&alg->cra_refcnt);
  36. return alg;
  37. }
  38. struct crypto_alg *crypto_mod_get(struct crypto_alg *alg)
  39. {
  40. return try_module_get(alg->cra_module) ? crypto_alg_get(alg) : NULL;
  41. }
  42. EXPORT_SYMBOL_GPL(crypto_mod_get);
  43. void crypto_mod_put(struct crypto_alg *alg)
  44. {
  45. struct module *module = alg->cra_module;
  46. crypto_alg_put(alg);
  47. module_put(module);
  48. }
  49. EXPORT_SYMBOL_GPL(crypto_mod_put);
  50. static inline int crypto_is_test_larval(struct crypto_larval *larval)
  51. {
  52. return larval->alg.cra_driver_name[0];
  53. }
  54. static struct crypto_alg *__crypto_alg_lookup(const char *name, u32 type,
  55. u32 mask)
  56. {
  57. struct crypto_alg *q, *alg = NULL;
  58. int best = -2;
  59. list_for_each_entry(q, &crypto_alg_list, cra_list) {
  60. int exact, fuzzy;
  61. if (crypto_is_moribund(q))
  62. continue;
  63. if ((q->cra_flags ^ type) & mask)
  64. continue;
  65. if (crypto_is_larval(q) &&
  66. !crypto_is_test_larval((struct crypto_larval *)q) &&
  67. ((struct crypto_larval *)q)->mask != mask)
  68. continue;
  69. exact = !strcmp(q->cra_driver_name, name);
  70. fuzzy = !strcmp(q->cra_name, name);
  71. if (!exact && !(fuzzy && q->cra_priority > best))
  72. continue;
  73. if (unlikely(!crypto_mod_get(q)))
  74. continue;
  75. best = q->cra_priority;
  76. if (alg)
  77. crypto_mod_put(alg);
  78. alg = q;
  79. if (exact)
  80. break;
  81. }
  82. return alg;
  83. }
  84. static void crypto_larval_destroy(struct crypto_alg *alg)
  85. {
  86. struct crypto_larval *larval = (void *)alg;
  87. BUG_ON(!crypto_is_larval(alg));
  88. if (larval->adult)
  89. crypto_mod_put(larval->adult);
  90. kfree(larval);
  91. }
  92. struct crypto_larval *crypto_larval_alloc(const char *name, u32 type, u32 mask)
  93. {
  94. struct crypto_larval *larval;
  95. larval = kzalloc(sizeof(*larval), GFP_KERNEL);
  96. if (!larval)
  97. return ERR_PTR(-ENOMEM);
  98. larval->mask = mask;
  99. larval->alg.cra_flags = CRYPTO_ALG_LARVAL | type;
  100. larval->alg.cra_priority = -1;
  101. larval->alg.cra_destroy = crypto_larval_destroy;
  102. strlcpy(larval->alg.cra_name, name, CRYPTO_MAX_ALG_NAME);
  103. init_completion(&larval->completion);
  104. return larval;
  105. }
  106. EXPORT_SYMBOL_GPL(crypto_larval_alloc);
  107. static struct crypto_alg *crypto_larval_add(const char *name, u32 type,
  108. u32 mask)
  109. {
  110. struct crypto_alg *alg;
  111. struct crypto_larval *larval;
  112. larval = crypto_larval_alloc(name, type, mask);
  113. if (IS_ERR(larval))
  114. return ERR_CAST(larval);
  115. atomic_set(&larval->alg.cra_refcnt, 2);
  116. down_write(&crypto_alg_sem);
  117. alg = __crypto_alg_lookup(name, type, mask);
  118. if (!alg) {
  119. alg = &larval->alg;
  120. list_add(&alg->cra_list, &crypto_alg_list);
  121. }
  122. up_write(&crypto_alg_sem);
  123. if (alg != &larval->alg)
  124. kfree(larval);
  125. return alg;
  126. }
  127. void crypto_larval_kill(struct crypto_alg *alg)
  128. {
  129. struct crypto_larval *larval = (void *)alg;
  130. down_write(&crypto_alg_sem);
  131. list_del(&alg->cra_list);
  132. up_write(&crypto_alg_sem);
  133. complete_all(&larval->completion);
  134. crypto_alg_put(alg);
  135. }
  136. EXPORT_SYMBOL_GPL(crypto_larval_kill);
  137. static struct crypto_alg *crypto_larval_wait(struct crypto_alg *alg)
  138. {
  139. struct crypto_larval *larval = (void *)alg;
  140. long timeout;
  141. timeout = wait_for_completion_interruptible_timeout(
  142. &larval->completion, 60 * HZ);
  143. alg = larval->adult;
  144. if (timeout < 0)
  145. alg = ERR_PTR(-EINTR);
  146. else if (!timeout)
  147. alg = ERR_PTR(-ETIMEDOUT);
  148. else if (!alg)
  149. alg = ERR_PTR(-ENOENT);
  150. else if (crypto_is_test_larval(larval) &&
  151. !(alg->cra_flags & CRYPTO_ALG_TESTED))
  152. alg = ERR_PTR(-EAGAIN);
  153. else if (!crypto_mod_get(alg))
  154. alg = ERR_PTR(-EAGAIN);
  155. crypto_mod_put(&larval->alg);
  156. return alg;
  157. }
  158. struct crypto_alg *crypto_alg_lookup(const char *name, u32 type, u32 mask)
  159. {
  160. struct crypto_alg *alg;
  161. down_read(&crypto_alg_sem);
  162. alg = __crypto_alg_lookup(name, type, mask);
  163. up_read(&crypto_alg_sem);
  164. return alg;
  165. }
  166. EXPORT_SYMBOL_GPL(crypto_alg_lookup);
  167. struct crypto_alg *crypto_larval_lookup(const char *name, u32 type, u32 mask)
  168. {
  169. struct crypto_alg *alg;
  170. if (!name)
  171. return ERR_PTR(-ENOENT);
  172. mask &= ~(CRYPTO_ALG_LARVAL | CRYPTO_ALG_DEAD);
  173. type &= mask;
  174. alg = crypto_alg_lookup(name, type, mask);
  175. if (!alg) {
  176. request_module("%s", name);
  177. if (!((type ^ CRYPTO_ALG_NEED_FALLBACK) & mask &
  178. CRYPTO_ALG_NEED_FALLBACK))
  179. request_module("%s-all", name);
  180. alg = crypto_alg_lookup(name, type, mask);
  181. }
  182. if (alg)
  183. return crypto_is_larval(alg) ? crypto_larval_wait(alg) : alg;
  184. return crypto_larval_add(name, type, mask);
  185. }
  186. EXPORT_SYMBOL_GPL(crypto_larval_lookup);
  187. int crypto_probing_notify(unsigned long val, void *v)
  188. {
  189. int ok;
  190. ok = blocking_notifier_call_chain(&crypto_chain, val, v);
  191. if (ok == NOTIFY_DONE) {
  192. request_module("cryptomgr");
  193. ok = blocking_notifier_call_chain(&crypto_chain, val, v);
  194. }
  195. return ok;
  196. }
  197. EXPORT_SYMBOL_GPL(crypto_probing_notify);
  198. struct crypto_alg *crypto_alg_mod_lookup(const char *name, u32 type, u32 mask)
  199. {
  200. struct crypto_alg *alg;
  201. struct crypto_alg *larval;
  202. int ok;
  203. if (!((type | mask) & CRYPTO_ALG_TESTED)) {
  204. type |= CRYPTO_ALG_TESTED;
  205. mask |= CRYPTO_ALG_TESTED;
  206. }
  207. larval = crypto_larval_lookup(name, type, mask);
  208. if (IS_ERR(larval) || !crypto_is_larval(larval))
  209. return larval;
  210. ok = crypto_probing_notify(CRYPTO_MSG_ALG_REQUEST, larval);
  211. if (ok == NOTIFY_STOP)
  212. alg = crypto_larval_wait(larval);
  213. else {
  214. crypto_mod_put(larval);
  215. alg = ERR_PTR(-ENOENT);
  216. }
  217. crypto_larval_kill(larval);
  218. return alg;
  219. }
  220. EXPORT_SYMBOL_GPL(crypto_alg_mod_lookup);
  221. static int crypto_init_ops(struct crypto_tfm *tfm, u32 type, u32 mask)
  222. {
  223. const struct crypto_type *type_obj = tfm->__crt_alg->cra_type;
  224. if (type_obj)
  225. return type_obj->init(tfm, type, mask);
  226. switch (crypto_tfm_alg_type(tfm)) {
  227. case CRYPTO_ALG_TYPE_CIPHER:
  228. return crypto_init_cipher_ops(tfm);
  229. case CRYPTO_ALG_TYPE_COMPRESS:
  230. return crypto_init_compress_ops(tfm);
  231. default:
  232. break;
  233. }
  234. BUG();
  235. return -EINVAL;
  236. }
  237. static void crypto_exit_ops(struct crypto_tfm *tfm)
  238. {
  239. const struct crypto_type *type = tfm->__crt_alg->cra_type;
  240. if (type) {
  241. if (tfm->exit)
  242. tfm->exit(tfm);
  243. return;
  244. }
  245. switch (crypto_tfm_alg_type(tfm)) {
  246. case CRYPTO_ALG_TYPE_CIPHER:
  247. crypto_exit_cipher_ops(tfm);
  248. break;
  249. case CRYPTO_ALG_TYPE_COMPRESS:
  250. crypto_exit_compress_ops(tfm);
  251. break;
  252. default:
  253. BUG();
  254. }
  255. }
  256. static unsigned int crypto_ctxsize(struct crypto_alg *alg, u32 type, u32 mask)
  257. {
  258. const struct crypto_type *type_obj = alg->cra_type;
  259. unsigned int len;
  260. len = alg->cra_alignmask & ~(crypto_tfm_ctx_alignment() - 1);
  261. if (type_obj)
  262. return len + type_obj->ctxsize(alg, type, mask);
  263. switch (alg->cra_flags & CRYPTO_ALG_TYPE_MASK) {
  264. default:
  265. BUG();
  266. case CRYPTO_ALG_TYPE_CIPHER:
  267. len += crypto_cipher_ctxsize(alg);
  268. break;
  269. case CRYPTO_ALG_TYPE_COMPRESS:
  270. len += crypto_compress_ctxsize(alg);
  271. break;
  272. }
  273. return len;
  274. }
  275. void crypto_shoot_alg(struct crypto_alg *alg)
  276. {
  277. down_write(&crypto_alg_sem);
  278. alg->cra_flags |= CRYPTO_ALG_DYING;
  279. up_write(&crypto_alg_sem);
  280. }
  281. EXPORT_SYMBOL_GPL(crypto_shoot_alg);
  282. struct crypto_tfm *__crypto_alloc_tfm(struct crypto_alg *alg, u32 type,
  283. u32 mask)
  284. {
  285. struct crypto_tfm *tfm = NULL;
  286. unsigned int tfm_size;
  287. int err = -ENOMEM;
  288. tfm_size = sizeof(*tfm) + crypto_ctxsize(alg, type, mask);
  289. tfm = kzalloc(tfm_size, GFP_KERNEL);
  290. if (tfm == NULL)
  291. goto out_err;
  292. tfm->__crt_alg = alg;
  293. err = crypto_init_ops(tfm, type, mask);
  294. if (err)
  295. goto out_free_tfm;
  296. if (!tfm->exit && alg->cra_init && (err = alg->cra_init(tfm)))
  297. goto cra_init_failed;
  298. goto out;
  299. cra_init_failed:
  300. crypto_exit_ops(tfm);
  301. out_free_tfm:
  302. if (err == -EAGAIN)
  303. crypto_shoot_alg(alg);
  304. kfree(tfm);
  305. out_err:
  306. tfm = ERR_PTR(err);
  307. out:
  308. return tfm;
  309. }
  310. EXPORT_SYMBOL_GPL(__crypto_alloc_tfm);
  311. /*
  312. * crypto_alloc_base - Locate algorithm and allocate transform
  313. * @alg_name: Name of algorithm
  314. * @type: Type of algorithm
  315. * @mask: Mask for type comparison
  316. *
  317. * This function should not be used by new algorithm types.
  318. * Plesae use crypto_alloc_tfm instead.
  319. *
  320. * crypto_alloc_base() will first attempt to locate an already loaded
  321. * algorithm. If that fails and the kernel supports dynamically loadable
  322. * modules, it will then attempt to load a module of the same name or
  323. * alias. If that fails it will send a query to any loaded crypto manager
  324. * to construct an algorithm on the fly. A refcount is grabbed on the
  325. * algorithm which is then associated with the new transform.
  326. *
  327. * The returned transform is of a non-determinate type. Most people
  328. * should use one of the more specific allocation functions such as
  329. * crypto_alloc_blkcipher.
  330. *
  331. * In case of error the return value is an error pointer.
  332. */
  333. struct crypto_tfm *crypto_alloc_base(const char *alg_name, u32 type, u32 mask)
  334. {
  335. struct crypto_tfm *tfm;
  336. int err;
  337. for (;;) {
  338. struct crypto_alg *alg;
  339. alg = crypto_alg_mod_lookup(alg_name, type, mask);
  340. if (IS_ERR(alg)) {
  341. err = PTR_ERR(alg);
  342. goto err;
  343. }
  344. tfm = __crypto_alloc_tfm(alg, type, mask);
  345. if (!IS_ERR(tfm))
  346. return tfm;
  347. crypto_mod_put(alg);
  348. err = PTR_ERR(tfm);
  349. err:
  350. if (err != -EAGAIN)
  351. break;
  352. if (signal_pending(current)) {
  353. err = -EINTR;
  354. break;
  355. }
  356. }
  357. return ERR_PTR(err);
  358. }
  359. EXPORT_SYMBOL_GPL(crypto_alloc_base);
  360. void *crypto_create_tfm(struct crypto_alg *alg,
  361. const struct crypto_type *frontend)
  362. {
  363. char *mem;
  364. struct crypto_tfm *tfm = NULL;
  365. unsigned int tfmsize;
  366. unsigned int total;
  367. int err = -ENOMEM;
  368. tfmsize = frontend->tfmsize;
  369. total = tfmsize + sizeof(*tfm) + frontend->extsize(alg);
  370. mem = kzalloc(total, GFP_KERNEL);
  371. if (mem == NULL)
  372. goto out_err;
  373. tfm = (struct crypto_tfm *)(mem + tfmsize);
  374. tfm->__crt_alg = alg;
  375. err = frontend->init_tfm(tfm);
  376. if (err)
  377. goto out_free_tfm;
  378. if (!tfm->exit && alg->cra_init && (err = alg->cra_init(tfm)))
  379. goto cra_init_failed;
  380. goto out;
  381. cra_init_failed:
  382. crypto_exit_ops(tfm);
  383. out_free_tfm:
  384. if (err == -EAGAIN)
  385. crypto_shoot_alg(alg);
  386. kfree(mem);
  387. out_err:
  388. mem = ERR_PTR(err);
  389. out:
  390. return mem;
  391. }
  392. EXPORT_SYMBOL_GPL(crypto_create_tfm);
  393. struct crypto_alg *crypto_find_alg(const char *alg_name,
  394. const struct crypto_type *frontend,
  395. u32 type, u32 mask)
  396. {
  397. struct crypto_alg *(*lookup)(const char *name, u32 type, u32 mask) =
  398. crypto_alg_mod_lookup;
  399. if (frontend) {
  400. type &= frontend->maskclear;
  401. mask &= frontend->maskclear;
  402. type |= frontend->type;
  403. mask |= frontend->maskset;
  404. if (frontend->lookup)
  405. lookup = frontend->lookup;
  406. }
  407. return lookup(alg_name, type, mask);
  408. }
  409. EXPORT_SYMBOL_GPL(crypto_find_alg);
  410. /*
  411. * crypto_alloc_tfm - Locate algorithm and allocate transform
  412. * @alg_name: Name of algorithm
  413. * @frontend: Frontend algorithm type
  414. * @type: Type of algorithm
  415. * @mask: Mask for type comparison
  416. *
  417. * crypto_alloc_tfm() will first attempt to locate an already loaded
  418. * algorithm. If that fails and the kernel supports dynamically loadable
  419. * modules, it will then attempt to load a module of the same name or
  420. * alias. If that fails it will send a query to any loaded crypto manager
  421. * to construct an algorithm on the fly. A refcount is grabbed on the
  422. * algorithm which is then associated with the new transform.
  423. *
  424. * The returned transform is of a non-determinate type. Most people
  425. * should use one of the more specific allocation functions such as
  426. * crypto_alloc_blkcipher.
  427. *
  428. * In case of error the return value is an error pointer.
  429. */
  430. void *crypto_alloc_tfm(const char *alg_name,
  431. const struct crypto_type *frontend, u32 type, u32 mask)
  432. {
  433. void *tfm;
  434. int err;
  435. for (;;) {
  436. struct crypto_alg *alg;
  437. alg = crypto_find_alg(alg_name, frontend, type, mask);
  438. if (IS_ERR(alg)) {
  439. err = PTR_ERR(alg);
  440. goto err;
  441. }
  442. tfm = crypto_create_tfm(alg, frontend);
  443. if (!IS_ERR(tfm))
  444. return tfm;
  445. crypto_mod_put(alg);
  446. err = PTR_ERR(tfm);
  447. err:
  448. if (err != -EAGAIN)
  449. break;
  450. if (signal_pending(current)) {
  451. err = -EINTR;
  452. break;
  453. }
  454. }
  455. return ERR_PTR(err);
  456. }
  457. EXPORT_SYMBOL_GPL(crypto_alloc_tfm);
  458. /*
  459. * crypto_destroy_tfm - Free crypto transform
  460. * @mem: Start of tfm slab
  461. * @tfm: Transform to free
  462. *
  463. * This function frees up the transform and any associated resources,
  464. * then drops the refcount on the associated algorithm.
  465. */
  466. void crypto_destroy_tfm(void *mem, struct crypto_tfm *tfm)
  467. {
  468. struct crypto_alg *alg;
  469. if (unlikely(!mem))
  470. return;
  471. alg = tfm->__crt_alg;
  472. if (!tfm->exit && alg->cra_exit)
  473. alg->cra_exit(tfm);
  474. crypto_exit_ops(tfm);
  475. crypto_mod_put(alg);
  476. kzfree(mem);
  477. }
  478. EXPORT_SYMBOL_GPL(crypto_destroy_tfm);
  479. int crypto_has_alg(const char *name, u32 type, u32 mask)
  480. {
  481. int ret = 0;
  482. struct crypto_alg *alg = crypto_alg_mod_lookup(name, type, mask);
  483. if (!IS_ERR(alg)) {
  484. crypto_mod_put(alg);
  485. ret = 1;
  486. }
  487. return ret;
  488. }
  489. EXPORT_SYMBOL_GPL(crypto_has_alg);
  490. MODULE_DESCRIPTION("Cryptographic core API");
  491. MODULE_LICENSE("GPL");