| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2010 The Chromium OS Authors <chromium-os-dev@chromium.org> | 2 * Copyright (C) 2010 The Chromium OS Authors <chromium-os-dev@chromium.org> |
| 3 * | 3 * |
| 4 * Device-Mapper block hash tree interface. | 4 * Device-Mapper block hash tree interface. |
| 5 * See Documentation/device-mapper/dm-bht.txt for details. | 5 * See Documentation/device-mapper/dm-bht.txt for details. |
| 6 * | 6 * |
| 7 * This file is released under the GPLv2. | 7 * This file is released under the GPLv2. |
| 8 */ | 8 */ |
| 9 #ifndef __LINUX_DM_BHT_H | 9 #ifndef __LINUX_DM_BHT_H |
| 10 #define __LINUX_DM_BHT_H | 10 #define __LINUX_DM_BHT_H |
| 11 | 11 |
| 12 #include <linux/compiler.h> | 12 #include <linux/compiler.h> |
| 13 #include <linux/crypto.h> | 13 #include <linux/crypto.h> |
| 14 #include <linux/mempool.h> | 14 #include <linux/mempool.h> |
| 15 #include <linux/types.h> | 15 #include <linux/types.h> |
| 16 | 16 |
| 17 /* To avoid allocating memory for digest tests, we just setup a | 17 /* To avoid allocating memory for digest tests, we just setup a |
| 18 * max to use for now. | 18 * max to use for now. |
| 19 */ | 19 */ |
| 20 #define DM_BHT_MAX_DIGEST_SIZE 128 /* 1k hashes are unlikely for now */ | 20 #define DM_BHT_MAX_DIGEST_SIZE 128 /* 1k hashes are unlikely for now */ |
| 21 #define DM_BHT_MAX_NODE_COUNT 256 | |
| 22 | 21 |
| 23 /* UNALLOCATED, PENDING, READY, and VERIFIED are valid states. All other | 22 /* UNALLOCATED, PENDING, READY, and VERIFIED are valid states. All other |
| 24 * values are entry-related return codes. | 23 * values are entry-related return codes. |
| 25 */ | 24 */ |
| 26 #define DM_BHT_ENTRY_VERIFIED 8 /* 'nodes' has been checked against parent */ | 25 #define DM_BHT_ENTRY_VERIFIED 8 /* 'nodes' has been checked against parent */ |
| 27 #define DM_BHT_ENTRY_READY 4 /* 'nodes' is loaded and available */ | 26 #define DM_BHT_ENTRY_READY 4 /* 'nodes' is loaded and available */ |
| 28 #define DM_BHT_ENTRY_PENDING 2 /* 'nodes' is being loaded */ | 27 #define DM_BHT_ENTRY_PENDING 2 /* 'nodes' is being loaded */ |
| 29 #define DM_BHT_ENTRY_REQUESTED 1 /* non-state response indicating entry is | 28 #define DM_BHT_ENTRY_REQUESTED 1 /* non-state response indicating entry is |
| 30 * pending because of the current call | 29 * pending because of the current call |
| 31 */ | 30 */ |
| (...skipping 112 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 144 */ | 143 */ |
| 145 int dm_bht_compute(struct dm_bht *bht, void *read_cb_ctx); | 144 int dm_bht_compute(struct dm_bht *bht, void *read_cb_ctx); |
| 146 int dm_bht_sync(struct dm_bht *bht, void *write_cb_ctx); | 145 int dm_bht_sync(struct dm_bht *bht, void *write_cb_ctx); |
| 147 int dm_bht_store_block(struct dm_bht *bht, unsigned int block_index, | 146 int dm_bht_store_block(struct dm_bht *bht, unsigned int block_index, |
| 148 u8 *block_data); | 147 u8 *block_data); |
| 149 int dm_bht_zeroread_callback(void *ctx, sector_t start, u8 *dst, sector_t count, | 148 int dm_bht_zeroread_callback(void *ctx, sector_t start, u8 *dst, sector_t count, |
| 150 struct dm_bht_entry *entry); | 149 struct dm_bht_entry *entry); |
| 151 void dm_bht_read_completed(struct dm_bht_entry *entry, int status); | 150 void dm_bht_read_completed(struct dm_bht_entry *entry, int status); |
| 152 void dm_bht_write_completed(struct dm_bht_entry *entry, int status); | 151 void dm_bht_write_completed(struct dm_bht_entry *entry, int status); |
| 153 #endif /* __LINUX_DM_BHT_H */ | 152 #endif /* __LINUX_DM_BHT_H */ |
| OLD | NEW |