23d5dd1687
I opted to embed the Bitmap structure directly in the ExitStatusSet.
This means that memory usage is a bit higher for units which don't define
this setting:
Service changes:
/* size: 2720, cachelines: 43, members: 73 */
/* sum members: 2680, holes: 9, sum holes: 39 */
/* sum bitfield members: 7 bits, bit holes: 1, sum bit holes: 1 bits */
/* last cacheline: 32 bytes */
/* size: 2816, cachelines: 44, members: 73 */
/* sum members: 2776, holes: 9, sum holes: 39 */
/* sum bitfield members: 7 bits, bit holes: 1, sum bit holes: 1 bits */
But this way the code is simpler and we do less pointer chasing.
36 lines
899 B
C
36 lines
899 B
C
/* SPDX-License-Identifier: LGPL-2.1+ */
|
|
#pragma once
|
|
|
|
#include <stdbool.h>
|
|
|
|
#include "hashmap.h"
|
|
#include "macro.h"
|
|
|
|
typedef struct Bitmap {
|
|
uint64_t *bitmaps;
|
|
size_t n_bitmaps;
|
|
size_t bitmaps_allocated;
|
|
} Bitmap;
|
|
|
|
Bitmap *bitmap_new(void);
|
|
Bitmap *bitmap_copy(Bitmap *b);
|
|
int bitmap_ensure_allocated(Bitmap **b);
|
|
void bitmap_free(Bitmap *b);
|
|
|
|
int bitmap_set(Bitmap *b, unsigned n);
|
|
void bitmap_unset(Bitmap *b, unsigned n);
|
|
bool bitmap_isset(const Bitmap *b, unsigned n);
|
|
bool bitmap_isclear(const Bitmap *b);
|
|
void bitmap_clear(Bitmap *b);
|
|
|
|
bool bitmap_iterate(const Bitmap *b, Iterator *i, unsigned *n);
|
|
|
|
bool bitmap_equal(const Bitmap *a, const Bitmap *b);
|
|
|
|
#define BITMAP_FOREACH(n, b, i) \
|
|
for ((i).idx = 0; bitmap_iterate((b), &(i), (unsigned*)&(n)); )
|
|
|
|
DEFINE_TRIVIAL_CLEANUP_FUNC(Bitmap*, bitmap_free);
|
|
|
|
#define _cleanup_bitmap_free_ _cleanup_(bitmap_freep)
|