shaba/lvm2
1
0
Fork 0
mirror of git://sourceware.org/git/lvm2.git synced 2024-12-22 17:35:59 +03:00
Code Releases Activity
ca54afd701
lvm2/base/memory/container_of.h

26 lines
855 B
C
Raw Normal View History

container_of: use offsetof from stddef Use standardized offsetof() macro from stddef. Helps to build valid code with latest gcc10 with -O2.
2020-03-05 14:58:34 +03:00
// Copyright (C) 2018 - 2020 Red Hat, Inc. All rights reserved.
radix-tree: First drop of radix tree. An implementation of an adaptive radix tree. Has the following nice properties: - At least as fast as the hash table - Uses less memory - You don't need to give an expected size when you create - It scales nicely (ie. no large reallocations like the hash table). - You can iterate the keys in lexicographical order. Only insert and lookup are implemented so far. Plus there's a lot more performance to come.
2018-05-11 08:10:01 +03:00
//
// This file is part of LVM2.
//
// This copyrighted material is made available to anyone wishing to use,
// modify, copy, or redistribute it subject to the terms and conditions
// of the GNU Lesser General Public License v.2.1.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this program; if not, write to the Free Software Foundation,
// Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
#ifndef BASE_MEMORY_CONTAINER_OF_H
#define BASE_MEMORY_CONTAINER_OF_H
container_of: use offsetof from stddef Use standardized offsetof() macro from stddef. Helps to build valid code with latest gcc10 with -O2.
2020-03-05 14:58:34 +03:00
#include <stddef.h> // offsetof
radix-tree: First drop of radix tree. An implementation of an adaptive radix tree. Has the following nice properties: - At least as fast as the hash table - Uses less memory - You don't need to give an expected size when you create - It scales nicely (ie. no large reallocations like the hash table). - You can iterate the keys in lexicographical order. Only insert and lookup are implemented so far. Plus there's a lot more performance to come.
2018-05-11 08:10:01 +03:00
//----------------------------------------------------------------
#define container_of(v, t, head) \
container_of: use offsetof from stddef Use standardized offsetof() macro from stddef. Helps to build valid code with latest gcc10 with -O2.
2020-03-05 14:58:34 +03:00
((t *)((const char *)(v) - offsetof(t, head)))
radix-tree: First drop of radix tree. An implementation of an adaptive radix tree. Has the following nice properties: - At least as fast as the hash table - Uses less memory - You don't need to give an expected size when you create - It scales nicely (ie. no large reallocations like the hash table). - You can iterate the keys in lexicographical order. Only insert and lookup are implemented so far. Plus there's a lot more performance to come.
2018-05-11 08:10:01 +03:00
//----------------------------------------------------------------
#endif
Copy Permalink