linux kernel struct 之 idr

linux-4.9.37/include/linux/idr.h

映射唯一标识符（UID）到指针的数据结构。‌

/*
 * We want shallower trees and thus more bits covered at each layer.  8
 * bits gives us large enough first layer for most use cases and maximum
 * tree depth of 4.  Each idr_layer is slightly larger than 2k on 64bit and
 * 1k on 32bit.
 */
#define IDR_BITS 8
#define IDR_SIZE (1 << IDR_BITS)
#define IDR_MASK ((1 << IDR_BITS)-1)

struct idr_layer {
    int            prefix;    /* the ID prefix of this idr_layer */
    int            layer;    /* distance from leaf */
    struct idr_layer __rcu    *ary[1<<IDR_BITS];
    int            count;    /* When zero, we can release it */
    union {
        /* A zero bit means "space here" */
        DECLARE_BITMAP(bitmap, IDR_SIZE);
        struct rcu_head        rcu_head;
    };
};

struct idr {
    struct idr_layer __rcu    *hint;    /* the last layer allocated from */
    struct idr_layer __rcu    *top;
    int            layers;    /* only valid w/o concurrent changes */
    int            cur;    /* current pos for cyclic allocation */
    spinlock_t        lock;
    int            id_free_cnt;
    struct idr_layer    *id_free;
};