488570ebd4
Many open source projects have moved to using SPDX identifiers to specify license information, reducing the amount of boilerplate code in every source file. This patch replaces the bulk of SPDK .c, .cpp and Makefiles with the BSD-3-Clause identifier. Almost all of these files share the exact same license text, and this patch only modifies the files that contain the most common license text. There can be slight variations because the third clause contains company names - most say "Intel Corporation", but there are instances for Nvidia, Samsung, Eideticom and even "the copyright holder". Used a bash script to automate replacement of the license text with SPDX identifier which is checked into scripts/spdx.sh. Signed-off-by: Jim Harris <james.r.harris@intel.com> Change-Id: Iaa88ab5e92ea471691dc298cfe41ebfb5d169780 Reviewed-on: https://review.spdk.io/gerrit/c/spdk/spdk/+/12904 Community-CI: Broadcom CI <spdk-ci.pdl@broadcom.com> Community-CI: Mellanox Build Bot Tested-by: SPDK CI Jenkins <sys_sgci@intel.com> Reviewed-by: Aleksey Marchuk <alexeymar@nvidia.com> Reviewed-by: Changpeng Liu <changpeng.liu@intel.com> Reviewed-by: Dong Yi <dongx.yi@intel.com> Reviewed-by: Konrad Sztyber <konrad.sztyber@intel.com> Reviewed-by: Paul Luse <paul.e.luse@intel.com> Reviewed-by: <qun.wan@intel.com>
48 lines
1.6 KiB
C
48 lines
1.6 KiB
C
/* SPDX-License-Identifier: BSD-3-Clause
|
|
* Copyright (c) Intel Corporation.
|
|
* All rights reserved.
|
|
*/
|
|
|
|
#ifndef SPDK_TREE_H_
|
|
#define SPDK_TREE_H_
|
|
|
|
struct cache_buffer {
|
|
uint8_t *buf;
|
|
uint64_t offset;
|
|
uint32_t buf_size;
|
|
uint32_t bytes_filled;
|
|
uint32_t bytes_flushed;
|
|
bool in_progress;
|
|
};
|
|
|
|
#define CACHE_BUFFER_SHIFT (18)
|
|
#define CACHE_BUFFER_SIZE (1U << CACHE_BUFFER_SHIFT)
|
|
#define NEXT_CACHE_BUFFER_OFFSET(offset) \
|
|
(((offset + CACHE_BUFFER_SIZE) >> CACHE_BUFFER_SHIFT) << CACHE_BUFFER_SHIFT)
|
|
|
|
#define CACHE_TREE_SHIFT 6
|
|
#define CACHE_TREE_WIDTH (1U << CACHE_TREE_SHIFT)
|
|
#define CACHE_TREE_LEVEL_SHIFT(level) (CACHE_BUFFER_SHIFT + (level) * CACHE_TREE_SHIFT)
|
|
#define CACHE_TREE_LEVEL_SIZE(level) (1ULL << CACHE_TREE_LEVEL_SHIFT(level))
|
|
#define CACHE_TREE_LEVEL_MASK(level) (CACHE_TREE_LEVEL_SIZE(level) - 1)
|
|
#define CACHE_TREE_INDEX(level, offset) ((offset >> CACHE_TREE_LEVEL_SHIFT(level)) & (CACHE_TREE_WIDTH - 1))
|
|
|
|
struct cache_tree {
|
|
uint8_t level;
|
|
uint64_t present_mask;
|
|
union {
|
|
struct cache_buffer *buffer[CACHE_TREE_WIDTH];
|
|
struct cache_tree *tree[CACHE_TREE_WIDTH];
|
|
} u;
|
|
};
|
|
|
|
void cache_buffer_free(struct cache_buffer *cache_buffer);
|
|
|
|
struct cache_tree *tree_insert_buffer(struct cache_tree *root, struct cache_buffer *buffer);
|
|
void tree_free_buffers(struct cache_tree *tree);
|
|
struct cache_buffer *tree_find_buffer(struct cache_tree *tree, uint64_t offset);
|
|
struct cache_buffer *tree_find_filled_buffer(struct cache_tree *tree, uint64_t offset);
|
|
void tree_remove_buffer(struct cache_tree *tree, struct cache_buffer *buffer);
|
|
|
|
#endif /* SPDK_TREE_H_ */
|