dm: change "unsigned" to "unsigned int"

[linux-2.6-block.git] / drivers / md / persistent-data / dm-btree.h

diff --git a/drivers/md/persistent-data/dm-btree.h b/drivers/md/persistent-data/dm-btree.h
index 62461e6db408fcd3b675f008d1e42cf0fd207681..f3f2b21c82c8aa6bca83a2fe8f462e1f77443d50 100644 (file)
--- a/drivers/md/persistent-data/dm-btree.h
+++ b/drivers/md/persistent-data/dm-btree.h
@@ -59,14 +59,14 @@ struct dm_btree_value_type {
         * somewhere.) This method is _not_ called for insertion of a new
         * value: It is assumed the ref count is already 1.
         */
-       void (*inc)(void *context, const void *value, unsigned count);
+       void (*inc)(void *context, const void *value, unsigned int count);
 
        /*
         * These values are being deleted.  The btree takes care of freeing
         * the memory pointed to by @value.  Often the del function just
         * needs to decrement a reference counts somewhere.
         */
-       void (*dec)(void *context, const void *value, unsigned count);
+       void (*dec)(void *context, const void *value, unsigned int count);
 
        /*
         * A test for equality between two values.  When a value is
@@ -85,7 +85,7 @@ struct dm_btree_info {
        /*
         * Number of nested btrees. (Not the depth of a single tree.)
         */
-       unsigned levels;
+       unsigned int levels;
        struct dm_btree_value_type value_type;
 };
 
@@ -150,7 +150,7 @@ int dm_btree_remove(struct dm_btree_info *info, dm_block_t root,
  */
 int dm_btree_remove_leaves(struct dm_btree_info *info, dm_block_t root,
                           uint64_t *keys, uint64_t end_key,
-                          dm_block_t *new_root, unsigned *nr_removed);
+                          dm_block_t *new_root, unsigned int *nr_removed);
 
 /*
  * Returns < 0 on failure.  Otherwise the number of key entries that have
@@ -189,7 +189,7 @@ int dm_btree_walk(struct dm_btree_info *info, dm_block_t root,
 
 struct cursor_node {
        struct dm_block *b;
-       unsigned index;
+       unsigned int index;
 };
 
 struct dm_btree_cursor {
@@ -197,7 +197,7 @@ struct dm_btree_cursor {
        dm_block_t root;
 
        bool prefetch_leaves;
-       unsigned depth;
+       unsigned int depth;
        struct cursor_node nodes[DM_BTREE_CURSOR_MAX_DEPTH];
 };