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
47 INLINE size_t kblock_readDirect(struct KBlock *b, block_idx_t index, void *buf, size_t offset, size_t size)
49 KB_ASSERT_METHOD(b, readDirect);
50 ASSERT(index < b->blk_cnt);
51 return b->priv.vt->readDirect(b, b->priv.blk_start + index, buf, offset, size);
54 INLINE size_t kblock_readBuf(struct KBlock *b, void *buf, size_t offset, size_t size)
56 KB_ASSERT_METHOD(b, readBuf);
57 ASSERT(offset + size <= b->blk_size);
59 return b->priv.vt->readBuf(b, buf, offset, size);
62 INLINE size_t kblock_writeBuf(struct KBlock *b, const void *buf, size_t offset, size_t size)
64 KB_ASSERT_METHOD(b, writeBuf);
65 ASSERT(offset + size <= b->blk_size);
66 return b->priv.vt->writeBuf(b, buf, offset, size);
69 INLINE int kblock_load(struct KBlock *b, block_idx_t index)
71 KB_ASSERT_METHOD(b, load);
72 ASSERT(index < b->blk_cnt);
74 LOG_INFO("index %d\n", index);
75 return b->priv.vt->load(b, b->priv.blk_start + index);
78 INLINE int kblock_store(struct KBlock *b, block_idx_t index)
80 KB_ASSERT_METHOD(b, store);
81 ASSERT(index < b->blk_cnt);
83 LOG_INFO("index %d\n", index);
84 return b->priv.vt->store(b, b->priv.blk_start + index);
87 INLINE void kblock_setDirty(struct KBlock *b, bool dirty)
90 b->priv.flags |= KB_CACHE_DIRTY;
92 b->priv.flags &= ~KB_CACHE_DIRTY;
97 size_t kblock_read(struct KBlock *b, block_idx_t idx, void *buf, size_t offset, size_t size)
101 ASSERT(offset + size <= b->blk_size);
102 LOG_INFO("blk_idx %d, offset %d, size %d\n", idx, offset, size);
104 if (idx == b->priv.curr_blk)
105 return kblock_readBuf(b, buf, offset, size);
107 return kblock_readDirect(b, idx, buf, offset, size);
111 int kblock_flush(struct KBlock *b)
115 if (kblock_cacheDirty(b))
117 LOG_INFO("flushing block %d\n", b->priv.curr_blk);
118 if (kblock_store(b, b->priv.curr_blk) == 0)
119 kblock_setDirty(b, false);
127 static bool kblock_loadPage(struct KBlock *b, block_idx_t idx)
131 if (idx != b->priv.curr_blk)
133 LOG_INFO("loading block %d\n", idx);
134 if (kblock_flush(b) != 0 || kblock_load(b, idx) != 0)
137 b->priv.curr_blk = idx;
143 size_t kblock_write(struct KBlock *b, block_idx_t idx, const void *buf, size_t offset, size_t size)
147 ASSERT(idx < b->blk_cnt);
148 ASSERT(offset + size <= b->blk_size);
150 LOG_INFO("blk_idx %d, offset %d, size %d\n", idx, offset, size);
152 if (!kblock_loadPage(b, idx))
155 kblock_setDirty(b, true);
156 return kblock_writeBuf(b, buf, offset, size);
159 int kblock_copy(struct KBlock *b, block_idx_t idx1, block_idx_t idx2)
162 ASSERT(idx1 < b->blk_cnt);
163 ASSERT(idx2 < b->blk_cnt);
165 if (!kblock_loadPage(b, idx1))
168 b->priv.curr_blk = idx2;
169 kblock_setDirty(b, true);
173 int kblock_swWriteBlock(struct KBlock *b, block_idx_t index, const void *buf)
175 return (kblock_write(b, index, buf, 0, b->blk_size) == b->blk_size) ? 0 : EOF;
178 int kblock_swReadBlock(struct KBlock *b, block_idx_t index, void *buf)
180 return (kblock_read(b, index, buf, 0, b->blk_size) == b->blk_size) ? 0 : EOF;
183 int kblock_swLoad(struct KBlock *b, block_idx_t index)
185 return kblock_readBlock(b, index, b->priv.buf);
188 int kblock_swStore(struct KBlock *b, block_idx_t index)
190 return kblock_writeBlock(b, index, b->priv.buf);
193 size_t kblock_swReadBuf(struct KBlock *b, void *buf, size_t offset, size_t size)
196 ASSERT(offset + size <= b->blk_size);
198 memcpy(buf, (uint8_t *)b->priv.buf + offset, size);
202 size_t kblock_swWriteBuf(struct KBlock *b, const void *buf, size_t offset, size_t size)
205 ASSERT(offset + size <= b->blk_size);
206 memcpy((uint8_t *)b->priv.buf + offset, buf, size);
210 size_t kblock_swReadDirect(struct KBlock *b, block_idx_t index, void *buf, size_t offset, size_t size)
213 ASSERT(index < b->blk_cnt);
215 if (!kblock_loadPage(b, index))
218 return kblock_swReadBuf(b, buf, offset, size);