scatterwalk.h 3.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118
  1. /*
  2. * Cryptographic scatter and gather helpers.
  3. *
  4. * Copyright (c) 2002 James Morris <jmorris@intercode.com.au>
  5. * Copyright (c) 2002 Adam J. Richter <adam@yggdrasil.com>
  6. * Copyright (c) 2004 Jean-Luc Cooke <jlcooke@certainkey.com>
  7. * Copyright (c) 2007 Herbert Xu <herbert@gondor.apana.org.au>
  8. *
  9. * This program is free software; you can redistribute it and/or modify it
  10. * under the terms of the GNU General Public License as published by the Free
  11. * Software Foundation; either version 2 of the License, or (at your option)
  12. * any later version.
  13. *
  14. */
  15. #ifndef _CRYPTO_SCATTERWALK_H
  16. #define _CRYPTO_SCATTERWALK_H
  17. #include <asm/kmap_types.h>
  18. #include <crypto/algapi.h>
  19. #include <linux/hardirq.h>
  20. #include <linux/highmem.h>
  21. #include <linux/kernel.h>
  22. #include <linux/mm.h>
  23. #include <linux/scatterlist.h>
  24. #include <linux/sched.h>
  25. static inline void crypto_yield(u32 flags)
  26. {
  27. if (flags & CRYPTO_TFM_REQ_MAY_SLEEP)
  28. cond_resched();
  29. }
  30. static inline void scatterwalk_sg_chain(struct scatterlist *sg1, int num,
  31. struct scatterlist *sg2)
  32. {
  33. sg_set_page(&sg1[num - 1], (void *)sg2, 0, 0);
  34. sg1[num - 1].page_link &= ~0x02;
  35. sg1[num - 1].page_link |= 0x01;
  36. }
  37. static inline struct scatterlist *scatterwalk_sg_next(struct scatterlist *sg)
  38. {
  39. if (sg_is_last(sg))
  40. return NULL;
  41. return (++sg)->length ? sg : sg_chain_ptr(sg);
  42. }
  43. static inline void scatterwalk_crypto_chain(struct scatterlist *head,
  44. struct scatterlist *sg,
  45. int chain, int num)
  46. {
  47. if (chain) {
  48. head->length += sg->length;
  49. sg = scatterwalk_sg_next(sg);
  50. }
  51. if (sg)
  52. scatterwalk_sg_chain(head, num, sg);
  53. else
  54. sg_mark_end(head);
  55. }
  56. static inline unsigned long scatterwalk_samebuf(struct scatter_walk *walk_in,
  57. struct scatter_walk *walk_out)
  58. {
  59. return !(((sg_page(walk_in->sg) - sg_page(walk_out->sg)) << PAGE_SHIFT) +
  60. (int)(walk_in->offset - walk_out->offset));
  61. }
  62. static inline unsigned int scatterwalk_pagelen(struct scatter_walk *walk)
  63. {
  64. unsigned int len = walk->sg->offset + walk->sg->length - walk->offset;
  65. unsigned int len_this_page = offset_in_page(~walk->offset) + 1;
  66. return len_this_page > len ? len : len_this_page;
  67. }
  68. static inline unsigned int scatterwalk_clamp(struct scatter_walk *walk,
  69. unsigned int nbytes)
  70. {
  71. unsigned int len_this_page = scatterwalk_pagelen(walk);
  72. return nbytes > len_this_page ? len_this_page : nbytes;
  73. }
  74. static inline void scatterwalk_advance(struct scatter_walk *walk,
  75. unsigned int nbytes)
  76. {
  77. walk->offset += nbytes;
  78. }
  79. static inline unsigned int scatterwalk_aligned(struct scatter_walk *walk,
  80. unsigned int alignmask)
  81. {
  82. return !(walk->offset & alignmask);
  83. }
  84. static inline struct page *scatterwalk_page(struct scatter_walk *walk)
  85. {
  86. return sg_page(walk->sg) + (walk->offset >> PAGE_SHIFT);
  87. }
  88. static inline void scatterwalk_unmap(void *vaddr)
  89. {
  90. kunmap_atomic(vaddr);
  91. }
  92. void scatterwalk_start(struct scatter_walk *walk, struct scatterlist *sg);
  93. void scatterwalk_copychunks(void *buf, struct scatter_walk *walk,
  94. size_t nbytes, int out);
  95. void *scatterwalk_map(struct scatter_walk *walk);
  96. void scatterwalk_done(struct scatter_walk *walk, int out, int more);
  97. void scatterwalk_map_and_copy(void *buf, struct scatterlist *sg,
  98. unsigned int start, unsigned int nbytes, int out);
  99. #endif /* _CRYPTO_SCATTERWALK_H */