'增加l2稳定性'

admin

2022-11-05 3680049029e6a193eae069596be04ce0fb2b1303

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#ifndef JEMALLOC_INTERNAL_QR_H
#define JEMALLOC_INTERNAL_QR_H
 
/* Ring definitions. */
#define qr(a_type)                            \
struct {                                \
    a_type    *qre_next;                        \
    a_type    *qre_prev;                        \
}
 
/* Ring functions. */
#define qr_new(a_qr, a_field) do {                    \
    (a_qr)->a_field.qre_next = (a_qr);                \
    (a_qr)->a_field.qre_prev = (a_qr);                \
} while (0)
 
#define qr_next(a_qr, a_field) ((a_qr)->a_field.qre_next)
 
#define qr_prev(a_qr, a_field) ((a_qr)->a_field.qre_prev)
 
#define qr_before_insert(a_qrelm, a_qr, a_field) do {            \
    (a_qr)->a_field.qre_prev = (a_qrelm)->a_field.qre_prev;        \
    (a_qr)->a_field.qre_next = (a_qrelm);                \
    (a_qr)->a_field.qre_prev->a_field.qre_next = (a_qr);        \
    (a_qrelm)->a_field.qre_prev = (a_qr);                \
} while (0)
 
#define qr_after_insert(a_qrelm, a_qr, a_field) do {            \
    (a_qr)->a_field.qre_next = (a_qrelm)->a_field.qre_next;        \
    (a_qr)->a_field.qre_prev = (a_qrelm);                \
    (a_qr)->a_field.qre_next->a_field.qre_prev = (a_qr);        \
    (a_qrelm)->a_field.qre_next = (a_qr);                \
} while (0)
 
#define qr_meld(a_qr_a, a_qr_b, a_type, a_field) do {            \
    a_type *t;                            \
    (a_qr_a)->a_field.qre_prev->a_field.qre_next = (a_qr_b);    \
    (a_qr_b)->a_field.qre_prev->a_field.qre_next = (a_qr_a);    \
    t = (a_qr_a)->a_field.qre_prev;                    \
    (a_qr_a)->a_field.qre_prev = (a_qr_b)->a_field.qre_prev;    \
    (a_qr_b)->a_field.qre_prev = t;                    \
} while (0)
 
/*
 * qr_meld() and qr_split() are functionally equivalent, so there's no need to
 * have two copies of the code.
 */
#define qr_split(a_qr_a, a_qr_b, a_type, a_field)            \
    qr_meld((a_qr_a), (a_qr_b), a_type, a_field)
 
#define qr_remove(a_qr, a_field) do {                    \
    (a_qr)->a_field.qre_prev->a_field.qre_next            \
        = (a_qr)->a_field.qre_next;                    \
    (a_qr)->a_field.qre_next->a_field.qre_prev            \
        = (a_qr)->a_field.qre_prev;                    \
    (a_qr)->a_field.qre_next = (a_qr);                \
    (a_qr)->a_field.qre_prev = (a_qr);                \
} while (0)
 
#define qr_foreach(var, a_qr, a_field)                    \
    for ((var) = (a_qr);                        \
        (var) != NULL;                        \
        (var) = (((var)->a_field.qre_next != (a_qr))        \
        ? (var)->a_field.qre_next : NULL))
 
#define qr_reverse_foreach(var, a_qr, a_field)                \
    for ((var) = ((a_qr) != NULL) ? qr_prev(a_qr, a_field) : NULL;    \
        (var) != NULL;                        \
        (var) = (((var) != (a_qr))                    \
        ? (var)->a_field.qre_prev : NULL))
 
#endif /* JEMALLOC_INTERNAL_QR_H */