Blame view
lib/scatterlist.c
18.2 KB
0db9299f4 SG: Move function... |
1 2 3 4 5 6 7 8 |
/* * Copyright (C) 2007 Jens Axboe <jens.axboe@oracle.com> * * Scatterlist handling helpers. * * This source code is licensed under the GNU General Public License, * Version 2. See the file COPYING for more details. */ |
8bc3bcc93 lib: reduce the u... |
9 |
#include <linux/export.h> |
5a0e3ad6a include cleanup: ... |
10 |
#include <linux/slab.h> |
0db9299f4 SG: Move function... |
11 |
#include <linux/scatterlist.h> |
b1adaf65b [SCSI] block: add... |
12 |
#include <linux/highmem.h> |
b94de9bb7 lib/scatterlist: ... |
13 |
#include <linux/kmemleak.h> |
0db9299f4 SG: Move function... |
14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 |
/** * sg_next - return the next scatterlist entry in a list * @sg: The current sg entry * * Description: * Usually the next entry will be @sg@ + 1, but if this sg element is part * of a chained scatterlist, it could jump to the start of a new * scatterlist array. * **/ struct scatterlist *sg_next(struct scatterlist *sg) { #ifdef CONFIG_DEBUG_SG BUG_ON(sg->sg_magic != SG_MAGIC); #endif if (sg_is_last(sg)) return NULL; sg++; if (unlikely(sg_is_chain(sg))) sg = sg_chain_ptr(sg); return sg; } EXPORT_SYMBOL(sg_next); /** |
2e4846102 scatterlist: add ... |
42 43 44 45 46 47 48 49 50 51 |
* sg_nents - return total count of entries in scatterlist * @sg: The scatterlist * * Description: * Allows to know how many entries are in sg, taking into acount * chaining as well * **/ int sg_nents(struct scatterlist *sg) { |
232f1b510 scatterlist: refa... |
52 53 |
int nents; for (nents = 0; sg; sg = sg_next(sg)) |
2e4846102 scatterlist: add ... |
54 |
nents++; |
2e4846102 scatterlist: add ... |
55 56 57 58 59 60 |
return nents; } EXPORT_SYMBOL(sg_nents); /** |
0db9299f4 SG: Move function... |
61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 |
* sg_last - return the last scatterlist entry in a list * @sgl: First entry in the scatterlist * @nents: Number of entries in the scatterlist * * Description: * Should only be used casually, it (currently) scans the entire list * to get the last entry. * * Note that the @sgl@ pointer passed in need not be the first one, * the important bit is that @nents@ denotes the number of entries that * exist from @sgl@. * **/ struct scatterlist *sg_last(struct scatterlist *sgl, unsigned int nents) { |
308c09f17 lib/scatterlist: ... |
76 |
#ifndef CONFIG_ARCH_HAS_SG_CHAIN |
0db9299f4 SG: Move function... |
77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 |
struct scatterlist *ret = &sgl[nents - 1]; #else struct scatterlist *sg, *ret = NULL; unsigned int i; for_each_sg(sgl, sg, nents, i) ret = sg; #endif #ifdef CONFIG_DEBUG_SG BUG_ON(sgl[0].sg_magic != SG_MAGIC); BUG_ON(!sg_is_last(ret)); #endif return ret; } EXPORT_SYMBOL(sg_last); /** * sg_init_table - Initialize SG table * @sgl: The SG table * @nents: Number of entries in table * * Notes: * If this is part of a chained sg table, sg_mark_end() should be * used only on the last table part. * **/ void sg_init_table(struct scatterlist *sgl, unsigned int nents) { memset(sgl, 0, sizeof(*sgl) * nents); #ifdef CONFIG_DEBUG_SG { unsigned int i; for (i = 0; i < nents; i++) sgl[i].sg_magic = SG_MAGIC; } #endif sg_mark_end(&sgl[nents - 1]); } EXPORT_SYMBOL(sg_init_table); /** * sg_init_one - Initialize a single entry sg list * @sg: SG entry * @buf: Virtual address for IO * @buflen: IO length * **/ void sg_init_one(struct scatterlist *sg, const void *buf, unsigned int buflen) { sg_init_table(sg, 1); sg_set_buf(sg, buf, buflen); } EXPORT_SYMBOL(sg_init_one); /* * The default behaviour of sg_alloc_table() is to use these kmalloc/kfree * helpers. */ static struct scatterlist *sg_kmalloc(unsigned int nents, gfp_t gfp_mask) { |
b94de9bb7 lib/scatterlist: ... |
138 139 140 141 142 143 144 145 146 147 148 149 150 151 |
if (nents == SG_MAX_SINGLE_ALLOC) { /* * Kmemleak doesn't track page allocations as they are not * commonly used (in a raw form) for kernel data structures. * As we chain together a list of pages and then a normal * kmalloc (tracked by kmemleak), in order to for that last * allocation not to become decoupled (and thus a * false-positive) we need to inform kmemleak of all the * intermediate allocations. */ void *ptr = (void *) __get_free_page(gfp_mask); kmemleak_alloc(ptr, PAGE_SIZE, 1, gfp_mask); return ptr; } else |
0db9299f4 SG: Move function... |
152 153 154 155 156 |
return kmalloc(nents * sizeof(struct scatterlist), gfp_mask); } static void sg_kfree(struct scatterlist *sg, unsigned int nents) { |
b94de9bb7 lib/scatterlist: ... |
157 158 |
if (nents == SG_MAX_SINGLE_ALLOC) { kmemleak_free(sg); |
0db9299f4 SG: Move function... |
159 |
free_page((unsigned long) sg); |
b94de9bb7 lib/scatterlist: ... |
160 |
} else |
0db9299f4 SG: Move function... |
161 162 163 164 165 166 |
kfree(sg); } /** * __sg_free_table - Free a previously mapped sg table * @table: The sg table header to use |
7cedb1f17 SG: work with the... |
167 |
* @max_ents: The maximum number of entries per single scatterlist |
c53c6d6a6 scatterlist: allo... |
168 |
* @skip_first_chunk: don't free the (preallocated) first scatterlist chunk |
0db9299f4 SG: Move function... |
169 170 171 |
* @free_fn: Free function * * Description: |
7cedb1f17 SG: work with the... |
172 173 174 |
* Free an sg table previously allocated and setup with * __sg_alloc_table(). The @max_ents value must be identical to * that previously used with __sg_alloc_table(). |
0db9299f4 SG: Move function... |
175 176 |
* **/ |
7cedb1f17 SG: work with the... |
177 |
void __sg_free_table(struct sg_table *table, unsigned int max_ents, |
c53c6d6a6 scatterlist: allo... |
178 |
bool skip_first_chunk, sg_free_fn *free_fn) |
0db9299f4 SG: Move function... |
179 180 181 182 183 184 185 186 187 188 189 190 |
{ struct scatterlist *sgl, *next; if (unlikely(!table->sgl)) return; sgl = table->sgl; while (table->orig_nents) { unsigned int alloc_size = table->orig_nents; unsigned int sg_size; /* |
7cedb1f17 SG: work with the... |
191 |
* If we have more than max_ents segments left, |
0db9299f4 SG: Move function... |
192 193 194 195 |
* then assign 'next' to the sg table after the current one. * sg_size is then one less than alloc size, since the last * element is the chain pointer. */ |
7cedb1f17 SG: work with the... |
196 197 198 |
if (alloc_size > max_ents) { next = sg_chain_ptr(&sgl[max_ents - 1]); alloc_size = max_ents; |
0db9299f4 SG: Move function... |
199 200 201 202 203 204 205 |
sg_size = alloc_size - 1; } else { sg_size = alloc_size; next = NULL; } table->orig_nents -= sg_size; |
c21e59d8d lib/scatterlist: ... |
206 |
if (skip_first_chunk) |
c53c6d6a6 scatterlist: allo... |
207 |
skip_first_chunk = false; |
c21e59d8d lib/scatterlist: ... |
208 209 |
else free_fn(sgl, alloc_size); |
0db9299f4 SG: Move function... |
210 211 212 213 214 215 216 217 218 219 220 221 222 223 |
sgl = next; } table->sgl = NULL; } EXPORT_SYMBOL(__sg_free_table); /** * sg_free_table - Free a previously allocated sg table * @table: The mapped sg table header * **/ void sg_free_table(struct sg_table *table) { |
c53c6d6a6 scatterlist: allo... |
224 |
__sg_free_table(table, SG_MAX_SINGLE_ALLOC, false, sg_kfree); |
0db9299f4 SG: Move function... |
225 226 227 228 229 230 231 |
} EXPORT_SYMBOL(sg_free_table); /** * __sg_alloc_table - Allocate and initialize an sg table with given allocator * @table: The sg table header to use * @nents: Number of entries in sg list |
7cedb1f17 SG: work with the... |
232 |
* @max_ents: The maximum number of entries the allocator returns per call |
0db9299f4 SG: Move function... |
233 234 235 |
* @gfp_mask: GFP allocation mask * @alloc_fn: Allocator to use * |
7cedb1f17 SG: work with the... |
236 237 238 239 240 241 |
* Description: * This function returns a @table @nents long. The allocator is * defined to return scatterlist chunks of maximum size @max_ents. * Thus if @nents is bigger than @max_ents, the scatterlists will be * chained in units of @max_ents. * |
0db9299f4 SG: Move function... |
242 243 244 245 246 |
* Notes: * If this function returns non-0 (eg failure), the caller must call * __sg_free_table() to cleanup any leftover allocations. * **/ |
7cedb1f17 SG: work with the... |
247 |
int __sg_alloc_table(struct sg_table *table, unsigned int nents, |
c53c6d6a6 scatterlist: allo... |
248 249 |
unsigned int max_ents, struct scatterlist *first_chunk, gfp_t gfp_mask, sg_alloc_fn *alloc_fn) |
0db9299f4 SG: Move function... |
250 251 252 |
{ struct scatterlist *sg, *prv; unsigned int left; |
27daabd9b lib/scatterlist: ... |
253 254 255 256 |
memset(table, 0, sizeof(*table)); if (nents == 0) return -EINVAL; |
308c09f17 lib/scatterlist: ... |
257 |
#ifndef CONFIG_ARCH_HAS_SG_CHAIN |
6fd59a83b scatterlist: don'... |
258 259 |
if (WARN_ON_ONCE(nents > max_ents)) return -EINVAL; |
0db9299f4 SG: Move function... |
260 |
#endif |
0db9299f4 SG: Move function... |
261 262 263 264 |
left = nents; prv = NULL; do { unsigned int sg_size, alloc_size = left; |
7cedb1f17 SG: work with the... |
265 266 |
if (alloc_size > max_ents) { alloc_size = max_ents; |
0db9299f4 SG: Move function... |
267 268 269 270 271 |
sg_size = alloc_size - 1; } else sg_size = alloc_size; left -= sg_size; |
c53c6d6a6 scatterlist: allo... |
272 273 274 275 276 277 |
if (first_chunk) { sg = first_chunk; first_chunk = NULL; } else { sg = alloc_fn(alloc_size, gfp_mask); } |
edce6820a scatterlist: prev... |
278 279 280 281 282 283 284 285 286 287 288 289 |
if (unlikely(!sg)) { /* * Adjust entry count to reflect that the last * entry of the previous table won't be used for * linkage. Without this, sg_kfree() may get * confused. */ if (prv) table->nents = ++table->orig_nents; return -ENOMEM; } |
0db9299f4 SG: Move function... |
290 291 292 293 294 295 296 297 298 |
sg_init_table(sg, alloc_size); table->nents = table->orig_nents += sg_size; /* * If this is the first mapping, assign the sg table header. * If this is not the first mapping, chain previous part. */ if (prv) |
7cedb1f17 SG: work with the... |
299 |
sg_chain(prv, max_ents, sg); |
0db9299f4 SG: Move function... |
300 301 302 303 304 305 306 307 |
else table->sgl = sg; /* * If no more entries after this one, mark the end */ if (!left) sg_mark_end(&sg[sg_size - 1]); |
0db9299f4 SG: Move function... |
308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 |
prv = sg; } while (left); return 0; } EXPORT_SYMBOL(__sg_alloc_table); /** * sg_alloc_table - Allocate and initialize an sg table * @table: The sg table header to use * @nents: Number of entries in sg list * @gfp_mask: GFP allocation mask * * Description: * Allocate and initialize an sg table. If @nents@ is larger than * SG_MAX_SINGLE_ALLOC a chained sg table will be setup. * **/ int sg_alloc_table(struct sg_table *table, unsigned int nents, gfp_t gfp_mask) { int ret; |
7cedb1f17 SG: work with the... |
329 |
ret = __sg_alloc_table(table, nents, SG_MAX_SINGLE_ALLOC, |
c53c6d6a6 scatterlist: allo... |
330 |
NULL, gfp_mask, sg_kmalloc); |
0db9299f4 SG: Move function... |
331 |
if (unlikely(ret)) |
c53c6d6a6 scatterlist: allo... |
332 |
__sg_free_table(table, SG_MAX_SINGLE_ALLOC, false, sg_kfree); |
0db9299f4 SG: Move function... |
333 334 335 336 |
return ret; } EXPORT_SYMBOL(sg_alloc_table); |
b1adaf65b [SCSI] block: add... |
337 338 |
/** |
efc42bc98 scatterlist: add ... |
339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 |
* sg_alloc_table_from_pages - Allocate and initialize an sg table from * an array of pages * @sgt: The sg table header to use * @pages: Pointer to an array of page pointers * @n_pages: Number of pages in the pages array * @offset: Offset from start of the first page to the start of a buffer * @size: Number of valid bytes in the buffer (after offset) * @gfp_mask: GFP allocation mask * * Description: * Allocate and initialize an sg table from a list of pages. Contiguous * ranges of the pages are squashed into a single scatterlist node. A user * may provide an offset at a start and a size of valid data in a buffer * specified by the page array. The returned sg table is released by * sg_free_table. * * Returns: * 0 on success, negative error on failure */ int sg_alloc_table_from_pages(struct sg_table *sgt, struct page **pages, unsigned int n_pages, unsigned long offset, unsigned long size, gfp_t gfp_mask) { unsigned int chunks; unsigned int i; unsigned int cur_page; int ret; struct scatterlist *s; /* compute number of contiguous chunks */ chunks = 1; for (i = 1; i < n_pages; ++i) if (page_to_pfn(pages[i]) != page_to_pfn(pages[i - 1]) + 1) ++chunks; ret = sg_alloc_table(sgt, chunks, gfp_mask); if (unlikely(ret)) return ret; /* merging chunks and putting them into the scatterlist */ cur_page = 0; for_each_sg(sgt->sgl, s, sgt->orig_nents, i) { unsigned long chunk_size; unsigned int j; /* look for the end of the current chunk */ for (j = cur_page + 1; j < n_pages; ++j) if (page_to_pfn(pages[j]) != page_to_pfn(pages[j - 1]) + 1) break; chunk_size = ((j - cur_page) << PAGE_SHIFT) - offset; sg_set_page(s, pages[cur_page], min(size, chunk_size), offset); size -= chunk_size; offset = 0; cur_page = j; } return 0; } EXPORT_SYMBOL(sg_alloc_table_from_pages); |
a321e91b6 lib/scatterlist: ... |
401 402 403 404 405 406 |
void __sg_page_iter_start(struct sg_page_iter *piter, struct scatterlist *sglist, unsigned int nents, unsigned long pgoffset) { piter->__pg_advance = 0; piter->__nents = nents; |
a321e91b6 lib/scatterlist: ... |
407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 |
piter->sg = sglist; piter->sg_pgoffset = pgoffset; } EXPORT_SYMBOL(__sg_page_iter_start); static int sg_page_count(struct scatterlist *sg) { return PAGE_ALIGN(sg->offset + sg->length) >> PAGE_SHIFT; } bool __sg_page_iter_next(struct sg_page_iter *piter) { if (!piter->__nents || !piter->sg) return false; piter->sg_pgoffset += piter->__pg_advance; piter->__pg_advance = 1; while (piter->sg_pgoffset >= sg_page_count(piter->sg)) { piter->sg_pgoffset -= sg_page_count(piter->sg); piter->sg = sg_next(piter->sg); if (!--piter->__nents || !piter->sg) return false; } |
a321e91b6 lib/scatterlist: ... |
431 432 433 434 |
return true; } EXPORT_SYMBOL(__sg_page_iter_next); |
efc42bc98 scatterlist: add ... |
435 |
/** |
137d3edb4 sg: reimplement s... |
436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 |
* sg_miter_start - start mapping iteration over a sg list * @miter: sg mapping iter to be started * @sgl: sg list to iterate over * @nents: number of sg entries * * Description: * Starts mapping iterator @miter. * * Context: * Don't care. */ void sg_miter_start(struct sg_mapping_iter *miter, struct scatterlist *sgl, unsigned int nents, unsigned int flags) { memset(miter, 0, sizeof(struct sg_mapping_iter)); |
4225fc855 lib/scatterlist: ... |
451 |
__sg_page_iter_start(&miter->piter, sgl, nents, 0); |
6de7e356f lib/scatterlist: ... |
452 |
WARN_ON(!(flags & (SG_MITER_TO_SG | SG_MITER_FROM_SG))); |
137d3edb4 sg: reimplement s... |
453 454 455 |
miter->__flags = flags; } EXPORT_SYMBOL(sg_miter_start); |
110520048 lib/scatterlist: ... |
456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 |
static bool sg_miter_get_next_page(struct sg_mapping_iter *miter) { if (!miter->__remaining) { struct scatterlist *sg; unsigned long pgoffset; if (!__sg_page_iter_next(&miter->piter)) return false; sg = miter->piter.sg; pgoffset = miter->piter.sg_pgoffset; miter->__offset = pgoffset ? 0 : sg->offset; miter->__remaining = sg->offset + sg->length - (pgoffset << PAGE_SHIFT) - miter->__offset; miter->__remaining = min_t(unsigned long, miter->__remaining, PAGE_SIZE - miter->__offset); } return true; } |
137d3edb4 sg: reimplement s... |
477 |
/** |
df642cea2 lib/scatterlist: ... |
478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 |
* sg_miter_skip - reposition mapping iterator * @miter: sg mapping iter to be skipped * @offset: number of bytes to plus the current location * * Description: * Sets the offset of @miter to its current location plus @offset bytes. * If mapping iterator @miter has been proceeded by sg_miter_next(), this * stops @miter. * * Context: * Don't care if @miter is stopped, or not proceeded yet. * Otherwise, preemption disabled if the SG_MITER_ATOMIC is set. * * Returns: * true if @miter contains the valid mapping. false if end of sg * list is reached. */ |
0d6077f8b lib/scatterlist: ... |
495 |
bool sg_miter_skip(struct sg_mapping_iter *miter, off_t offset) |
df642cea2 lib/scatterlist: ... |
496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 |
{ sg_miter_stop(miter); while (offset) { off_t consumed; if (!sg_miter_get_next_page(miter)) return false; consumed = min_t(off_t, offset, miter->__remaining); miter->__offset += consumed; miter->__remaining -= consumed; offset -= consumed; } return true; } |
0d6077f8b lib/scatterlist: ... |
513 |
EXPORT_SYMBOL(sg_miter_skip); |
df642cea2 lib/scatterlist: ... |
514 515 |
/** |
137d3edb4 sg: reimplement s... |
516 517 518 519 |
* sg_miter_next - proceed mapping iterator to the next mapping * @miter: sg mapping iter to proceed * * Description: |
8290e2d2d scatterlist: atom... |
520 521 522 |
* Proceeds @miter to the next mapping. @miter should have been started * using sg_miter_start(). On successful return, @miter->page, * @miter->addr and @miter->length point to the current mapping. |
137d3edb4 sg: reimplement s... |
523 524 |
* * Context: |
8290e2d2d scatterlist: atom... |
525 526 |
* Preemption disabled if SG_MITER_ATOMIC. Preemption must stay disabled * till @miter is stopped. May sleep if !SG_MITER_ATOMIC. |
137d3edb4 sg: reimplement s... |
527 528 529 530 531 532 533 |
* * Returns: * true if @miter contains the next mapping. false if end of sg * list is reached. */ bool sg_miter_next(struct sg_mapping_iter *miter) { |
137d3edb4 sg: reimplement s... |
534 |
sg_miter_stop(miter); |
4225fc855 lib/scatterlist: ... |
535 536 537 538 |
/* * Get to the next page if necessary. * __remaining, __offset is adjusted by sg_miter_stop */ |
110520048 lib/scatterlist: ... |
539 540 |
if (!sg_miter_get_next_page(miter)) return false; |
137d3edb4 sg: reimplement s... |
541 |
|
2db76d7c3 lib/scatterlist: ... |
542 |
miter->page = sg_page_iter_page(&miter->piter); |
4225fc855 lib/scatterlist: ... |
543 |
miter->consumed = miter->length = miter->__remaining; |
137d3edb4 sg: reimplement s... |
544 545 |
if (miter->__flags & SG_MITER_ATOMIC) |
4225fc855 lib/scatterlist: ... |
546 |
miter->addr = kmap_atomic(miter->page) + miter->__offset; |
137d3edb4 sg: reimplement s... |
547 |
else |
4225fc855 lib/scatterlist: ... |
548 |
miter->addr = kmap(miter->page) + miter->__offset; |
137d3edb4 sg: reimplement s... |
549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 |
return true; } EXPORT_SYMBOL(sg_miter_next); /** * sg_miter_stop - stop mapping iteration * @miter: sg mapping iter to be stopped * * Description: * Stops mapping iterator @miter. @miter should have been started * started using sg_miter_start(). A stopped iteration can be * resumed by calling sg_miter_next() on it. This is useful when * resources (kmap) need to be released during iteration. * * Context: |
8290e2d2d scatterlist: atom... |
565 566 |
* Preemption disabled if the SG_MITER_ATOMIC is set. Don't care * otherwise. |
137d3edb4 sg: reimplement s... |
567 568 569 570 571 572 573 574 |
*/ void sg_miter_stop(struct sg_mapping_iter *miter) { WARN_ON(miter->consumed > miter->length); /* drop resources from the last iteration */ if (miter->addr) { miter->__offset += miter->consumed; |
4225fc855 lib/scatterlist: ... |
575 |
miter->__remaining -= miter->consumed; |
137d3edb4 sg: reimplement s... |
576 |
|
3d77b50c5 lib/scatterlist.c... |
577 578 |
if ((miter->__flags & SG_MITER_TO_SG) && !PageSlab(miter->page)) |
6de7e356f lib/scatterlist: ... |
579 |
flush_kernel_dcache_page(miter->page); |
137d3edb4 sg: reimplement s... |
580 |
if (miter->__flags & SG_MITER_ATOMIC) { |
8290e2d2d scatterlist: atom... |
581 |
WARN_ON_ONCE(preemptible()); |
c3eede8e0 lib: remove the s... |
582 |
kunmap_atomic(miter->addr); |
137d3edb4 sg: reimplement s... |
583 |
} else |
f652c521e lib/scatterlist.c... |
584 |
kunmap(miter->page); |
137d3edb4 sg: reimplement s... |
585 586 587 588 589 590 591 592 593 594 |
miter->page = NULL; miter->addr = NULL; miter->length = 0; miter->consumed = 0; } } EXPORT_SYMBOL(sg_miter_stop); /** |
b1adaf65b [SCSI] block: add... |
595 596 597 598 599 |
* sg_copy_buffer - Copy data between a linear buffer and an SG list * @sgl: The SG list * @nents: Number of SG entries * @buf: Where to copy from * @buflen: The number of bytes to copy |
df642cea2 lib/scatterlist: ... |
600 601 602 |
* @skip: Number of bytes to skip before copying * @to_buffer: transfer direction (true == from an sg list to a * buffer, false == from a buffer to an sg list |
b1adaf65b [SCSI] block: add... |
603 604 605 606 607 |
* * Returns the number of copied bytes. * **/ static size_t sg_copy_buffer(struct scatterlist *sgl, unsigned int nents, |
df642cea2 lib/scatterlist: ... |
608 609 |
void *buf, size_t buflen, off_t skip, bool to_buffer) |
b1adaf65b [SCSI] block: add... |
610 |
{ |
137d3edb4 sg: reimplement s... |
611 612 |
unsigned int offset = 0; struct sg_mapping_iter miter; |
50bed2e28 sg: disable inter... |
613 |
unsigned long flags; |
6de7e356f lib/scatterlist: ... |
614 615 616 617 618 619 |
unsigned int sg_flags = SG_MITER_ATOMIC; if (to_buffer) sg_flags |= SG_MITER_FROM_SG; else sg_flags |= SG_MITER_TO_SG; |
137d3edb4 sg: reimplement s... |
620 |
|
6de7e356f lib/scatterlist: ... |
621 |
sg_miter_start(&miter, sgl, nents, sg_flags); |
137d3edb4 sg: reimplement s... |
622 |
|
df642cea2 lib/scatterlist: ... |
623 624 |
if (!sg_miter_skip(&miter, skip)) return false; |
50bed2e28 sg: disable inter... |
625 |
local_irq_save(flags); |
137d3edb4 sg: reimplement s... |
626 627 628 629 630 631 632 |
while (sg_miter_next(&miter) && offset < buflen) { unsigned int len; len = min(miter.length, buflen - offset); if (to_buffer) memcpy(buf + offset, miter.addr, len); |
6de7e356f lib/scatterlist: ... |
633 |
else |
137d3edb4 sg: reimplement s... |
634 |
memcpy(miter.addr, buf + offset, len); |
b1adaf65b [SCSI] block: add... |
635 |
|
137d3edb4 sg: reimplement s... |
636 |
offset += len; |
b1adaf65b [SCSI] block: add... |
637 |
} |
137d3edb4 sg: reimplement s... |
638 |
sg_miter_stop(&miter); |
50bed2e28 sg: disable inter... |
639 |
local_irq_restore(flags); |
137d3edb4 sg: reimplement s... |
640 |
return offset; |
b1adaf65b [SCSI] block: add... |
641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 |
} /** * sg_copy_from_buffer - Copy from a linear buffer to an SG list * @sgl: The SG list * @nents: Number of SG entries * @buf: Where to copy from * @buflen: The number of bytes to copy * * Returns the number of copied bytes. * **/ size_t sg_copy_from_buffer(struct scatterlist *sgl, unsigned int nents, void *buf, size_t buflen) { |
df642cea2 lib/scatterlist: ... |
656 |
return sg_copy_buffer(sgl, nents, buf, buflen, 0, false); |
b1adaf65b [SCSI] block: add... |
657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 |
} EXPORT_SYMBOL(sg_copy_from_buffer); /** * sg_copy_to_buffer - Copy from an SG list to a linear buffer * @sgl: The SG list * @nents: Number of SG entries * @buf: Where to copy to * @buflen: The number of bytes to copy * * Returns the number of copied bytes. * **/ size_t sg_copy_to_buffer(struct scatterlist *sgl, unsigned int nents, void *buf, size_t buflen) { |
df642cea2 lib/scatterlist: ... |
673 |
return sg_copy_buffer(sgl, nents, buf, buflen, 0, true); |
b1adaf65b [SCSI] block: add... |
674 675 |
} EXPORT_SYMBOL(sg_copy_to_buffer); |
df642cea2 lib/scatterlist: ... |
676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 |
/** * sg_pcopy_from_buffer - Copy from a linear buffer to an SG list * @sgl: The SG list * @nents: Number of SG entries * @buf: Where to copy from * @skip: Number of bytes to skip before copying * @buflen: The number of bytes to copy * * Returns the number of copied bytes. * **/ size_t sg_pcopy_from_buffer(struct scatterlist *sgl, unsigned int nents, void *buf, size_t buflen, off_t skip) { return sg_copy_buffer(sgl, nents, buf, buflen, skip, false); } EXPORT_SYMBOL(sg_pcopy_from_buffer); /** * sg_pcopy_to_buffer - Copy from an SG list to a linear buffer * @sgl: The SG list * @nents: Number of SG entries * @buf: Where to copy to * @skip: Number of bytes to skip before copying * @buflen: The number of bytes to copy * * Returns the number of copied bytes. * **/ size_t sg_pcopy_to_buffer(struct scatterlist *sgl, unsigned int nents, void *buf, size_t buflen, off_t skip) { return sg_copy_buffer(sgl, nents, buf, buflen, skip, true); } EXPORT_SYMBOL(sg_pcopy_to_buffer); |