Ticket #13513: 0001-Fixed-Code-style.patch

src/add-ons/kernel/file_systems/btrfs/Attribute.cpp

@@ -92 +92 @@
     TRACE("Stat\n");
 
     size_t nameLength = strlen(fName);
-    btrfs_dir_entry *entries;
+    btrfs_dir_entry* entries;
     size_t length;
     status_t status = _Lookup(fName, nameLength, &entries, &length);
     if (status < B_OK)
         return status;
 
-    btrfs_dir_entry *entry;
+    btrfs_dir_entry* entry;
     status = _FindEntry(entries, length, fName, nameLength, &entry);
     if (status != B_OK) {
         free(entries);
@@ -120 +120 @@
         return ERANGE;
 
     size_t nameLength = strlen(fName);
-    btrfs_dir_entry *entries;
+    btrfs_dir_entry* entries;
     size_t length;
     status_t status = _Lookup(fName, nameLength, &entries, &length);
     if (status < B_OK)
         return status;
 
-    btrfs_dir_entry *entry;
+    btrfs_dir_entry* entry;
     status = _FindEntry(entries, length, fName, nameLength, &entry);
     if (status != B_OK) {
         free(entries);
@@ -149 +149 @@
 
 status_t
 Attribute::_Lookup(const char* name, size_t nameLength,
-    btrfs_dir_entry **_entries, size_t *_length)
+    btrfs_dir_entry** _entries, size_t* _length)
 {
     uint32 hash = calculate_crc((uint32)~1, (uint8*)name, nameLength);
     struct btrfs_key key;
@@ -157 +157 @@
     key.SetObjectID(fInode->ID());
     key.SetOffset(hash);
 
-    btrfs_dir_entry *entries;
+    btrfs_dir_entry* entries;
     size_t length;
     status_t status = fInode->GetVolume()->FSTree()->FindExact(key,
         (void**)&entries, &length);
@@ -180 +180 @@
 
 
 status_t
-Attribute::_FindEntry(btrfs_dir_entry *entries, size_t length,
-    const char* name, size_t nameLength, btrfs_dir_entry **_entry)
+Attribute::_FindEntry(btrfs_dir_entry* entries, size_t length,
+    const char* name, size_t nameLength, btrfs_dir_entry** _entry)
 {
-    btrfs_dir_entry *entry = entries;
+    btrfs_dir_entry* entry = entries;
     uint16 current = 0;
     while (current < length) {
         current += entry->Length();
         break;
         // TODO there could be several entries with the same name hash
-        entry = (btrfs_dir_entry *)((uint8*)entry + entry->Length());
+        entry = (btrfs_dir_entry*)((uint8*)entry + entry->Length());
     }
     
     *_entry = entry;
     return B_OK;
 }
-

src/add-ons/kernel/file_systems/btrfs/Attribute.h

@@ -38 +38 @@
                                     uint8* buffer, size_t* _length);
 private:
             status_t            _Lookup(const char* name, size_t nameLength,
-                                    btrfs_dir_entry **entries = NULL,
-                                    size_t *length = NULL);
-            status_t            _FindEntry(btrfs_dir_entry *entries,
+                                    btrfs_dir_entry** entries = NULL,
+                                    size_t* length = NULL);
+            status_t            _FindEntry(btrfs_dir_entry* entries,
                                     size_t length, const char* name,
                                     size_t nameLength,
-                                    btrfs_dir_entry **_entry);
+                                    btrfs_dir_entry** _entry);
 
             ::Volume*           fVolume;
             Inode*              fInode;

src/add-ons/kernel/file_systems/btrfs/AttributeIterator.cpp

