#define BTRFS_MAX_LEVEL 8
 
+#define BTRFS_OLDEST_GENERATION        0ULL
+
 #define BTRFS_COMPAT_EXTENT_TREE_V0
 
 /*
 
                        range->len = (u64)-1;
                }
                ret = btrfs_defrag_file(file_inode(file), file,
-                                       range, 0, 0);
+                                       range, BTRFS_OLDEST_GENERATION, 0);
                if (ret > 0)
                        ret = 0;
                kfree(range);
 
        int level;
        int next_key_ret = 0;
        u64 last_ret = 0;
-       u64 min_trans = 0;
 
        if (root->fs_info->extent_root == root) {
                /*
 
        path->keep_locks = 1;
 
-       ret = btrfs_search_forward(root, &key, path, min_trans);
+       ret = btrfs_search_forward(root, &key, path, BTRFS_OLDEST_GENERATION);
        if (ret < 0)
                goto out;
        if (ret > 0) {
         */
        path->slots[1] = btrfs_header_nritems(path->nodes[1]);
        next_key_ret = btrfs_find_next_key(root, path, &key, 1,
-                                          min_trans);
+                                          BTRFS_OLDEST_GENERATION);
        if (next_key_ret == 0) {
                memcpy(&root->defrag_progress, &key, sizeof(key));
                ret = -EAGAIN;
 
        key.offset = 0;
 
 again_search_slot:
-       ret = btrfs_search_forward(root, &key, path, 0);
+       ret = btrfs_search_forward(root, &key, path, BTRFS_OLDEST_GENERATION);
        if (ret) {
                if (ret > 0)
                        ret = 0;
 
        key.offset = 0;
 
        while (1) {
-               ret = btrfs_search_forward(root, &key, path, 0);
+               ret = btrfs_search_forward(root, &key, path,
+                               BTRFS_OLDEST_GENERATION);
                if (ret) {
                        if (ret > 0)
                                ret = 0;