bset.c (d56d000a1f424aa77538bd5aad18b43037ed20cc) bset.c (78b77bf8b20431f8ad8a4db7e3120103bd922337)
1/*
2 * Code for working with individual keys, and sorted sets of keys with in a
3 * btree node
4 *
5 * Copyright 2012 Google, Inc.
6 */
7
8#include "bcache.h"

--- 1046 unchanged lines hidden (view full) ---

1055 order = ilog2(bucket_pages(b->c));
1056 }
1057
1058 start_time = local_clock();
1059
1060 btree_mergesort(b, out, iter, fixup, remove_stale);
1061 b->nsets = start;
1062
1/*
2 * Code for working with individual keys, and sorted sets of keys with in a
3 * btree node
4 *
5 * Copyright 2012 Google, Inc.
6 */
7
8#include "bcache.h"

--- 1046 unchanged lines hidden (view full) ---

1055 order = ilog2(bucket_pages(b->c));
1056 }
1057
1058 start_time = local_clock();
1059
1060 btree_mergesort(b, out, iter, fixup, remove_stale);
1061 b->nsets = start;
1062
1063 if (!fixup && !start && b->written)
1064 bch_btree_verify(b, out);
1065
1066 if (!start && order == b->page_order) {
1067 /*
1068 * Our temporary buffer is the same size as the btree node's
1069 * buffer, we can just swap buffers instead of doing a big
1070 * memcpy()
1071 */
1072
1073 out->magic = bset_magic(&b->c->sb);

--- 175 unchanged lines hidden --- 		1063 if (!start && order == b->page_order) {
1064 /*
1065 * Our temporary buffer is the same size as the btree node's
1066 * buffer, we can just swap buffers instead of doing a big
1067 * memcpy()
1068 */
1069
1070 out->magic = bset_magic(&b->c->sb);

--- 175 unchanged lines hidden ---