btree.c (1ac731c529cd4d6adbce134754b51ff7d822b145) btree.c (1a251f52cfdc417c84411a056bc142cbd77baef4)
1// SPDX-License-Identifier: GPL-2.0-only
2/*
3 * lib/btree.c - Simple In-memory B+Tree
4 *
5 * Copyright (c) 2007-2008 Joern Engel <joern@purestorage.com>
6 * Bits and pieces stolen from Peter Zijlstra's code, which is
7 * Copyright 2007, Red Hat Inc. Peter Zijlstra
8 *

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

38 */
39
40#include <linux/btree.h>
41#include <linux/cache.h>
42#include <linux/kernel.h>
43#include <linux/slab.h>
44#include <linux/module.h>
45
1// SPDX-License-Identifier: GPL-2.0-only
2/*
3 * lib/btree.c - Simple In-memory B+Tree
4 *
5 * Copyright (c) 2007-2008 Joern Engel <joern@purestorage.com>
6 * Bits and pieces stolen from Peter Zijlstra's code, which is
7 * Copyright 2007, Red Hat Inc. Peter Zijlstra
8 *

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

38 */
39
40#include <linux/btree.h>
41#include <linux/cache.h>
42#include <linux/kernel.h>
43#include <linux/slab.h>
44#include <linux/module.h>
45
46#define MAX(a, b) ((a) > (b) ? (a) : (b))
47#define NODESIZE MAX(L1_CACHE_BYTES, 128)
48
49struct btree_geo {
50 int keylen;
51 int no_pairs;
52 int no_longs;
53};
54

--- 742 unchanged lines hidden --- 		46#define NODESIZE MAX(L1_CACHE_BYTES, 128)
47
48struct btree_geo {
49 int keylen;
50 int no_pairs;
51 int no_longs;
52};
53

--- 742 unchanged lines hidden ---