@@ -50 +50 @@
 AttributeIterator::GetNext(char* name, size_t* _nameLength)
 {
     btrfs_key key;
-    btrfs_dir_entry *entries;
+    btrfs_dir_entry* entries;
     size_t entries_length;
     status_t status = fIterator->GetPreviousEntry(key, (void**)&entries,
         &entries_length);
     if (status != B_OK)
         return status;
 
-    btrfs_dir_entry *entry = entries;
+    btrfs_dir_entry* entry = entries;
     uint16 current = 0;
     while (current < entries_length) {
         current += entry->Length();
         break;
         // TODO there could be several entries with the same name hash
-        entry = (btrfs_dir_entry *)((uint8*)entry + entry->Length());
+        entry = (btrfs_dir_entry*)((uint8*)entry + entry->Length());
     }
 
     TRACE("DirectoryIterator::GetNext() entries_length %ld name_length %d\n",
@@ -85 +85 @@
     fOffset = -1ULL;
     return B_OK;
 }
-

src/add-ons/kernel/file_systems/btrfs/BPlusTree.cpp

@@ -26 +26 @@
 #   define ERROR(x...) dprintf("\33[34mbtrfs:\33[0m " x)
 
 
-BPlusTree::BPlusTree(Volume* volume, struct btrfs_stream *stream)
+BPlusTree::BPlusTree(Volume* volume, struct btrfs_stream* stream)
     :
     fStream(stream),
     fRootBlock(0),
@@ -62 +62 @@
 
 
 int32
-BPlusTree::_CompareKeys(struct btrfs_key &key1, struct btrfs_key &key2)
+BPlusTree::_CompareKeys(struct btrfs_key& key1, struct btrfs_key& key2)
 {
     if (key1.ObjectID() > key2.ObjectID())
         return 1;
@@ -86 +86 @@
     It can also return other errors to indicate that something went wrong.
 */
 status_t
-BPlusTree::_Find(struct btrfs_key &key, void** _value, size_t* _size,
+BPlusTree::_Find(struct btrfs_key& key, void** _value, size_t* _size,
     bplustree_traversing type)
 {
     TRACE("Find() objectid %" B_PRId64 " type %d offset %" B_PRId64 " \n",
         key.ObjectID(), key.Type(), key.Offset());
-    btrfs_stream *stream = fStream;
+    btrfs_stream* stream = fStream;
     CachedBlock cached(fVolume);
     fsblock_t physical;
     if (stream == NULL) {
@@ -99 +99 @@
             ERROR("Find() unmapped block %" B_PRId64 "\n", fRootBlock);
             return B_ERROR;
         }
-        stream = (btrfs_stream *)cached.SetTo(physical);
+        stream = (btrfs_stream*)cached.SetTo(physical);
     }
 
     while (stream->header.Level() != 0) {
@@ -123 +123 @@
                 stream->index[i - 1].BlockNum());
             return B_ERROR;
         }
-        stream = (btrfs_stream *)cached.SetTo(physical);
+        stream = (btrfs_stream*)cached.SetTo(physical);
     }
 
     uint32 i;
@@ -175 +175 @@
             if ((fVolume->BlockSize() - totalOffset % fVolume->BlockSize())
                 >= stream->entries[i].Size()) {
                 //If there is enough space for *_value
-                memcpy(*_value, ((uint8 *)cached.SetTo(physical
+                memcpy(*_value, ((uint8*)cached.SetTo(physical
                     + totalOffset / fVolume->BlockSize())
                     + totalOffset % fVolume->BlockSize()),
                     stream->entries[i].Size());
@@ -201 +201 @@
 
 
 status_t
-BPlusTree::FindNext(struct btrfs_key &key, void** _value, size_t* _size)
+BPlusTree::FindNext(struct btrfs_key& key, void** _value, size_t* _size)
 {
     return _Find(key, _value, _size, BPLUSTREE_FORWARD);
 }
 
 
 status_t
-BPlusTree::FindPrevious(struct btrfs_key &key, void** _value, size_t* _size)
+BPlusTree::FindPrevious(struct btrfs_key& key, void** _value, size_t* _size)
 {
     return _Find(key, _value, _size, BPLUSTREE_BACKWARD);
 }
 
 
 status_t
-BPlusTree::FindExact(struct btrfs_key &key, void** _value, size_t* _size)
+BPlusTree::FindExact(struct btrfs_key& key, void** _value, size_t* _size)
 {
     return _Find(key, _value, _size, BPLUSTREE_EXACT);
 }
@@ -240 +240 @@
 //  #pragma mark -
 
 
-TreeIterator::TreeIterator(BPlusTree* tree, struct btrfs_key &key)
+TreeIterator::TreeIterator(BPlusTree* tree, struct btrfs_key& key)
     :
     fTree(tree),
     fCurrentKey(key)
@@ -260 +260 @@
 /*! Iterates through the tree in the specified direction.
 */
 status_t
-TreeIterator::Traverse(bplustree_traversing direction, struct btrfs_key &key,
+TreeIterator::Traverse(bplustree_traversing direction, struct btrfs_key& key,
     void** value, size_t* size)
 {
     if (fTree == NULL)
@@ -281 +281 @@
 /*! just sets the current key in the iterator.
 */
 status_t
-TreeIterator::Find(struct btrfs_key &key)
+TreeIterator::Find(struct btrfs_key& key)
 {
     if (fTree == NULL)
         return B_INTERRUPTED;
@@ -295 +295 @@
 {
     fTree = NULL;
 }
-

src/add-ons/kernel/file_systems/btrfs/BPlusTree.h

@@ -30 +30 @@
 
 //  #pragma mark - in-memory structures
 
+
 template<class T> class Stack;
 class TreeIterator;
 
@@ -44 +45 @@
 class BPlusTree {
 public:
                                 BPlusTree(Volume* volume,
-                                    struct btrfs_stream *stream);
+                                    struct btrfs_stream* stream);
                                 BPlusTree(Volume* volume,
                                     fsblock_t rootBlock);
                                 ~BPlusTree();
-            status_t            FindExact(struct btrfs_key &key, void** value,
+            status_t            FindExact(struct btrfs_key& key, void** value,
                                     size_t* size = NULL);
-            status_t            FindNext(struct btrfs_key &key, void** value,
+            status_t            FindNext(struct btrfs_key& key, void** value,
                                     size_t* size = NULL);
-            status_t            FindPrevious(struct btrfs_key &key, void** value,
+            status_t            FindPrevious(struct btrfs_key& key, void** value,
                                     size_t* size = NULL);
 
 private:
@@ -60 +61 @@
                                 BPlusTree& operator=(const BPlusTree& other);
                                     // no implementation
 
-            int32               _CompareKeys(struct btrfs_key &key1,
-                                    struct btrfs_key &key2);
-            status_t            _Find(struct btrfs_key &key, void** value,
+            int32               _CompareKeys(struct btrfs_key& key1,
+                                    struct btrfs_key& key2);
+            status_t            _Find(struct btrfs_key& key, void** value,
                                     size_t* size, bplustree_traversing type);
             void                _AddIterator(TreeIterator* iterator);
             void                _RemoveIterator(TreeIterator* iterator);
@@ -79 +80 @@
 
 class TreeIterator : public SinglyLinkedListLinkImpl<TreeIterator> {
 public:
-                                TreeIterator(BPlusTree* tree, struct btrfs_key &key);
+                                TreeIterator(BPlusTree* tree, struct btrfs_key& key);
                                 ~TreeIterator();
 
             status_t            Traverse(bplustree_traversing direction,
-                                    struct btrfs_key &key, void** value,
-                                    size_t *size = NULL);
-            status_t            Find(struct btrfs_key &key);
+                                    struct btrfs_key& key, void** value,
+                                    size_t* size = NULL);
+            status_t            Find(struct btrfs_key& key);
 
             status_t            Rewind();
-            status_t            GetNextEntry(struct btrfs_key &key, void** value,
-                                    size_t *size = NULL);
-            status_t            GetPreviousEntry(struct btrfs_key &key, void** value,
-                                    size_t *size = NULL);
+            status_t            GetNextEntry(struct btrfs_key& key, void** value,
+                                    size_t* size = NULL);
+            status_t            GetPreviousEntry(struct btrfs_key& key, void** value,
+                                    size_t* size = NULL);
 
             BPlusTree*          Tree() const { return fTree; }
 
@@ -117 +118 @@
     return B_OK;
 }
 
+
 inline status_t
-TreeIterator::GetNextEntry(struct btrfs_key &key, void** value, size_t *size)
+TreeIterator::GetNextEntry(struct btrfs_key& key, void** value, size_t* size)
 {
     return Traverse(BPLUSTREE_FORWARD, key, value, size);
 }
 
+
 inline status_t
-TreeIterator::GetPreviousEntry(struct btrfs_key &key, void** value,
-    size_t *size)
+TreeIterator::GetPreviousEntry(struct btrfs_key& key, void** value,
+    size_t* size)
 {
     return Traverse(BPLUSTREE_BACKWARD, key, value, size);
 }
 
 
-
 #endif  // B_PLUS_TREE_H

src/add-ons/kernel/file_systems/btrfs/CRCTable.cpp

@@ -12 +12 @@
 
 //! CRC 03667067501 table, as generated by crc_table.cpp
 static uint32 kCrcTable[256] = { 
-    0x00000000, 0xf26b8303, 0xe13b70f7, 0x1350f3f4, 0xc79a971f, 0x35f1141c, 0x26a1e7e8, 0xd4ca64eb, 
-    0x8ad958cf, 0x78b2dbcc, 0x6be22838, 0x9989ab3b, 0x4d43cfd0, 0xbf284cd3, 0xac78bf27, 0x5e133c24, 
-    0x105ec76f, 0xe235446c, 0xf165b798, 0x030e349b, 0xd7c45070, 0x25afd373, 0x36ff2087, 0xc494a384, 
-    0x9a879fa0, 0x68ec1ca3, 0x7bbcef57, 0x89d76c54, 0x5d1d08bf, 0xaf768bbc, 0xbc267848, 0x4e4dfb4b, 
-    0x20bd8ede, 0xd2d60ddd, 0xc186fe29, 0x33ed7d2a, 0xe72719c1, 0x154c9ac2, 0x061c6936, 0xf477ea35, 
-    0xaa64d611, 0x580f5512, 0x4b5fa6e6, 0xb93425e5, 0x6dfe410e, 0x9f95c20d, 0x8cc531f9, 0x7eaeb2fa, 
-    0x30e349b1, 0xc288cab2, 0xd1d83946, 0x23b3ba45, 0xf779deae, 0x05125dad, 0x1642ae59, 0xe4292d5a, 
-    0xba3a117e, 0x4851927d, 0x5b016189, 0xa96ae28a, 0x7da08661, 0x8fcb0562, 0x9c9bf696, 0x6ef07595, 
-    0x417b1dbc, 0xb3109ebf, 0xa0406d4b, 0x522bee48, 0x86e18aa3, 0x748a09a0, 0x67dafa54, 0x95b17957, 
-    0xcba24573, 0x39c9c670, 0x2a993584, 0xd8f2b687, 0x0c38d26c, 0xfe53516f, 0xed03a29b, 0x1f682198, 
-    0x5125dad3, 0xa34e59d0, 0xb01eaa24, 0x42752927, 0x96bf4dcc, 0x64d4cecf, 0x77843d3b, 0x85efbe38, 
-    0xdbfc821c, 0x2997011f, 0x3ac7f2eb, 0xc8ac71e8, 0x1c661503, 0xee0d9600, 0xfd5d65f4, 0x0f36e6f7, 
-    0x61c69362, 0x93ad1061, 0x80fde395, 0x72966096, 0xa65c047d, 0x5437877e, 0x4767748a, 0xb50cf789, 
-    0xeb1fcbad, 0x197448ae, 0x0a24bb5a, 0xf84f3859, 0x2c855cb2, 0xdeeedfb1, 0xcdbe2c45, 0x3fd5af46, 
-    0x7198540d, 0x83f3d70e, 0x90a324fa, 0x62c8a7f9, 0xb602c312, 0x44694011, 0x5739b3e5, 0xa55230e6, 
-    0xfb410cc2, 0x092a8fc1, 0x1a7a7c35, 0xe811ff36, 0x3cdb9bdd, 0xceb018de, 0xdde0eb2a, 0x2f8b6829, 
-    0x82f63b78, 0x709db87b, 0x63cd4b8f, 0x91a6c88c, 0x456cac67, 0xb7072f64, 0xa457dc90, 0x563c5f93, 
-    0x082f63b7, 0xfa44e0b4, 0xe9141340, 0x1b7f9043, 0xcfb5f4a8, 0x3dde77ab, 0x2e8e845f, 0xdce5075c, 
-    0x92a8fc17, 0x60c37f14, 0x73938ce0, 0x81f80fe3, 0x55326b08, 0xa759e80b, 0xb4091bff, 0x466298fc, 
-    0x1871a4d8, 0xea1a27db, 0xf94ad42f, 0x0b21572c, 0xdfeb33c7, 0x2d80b0c4, 0x3ed04330, 0xccbbc033, 
-    0xa24bb5a6, 0x502036a5, 0x4370c551, 0xb11b4652, 0x65d122b9, 0x97baa1ba, 0x84ea524e, 0x7681d14d, 
-    0x2892ed69, 0xdaf96e6a, 0xc9a99d9e, 0x3bc21e9d, 0xef087a76, 0x1d63f975, 0x0e330a81, 0xfc588982, 
-    0xb21572c9, 0x407ef1ca, 0x532e023e, 0xa145813d, 0x758fe5d6, 0x87e466d5, 0x94b49521, 0x66df1622, 
-    0x38cc2a06, 0xcaa7a905, 0xd9f75af1, 0x2b9cd9f2, 0xff56bd19, 0x0d3d3e1a, 0x1e6dcdee, 0xec064eed, 
-    0xc38d26c4, 0x31e6a5c7, 0x22b65633, 0xd0ddd530, 0x0417b1db, 0xf67c32d8, 0xe52cc12c, 0x1747422f, 
-    0x49547e0b, 0xbb3ffd08, 0xa86f0efc, 0x5a048dff, 0x8ecee914, 0x7ca56a17, 0x6ff599e3, 0x9d9e1ae0, 
-    0xd3d3e1ab, 0x21b862a8, 0x32e8915c, 0xc083125f, 0x144976b4, 0xe622f5b7, 0xf5720643, 0x07198540, 
-    0x590ab964, 0xab613a67, 0xb831c993, 0x4a5a4a90, 0x9e902e7b, 0x6cfbad78, 0x7fab5e8c, 0x8dc0dd8f, 
-    0xe330a81a, 0x115b2b19, 0x020bd8ed, 0xf0605bee, 0x24aa3f05, 0xd6c1bc06, 0xc5914ff2, 0x37faccf1, 
-    0x69e9f0d5, 0x9b8273d6, 0x88d28022, 0x7ab90321, 0xae7367ca, 0x5c18e4c9, 0x4f48173d, 0xbd23943e, 
-    0xf36e6f75, 0x0105ec76, 0x12551f82, 0xe03e9c81, 0x34f4f86a, 0xc69f7b69, 0xd5cf889d, 0x27a40b9e, 
-    0x79b737ba, 0x8bdcb4b9, 0x988c474d, 0x6ae7c44e, 0xbe2da0a5, 0x4c4623a6, 0x5f16d052, 0xad7d5351 
+    0x00000000, 0xf26b8303, 0xe13b70f7, 0x1350f3f4, 0xc79a971f, 0x35f1141c, 0x26a1e7e8, 0xd4ca64eb, 
+    0x8ad958cf, 0x78b2dbcc, 0x6be22838, 0x9989ab3b, 0x4d43cfd0, 0xbf284cd3, 0xac78bf27, 0x5e133c24, 
+    0x105ec76f, 0xe235446c, 0xf165b798, 0x030e349b, 0xd7c45070, 0x25afd373, 0x36ff2087, 0xc494a384, 
+    0x9a879fa0, 0x68ec1ca3, 0x7bbcef57, 0x89d76c54, 0x5d1d08bf, 0xaf768bbc, 0xbc267848, 0x4e4dfb4b, 
+    0x20bd8ede, 0xd2d60ddd, 0xc186fe29, 0x33ed7d2a, 0xe72719c1, 0x154c9ac2, 0x061c6936, 0xf477ea35, 
+    0xaa64d611, 0x580f5512, 0x4b5fa6e6, 0xb93425e5, 0x6dfe410e, 0x9f95c20d, 0x8cc531f9, 0x7eaeb2fa, 
+    0x30e349b1, 0xc288cab2, 0xd1d83946, 0x23b3ba45, 0xf779deae, 0x05125dad, 0x1642ae59, 0xe4292d5a, 
+    0xba3a117e, 0x4851927d, 0x5b016189, 0xa96ae28a, 0x7da08661, 0x8fcb0562, 0x9c9bf696, 0x6ef07595, 
+    0x417b1dbc, 0xb3109ebf, 0xa0406d4b, 0x522bee48, 0x86e18aa3, 0x748a09a0, 0x67dafa54, 0x95b17957, 
+    0xcba24573, 0x39c9c670, 0x2a993584, 0xd8f2b687, 0x0c38d26c, 0xfe53516f, 0xed03a29b, 0x1f682198, 
+    0x5125dad3, 0xa34e59d0, 0xb01eaa24, 0x42752927, 0x96bf4dcc, 0x64d4cecf, 0x77843d3b, 0x85efbe38, 
+    0xdbfc821c, 0x2997011f, 0x3ac7f2eb, 0xc8ac71e8, 0x1c661503, 0xee0d9600, 0xfd5d65f4, 0x0f36e6f7, 
+    0x61c69362, 0x93ad1061, 0x80fde395, 0x72966096, 0xa65c047d, 0x5437877e, 0x4767748a, 0xb50cf789, 
+    0xeb1fcbad, 0x197448ae, 0x0a24bb5a, 0xf84f3859, 0x2c855cb2, 0xdeeedfb1, 0xcdbe2c45, 0x3fd5af46, 
+    0x7198540d, 0x83f3d70e, 0x90a324fa, 0x62c8a7f9, 0xb602c312, 0x44694011, 0x5739b3e5, 0xa55230e6, 
+    0xfb410cc2, 0x092a8fc1, 0x1a7a7c35, 0xe811ff36, 0x3cdb9bdd, 0xceb018de, 0xdde0eb2a, 0x2f8b6829, 
+    0x82f63b78, 0x709db87b, 0x63cd4b8f, 0x91a6c88c, 0x456cac67, 0xb7072f64, 0xa457dc90, 0x563c5f93, 
+    0x082f63b7, 0xfa44e0b4, 0xe9141340, 0x1b7f9043, 0xcfb5f4a8, 0x3dde77ab, 0x2e8e845f, 0xdce5075c, 
+    0x92a8fc17, 0x60c37f14, 0x73938ce0, 0x81f80fe3, 0x55326b08, 0xa759e80b, 0xb4091bff, 0x466298fc, 
+    0x1871a4d8, 0xea1a27db, 0xf94ad42f, 0x0b21572c, 0xdfeb33c7, 0x2d80b0c4, 0x3ed04330, 0xccbbc033, 
+    0xa24bb5a6, 0x502036a5, 0x4370c551, 0xb11b4652, 0x65d122b9, 0x97baa1ba, 0x84ea524e, 0x7681d14d, 
+    0x2892ed69, 0xdaf96e6a, 0xc9a99d9e, 0x3bc21e9d, 0xef087a76, 0x1d63f975, 0x0e330a81, 0xfc588982, 
+    0xb21572c9, 0x407ef1ca, 0x532e023e, 0xa145813d, 0x758fe5d6, 0x87e466d5, 0x94b49521, 0x66df1622, 
+    0x38cc2a06, 0xcaa7a905, 0xd9f75af1, 0x2b9cd9f2, 0xff56bd19, 0x0d3d3e1a, 0x1e6dcdee, 0xec064eed, 
+    0xc38d26c4, 0x31e6a5c7, 0x22b65633, 0xd0ddd530, 0x0417b1db, 0xf67c32d8, 0xe52cc12c, 0x1747422f, 
+    0x49547e0b, 0xbb3ffd08, 0xa86f0efc, 0x5a048dff, 0x8ecee914, 0x7ca56a17, 0x6ff599e3, 0x9d9e1ae0, 
+    0xd3d3e1ab, 0x21b862a8, 0x32e8915c, 0xc083125f, 0x144976b4, 0xe622f5b7, 0xf5720643, 0x07198540, 
+    0x590ab964, 0xab613a67, 0xb831c993, 0x4a5a4a90, 0x9e902e7b, 0x6cfbad78, 0x7fab5e8c, 0x8dc0dd8f, 
+    0xe330a81a, 0x115b2b19, 0x020bd8ed, 0xf0605bee, 0x24aa3f05, 0xd6c1bc06, 0xc5914ff2, 0x37faccf1, 
+    0x69e9f0d5, 0x9b8273d6, 0x88d28022, 0x7ab90321, 0xae7367ca, 0x5c18e4c9, 0x4f48173d, 0xbd23943e, 
+    0xf36e6f75, 0x0105ec76, 0x12551f82, 0xe03e9c81, 0x34f4f86a, 0xc69f7b69, 0xd5cf889d, 0x27a40b9e, 
+    0x79b737ba, 0x8bdcb4b9, 0x988c474d, 0x6ae7c44e, 0xbe2da0a5, 0x4c4623a6, 0x5f16d052, 0xad7d5351 
 };
 
 
@@ -58 +58 @@
     \return The crc checksum, or 0 if an error occurred.
 */
 uint32
-calculate_crc(uint32 crc, uint8 *data, uint16 length)
+calculate_crc(uint32 crc, uint8* data, uint16 length)
 {
     if (data) {
         for ( ; length > 0; length--, data++)

src/add-ons/kernel/file_systems/btrfs/CRCTable.h

@@ -6 +6 @@
  *      Jérôme Duval
  */
 
-uint32 calculate_crc(uint32 crc, uint8 *data, uint16 length);
-
+uint32 calculate_crc(uint32 crc, uint8* data, uint16 length);

src/add-ons/kernel/file_systems/btrfs/CachedBlock.h

@@ -27 +27 @@
             off_t           BlockNumber() const { return fBlockNumber; }
 
 private:
-                            CachedBlock(const CachedBlock &);
-                            CachedBlock &operator=(const CachedBlock &);
+                            CachedBlock(const CachedBlock&);
+                            CachedBlock& operator=(const CachedBlock&);
                                 // no implementation
                         
 protected:
@@ -91 +91 @@
 {
     Unset();
     fBlockNumber = block;
-    return fBlock = (uint8 *)block_cache_get(fVolume->BlockCache(), block);
+    return fBlock = (uint8*)block_cache_get(fVolume->BlockCache(), block);
 }
 
+
 #endif  // CACHED_BLOCK_H

src/add-ons/kernel/file_systems/btrfs/Chunk.cpp

@@ -43 +43 @@
         "sector_size %" B_PRIu32 "\n", chunk->Length(), chunk->Owner(), 
         chunk->StripeLength(), chunk->Type(), chunk->StripeCount(), 
         chunk->SubStripes(), chunk->SectorSize());
-    for(int32 i = 0; i < chunk->StripeCount(); i++) {
+    for (int32 i = 0; i < chunk->StripeCount(); i++) {
         TRACE("chunk.stripe[%" B_PRId32 "].physical %" B_PRId64 " deviceid %"
             B_PRId64 "\n", i, chunk->stripes[i].Offset(),
             chunk->stripes[i].DeviceID());
@@ -66 +66 @@
 
 
 status_t
-Chunk::FindBlock(off_t logical, off_t &physical)
+Chunk::FindBlock(off_t logical, off_t& physical)
 {
     if (fChunk == NULL)
         return B_NO_INIT;
 
     if (logical < (off_t)fChunkOffset
         || logical > (off_t)(fChunkOffset + fChunk->Length()))
-            return B_BAD_VALUE;
+        return B_BAD_VALUE;
     
     // only one stripe
     physical = logical + fChunk->stripes[0].Offset() - fChunkOffset;

src/add-ons/kernel/file_systems/btrfs/Chunk.h

@@ -18 +18 @@
                                     fsblock_t offset);
                                 ~Chunk();
             uint32              Size() const;
-            status_t            FindBlock(off_t logical, off_t &physical);
+            status_t            FindBlock(off_t logical, off_t& physical);
             fsblock_t           Offset() const { return fChunkOffset; }
-            fsblock_t           End() const 
+            fsblock_t           End() const
                                     { return fChunkOffset + fChunk->Length(); }
 private:
             struct btrfs_chunk* fChunk;

src/add-ons/kernel/file_systems/btrfs/DirectoryIterator.cpp

@@ -73 +73 @@
     }
 
     btrfs_key key;
-    btrfs_dir_entry *entries;
+    btrfs_dir_entry* entries;
     size_t entries_length;
     status_t status = fIterator->GetNextEntry(key, (void**)&entries,
         &entries_length);
     if (status != B_OK)
         return status;
 
-    btrfs_dir_entry *entry = entries;
+    btrfs_dir_entry* entry = entries;
     uint16 current = 0;
     while (current < entries_length) {
         current += entry->Length();
         break;
         // TODO there could be several entries with the same name hash
-        entry = (btrfs_dir_entry *)((uint8*)entry + entry->Length());
+        entry = (btrfs_dir_entry*)((uint8*)entry + entry->Length());
     }
 
     size_t length = entry->NameLength();
@@ -127 +127 @@
     key.SetObjectID(fInode->ID());
     key.SetOffset(hash);
 
-    btrfs_dir_entry *entries;
+    btrfs_dir_entry* entries;
     size_t length;
     status_t status = fInode->GetVolume()->FSTree()->FindExact(key,
         (void**)&entries, &length);
@@ -137 +137 @@
         return status;
     }
 
-    btrfs_dir_entry *entry = entries;
+    btrfs_dir_entry* entry = entries;
     uint16 current = 0;
     while (current < length) {
         current += entry->Length();
         break;
         // TODO there could be several entries with the same name hash
-        entry = (btrfs_dir_entry *)((uint8*)entry + entry->Length());
+        entry = (btrfs_dir_entry*)((uint8*)entry + entry->Length());
     }
 
     TRACE("DirectoryIterator::Lookup() entries_length %ld name_length %d\n",

src/add-ons/kernel/file_systems/btrfs/Inode.cpp

@@ -84 +84 @@
     search_key.SetObjectID(fID);
     search_key.SetOffset(0);
 
-    struct btrfs_inode *node;
+    struct btrfs_inode* node;
     if (fVolume->FSTree()->FindExact(search_key, (void**)&node) != B_OK) {
         ERROR("Inode::UpdateNodeFromDisk(): Couldn't find inode %"
             B_PRIdINO "\n", fID);
@@ -110 +110 @@
 
 
 status_t
-Inode::FindBlock(off_t pos, off_t& physical, off_t *_length)
+Inode::FindBlock(off_t pos, off_t& physical, off_t* _length)
 {
     struct btrfs_key search_key;
     search_key.SetType(BTRFS_KEY_TYPE_EXTENT_DATA);
     search_key.SetObjectID(fID);
     search_key.SetOffset(pos + 1);
 
-    btrfs_extent_data *extent_data;
+    btrfs_extent_data* extent_data;
     status_t status = fVolume->FSTree()->FindPrevious(search_key,
         (void**)&extent_data);
     if (status != B_OK) {
@@ -173 +173 @@
     search_key.SetOffset(pos + 1);
 
     size_t item_size;
-    btrfs_extent_data *extent_data;
+    btrfs_extent_data* extent_data;
     status_t status = fVolume->FSTree()->FindPrevious(search_key,
         (void**)&extent_data, &item_size);
     if (status != B_OK) {
@@ -291 +291 @@
 
 
 status_t
-Inode::FindParent(ino_t *id)
+Inode::FindParent(ino_t* id)
 {
     struct btrfs_key search_key;
     search_key.SetType(BTRFS_KEY_TYPE_INODE_REF);
     search_key.SetObjectID(fID);
     search_key.SetOffset(-1);
 
-    void *node_ref;
+    void* node_ref;
     if (fVolume->FSTree()->FindPrevious(search_key, &node_ref) != B_OK) {
         ERROR("Inode::FindParent(): Couldn't find inode for %" B_PRIdINO "\n",
             fID);

src/add-ons/kernel/file_systems/btrfs/Inode.h

@@ -32 +32 @@
 
             ino_t       ID() const { return fID; }
 
-            rw_lock*    Lock() { return &fLock; }
+            rw_lock*    Lock() { return& fLock; }
 
             status_t    UpdateNodeFromDisk();
 
@@ -48 +48 @@
             off_t       Size() const { return fNode.Size(); }
             uid_t       UserID() const { return fNode.UserID(); }
             gid_t       GroupID() const { return fNode.GroupID(); }
-            void        GetChangeTime(struct timespec &timespec) const
+            void        GetChangeTime(struct timespec& timespec) const
                             { fNode.GetChangeTime(timespec); }
-            void        GetModificationTime(struct timespec &timespec) const
+            void        GetModificationTime(struct timespec& timespec) const
                             { fNode.GetModificationTime(timespec); }
-            void        GetCreationTime(struct timespec &timespec) const
+            void        GetCreationTime(struct timespec& timespec) const
                             { fNode.GetCreationTime(timespec); }
-            void        GetAccessTime(struct timespec &timespec) const
+            void        GetAccessTime(struct timespec& timespec) const
                             { fNode.GetCreationTime(timespec); }
 
             Volume*     GetVolume() const { return fVolume; }
 
             status_t    FindBlock(off_t logical, off_t& physical,
-                            off_t *_length = NULL);
-            status_t    ReadAt(off_t pos, uint8 *buffer, size_t *length);
+                            off_t* _length = NULL);
+            status_t    ReadAt(off_t pos, uint8* buffer, size_t* length);
             status_t    FillGapWithZeros(off_t start, off_t end);
 
             void*       FileCache() const { return fCache; }
             void*       Map() const { return fMap; }
             
-            status_t    FindParent(ino_t *id);
+            status_t    FindParent(ino_t* id);
 private:
                         Inode(Volume* volume);
                         Inode(const Inode&);
-                        Inode &operator=(const Inode&);
+                        Inode& operator=(const Inode&);
                             // no implementation
 
             uint64      _NumBlocks();
@@ -149 +149 @@
     Inode*      fInode;
 };
 
+
 #endif  // INODE_H

src/add-ons/kernel/file_systems/btrfs/Utility.h

@@ -38 +38 @@
     return R_OK | W_OK;
 }
 
+
 #endif  // UTILITY_H

src/add-ons/kernel/file_systems/btrfs/Volume.cpp

@@ -348 +348 @@
     search_key.SetOffset(0);
     search_key.SetType(BTRFS_KEY_TYPE_ROOT_ITEM);
     search_key.SetObjectID(BTRFS_OBJECT_ID_EXTENT_TREE);
-    struct btrfs_root *root;
+    struct btrfs_root* root;
     if (fRootTree->FindNext(search_key, (void**)&root) != B_OK) {
         ERROR("Volume::Mount(): Couldn't find extent root\n");
         return B_ERROR;
@@ -478 +478 @@
 
 
 status_t
-Volume::FindBlock(off_t logical, fsblock_t &physicalBlock)
+Volume::FindBlock(off_t logical, fsblock_t& physicalBlock)
 {
     off_t physical;
     status_t status = FindBlock(logical, physical);
@@ -490 +490 @@
 
 
 status_t
-Volume::FindBlock(off_t logical, off_t &physical)
+Volume::FindBlock(off_t logical, off_t& physical)
 {
     if (fChunkTree == NULL
         || (logical >= (off_t)fChunk->Offset()
@@ -503 +503 @@
     search_key.SetOffset(logical);
     search_key.SetType(BTRFS_KEY_TYPE_CHUNK_ITEM);
     search_key.SetObjectID(BTRFS_OBJECT_ID_CHUNK_TREE);
-    struct btrfs_chunk *chunk;
+    struct btrfs_chunk* chunk;
     size_t chunk_length;
     status_t status = fChunkTree->FindPrevious(search_key, (void**)&chunk,
         &chunk_length);

src/add-ons/kernel/file_systems/btrfs/Volume.h

@@ -6 +6 @@
 #ifndef VOLUME_H
 #define VOLUME_H
 
-
 #include <lock.h>
 
 #include "btrfs.h"
@@ -53 +52 @@
 
     static  status_t            Identify(int fd, btrfs_super_block* superBlock);
 
-            status_t            FindBlock(off_t logical, fsblock_t &physical);
-            status_t            FindBlock(off_t logical, off_t &physical);
+            status_t            FindBlock(off_t logical, fsblock_t& physical);
+            status_t            FindBlock(off_t logical, off_t& physical);
 
 private:
             mutex               fLock;
@@ -78 +77 @@
             BPlusTree*          fChecksumTree;
 };
 
-#endif  // VOLUME_H
 
+#endif  // VOLUME_H

src/add-ons/kernel/file_systems/btrfs/btrfs.h

@@ -32 +32 @@
     void SetOffset(uint64 off) { offset = B_HOST_TO_LENDIAN_INT64(off); }
 } _PACKED;
 
+
 struct btrfs_timespec {
     uint64  seconds;
     uint32  nanoseconds;
 } _PACKED;
 
+
 struct btrfs_header {
     uint8   checksum[32];
     uint8   fsid[16];
@@ -49 +51 @@
     uint8   level;
     uint64 BlockNum() const { return B_LENDIAN_TO_HOST_INT64(blocknum); }
     uint64 Flags() const { return B_LENDIAN_TO_HOST_INT64(flags); }
-    uint64 Generation() const {
-        return B_LENDIAN_TO_HOST_INT64(generation); }
-    uint64 Owner() const {
-        return B_LENDIAN_TO_HOST_INT64(owner); }
-    uint32 ItemCount() const {
-        return B_LENDIAN_TO_HOST_INT32(item_count); }
+    uint64 Generation() const
+        { return B_LENDIAN_TO_HOST_INT64(generation); }
+    uint64 Owner() const
+        { return B_LENDIAN_TO_HOST_INT64(owner); }
+    uint32 ItemCount() const
+        { return B_LENDIAN_TO_HOST_INT32(item_count); }
     uint8 Level() const { return level; }
 } _PACKED;
 
+
 struct btrfs_index {
     btrfs_key key;
     uint64  blocknum;
     uint64  generation;
     uint64 BlockNum() const { return B_LENDIAN_TO_HOST_INT64(blocknum); }
-    uint64 Generation() const {
-        return B_LENDIAN_TO_HOST_INT64(generation); }
+    uint64 Generation() const
+        { return B_LENDIAN_TO_HOST_INT64(generation); }
 } _PACKED;
 
+
 struct btrfs_entry {
     btrfs_key key;
     uint32 offset;
     uint32 size;
-    uint32 Offset() const {
-        return B_LENDIAN_TO_HOST_INT32(offset); }
-    uint32 Size() const {
-        return B_LENDIAN_TO_HOST_INT32(size); }
+    uint32 Offset() const
+        { return B_LENDIAN_TO_HOST_INT32(offset); }
+    uint32 Size() const
+        { return B_LENDIAN_TO_HOST_INT32(size); }
 } _PACKED;
 
+
 struct btrfs_stream {
     btrfs_header header;
     union {
@@ -85 +90 @@
     };
 } _PACKED;
 
+
 struct btrfs_stripe {
     uint64  device_id;
     uint64  offset;
@@ -93 +99 @@
     uint64  Offset() const { return B_LENDIAN_TO_HOST_INT64(offset); }
 } _PACKED;
 
+
 struct btrfs_chunk {
     uint64  length;
     uint64  owner;
@@ -119 +126 @@
         { return B_LENDIAN_TO_HOST_INT16(sub_stripes); }
 } _PACKED;
 
+
 struct btrfs_device {
     uint64  id;
     uint64  total_size;
@@ -174 +182 @@
         // implemented in Volume.cpp
     uint64 TotalSize() const { return B_LENDIAN_TO_HOST_INT64(total_size); }
     uint32 BlockSize() const { return B_LENDIAN_TO_HOST_INT32(sector_size); }
-    uint64 RootDirObjectID() const {
-        return B_LENDIAN_TO_HOST_INT64(root_dir_object_id); }
-    uint64 Generation() const {
-        return B_LENDIAN_TO_HOST_INT64(generation); }
-    uint64 Root() const {
-        return B_LENDIAN_TO_HOST_INT64(root); }
-    uint64 ChunkRoot() const {
-        return B_LENDIAN_TO_HOST_INT64(chunk_root); }
-    uint64 LogRoot() const {
-        return B_LENDIAN_TO_HOST_INT64(log_root); }
+    uint64 RootDirObjectID() const
+        { return B_LENDIAN_TO_HOST_INT64(root_dir_object_id); }
+    uint64 Generation() const
+        { return B_LENDIAN_TO_HOST_INT64(generation); }
+    uint64 Root() const
+        { return B_LENDIAN_TO_HOST_INT64(root); }
+    uint64 ChunkRoot() const
+        { return B_LENDIAN_TO_HOST_INT64(chunk_root); }
+    uint64 LogRoot() const
+        { return B_LENDIAN_TO_HOST_INT64(log_root); }
     uint8 ChunkRootLevel() const { return chunk_root_level; }
 } _PACKED;
 
+
 struct btrfs_inode {
     uint64  generation;
     uint64  transaction_id;
@@ -212 +221 @@
     uint32 Mode() const { return B_LENDIAN_TO_HOST_INT32(mode); }
     uint64 Flags() const { return B_LENDIAN_TO_HOST_INT64(flags); }
     uint64 Sequence() const { return B_LENDIAN_TO_HOST_INT64(sequence); }
-    static void _DecodeTime(struct timespec &timespec,
-        const struct btrfs_timespec &time)
+    static void _DecodeTime(struct timespec& timespec,
+        const struct btrfs_timespec& time)
     {
         timespec.tv_sec = B_LENDIAN_TO_HOST_INT64(time.seconds);
         timespec.tv_nsec = B_LENDIAN_TO_HOST_INT32(time.nanoseconds);
     }
-    void GetAccessTime(struct timespec &timespec) const 
+    void GetAccessTime(struct timespec& timespec) const 
         { _DecodeTime(timespec, access_time); }
-    void GetChangeTime(struct timespec &timespec) const 
+    void GetChangeTime(struct timespec& timespec) const 
         { _DecodeTime(timespec, change_time); }
-    void GetModificationTime(struct timespec &timespec) const 
+    void GetModificationTime(struct timespec& timespec) const 
         { _DecodeTime(timespec, modification_time); }
-    void GetCreationTime(struct timespec &timespec) const 
+    void GetCreationTime(struct timespec& timespec) const 
         { _DecodeTime(timespec, creation_time); }
 } _PACKED;
 
+
 struct btrfs_root {
     btrfs_inode inode;
     uint64  generation;
@@ -241 +251 @@
     btrfs_key drop_progress;
     uint8   drop_level;
     uint8   level;
-    uint64 Generation() const {
-        return B_LENDIAN_TO_HOST_INT64(generation); }
+    uint64 Generation() const
+        { return B_LENDIAN_TO_HOST_INT64(generation); }
     uint64 BlockNum() const { return B_LENDIAN_TO_HOST_INT64(blocknum); }
 } _PACKED;
 
+
 struct btrfs_dir_entry {
     btrfs_key location;
     uint64  transaction_id;
@@ -259 +270 @@
         { return sizeof(*this) + NameLength() + DataLength(); }
 } _PACKED;
 
+
 struct btrfs_extent_data {
     uint64  generation;
     uint64  memory_size;
@@ -275 +287 @@
         };
         uint8 inline_data[0];
     };
-    uint64 Generation() const {
-        return B_LENDIAN_TO_HOST_INT64(generation); }
-    uint64 MemoryBytes() const {
-        return B_LENDIAN_TO_HOST_INT64(memory_size); }
+    uint64 Generation() const
+        { return B_LENDIAN_TO_HOST_INT64(generation); }
+    uint64 MemoryBytes() const
+        { return B_LENDIAN_TO_HOST_INT64(memory_size); }
     uint8 Compression() const { return compression; }
     uint8 Type() const { return type; }
-    uint64 DiskOffset() const {
-        return B_LENDIAN_TO_HOST_INT64(disk_offset); }
-    uint64 DiskSize() const {
-        return B_LENDIAN_TO_HOST_INT64(disk_size); }
-    uint64 ExtentOffset() const {
-        return B_LENDIAN_TO_HOST_INT64(extent_offset); }
-    uint64 Size() const {
-        return B_LENDIAN_TO_HOST_INT64(size); }
+    uint64 DiskOffset() const
+        { return B_LENDIAN_TO_HOST_INT64(disk_offset); }
+    uint64 DiskSize() const
+        { return B_LENDIAN_TO_HOST_INT64(disk_size); }
+    uint64 ExtentOffset() const
+        { return B_LENDIAN_TO_HOST_INT64(extent_offset); }
+    uint64 Size() const
+        { return B_LENDIAN_TO_HOST_INT64(size); }
 } _PACKED;
 
 
@@ -326 +338 @@
     int         open_mode;
 };
 
+
 #define BTRFS_OPEN_MODE_USER_MASK       0x7fffffff
 
 extern fs_volume_ops gBtrfsVolumeOps;
 extern fs_vnode_ops gBtrfsVnodeOps;
 
+
 #endif  // BTRFS_H

src/add-ons/kernel/file_systems/btrfs/crc_table.cpp

@@ -7 +7 @@
 
 /*! \file crc_table.cpp
 
-        Standalone program to generate the CRC table used for calculating
-        UDF tag id CRC values.
-       
-        This code based off of crc code in UDF-2.50 specs, as permitted.
-        See UDF-2.50 6.5 for more information. 
+    Standalone program to generate the CRC table used for calculating
+    UDF tag id CRC values.
 
-        Reflected version by Jéme Duval
+    This code based off of crc code in UDF-2.50 specs, as permitted.
+    See UDF-2.50 6.5 for more information. 
+
+    Reflected version by Jéme Duval
 */
 
+
 #include <stdio.h>
 #include <sys/types.h>
 
+
 typedef unsigned int uint32 ;
 
 uint32
@@ -36 +38 @@
 
 
 int
-main(int argc, char *argv[]) {
-        uint32 crc, poly;
+main(int argc, char* argv[]) {
+    uint32 crc, poly;
 
-        if (argc != 2) {
-                fprintf(stderr, "USAGE: crc_table <octal polynomial=3667067501 for btrfs>\n");
-                return 0;
-        }
+    if (argc != 2) {
+        fprintf(stderr, "USAGE: crc_table <octal polynomial=3667067501 for btrfs>\n");
+        return 0;
+    }
+
+    sscanf(argv[1], "%lo", &poly);
 
-        sscanf(argv[1], "%lo", &poly);
-       
-        printf("//! CRC 0%o table, as generated by crc_table.cpp\n", poly);
-        printf("static uint32 crc_table[256] = { \n");
-        for (int n = 0; n < 256; n++) {
-                if (n%8 == 0)
-                        printf("    ");
-                crc = reflect32(n);
-                for (int i = 0; i < 8; i++) {
-                        if (crc & 0x80000000)
-                                crc = (crc << 1) ^ poly;
-                        else
-                                crc <<= 1;
-                }
+    printf("//! CRC 0%o table, as generated by crc_table.cpp\n", poly);
+    printf("static uint32 crc_table[256] = { \n");
+    for (int n = 0; n < 256; n++) {
+        if (n % 8 == 0)
+            printf("    ");
+        crc = reflect32(n);
+        for (int i = 0; i < 8; i++) {
+            if (crc & 0x80000000)
+                crc = (crc << 1) ^ poly;
+            else
+                crc <<= 1;
+        }
         crc = reflect32(crc);
-                printf("0x%08x%s ", crc, (n != 255 ? "," : ""));
-                if (n%8 == 7)
-                        printf("\n");
-        }
-        printf("};\n");
-        return 0;
+        printf("0x%08x%s ", crc, (n != 255 ? "," : ""));
+        if (n % 8 == 7)
+            printf("\n");
+    }
+    printf("};\n");
+    return 0;
 }

src/add-ons/kernel/file_systems/btrfs/kernel_interface.cpp

@@ -68 +68 @@
 
 
 static float
-btrfs_identify_partition(int fd, partition_data *partition, void **_cookie)
+btrfs_identify_partition(int fd, partition_data* partition, void** _cookie)
 {
     btrfs_super_block superBlock;
     status_t status = Volume::Identify(fd, &superBlock);
     if (status != B_OK)
         return -1;
 
-    identify_cookie *cookie = new identify_cookie;
+    identify_cookie* cookie = new identify_cookie;
     memcpy(&cookie->super_block, &superBlock, sizeof(btrfs_super_block));
 
     *_cookie = cookie;
@@ -84 +84 @@
 
 
 static status_t
-btrfs_scan_partition(int fd, partition_data *partition, void *_cookie)
+btrfs_scan_partition(int fd, partition_data* partition, void* _cookie)
 {
-    identify_cookie *cookie = (identify_cookie *)_cookie;
+    identify_cookie* cookie = (identify_cookie*)_cookie;
 
     partition->status = B_PARTITION_VALID;
     partition->flags |= B_PARTITION_FILE_SYSTEM;
@@ -138 +138 @@
 
 
 static status_t
-btrfs_unmount(fs_volume *_volume)
+btrfs_unmount(fs_volume* _volume)
 {
-    Volume* volume = (Volume *)_volume->private_volume;
+    Volume* volume = (Volume*)_volume->private_volume;
 
     status_t status = volume->Unmount();
     delete volume;
@@ -452 +452 @@
 
 
 static status_t
-btrfs_close(fs_volume *_volume, fs_vnode *_node, void *_cookie)
+btrfs_close(fs_volume* _volume, fs_vnode* _node, void* _cookie)
 {
     return B_OK;
 }
@@ -482 +482 @@
 
 
 static status_t
-btrfs_read_link(fs_volume *_volume, fs_vnode *_node, char *buffer,
-    size_t *_bufferSize)
+btrfs_read_link(fs_volume* _volume, fs_vnode* _node, char* buffer,
+    size_t* _bufferSize)
 {
     Inode* inode = (Inode*)_node->private_node;
     return inode->ReadAt(0, (uint8*)buffer, _bufferSize);
@@ -516 +516 @@
 
 
 static status_t
-btrfs_read_dir(fs_volume *_volume, fs_vnode *_node, void *_cookie,
-    struct dirent *dirent, size_t bufferSize, uint32 *_num)
+btrfs_read_dir(fs_volume* _volume, fs_vnode* _node, void* _cookie,
+    struct dirent* dirent, size_t bufferSize, uint32* _num)
 {
     DirectoryIterator* iterator = (DirectoryIterator*)_cookie;
     Volume* volume = (Volume*)_volume->private_volume;
@@ -560 +560 @@
 
 
 static status_t
-btrfs_rewind_dir(fs_volume * /*_volume*/, fs_vnode * /*node*/, void *_cookie)
+btrfs_rewind_dir(fs_volume* /*_volume*/, fs_vnode* /*node*/, void* _cookie)
 {
     DirectoryIterator* iterator = (DirectoryIterator*)_cookie;
 
@@ -576 +576 @@
 
 
 static status_t
-btrfs_free_dir_cookie(fs_volume *_volume, fs_vnode *_node, void *_cookie)
+btrfs_free_dir_cookie(fs_volume* _volume, fs_vnode* _node, void* _cookie)
 {
     delete (DirectoryIterator*)_cookie;
     return B_OK;
@@ -584 +584 @@
 
 
 static status_t
-btrfs_open_attr_dir(fs_volume *_volume, fs_vnode *_node, void **_cookie)
+btrfs_open_attr_dir(fs_volume* _volume, fs_vnode* _node, void** _cookie)
 {
     Inode* inode = (Inode*)_node->private_node;
     TRACE("%s()\n", __FUNCTION__);
@@ -716 +716 @@
 }
 
 
-
 static status_t
 btrfs_read_attr_stat(fs_volume* _volume, fs_vnode* _node,
     void* _cookie, struct stat* stat)
@@ -859 +858 @@
 };
 
 
-module_info *modules[] = {
-    (module_info *)&sBtrfsFileSystem,
+module_info* modules[] = {
+    (module_info*)&sBtrfsFileSystem,
     NULL,
 };