4 * This file is part of BeRTOS.
6 * Bertos is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 * As a special exception, you may use this file as part of a free software
21 * library without restriction. Specifically, if other files instantiate
22 * templates or use macros or inline functions from this file, or you compile
23 * this file and link it with other files to produce an executable, this
24 * file does not by itself cause the resulting executable to be covered by
25 * the GNU General Public License. This exception does not however
26 * invalidate any other reasons why the executable file might be covered by
27 * the GNU General Public License.
29 * Copyright 2009 Develer S.r.l. (http://www.develer.com/)
33 * \author Francesco Sacchi <batt@develer.com>
35 * \brief KBlock interface
41 #define LOG_LEVEL LOG_LVL_ERR
42 #define LOG_FORMAT LOG_FMT_VERBOSE
46 INLINE size_t kblock_readDirect(struct KBlock *b, block_idx_t index, void *buf, size_t offset, size_t size)
48 KB_ASSERT_METHOD(b, readDirect);
49 return b->priv.vt->readDirect(b, b->priv.blk_start + index, buf, offset, size);
52 INLINE size_t kblock_readBuf(struct KBlock *b, void *buf, size_t offset, size_t size)
54 KB_ASSERT_METHOD(b, readBuf);
55 ASSERT(offset + size <= b->blk_size);
57 return b->priv.vt->readBuf(b, buf, offset, size);
60 INLINE size_t kblock_writeBuf(struct KBlock *b, const void *buf, size_t offset, size_t size)
62 KB_ASSERT_METHOD(b, writeBuf);
63 ASSERT(offset + size <= b->blk_size);
64 return b->priv.vt->writeBuf(b, buf, offset, size);
67 INLINE int kblock_load(struct KBlock *b, block_idx_t index)
69 KB_ASSERT_METHOD(b, load);
70 ASSERT(index < b->blk_cnt);
72 LOG_INFO("index %d\n", index);
73 return b->priv.vt->load(b, b->priv.blk_start + index);
76 INLINE int kblock_store(struct KBlock *b, block_idx_t index)
78 KB_ASSERT_METHOD(b, store);
79 ASSERT(index < b->blk_cnt);
81 LOG_INFO("index %d\n", index);
82 return b->priv.vt->store(b, b->priv.blk_start + index);
87 size_t kblock_read(struct KBlock *b, block_idx_t idx, void *buf, size_t offset, size_t size)
91 ASSERT(offset + size <= b->blk_size);
92 LOG_INFO("blk_idx %d, offset %d, size %d\n", idx, offset, size);
94 if (idx == b->priv.curr_blk)
95 return kblock_readBuf(b, buf, offset, size);
97 return kblock_readDirect(b, idx, buf, offset, size);
101 int kblock_flush(struct KBlock *b)
105 if (b->priv.cache_dirty)
107 LOG_INFO("flushing block %d\n", b->priv.curr_blk);
108 if (kblock_store(b, b->priv.curr_blk) == 0)
109 b->priv.cache_dirty = false;
117 static bool kblock_loadPage(struct KBlock *b, block_idx_t idx)
121 if (idx != b->priv.curr_blk)
123 LOG_INFO("loading block %d\n", idx);
124 if (kblock_flush(b) != 0 || kblock_load(b, idx) != 0)
127 b->priv.curr_blk = idx;
133 size_t kblock_write(struct KBlock *b, block_idx_t idx, const void *buf, size_t offset, size_t size)
137 ASSERT(offset + size <= b->blk_size);
139 LOG_INFO("blk_idx %d, offset %d, size %d\n", idx, offset, size);
141 if (!kblock_loadPage(b, idx))
144 b->priv.cache_dirty = true;
145 return kblock_writeBuf(b, buf, offset, size);
148 int kblock_copy(struct KBlock *b, block_idx_t idx1, block_idx_t idx2)
152 if (!kblock_loadPage(b, idx1))
155 b->priv.curr_blk = idx2;
156 b->priv.cache_dirty = true;