source: mainline/uspace/lib/block/libblock.c@ ffa2c8ef

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since ffa2c8ef was ffa2c8ef, checked in by Martin Decky <martin@…>, 14 years ago

do not intermix low-level IPC methods with async framework methods

  • Property mode set to 100644
File size: 22.2 KB
RevLine 
[fc840d9]1/*
[ed903174]2 * Copyright (c) 2008 Jakub Jermar
3 * Copyright (c) 2008 Martin Decky
[fc840d9]4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
8 * are met:
9 *
10 * - Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * - Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * - The name of the author may not be used to endorse or promote products
16 * derived from this software without specific prior written permission.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
19 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
27 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 */
29
[97c9da8]30/** @addtogroup libblock
[fc840d9]31 * @{
[97c9da8]32 */
[fc840d9]33/**
34 * @file
35 * @brief
36 */
37
[97c9da8]38#include "libblock.h"
[fc840d9]39#include "../../srv/vfs/vfs.h"
[7858bc5f]40#include <ipc/devmap.h>
[c5747fe]41#include <ipc/bd.h>
[7858bc5f]42#include <ipc/services.h>
[fc840d9]43#include <errno.h>
[7858bc5f]44#include <sys/mman.h>
[fc840d9]45#include <async.h>
46#include <as.h>
47#include <assert.h>
[1e4cada]48#include <fibril_synch.h>
[d9c8c81]49#include <adt/list.h>
50#include <adt/hash_table.h>
[1ee00b7]51#include <macros.h>
[d00ae4c]52#include <mem.h>
[16fc3c9]53#include <sys/typefmt.h>
54#include <stacktrace.h>
[fc840d9]55
[916bf1a]56/** Lock protecting the device connection list */
[4e1b57d]57static FIBRIL_MUTEX_INITIALIZE(dcl_lock);
[916bf1a]58/** Device connection list head. */
59static LIST_INITIALIZE(dcl_head);
60
[f1ba5d6]61#define CACHE_BUCKETS_LOG2 10
62#define CACHE_BUCKETS (1 << CACHE_BUCKETS_LOG2)
63
64typedef struct {
[4e1b57d]65 fibril_mutex_t lock;
[1ee00b7]66 size_t lblock_size; /**< Logical block size. */
[f092718]67 unsigned blocks_cluster; /**< Physical blocks per block_t */
[f1ba5d6]68 unsigned block_count; /**< Total number of blocks. */
[d68e4d5]69 unsigned blocks_cached; /**< Number of cached blocks. */
[f1ba5d6]70 hash_table_t block_hash;
71 link_t free_head;
[1fbe064b]72 enum cache_mode mode;
[f1ba5d6]73} cache_t;
74
[916bf1a]75typedef struct {
76 link_t link;
[991f645]77 devmap_handle_t devmap_handle;
[916bf1a]78 int dev_phone;
[a830611]79 fibril_mutex_t comm_area_lock;
80 void *comm_area;
81 size_t comm_size;
[916bf1a]82 void *bb_buf;
[ed903174]83 aoff64_t bb_addr;
[1ee00b7]84 size_t pblock_size; /**< Physical block size. */
[f1ba5d6]85 cache_t *cache;
[916bf1a]86} devcon_t;
87
[ed903174]88static int read_blocks(devcon_t *devcon, aoff64_t ba, size_t cnt);
89static int write_blocks(devcon_t *devcon, aoff64_t ba, size_t cnt);
[00b1d20e]90static int get_block_size(int dev_phone, size_t *bsize);
[ed903174]91static int get_num_blocks(int dev_phone, aoff64_t *nblocks);
[f092718]92static aoff64_t ba_ltop(devcon_t *devcon, aoff64_t lba);
[1fbe064b]93
[991f645]94static devcon_t *devcon_search(devmap_handle_t devmap_handle)
[916bf1a]95{
96 link_t *cur;
97
[4e1b57d]98 fibril_mutex_lock(&dcl_lock);
[916bf1a]99 for (cur = dcl_head.next; cur != &dcl_head; cur = cur->next) {
100 devcon_t *devcon = list_get_instance(cur, devcon_t, link);
[991f645]101 if (devcon->devmap_handle == devmap_handle) {
[4e1b57d]102 fibril_mutex_unlock(&dcl_lock);
[916bf1a]103 return devcon;
104 }
105 }
[4e1b57d]106 fibril_mutex_unlock(&dcl_lock);
[916bf1a]107 return NULL;
108}
109
[991f645]110static int devcon_add(devmap_handle_t devmap_handle, int dev_phone, size_t bsize,
[a830611]111 void *comm_area, size_t comm_size)
[916bf1a]112{
113 link_t *cur;
114 devcon_t *devcon;
115
[a830611]116 if (comm_size < bsize)
[1ee00b7]117 return EINVAL;
118
[916bf1a]119 devcon = malloc(sizeof(devcon_t));
120 if (!devcon)
121 return ENOMEM;
122
123 link_initialize(&devcon->link);
[991f645]124 devcon->devmap_handle = devmap_handle;
[916bf1a]125 devcon->dev_phone = dev_phone;
[a830611]126 fibril_mutex_initialize(&devcon->comm_area_lock);
127 devcon->comm_area = comm_area;
128 devcon->comm_size = comm_size;
[6284978]129 devcon->bb_buf = NULL;
[1ee00b7]130 devcon->bb_addr = 0;
131 devcon->pblock_size = bsize;
[f1ba5d6]132 devcon->cache = NULL;
[916bf1a]133
[4e1b57d]134 fibril_mutex_lock(&dcl_lock);
[916bf1a]135 for (cur = dcl_head.next; cur != &dcl_head; cur = cur->next) {
136 devcon_t *d = list_get_instance(cur, devcon_t, link);
[991f645]137 if (d->devmap_handle == devmap_handle) {
[4e1b57d]138 fibril_mutex_unlock(&dcl_lock);
[916bf1a]139 free(devcon);
140 return EEXIST;
141 }
142 }
143 list_append(&devcon->link, &dcl_head);
[4e1b57d]144 fibril_mutex_unlock(&dcl_lock);
[916bf1a]145 return EOK;
146}
147
148static void devcon_remove(devcon_t *devcon)
149{
[4e1b57d]150 fibril_mutex_lock(&dcl_lock);
[916bf1a]151 list_remove(&devcon->link);
[4e1b57d]152 fibril_mutex_unlock(&dcl_lock);
[916bf1a]153}
[7858bc5f]154
[991f645]155int block_init(devmap_handle_t devmap_handle, size_t comm_size)
[7858bc5f]156{
157 int rc;
[916bf1a]158 int dev_phone;
[a830611]159 void *comm_area;
[1ee00b7]160 size_t bsize;
161
[a830611]162 comm_area = mmap(NULL, comm_size, PROTO_READ | PROTO_WRITE,
[7858bc5f]163 MAP_ANONYMOUS | MAP_PRIVATE, 0, 0);
[a830611]164 if (!comm_area) {
[7858bc5f]165 return ENOMEM;
166 }
167
[991f645]168 dev_phone = devmap_device_connect(devmap_handle, IPC_FLAG_BLOCKING);
[7858bc5f]169 if (dev_phone < 0) {
[a830611]170 munmap(comm_area, comm_size);
[7858bc5f]171 return dev_phone;
172 }
173
[0da4e41]174 rc = async_share_out_start(dev_phone, comm_area,
[7858bc5f]175 AS_AREA_READ | AS_AREA_WRITE);
176 if (rc != EOK) {
[a830611]177 munmap(comm_area, comm_size);
[ffa2c8ef]178 async_hangup(dev_phone);
[7858bc5f]179 return rc;
180 }
[1ee00b7]181
182 if (get_block_size(dev_phone, &bsize) != EOK) {
[a830611]183 munmap(comm_area, comm_size);
[ffa2c8ef]184 async_hangup(dev_phone);
[1ee00b7]185 return rc;
186 }
[916bf1a]187
[991f645]188 rc = devcon_add(devmap_handle, dev_phone, bsize, comm_area, comm_size);
[916bf1a]189 if (rc != EOK) {
[a830611]190 munmap(comm_area, comm_size);
[ffa2c8ef]191 async_hangup(dev_phone);
[916bf1a]192 return rc;
193 }
194
[7858bc5f]195 return EOK;
196}
197
[991f645]198void block_fini(devmap_handle_t devmap_handle)
[7858bc5f]199{
[991f645]200 devcon_t *devcon = devcon_search(devmap_handle);
[916bf1a]201 assert(devcon);
202
[64bc4b6]203 if (devcon->cache)
[991f645]204 (void) block_cache_fini(devmap_handle);
[64bc4b6]205
[916bf1a]206 devcon_remove(devcon);
207
[6284978]208 if (devcon->bb_buf)
209 free(devcon->bb_buf);
[f1ba5d6]210
[a830611]211 munmap(devcon->comm_area, devcon->comm_size);
[ffa2c8ef]212 async_hangup(devcon->dev_phone);
[916bf1a]213
214 free(devcon);
[7858bc5f]215}
216
[991f645]217int block_bb_read(devmap_handle_t devmap_handle, aoff64_t ba)
[6284978]218{
219 void *bb_buf;
[0c243b4]220 int rc;
[6284978]221
[991f645]222 devcon_t *devcon = devcon_search(devmap_handle);
[6284978]223 if (!devcon)
224 return ENOENT;
225 if (devcon->bb_buf)
226 return EEXIST;
[1ee00b7]227 bb_buf = malloc(devcon->pblock_size);
[6284978]228 if (!bb_buf)
229 return ENOMEM;
[1ee00b7]230
[a830611]231 fibril_mutex_lock(&devcon->comm_area_lock);
[1ee00b7]232 rc = read_blocks(devcon, 0, 1);
[0c243b4]233 if (rc != EOK) {
[a830611]234 fibril_mutex_unlock(&devcon->comm_area_lock);
[6284978]235 free(bb_buf);
[0c243b4]236 return rc;
[6284978]237 }
[a830611]238 memcpy(bb_buf, devcon->comm_area, devcon->pblock_size);
239 fibril_mutex_unlock(&devcon->comm_area_lock);
[6408be3]240
[6284978]241 devcon->bb_buf = bb_buf;
[1ee00b7]242 devcon->bb_addr = ba;
[6284978]243
244 return EOK;
245}
246
[991f645]247void *block_bb_get(devmap_handle_t devmap_handle)
[7858bc5f]248{
[991f645]249 devcon_t *devcon = devcon_search(devmap_handle);
[916bf1a]250 assert(devcon);
251 return devcon->bb_buf;
[7858bc5f]252}
253
[f1ba5d6]254static hash_index_t cache_hash(unsigned long *key)
255{
256 return *key & (CACHE_BUCKETS - 1);
257}
258
259static int cache_compare(unsigned long *key, hash_count_t keys, link_t *item)
260{
261 block_t *b = hash_table_get_instance(item, block_t, hash_link);
[a6ba0c9]262 return b->lba == *key;
[f1ba5d6]263}
264
265static void cache_remove_callback(link_t *item)
266{
267}
268
269static hash_table_operations_t cache_ops = {
270 .hash = cache_hash,
271 .compare = cache_compare,
272 .remove_callback = cache_remove_callback
273};
274
[991f645]275int block_cache_init(devmap_handle_t devmap_handle, size_t size, unsigned blocks,
[1fbe064b]276 enum cache_mode mode)
[f1ba5d6]277{
[991f645]278 devcon_t *devcon = devcon_search(devmap_handle);
[f1ba5d6]279 cache_t *cache;
280 if (!devcon)
281 return ENOENT;
282 if (devcon->cache)
283 return EEXIST;
284 cache = malloc(sizeof(cache_t));
285 if (!cache)
286 return ENOMEM;
287
[4e1b57d]288 fibril_mutex_initialize(&cache->lock);
[f1ba5d6]289 list_initialize(&cache->free_head);
[1ee00b7]290 cache->lblock_size = size;
[f1ba5d6]291 cache->block_count = blocks;
[d68e4d5]292 cache->blocks_cached = 0;
[1fbe064b]293 cache->mode = mode;
[f1ba5d6]294
[f092718]295 /* Allow 1:1 or small-to-large block size translation */
296 if (cache->lblock_size % devcon->pblock_size != 0)
297 return ENOTSUP;
298
299 cache->blocks_cluster = cache->lblock_size / devcon->pblock_size;
[1ee00b7]300
[f1ba5d6]301 if (!hash_table_create(&cache->block_hash, CACHE_BUCKETS, 1,
302 &cache_ops)) {
303 free(cache);
304 return ENOMEM;
305 }
306
307 devcon->cache = cache;
308 return EOK;
309}
310
[991f645]311int block_cache_fini(devmap_handle_t devmap_handle)
[64bc4b6]312{
[991f645]313 devcon_t *devcon = devcon_search(devmap_handle);
[64bc4b6]314 cache_t *cache;
315 int rc;
316
317 if (!devcon)
318 return ENOENT;
319 if (!devcon->cache)
320 return EOK;
321 cache = devcon->cache;
322
323 /*
324 * We are expecting to find all blocks for this device handle on the
325 * free list, i.e. the block reference count should be zero. Do not
326 * bother with the cache and block locks because we are single-threaded.
327 */
328 while (!list_empty(&cache->free_head)) {
329 block_t *b = list_get_instance(cache->free_head.next,
330 block_t, free_link);
331
332 list_remove(&b->free_link);
333 if (b->dirty) {
334 memcpy(devcon->comm_area, b->data, b->size);
[f092718]335 rc = write_blocks(devcon, b->pba, cache->blocks_cluster);
[64bc4b6]336 if (rc != EOK)
337 return rc;
338 }
339
[a6ba0c9]340 unsigned long key = b->lba;
[64bc4b6]341 hash_table_remove(&cache->block_hash, &key, 1);
342
343 free(b->data);
344 free(b);
345 }
346
347 hash_table_destroy(&cache->block_hash);
348 devcon->cache = NULL;
349 free(cache);
350
351 return EOK;
352}
353
[d68e4d5]354#define CACHE_LO_WATERMARK 10
355#define CACHE_HI_WATERMARK 20
[e1c88d5]356static bool cache_can_grow(cache_t *cache)
[fc840d9]357{
[d68e4d5]358 if (cache->blocks_cached < CACHE_LO_WATERMARK)
359 return true;
360 if (!list_empty(&cache->free_head))
361 return false;
[e1c88d5]362 return true;
363}
364
365static void block_initialize(block_t *b)
366{
[4e1b57d]367 fibril_mutex_initialize(&b->lock);
[e1c88d5]368 b->refcnt = 1;
369 b->dirty = false;
[cd688d9]370 b->toxic = false;
[4e1b57d]371 fibril_rwlock_initialize(&b->contents_lock);
[e1c88d5]372 link_initialize(&b->free_link);
373 link_initialize(&b->hash_link);
374}
375
376/** Instantiate a block in memory and get a reference to it.
377 *
[c91f2d1b]378 * @param block Pointer to where the function will store the
379 * block pointer on success.
[991f645]380 * @param devmap_handle Device handle of the block device.
[a6ba0c9]381 * @param ba Block address (logical).
[1d8cdb1]382 * @param flags If BLOCK_FLAGS_NOREAD is specified, block_get()
383 * will not read the contents of the block from the
384 * device.
[e1c88d5]385 *
[c91f2d1b]386 * @return EOK on success or a negative error code.
[e1c88d5]387 */
[a6ba0c9]388int block_get(block_t **block, devmap_handle_t devmap_handle, aoff64_t ba, int flags)
[e1c88d5]389{
390 devcon_t *devcon;
391 cache_t *cache;
[fc840d9]392 block_t *b;
[e1c88d5]393 link_t *l;
[a6ba0c9]394 unsigned long key = ba;
[b7b3fda]395 int rc;
[e1c88d5]396
[991f645]397 devcon = devcon_search(devmap_handle);
[fc840d9]398
[e1c88d5]399 assert(devcon);
400 assert(devcon->cache);
[fc840d9]401
[e1c88d5]402 cache = devcon->cache;
[02ee6bf5]403
404retry:
[b7b3fda]405 rc = EOK;
[4f690cd]406 b = NULL;
[b7b3fda]407
[4e1b57d]408 fibril_mutex_lock(&cache->lock);
[e1c88d5]409 l = hash_table_find(&cache->block_hash, &key);
410 if (l) {
411 /*
412 * We found the block in the cache.
413 */
414 b = hash_table_get_instance(l, block_t, hash_link);
[4e1b57d]415 fibril_mutex_lock(&b->lock);
[e1c88d5]416 if (b->refcnt++ == 0)
417 list_remove(&b->free_link);
[402a18f]418 if (b->toxic)
419 rc = EIO;
[4e1b57d]420 fibril_mutex_unlock(&b->lock);
421 fibril_mutex_unlock(&cache->lock);
[e1c88d5]422 } else {
423 /*
424 * The block was not found in the cache.
425 */
426 if (cache_can_grow(cache)) {
427 /*
428 * We can grow the cache by allocating new blocks.
429 * Should the allocation fail, we fail over and try to
430 * recycle a block from the cache.
431 */
432 b = malloc(sizeof(block_t));
433 if (!b)
434 goto recycle;
[1ee00b7]435 b->data = malloc(cache->lblock_size);
[e1c88d5]436 if (!b->data) {
437 free(b);
438 goto recycle;
439 }
[d68e4d5]440 cache->blocks_cached++;
[e1c88d5]441 } else {
442 /*
443 * Try to recycle a block from the free list.
444 */
445 unsigned long temp_key;
446recycle:
[7a56b1ed]447 if (list_empty(&cache->free_head)) {
448 fibril_mutex_unlock(&cache->lock);
449 rc = ENOMEM;
450 goto out;
451 }
[e1c88d5]452 l = cache->free_head.next;
[d68e4d5]453 b = list_get_instance(l, block_t, free_link);
[02ee6bf5]454
455 fibril_mutex_lock(&b->lock);
456 if (b->dirty) {
457 /*
458 * The block needs to be written back to the
459 * device before it changes identity. Do this
460 * while not holding the cache lock so that
461 * concurrency is not impeded. Also move the
462 * block to the end of the free list so that we
463 * do not slow down other instances of
464 * block_get() draining the free list.
465 */
466 list_remove(&b->free_link);
467 list_append(&b->free_link, &cache->free_head);
468 fibril_mutex_unlock(&cache->lock);
[a830611]469 fibril_mutex_lock(&devcon->comm_area_lock);
470 memcpy(devcon->comm_area, b->data, b->size);
[f092718]471 rc = write_blocks(devcon, b->pba,
472 cache->blocks_cluster);
[a830611]473 fibril_mutex_unlock(&devcon->comm_area_lock);
[402a18f]474 if (rc != EOK) {
475 /*
476 * We did not manage to write the block
477 * to the device. Keep it around for
478 * another try. Hopefully, we will grab
479 * another block next time.
480 */
481 fibril_mutex_unlock(&b->lock);
482 goto retry;
483 }
[02ee6bf5]484 b->dirty = false;
485 if (!fibril_mutex_trylock(&cache->lock)) {
486 /*
487 * Somebody is probably racing with us.
488 * Unlock the block and retry.
489 */
490 fibril_mutex_unlock(&b->lock);
491 goto retry;
492 }
493
494 }
495 fibril_mutex_unlock(&b->lock);
496
497 /*
498 * Unlink the block from the free list and the hash
499 * table.
500 */
501 list_remove(&b->free_link);
[a6ba0c9]502 temp_key = b->lba;
[e1c88d5]503 hash_table_remove(&cache->block_hash, &temp_key, 1);
504 }
[fc840d9]505
[e1c88d5]506 block_initialize(b);
[991f645]507 b->devmap_handle = devmap_handle;
[1ee00b7]508 b->size = cache->lblock_size;
[a6ba0c9]509 b->lba = ba;
510 b->pba = ba_ltop(devcon, b->lba);
[a6d97fb9]511 hash_table_insert(&cache->block_hash, &key, &b->hash_link);
512
513 /*
514 * Lock the block before releasing the cache lock. Thus we don't
[5ac8918]515 * kill concurrent operations on the cache while doing I/O on
516 * the block.
[a6d97fb9]517 */
[4e1b57d]518 fibril_mutex_lock(&b->lock);
519 fibril_mutex_unlock(&cache->lock);
[a6d97fb9]520
[1d8cdb1]521 if (!(flags & BLOCK_FLAGS_NOREAD)) {
522 /*
523 * The block contains old or no data. We need to read
524 * the new contents from the device.
525 */
[a830611]526 fibril_mutex_lock(&devcon->comm_area_lock);
[f092718]527 rc = read_blocks(devcon, b->pba, cache->blocks_cluster);
[a830611]528 memcpy(b->data, devcon->comm_area, cache->lblock_size);
529 fibril_mutex_unlock(&devcon->comm_area_lock);
[402a18f]530 if (rc != EOK)
531 b->toxic = true;
532 } else
533 rc = EOK;
[fc840d9]534
[4e1b57d]535 fibril_mutex_unlock(&b->lock);
[a6d97fb9]536 }
[7a56b1ed]537out:
[4f690cd]538 if ((rc != EOK) && b) {
539 assert(b->toxic);
540 (void) block_put(b);
541 b = NULL;
542 }
[c91f2d1b]543 *block = b;
[402a18f]544 return rc;
[fc840d9]545}
546
[d5a720cf]547/** Release a reference to a block.
548 *
[a6d97fb9]549 * If the last reference is dropped, the block is put on the free list.
[d5a720cf]550 *
551 * @param block Block of which a reference is to be released.
[c91f2d1b]552 *
553 * @return EOK on success or a negative error code.
[d5a720cf]554 */
[c91f2d1b]555int block_put(block_t *block)
[fc840d9]556{
[991f645]557 devcon_t *devcon = devcon_search(block->devmap_handle);
[d5a720cf]558 cache_t *cache;
[ddfc39a3]559 unsigned blocks_cached;
560 enum cache_mode mode;
[402a18f]561 int rc = EOK;
[d5a720cf]562
563 assert(devcon);
564 assert(devcon->cache);
565
566 cache = devcon->cache;
[ddfc39a3]567
568retry:
569 fibril_mutex_lock(&cache->lock);
570 blocks_cached = cache->blocks_cached;
571 mode = cache->mode;
572 fibril_mutex_unlock(&cache->lock);
573
574 /*
575 * Determine whether to sync the block. Syncing the block is best done
576 * when not holding the cache lock as it does not impede concurrency.
577 * Since the situation may have changed when we unlocked the cache, the
578 * blocks_cached and mode variables are mere hints. We will recheck the
579 * conditions later when the cache lock is held again.
580 */
581 fibril_mutex_lock(&block->lock);
[402a18f]582 if (block->toxic)
583 block->dirty = false; /* will not write back toxic block */
[ddfc39a3]584 if (block->dirty && (block->refcnt == 1) &&
585 (blocks_cached > CACHE_HI_WATERMARK || mode != CACHE_MODE_WB)) {
[a830611]586 fibril_mutex_lock(&devcon->comm_area_lock);
587 memcpy(devcon->comm_area, block->data, block->size);
[f092718]588 rc = write_blocks(devcon, block->pba, cache->blocks_cluster);
[a830611]589 fibril_mutex_unlock(&devcon->comm_area_lock);
[ddfc39a3]590 block->dirty = false;
591 }
592 fibril_mutex_unlock(&block->lock);
593
[4e1b57d]594 fibril_mutex_lock(&cache->lock);
595 fibril_mutex_lock(&block->lock);
[d5a720cf]596 if (!--block->refcnt) {
597 /*
[d68e4d5]598 * Last reference to the block was dropped. Either free the
[402a18f]599 * block or put it on the free list. In case of an I/O error,
600 * free the block.
[d68e4d5]601 */
[402a18f]602 if ((cache->blocks_cached > CACHE_HI_WATERMARK) ||
603 (rc != EOK)) {
[d68e4d5]604 /*
[402a18f]605 * Currently there are too many cached blocks or there
606 * was an I/O error when writing the block back to the
607 * device.
[d68e4d5]608 */
609 if (block->dirty) {
[ddfc39a3]610 /*
611 * We cannot sync the block while holding the
612 * cache lock. Release everything and retry.
613 */
614 block->refcnt++;
615 fibril_mutex_unlock(&block->lock);
616 fibril_mutex_unlock(&cache->lock);
617 goto retry;
[d68e4d5]618 }
619 /*
620 * Take the block out of the cache and free it.
621 */
[a6ba0c9]622 unsigned long key = block->lba;
[d68e4d5]623 hash_table_remove(&cache->block_hash, &key, 1);
624 free(block);
625 free(block->data);
626 cache->blocks_cached--;
627 fibril_mutex_unlock(&cache->lock);
[402a18f]628 return rc;
[d68e4d5]629 }
630 /*
631 * Put the block on the free list.
[d5a720cf]632 */
[1fbe064b]633 if (cache->mode != CACHE_MODE_WB && block->dirty) {
[ddfc39a3]634 /*
635 * We cannot sync the block while holding the cache
636 * lock. Release everything and retry.
637 */
638 block->refcnt++;
639 fibril_mutex_unlock(&block->lock);
640 fibril_mutex_unlock(&cache->lock);
641 goto retry;
[1fbe064b]642 }
[ddfc39a3]643 list_append(&block->free_link, &cache->free_head);
[d5a720cf]644 }
[4e1b57d]645 fibril_mutex_unlock(&block->lock);
646 fibril_mutex_unlock(&cache->lock);
[c91f2d1b]647
[402a18f]648 return rc;
[d5a720cf]649}
650
[6408be3]651/** Read sequential data from a block device.
[d5a720cf]652 *
[991f645]653 * @param devmap_handle Device handle of the block device.
[d5a720cf]654 * @param bufpos Pointer to the first unread valid offset within the
655 * communication buffer.
656 * @param buflen Pointer to the number of unread bytes that are ready in
657 * the communication buffer.
658 * @param pos Device position to be read.
659 * @param dst Destination buffer.
660 * @param size Size of the destination buffer.
661 * @param block_size Block size to be used for the transfer.
662 *
663 * @return EOK on success or a negative return code on failure.
664 */
[991f645]665int block_seqread(devmap_handle_t devmap_handle, size_t *bufpos, size_t *buflen,
[ed903174]666 aoff64_t *pos, void *dst, size_t size)
[d5a720cf]667{
[ed903174]668 size_t offset = 0;
[d5a720cf]669 size_t left = size;
[1ee00b7]670 size_t block_size;
671 devcon_t *devcon;
672
[991f645]673 devcon = devcon_search(devmap_handle);
[d5a720cf]674 assert(devcon);
[1ee00b7]675 block_size = devcon->pblock_size;
[e1c88d5]676
[a830611]677 fibril_mutex_lock(&devcon->comm_area_lock);
[d5a720cf]678 while (left > 0) {
679 size_t rd;
680
681 if (*bufpos + left < *buflen)
682 rd = left;
683 else
684 rd = *buflen - *bufpos;
685
686 if (rd > 0) {
687 /*
688 * Copy the contents of the communication buffer to the
689 * destination buffer.
690 */
[a830611]691 memcpy(dst + offset, devcon->comm_area + *bufpos, rd);
[d5a720cf]692 offset += rd;
693 *bufpos += rd;
694 *pos += rd;
695 left -= rd;
696 }
697
[ed903174]698 if (*bufpos == *buflen) {
[d5a720cf]699 /* Refill the communication buffer with a new block. */
[6408be3]700 int rc;
701
[1ee00b7]702 rc = read_blocks(devcon, *pos / block_size, 1);
[d68e4d5]703 if (rc != EOK) {
[a830611]704 fibril_mutex_unlock(&devcon->comm_area_lock);
[6408be3]705 return rc;
[d68e4d5]706 }
[d5a720cf]707
708 *bufpos = 0;
709 *buflen = block_size;
710 }
711 }
[a830611]712 fibril_mutex_unlock(&devcon->comm_area_lock);
[d5a720cf]713
714 return EOK;
[fc840d9]715}
716
[00b1d20e]717/** Read blocks directly from device (bypass cache).
718 *
[991f645]719 * @param devmap_handle Device handle of the block device.
[a6ba0c9]720 * @param ba Address of first block (physical).
[00b1d20e]721 * @param cnt Number of blocks.
722 * @param src Buffer for storing the data.
723 *
724 * @return EOK on success or negative error code on failure.
725 */
[991f645]726int block_read_direct(devmap_handle_t devmap_handle, aoff64_t ba, size_t cnt, void *buf)
[00b1d20e]727{
728 devcon_t *devcon;
729 int rc;
730
[991f645]731 devcon = devcon_search(devmap_handle);
[00b1d20e]732 assert(devcon);
733
734 fibril_mutex_lock(&devcon->comm_area_lock);
735
736 rc = read_blocks(devcon, ba, cnt);
737 if (rc == EOK)
738 memcpy(buf, devcon->comm_area, devcon->pblock_size * cnt);
739
740 fibril_mutex_unlock(&devcon->comm_area_lock);
741
742 return rc;
743}
744
745/** Write blocks directly to device (bypass cache).
746 *
[991f645]747 * @param devmap_handle Device handle of the block device.
[a6ba0c9]748 * @param ba Address of first block (physical).
[00b1d20e]749 * @param cnt Number of blocks.
750 * @param src The data to be written.
751 *
752 * @return EOK on success or negative error code on failure.
753 */
[991f645]754int block_write_direct(devmap_handle_t devmap_handle, aoff64_t ba, size_t cnt,
[00b1d20e]755 const void *data)
756{
757 devcon_t *devcon;
758 int rc;
759
[991f645]760 devcon = devcon_search(devmap_handle);
[00b1d20e]761 assert(devcon);
762
763 fibril_mutex_lock(&devcon->comm_area_lock);
764
765 memcpy(devcon->comm_area, data, devcon->pblock_size * cnt);
[dccf721]766 rc = write_blocks(devcon, ba, cnt);
[00b1d20e]767
768 fibril_mutex_unlock(&devcon->comm_area_lock);
769
770 return rc;
771}
772
773/** Get device block size.
774 *
[991f645]775 * @param devmap_handle Device handle of the block device.
[00b1d20e]776 * @param bsize Output block size.
777 *
778 * @return EOK on success or negative error code on failure.
779 */
[991f645]780int block_get_bsize(devmap_handle_t devmap_handle, size_t *bsize)
[00b1d20e]781{
782 devcon_t *devcon;
783
[991f645]784 devcon = devcon_search(devmap_handle);
[00b1d20e]785 assert(devcon);
786
787 return get_block_size(devcon->dev_phone, bsize);
788}
789
[08232ee]790/** Get number of blocks on device.
791 *
[991f645]792 * @param devmap_handle Device handle of the block device.
[08232ee]793 * @param nblocks Output number of blocks.
794 *
795 * @return EOK on success or negative error code on failure.
796 */
[991f645]797int block_get_nblocks(devmap_handle_t devmap_handle, aoff64_t *nblocks)
[08232ee]798{
799 devcon_t *devcon;
800
[991f645]801 devcon = devcon_search(devmap_handle);
[08232ee]802 assert(devcon);
803
804 return get_num_blocks(devcon->dev_phone, nblocks);
805}
806
[1ee00b7]807/** Read blocks from block device.
[6408be3]808 *
809 * @param devcon Device connection.
[1ee00b7]810 * @param ba Address of first block.
811 * @param cnt Number of blocks.
[6408be3]812 * @param src Buffer for storing the data.
813 *
814 * @return EOK on success or negative error code on failure.
815 */
[ed903174]816static int read_blocks(devcon_t *devcon, aoff64_t ba, size_t cnt)
[6408be3]817{
818 int rc;
819
820 assert(devcon);
[1ee00b7]821 rc = async_req_3_0(devcon->dev_phone, BD_READ_BLOCKS, LOWER32(ba),
822 UPPER32(ba), cnt);
[16fc3c9]823 if (rc != EOK) {
[7e752b2]824 printf("Error %d reading %zu blocks starting at block %" PRIuOFF64
825 " from device handle %" PRIun "\n", rc, cnt, ba,
[991f645]826 devcon->devmap_handle);
[16fc3c9]827#ifndef NDEBUG
828 stacktrace_print();
829#endif
830 }
[1ee00b7]831 return rc;
[6408be3]832}
833
[1fbe064b]834/** Write block to block device.
835 *
836 * @param devcon Device connection.
[1ee00b7]837 * @param ba Address of first block.
838 * @param cnt Number of blocks.
[1fbe064b]839 * @param src Buffer containing the data to write.
840 *
841 * @return EOK on success or negative error code on failure.
842 */
[ed903174]843static int write_blocks(devcon_t *devcon, aoff64_t ba, size_t cnt)
[1fbe064b]844{
845 int rc;
846
847 assert(devcon);
[1ee00b7]848 rc = async_req_3_0(devcon->dev_phone, BD_WRITE_BLOCKS, LOWER32(ba),
849 UPPER32(ba), cnt);
[16fc3c9]850 if (rc != EOK) {
[7e752b2]851 printf("Error %d writing %zu blocks starting at block %" PRIuOFF64
852 " to device handle %" PRIun "\n", rc, cnt, ba, devcon->devmap_handle);
[16fc3c9]853#ifndef NDEBUG
854 stacktrace_print();
855#endif
856 }
[1ee00b7]857 return rc;
858}
[1fbe064b]859
[1ee00b7]860/** Get block size used by the device. */
[00b1d20e]861static int get_block_size(int dev_phone, size_t *bsize)
[1ee00b7]862{
[96b02eb9]863 sysarg_t bs;
[1ee00b7]864 int rc;
865
866 rc = async_req_0_1(dev_phone, BD_GET_BLOCK_SIZE, &bs);
867 if (rc == EOK)
868 *bsize = (size_t) bs;
869
870 return rc;
[1fbe064b]871}
872
[08232ee]873/** Get total number of blocks on block device. */
[ed903174]874static int get_num_blocks(int dev_phone, aoff64_t *nblocks)
[08232ee]875{
[96b02eb9]876 sysarg_t nb_l, nb_h;
[08232ee]877 int rc;
878
879 rc = async_req_0_2(dev_phone, BD_GET_NUM_BLOCKS, &nb_l, &nb_h);
880 if (rc == EOK) {
[ed903174]881 *nblocks = (aoff64_t) MERGE_LOUP32(nb_l, nb_h);
[08232ee]882 }
883
884 return rc;
885}
886
[f092718]887/** Convert logical block address to physical block address. */
888static aoff64_t ba_ltop(devcon_t *devcon, aoff64_t lba)
889{
890 assert(devcon->cache != NULL);
891 return lba * devcon->cache->blocks_cluster;
892}
893
[fc840d9]894/** @}
895 */
Note: See TracBrowser for help on using the repository browser.