OpenCoverage

krl.c

Absolute File Name:/home/opencoverage/opencoverage/guest-scripts/openssh/src/krl.c
Switch to Source codePreprocessed file
LineSourceCount
1-
2-
3-
4-
5-
6struct revoked_serial {-
7 u_int64_t lo, hi;-
8 struct { struct revoked_serial *rbe_left; struct revoked_serial *rbe_right; struct revoked_serial *rbe_parent; int rbe_color; } tree_entry;-
9};-
10static int serial_cmp(struct revoked_serial *a, struct revoked_serial *b);-
11struct revoked_serial_tree { struct revoked_serial *rbh_root; };-
12__attribute__((__unused__)) static void revoked_serial_tree_RB_INSERT_COLOR(struct revoked_serial_tree *head, struct revoked_serial *elm) { struct revoked_serial *parent, *gparent, *tmp; while ((
(parent = (elm...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
parent = (elm)->tree_entry.rbe_parent)
(parent = (elm...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
 && (
(parent)->tree...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_color == 1
(parent)->tree...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
) { gparent = (parent)->tree_entry.rbe_parent; if (parent == (gparent)->tree_entry.rbe_left
parent == (gpa...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) { tmp = (gparent)->tree_entry.rbe_right; if (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
 && (
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_color == 1
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
) { (tmp)->tree_entry.rbe_color = 0; do { (parent)->tree_entry.rbe_color = 0; (gparent)->tree_entry.rbe_color = 1; } while (0); elm = gparent; continue;
never executed: continue;
 } if ((
(parent)->tree...e_right == elmDescription
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_right == elm
(parent)->tree...e_right == elmDescription
TRUEnever evaluated
FALSEnever evaluated
) { do { (tmp) = (parent)->tree_entry.rbe_right; if (((
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_right = (tmp)->tree_entry.rbe_left)
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_left = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = parent; parent = elm; elm = tmp; }
never executed: end of block
 do { (parent)->tree_entry.rbe_color = 0; (gparent)->tree_entry.rbe_color = 1; } while (0); do { (tmp) = (gparent)->tree_entry.rbe_left; if (((
((gparent)->tr...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
gparent)->tree_entry.rbe_left = (tmp)->tree_entry.rbe_right)
((gparent)->tr...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_parent = (gparent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (gparent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(gparent) == (...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
gparent) == ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(gparent) == (...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_right = (gparent); (gparent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); }
never executed: end of block
 else { tmp = (gparent)->tree_entry.rbe_left; if (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
 && (
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_color == 1
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
) { (tmp)->tree_entry.rbe_color = 0; do { (parent)->tree_entry.rbe_color = 0; (gparent)->tree_entry.rbe_color = 1; } while (0); elm = gparent; continue;
never executed: continue;
 } if ((
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left == elm
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
) { do { (tmp) = (parent)->tree_entry.rbe_left; if (((
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left = (tmp)->tree_entry.rbe_right)
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_right = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = parent; parent = elm; elm = tmp; }
never executed: end of block
 do { (parent)->tree_entry.rbe_color = 0; (gparent)->tree_entry.rbe_color = 1; } while (0); do { (tmp) = (gparent)->tree_entry.rbe_right; if (((
((gparent)->tr...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
gparent)->tree_entry.rbe_right = (tmp)->tree_entry.rbe_left)
((gparent)->tr...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_parent = (gparent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (gparent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(gparent) == (...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
gparent) == ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(gparent) == (...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_left = (gparent); (gparent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); }
never executed: end of block
 } (head->rbh_root)->tree_entry.rbe_color = 0; }
never executed: end of block
 __attribute__((__unused__)) static void revoked_serial_tree_RB_REMOVE_COLOR(struct revoked_serial_tree *head, struct revoked_serial *parent, struct revoked_serial *elm) { struct revoked_serial *tmp; while ((elm ==
elm == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
13((
elm == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
elm == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
elm == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
14|| (
(elm)->tree_en...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_color == 0
(elm)->tree_en...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) && elm != (head)->rbh_root
elm != (head)->rbh_rootDescription
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left == elm
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
) { tmp = (parent)->tree_entry.rbe_right; if ((
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_color == 1
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
) { do { (tmp)->tree_entry.rbe_color = 0; (parent)->tree_entry.rbe_color = 1; } while (0); do { (tmp) = (parent)->tree_entry.rbe_right; if (((
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_right = (tmp)->tree_entry.rbe_left)
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_left = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = (parent)->tree_entry.rbe_right; }
never executed: end of block
 if (((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
15((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
16|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) && ((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
17((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
18|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
)) { (tmp)->tree_entry.rbe_color = 1; elm = parent; parent = (elm)->tree_entry.rbe_parent; }
never executed: end of block
 else { if ((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
19((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
20|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) { struct revoked_serial *oleft; if ((
(oleft = (tmp)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
oleft = (tmp)->tree_entry.rbe_left)
(oleft = (tmp)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (oleft)->tree_entry.rbe_color = 0;
oleft)->tree_entry.rbe_color = 0;
never executed: (oleft)->tree_entry.rbe_color = 0;
 (tmp)->tree_entry.rbe_color = 1; do { (oleft) = (tmp)->tree_entry.rbe_left; if (((
((tmp)->tree_e...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left = (oleft)->tree_entry.rbe_right)
((tmp)->tree_e...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((oleft)->tree_entry.rbe_right)->tree_entry.rbe_parent = (tmp); }
never executed: end of block
 do {} while (0); if (((
((oleft)->tree...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
oleft)->tree_entry.rbe_parent = (tmp)->tree_entry.rbe_parent)
((oleft)->tree...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(tmp) == ((tmp...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
tmp) == ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left
(tmp) == ((tmp...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oleft);
tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oleft);
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oleft);
 else ((
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oleft);
tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oleft);
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oleft);
 } else (
never executed: (head)->rbh_root = (oleft);
head)->rbh_root = (oleft);
never executed: (head)->rbh_root = (oleft);
 (oleft)->tree_entry.rbe_right = (tmp); (tmp)->tree_entry.rbe_parent = (oleft); do {} while (0); if (((
((oleft)->tree...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
oleft)->tree_entry.rbe_parent)
((oleft)->tree...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = (parent)->tree_entry.rbe_right; }
never executed: end of block
 (tmp)->tree_entry.rbe_color = (parent)->tree_entry.rbe_color; (parent)->tree_entry.rbe_color = 0; if ((
(tmp)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right
(tmp)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_color = 0;
tmp)->tree_entry.rbe_right)->tree_entry.rbe_color = 0;
never executed: ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_color = 0;
 do { (tmp) = (parent)->tree_entry.rbe_right; if (((
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_right = (tmp)->tree_entry.rbe_left)
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_left = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); elm = (head)->rbh_root; break;
never executed: break;
 } } else { tmp = (parent)->tree_entry.rbe_left; if ((
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_color == 1
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
) { do { (tmp)->tree_entry.rbe_color = 0; (parent)->tree_entry.rbe_color = 1; } while (0); do { (tmp) = (parent)->tree_entry.rbe_left; if (((
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left = (tmp)->tree_entry.rbe_right)
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_right = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = (parent)->tree_entry.rbe_left; }
never executed: end of block
 if (((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
21((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
22|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) && ((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
23((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
24|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
)) { (tmp)->tree_entry.rbe_color = 1; elm = parent; parent = (elm)->tree_entry.rbe_parent; }
never executed: end of block
 else { if ((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
25((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
26|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) { struct revoked_serial *oright; if ((
(oright = (tmp...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
oright = (tmp)->tree_entry.rbe_right)
(oright = (tmp...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (oright)->tree_entry.rbe_color = 0;
oright)->tree_entry.rbe_color = 0;
never executed: (oright)->tree_entry.rbe_color = 0;
 (tmp)->tree_entry.rbe_color = 1; do { (oright) = (tmp)->tree_entry.rbe_right; if (((
((tmp)->tree_e...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right = (oright)->tree_entry.rbe_left)
((tmp)->tree_e...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((oright)->tree_entry.rbe_left)->tree_entry.rbe_parent = (tmp); }
never executed: end of block
 do {} while (0); if (((
((oright)->tre...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
oright)->tree_entry.rbe_parent = (tmp)->tree_entry.rbe_parent)
((oright)->tre...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(tmp) == ((tmp...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
tmp) == ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left
(tmp) == ((tmp...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oright);
tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oright);
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oright);
 else ((
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oright);
tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oright);
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oright);
 } else (
never executed: (head)->rbh_root = (oright);
head)->rbh_root = (oright);
never executed: (head)->rbh_root = (oright);
 (oright)->tree_entry.rbe_left = (tmp); (tmp)->tree_entry.rbe_parent = (oright); do {} while (0); if (((
((oright)->tre...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
oright)->tree_entry.rbe_parent)
((oright)->tre...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = (parent)->tree_entry.rbe_left; }
never executed: end of block
 (tmp)->tree_entry.rbe_color = (parent)->tree_entry.rbe_color; (parent)->tree_entry.rbe_color = 0; if ((
(tmp)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left
(tmp)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_color = 0;
tmp)->tree_entry.rbe_left)->tree_entry.rbe_color = 0;
never executed: ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_color = 0;
 do { (tmp) = (parent)->tree_entry.rbe_left; if (((
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left = (tmp)->tree_entry.rbe_right)
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_right = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); elm = (head)->rbh_root; break;
never executed: break;
 } } } if (elm
elmDescription
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (elm)->tree_entry.rbe_color = 0;
elm)->tree_entry.rbe_color = 0;
never executed: (elm)->tree_entry.rbe_color = 0;
 }
never executed: end of block
 __attribute__((__unused__)) static struct revoked_serial * revoked_serial_tree_RB_REMOVE(struct revoked_serial_tree *head, struct revoked_serial *elm) { struct revoked_serial *child, *parent, *old = elm; int color; if ((
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_left ==
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
27((
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
28) child = (elm)->tree_entry.rbe_right;
never executed: child = (elm)->tree_entry.rbe_right;
 else if ((
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_right ==
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
29((
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
30) child = (elm)->tree_entry.rbe_left;
never executed: child = (elm)->tree_entry.rbe_left;
 else { struct revoked_serial *left; elm = (elm)->tree_entry.rbe_right; while ((
(left = (elm)-...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
left = (elm)->tree_entry.rbe_left)
(left = (elm)-...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) elm = left;
never executed: elm = left;
 child = (elm)->tree_entry.rbe_right; parent = (elm)->tree_entry.rbe_parent; color = (elm)->tree_entry.rbe_color; if (child
childDescription
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (child)->tree_entry.rbe_parent = parent;
child)->tree_entry.rbe_parent = parent;
never executed: (child)->tree_entry.rbe_parent = parent;
 if (parent
parentDescription
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left == elm
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (parent)->tree_entry.rbe_left = child;
parent)->tree_entry.rbe_left = child;
never executed: (parent)->tree_entry.rbe_left = child;
 else (
never executed: (parent)->tree_entry.rbe_right = child;
parent)->tree_entry.rbe_right = child;
never executed: (parent)->tree_entry.rbe_right = child;
 do {} while (0); }
never executed: end of block
 else (
never executed: (head)->rbh_root = child;
head)->rbh_root = child;
never executed: (head)->rbh_root = child;
 if ((
(elm)->tree_en..._parent == oldDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_parent == old
(elm)->tree_en..._parent == oldDescription
TRUEnever evaluated
FALSEnever evaluated
) parent = elm;
never executed: parent = elm;
 (elm)->tree_entry = (old)->tree_entry; if ((
(old)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
old)->tree_entry.rbe_parent
(old)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
) { if (((
((old)->tree_e...be_left == oldDescription
TRUEnever evaluated
FALSEnever evaluated
old)->tree_entry.rbe_parent)->tree_entry.rbe_left == old
((old)->tree_e...be_left == oldDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((old)->tree_entry.rbe_parent)->tree_entry.rbe_left = elm;
old)->tree_entry.rbe_parent)->tree_entry.rbe_left = elm;
never executed: ((old)->tree_entry.rbe_parent)->tree_entry.rbe_left = elm;
 else ((
never executed: ((old)->tree_entry.rbe_parent)->tree_entry.rbe_right = elm;
old)->tree_entry.rbe_parent)->tree_entry.rbe_right = elm;
never executed: ((old)->tree_entry.rbe_parent)->tree_entry.rbe_right = elm;
 do {} while (0); }
never executed: end of block
 else (
never executed: (head)->rbh_root = elm;
head)->rbh_root = elm;
never executed: (head)->rbh_root = elm;
 ((old)->tree_entry.rbe_left)->tree_entry.rbe_parent = elm; if ((
(old)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
old)->tree_entry.rbe_right
(old)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((old)->tree_entry.rbe_right)->tree_entry.rbe_parent = elm;
old)->tree_entry.rbe_right)->tree_entry.rbe_parent = elm;
never executed: ((old)->tree_entry.rbe_right)->tree_entry.rbe_parent = elm;
 if (parent
parentDescription
TRUEnever evaluated
FALSEnever evaluated
) { left = parent; do { do {} while (0); }
never executed: end of block
 while ((
(left = (left)...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
left = (left)->tree_entry.rbe_parent)
(left = (left)...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
); }
never executed: end of block
 goto
never executed: goto color;
 color;
never executed: goto color;
 } parent = (elm)->tree_entry.rbe_parent; color = (elm)->tree_entry.rbe_color; if (child
childDescription
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (child)->tree_entry.rbe_parent = parent;
child)->tree_entry.rbe_parent = parent;
never executed: (child)->tree_entry.rbe_parent = parent;
 if (parent
parentDescription
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left == elm
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (parent)->tree_entry.rbe_left = child;
parent)->tree_entry.rbe_left = child;
never executed: (parent)->tree_entry.rbe_left = child;
 else (
never executed: (parent)->tree_entry.rbe_right = child;
parent)->tree_entry.rbe_right = child;
never executed: (parent)->tree_entry.rbe_right = child;
 do {} while (0); }
never executed: end of block
 else (
never executed: (head)->rbh_root = child;
head)->rbh_root = child;
never executed: (head)->rbh_root = child;
 color:
code before this statement never executed: color:
 if (color == 0
color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) revoked_serial_tree_RB_REMOVE_COLOR(head, parent, child);
never executed: revoked_serial_tree_RB_REMOVE_COLOR(head, parent, child);
 return
never executed: return (old);
 (old);
never executed: return (old);
 } __attribute__((__unused__)) static struct revoked_serial * revoked_serial_tree_RB_INSERT(struct revoked_serial_tree *head, struct revoked_serial *elm) { struct revoked_serial *tmp; struct revoked_serial *parent = 		0
31((void *)0)-
32; int comp = 0; tmp = (head)->rbh_root; while (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
) { parent = tmp; comp = (serial_cmp)(elm, parent); if (comp < 0
comp < 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_left;
never executed: tmp = (tmp)->tree_entry.rbe_left;
 else if (comp > 0
comp > 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_right;
never executed: tmp = (tmp)->tree_entry.rbe_right;
 else return
never executed: return (tmp);
 (tmp);
never executed: return (tmp);
 } do { (elm)->tree_entry.rbe_parent = parent; (elm)->tree_entry.rbe_left = (elm)->tree_entry.rbe_right = 		0
33((void *)0)-
34; (elm)->tree_entry.rbe_color = 1; } while (0); if (parent !=
parent != ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
35((
parent != ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
parent != ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
parent != ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
36) { if (comp < 0
comp < 0Description
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (parent)->tree_entry.rbe_left = elm;
parent)->tree_entry.rbe_left = elm;
never executed: (parent)->tree_entry.rbe_left = elm;
 else (
never executed: (parent)->tree_entry.rbe_right = elm;
parent)->tree_entry.rbe_right = elm;
never executed: (parent)->tree_entry.rbe_right = elm;
 do {} while (0); }
never executed: end of block
 else (
never executed: (head)->rbh_root = elm;
head)->rbh_root = elm;
never executed: (head)->rbh_root = elm;
 revoked_serial_tree_RB_INSERT_COLOR(head, elm); return
never executed: return ( ((void *)0) );
 (
never executed: return ( ((void *)0) );
0
37((
never executed: return ( ((void *)0) );
never executed: return ( ((void *)0) );
void *)0)
never executed: return ( ((void *)0) );
0
38)
never executed: return ( ((void *)0) );
never executed: return ( ((void *)0) );
;
never executed: return ( ((void *)0) );
 } __attribute__((__unused__)) static struct revoked_serial * revoked_serial_tree_RB_FIND(struct revoked_serial_tree *head, struct revoked_serial *elm) { struct revoked_serial *tmp = (head)->rbh_root; int comp; while (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
) { comp = serial_cmp(elm, tmp); if (comp < 0
comp < 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_left;
never executed: tmp = (tmp)->tree_entry.rbe_left;
 else if (comp > 0
comp > 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_right;
never executed: tmp = (tmp)->tree_entry.rbe_right;
 else return
never executed: return (tmp);
 (tmp);
never executed: return (tmp);
 } return
never executed: return ( ((void *)0) );
 (
never executed: return ( ((void *)0) );
0
39((
never executed: return ( ((void *)0) );
never executed: return ( ((void *)0) );
void *)0)
never executed: return ( ((void *)0) );
0
40)
never executed: return ( ((void *)0) );
never executed: return ( ((void *)0) );
;
never executed: return ( ((void *)0) );
 } __attribute__((__unused__)) static struct revoked_serial * revoked_serial_tree_RB_NFIND(struct revoked_serial_tree *head, struct revoked_serial *elm) { struct revoked_serial *tmp = (head)->rbh_root; struct revoked_serial *res = 		0
41((void *)0)-
42; int comp; while (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
) { comp = serial_cmp(elm, tmp); if (comp < 0
comp < 0Description
TRUEnever evaluated
FALSEnever evaluated
) { res = tmp; tmp = (tmp)->tree_entry.rbe_left; }
never executed: end of block
 else if (comp > 0
comp > 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_right;
never executed: tmp = (tmp)->tree_entry.rbe_right;
 else return
never executed: return (tmp);
 (tmp);
never executed: return (tmp);
 } return
never executed: return (res);
 (res);
never executed: return (res);
 } __attribute__((__unused__)) static struct revoked_serial * revoked_serial_tree_RB_NEXT(struct revoked_serial *elm) { if ((
(elm)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_right
(elm)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
) { elm = (elm)->tree_entry.rbe_right; while ((
(elm)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_left
(elm)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) elm = (elm)->tree_entry.rbe_left;
never executed: elm = (elm)->tree_entry.rbe_left;
 }
never executed: end of block
 else { if ((
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_parent
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
 && (
(elm == ((elm)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
elm == ((elm)->tree_entry.rbe_parent)->tree_entry.rbe_left)
(elm == ((elm)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) elm = (elm)->tree_entry.rbe_parent;
never executed: elm = (elm)->tree_entry.rbe_parent;
 else { while ((
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_parent
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
 && (
(elm == ((elm)...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
elm == ((elm)->tree_entry.rbe_parent)->tree_entry.rbe_right)
(elm == ((elm)...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) elm = (elm)->tree_entry.rbe_parent;
never executed: elm = (elm)->tree_entry.rbe_parent;
 elm = (elm)->tree_entry.rbe_parent; }
never executed: end of block
 } return
never executed: return (elm);
 (elm);
never executed: return (elm);
 } __attribute__((__unused__)) static struct revoked_serial * revoked_serial_tree_RB_PREV(struct revoked_serial *elm) { if ((
(elm)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_left
(elm)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) { elm = (elm)->tree_entry.rbe_left; while ((
(elm)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_right
(elm)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
) elm = (elm)->tree_entry.rbe_right;
never executed: elm = (elm)->tree_entry.rbe_right;
 }
never executed: end of block
 else { if ((
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_parent
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
 && (
(elm == ((elm)...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
elm == ((elm)->tree_entry.rbe_parent)->tree_entry.rbe_right)
(elm == ((elm)...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) elm = (elm)->tree_entry.rbe_parent;
never executed: elm = (elm)->tree_entry.rbe_parent;
 else { while ((
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_parent
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
 && (
(elm == ((elm)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
elm == ((elm)->tree_entry.rbe_parent)->tree_entry.rbe_left)
(elm == ((elm)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) elm = (elm)->tree_entry.rbe_parent;
never executed: elm = (elm)->tree_entry.rbe_parent;
 elm = (elm)->tree_entry.rbe_parent; }
never executed: end of block
 } return
never executed: return (elm);
 (elm);
never executed: return (elm);
 } __attribute__((__unused__)) static struct revoked_serial * revoked_serial_tree_RB_MINMAX(struct revoked_serial_tree *head, int val) { struct revoked_serial *tmp = (head)->rbh_root; struct revoked_serial *parent = 		0
43((void *)0)-
44; while (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
) { parent = tmp; if (val < 0
val < 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_left;
never executed: tmp = (tmp)->tree_entry.rbe_left;
 else tmp = (tmp)->tree_entry.rbe_right;
never executed: tmp = (tmp)->tree_entry.rbe_right;
 } return
never executed: return (parent);
 (parent);
never executed: return (parent);
 };		0
45-
46-
47struct revoked_key_id {-
48 char *key_id;-
49 struct { struct revoked_key_id *rbe_left; struct revoked_key_id *rbe_right; struct revoked_key_id *rbe_parent; int rbe_color; } tree_entry;-
50};-
51static int key_id_cmp(struct revoked_key_id *a, struct revoked_key_id *b);-
52struct revoked_key_id_tree { struct revoked_key_id *rbh_root; };-
53__attribute__((__unused__)) static void revoked_key_id_tree_RB_INSERT_COLOR(struct revoked_key_id_tree *head, struct revoked_key_id *elm) { struct revoked_key_id *parent, *gparent, *tmp; while ((
(parent = (elm...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
parent = (elm)->tree_entry.rbe_parent)
(parent = (elm...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
 && (
(parent)->tree...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_color == 1
(parent)->tree...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
) { gparent = (parent)->tree_entry.rbe_parent; if (parent == (gparent)->tree_entry.rbe_left
parent == (gpa...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) { tmp = (gparent)->tree_entry.rbe_right; if (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
 && (
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_color == 1
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
) { (tmp)->tree_entry.rbe_color = 0; do { (parent)->tree_entry.rbe_color = 0; (gparent)->tree_entry.rbe_color = 1; } while (0); elm = gparent; continue;
never executed: continue;
 } if ((
(parent)->tree...e_right == elmDescription
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_right == elm
(parent)->tree...e_right == elmDescription
TRUEnever evaluated
FALSEnever evaluated
) { do { (tmp) = (parent)->tree_entry.rbe_right; if (((
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_right = (tmp)->tree_entry.rbe_left)
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_left = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = parent; parent = elm; elm = tmp; }
never executed: end of block
 do { (parent)->tree_entry.rbe_color = 0; (gparent)->tree_entry.rbe_color = 1; } while (0); do { (tmp) = (gparent)->tree_entry.rbe_left; if (((
((gparent)->tr...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
gparent)->tree_entry.rbe_left = (tmp)->tree_entry.rbe_right)
((gparent)->tr...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_parent = (gparent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (gparent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(gparent) == (...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
gparent) == ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(gparent) == (...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_right = (gparent); (gparent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); }
never executed: end of block
 else { tmp = (gparent)->tree_entry.rbe_left; if (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
 && (
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_color == 1
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
) { (tmp)->tree_entry.rbe_color = 0; do { (parent)->tree_entry.rbe_color = 0; (gparent)->tree_entry.rbe_color = 1; } while (0); elm = gparent; continue;
never executed: continue;
 } if ((
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left == elm
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
) { do { (tmp) = (parent)->tree_entry.rbe_left; if (((
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left = (tmp)->tree_entry.rbe_right)
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_right = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = parent; parent = elm; elm = tmp; }
never executed: end of block
 do { (parent)->tree_entry.rbe_color = 0; (gparent)->tree_entry.rbe_color = 1; } while (0); do { (tmp) = (gparent)->tree_entry.rbe_right; if (((
((gparent)->tr...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
gparent)->tree_entry.rbe_right = (tmp)->tree_entry.rbe_left)
((gparent)->tr...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_parent = (gparent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (gparent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(gparent) == (...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
gparent) == ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(gparent) == (...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_left = (gparent); (gparent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); }
never executed: end of block
 } (head->rbh_root)->tree_entry.rbe_color = 0; }
never executed: end of block
 __attribute__((__unused__)) static void revoked_key_id_tree_RB_REMOVE_COLOR(struct revoked_key_id_tree *head, struct revoked_key_id *parent, struct revoked_key_id *elm) { struct revoked_key_id *tmp; while ((elm ==
elm == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
54((
elm == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
elm == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
elm == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
55|| (
(elm)->tree_en...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_color == 0
(elm)->tree_en...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) && elm != (head)->rbh_root
elm != (head)->rbh_rootDescription
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left == elm
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
) { tmp = (parent)->tree_entry.rbe_right; if ((
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_color == 1
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
) { do { (tmp)->tree_entry.rbe_color = 0; (parent)->tree_entry.rbe_color = 1; } while (0); do { (tmp) = (parent)->tree_entry.rbe_right; if (((
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_right = (tmp)->tree_entry.rbe_left)
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_left = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = (parent)->tree_entry.rbe_right; }
never executed: end of block
 if (((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
56((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
57|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) && ((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
58((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
59|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
)) { (tmp)->tree_entry.rbe_color = 1; elm = parent; parent = (elm)->tree_entry.rbe_parent; }
never executed: end of block
 else { if ((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
60((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
61|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) { struct revoked_key_id *oleft; if ((
(oleft = (tmp)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
oleft = (tmp)->tree_entry.rbe_left)
(oleft = (tmp)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (oleft)->tree_entry.rbe_color = 0;
oleft)->tree_entry.rbe_color = 0;
never executed: (oleft)->tree_entry.rbe_color = 0;
 (tmp)->tree_entry.rbe_color = 1; do { (oleft) = (tmp)->tree_entry.rbe_left; if (((
((tmp)->tree_e...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left = (oleft)->tree_entry.rbe_right)
((tmp)->tree_e...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((oleft)->tree_entry.rbe_right)->tree_entry.rbe_parent = (tmp); }
never executed: end of block
 do {} while (0); if (((
((oleft)->tree...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
oleft)->tree_entry.rbe_parent = (tmp)->tree_entry.rbe_parent)
((oleft)->tree...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(tmp) == ((tmp...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
tmp) == ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left
(tmp) == ((tmp...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oleft);
tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oleft);
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oleft);
 else ((
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oleft);
tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oleft);
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oleft);
 } else (
never executed: (head)->rbh_root = (oleft);
head)->rbh_root = (oleft);
never executed: (head)->rbh_root = (oleft);
 (oleft)->tree_entry.rbe_right = (tmp); (tmp)->tree_entry.rbe_parent = (oleft); do {} while (0); if (((
((oleft)->tree...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
oleft)->tree_entry.rbe_parent)
((oleft)->tree...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = (parent)->tree_entry.rbe_right; }
never executed: end of block
 (tmp)->tree_entry.rbe_color = (parent)->tree_entry.rbe_color; (parent)->tree_entry.rbe_color = 0; if ((
(tmp)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right
(tmp)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_color = 0;
tmp)->tree_entry.rbe_right)->tree_entry.rbe_color = 0;
never executed: ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_color = 0;
 do { (tmp) = (parent)->tree_entry.rbe_right; if (((
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_right = (tmp)->tree_entry.rbe_left)
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_left = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); elm = (head)->rbh_root; break;
never executed: break;
 } } else { tmp = (parent)->tree_entry.rbe_left; if ((
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_color == 1
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
) { do { (tmp)->tree_entry.rbe_color = 0; (parent)->tree_entry.rbe_color = 1; } while (0); do { (tmp) = (parent)->tree_entry.rbe_left; if (((
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left = (tmp)->tree_entry.rbe_right)
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_right = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = (parent)->tree_entry.rbe_left; }
never executed: end of block
 if (((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
62((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
63|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) && ((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
64((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
65|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
)) { (tmp)->tree_entry.rbe_color = 1; elm = parent; parent = (elm)->tree_entry.rbe_parent; }
never executed: end of block
 else { if ((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
66((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
67|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) { struct revoked_key_id *oright; if ((
(oright = (tmp...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
oright = (tmp)->tree_entry.rbe_right)
(oright = (tmp...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (oright)->tree_entry.rbe_color = 0;
oright)->tree_entry.rbe_color = 0;
never executed: (oright)->tree_entry.rbe_color = 0;
 (tmp)->tree_entry.rbe_color = 1; do { (oright) = (tmp)->tree_entry.rbe_right; if (((
((tmp)->tree_e...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right = (oright)->tree_entry.rbe_left)
((tmp)->tree_e...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((oright)->tree_entry.rbe_left)->tree_entry.rbe_parent = (tmp); }
never executed: end of block
 do {} while (0); if (((
((oright)->tre...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
oright)->tree_entry.rbe_parent = (tmp)->tree_entry.rbe_parent)
((oright)->tre...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(tmp) == ((tmp...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
tmp) == ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left
(tmp) == ((tmp...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oright);
tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oright);
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oright);
 else ((
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oright);
tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oright);
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oright);
 } else (
never executed: (head)->rbh_root = (oright);
head)->rbh_root = (oright);
never executed: (head)->rbh_root = (oright);
 (oright)->tree_entry.rbe_left = (tmp); (tmp)->tree_entry.rbe_parent = (oright); do {} while (0); if (((
((oright)->tre...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
oright)->tree_entry.rbe_parent)
((oright)->tre...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = (parent)->tree_entry.rbe_left; }
never executed: end of block
 (tmp)->tree_entry.rbe_color = (parent)->tree_entry.rbe_color; (parent)->tree_entry.rbe_color = 0; if ((
(tmp)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left
(tmp)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_color = 0;
tmp)->tree_entry.rbe_left)->tree_entry.rbe_color = 0;
never executed: ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_color = 0;
 do { (tmp) = (parent)->tree_entry.rbe_left; if (((
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left = (tmp)->tree_entry.rbe_right)
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_right = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); elm = (head)->rbh_root; break;
never executed: break;
 } } } if (elm
elmDescription
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (elm)->tree_entry.rbe_color = 0;
elm)->tree_entry.rbe_color = 0;
never executed: (elm)->tree_entry.rbe_color = 0;
 }
never executed: end of block
 __attribute__((__unused__)) static struct revoked_key_id * revoked_key_id_tree_RB_REMOVE(struct revoked_key_id_tree *head, struct revoked_key_id *elm) { struct revoked_key_id *child, *parent, *old = elm; int color; if ((
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_left ==
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
68((
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
69) child = (elm)->tree_entry.rbe_right;
never executed: child = (elm)->tree_entry.rbe_right;
 else if ((
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_right ==
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
70((
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
71) child = (elm)->tree_entry.rbe_left;
never executed: child = (elm)->tree_entry.rbe_left;
 else { struct revoked_key_id *left; elm = (elm)->tree_entry.rbe_right; while ((
(left = (elm)-...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
left = (elm)->tree_entry.rbe_left)
(left = (elm)-...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) elm = left;
never executed: elm = left;
 child = (elm)->tree_entry.rbe_right; parent = (elm)->tree_entry.rbe_parent; color = (elm)->tree_entry.rbe_color; if (child
childDescription
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (child)->tree_entry.rbe_parent = parent;
child)->tree_entry.rbe_parent = parent;
never executed: (child)->tree_entry.rbe_parent = parent;
 if (parent
parentDescription
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left == elm
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (parent)->tree_entry.rbe_left = child;
parent)->tree_entry.rbe_left = child;
never executed: (parent)->tree_entry.rbe_left = child;
 else (
never executed: (parent)->tree_entry.rbe_right = child;
parent)->tree_entry.rbe_right = child;
never executed: (parent)->tree_entry.rbe_right = child;
 do {} while (0); }
never executed: end of block
 else (
never executed: (head)->rbh_root = child;
head)->rbh_root = child;
never executed: (head)->rbh_root = child;
 if ((
(elm)->tree_en..._parent == oldDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_parent == old
(elm)->tree_en..._parent == oldDescription
TRUEnever evaluated
FALSEnever evaluated
) parent = elm;
never executed: parent = elm;
 (elm)->tree_entry = (old)->tree_entry; if ((
(old)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
old)->tree_entry.rbe_parent
(old)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
) { if (((
((old)->tree_e...be_left == oldDescription
TRUEnever evaluated
FALSEnever evaluated
old)->tree_entry.rbe_parent)->tree_entry.rbe_left == old
((old)->tree_e...be_left == oldDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((old)->tree_entry.rbe_parent)->tree_entry.rbe_left = elm;
old)->tree_entry.rbe_parent)->tree_entry.rbe_left = elm;
never executed: ((old)->tree_entry.rbe_parent)->tree_entry.rbe_left = elm;
 else ((
never executed: ((old)->tree_entry.rbe_parent)->tree_entry.rbe_right = elm;
old)->tree_entry.rbe_parent)->tree_entry.rbe_right = elm;
never executed: ((old)->tree_entry.rbe_parent)->tree_entry.rbe_right = elm;
 do {} while (0); }
never executed: end of block
 else (
never executed: (head)->rbh_root = elm;
head)->rbh_root = elm;
never executed: (head)->rbh_root = elm;
 ((old)->tree_entry.rbe_left)->tree_entry.rbe_parent = elm; if ((
(old)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
old)->tree_entry.rbe_right
(old)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((old)->tree_entry.rbe_right)->tree_entry.rbe_parent = elm;
old)->tree_entry.rbe_right)->tree_entry.rbe_parent = elm;
never executed: ((old)->tree_entry.rbe_right)->tree_entry.rbe_parent = elm;
 if (parent
parentDescription
TRUEnever evaluated
FALSEnever evaluated
) { left = parent; do { do {} while (0); }
never executed: end of block
 while ((
(left = (left)...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
left = (left)->tree_entry.rbe_parent)
(left = (left)...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
); }
never executed: end of block
 goto
never executed: goto color;
 color;
never executed: goto color;
 } parent = (elm)->tree_entry.rbe_parent; color = (elm)->tree_entry.rbe_color; if (child
childDescription
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (child)->tree_entry.rbe_parent = parent;
child)->tree_entry.rbe_parent = parent;
never executed: (child)->tree_entry.rbe_parent = parent;
 if (parent
parentDescription
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left == elm
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (parent)->tree_entry.rbe_left = child;
parent)->tree_entry.rbe_left = child;
never executed: (parent)->tree_entry.rbe_left = child;
 else (
never executed: (parent)->tree_entry.rbe_right = child;
parent)->tree_entry.rbe_right = child;
never executed: (parent)->tree_entry.rbe_right = child;
 do {} while (0); }
never executed: end of block
 else (
never executed: (head)->rbh_root = child;
head)->rbh_root = child;
never executed: (head)->rbh_root = child;
 color:
code before this statement never executed: color:
 if (color == 0
color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) revoked_key_id_tree_RB_REMOVE_COLOR(head, parent, child);
never executed: revoked_key_id_tree_RB_REMOVE_COLOR(head, parent, child);
 return
never executed: return (old);
 (old);
never executed: return (old);
 } __attribute__((__unused__)) static struct revoked_key_id * revoked_key_id_tree_RB_INSERT(struct revoked_key_id_tree *head, struct revoked_key_id *elm) { struct revoked_key_id *tmp; struct revoked_key_id *parent = 		0
72((void *)0)-
73; int comp = 0; tmp = (head)->rbh_root; while (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
) { parent = tmp; comp = (key_id_cmp)(elm, parent); if (comp < 0
comp < 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_left;
never executed: tmp = (tmp)->tree_entry.rbe_left;
 else if (comp > 0
comp > 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_right;
never executed: tmp = (tmp)->tree_entry.rbe_right;
 else return
never executed: return (tmp);
 (tmp);
never executed: return (tmp);
 } do { (elm)->tree_entry.rbe_parent = parent; (elm)->tree_entry.rbe_left = (elm)->tree_entry.rbe_right = 		0
74((void *)0)-
75; (elm)->tree_entry.rbe_color = 1; } while (0); if (parent !=
parent != ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
76((
parent != ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
parent != ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
parent != ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
77) { if (comp < 0
comp < 0Description
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (parent)->tree_entry.rbe_left = elm;
parent)->tree_entry.rbe_left = elm;
never executed: (parent)->tree_entry.rbe_left = elm;
 else (
never executed: (parent)->tree_entry.rbe_right = elm;
parent)->tree_entry.rbe_right = elm;
never executed: (parent)->tree_entry.rbe_right = elm;
 do {} while (0); }
never executed: end of block
 else (
never executed: (head)->rbh_root = elm;
head)->rbh_root = elm;
never executed: (head)->rbh_root = elm;
 revoked_key_id_tree_RB_INSERT_COLOR(head, elm); return
never executed: return ( ((void *)0) );
 (
never executed: return ( ((void *)0) );
0
78((
never executed: return ( ((void *)0) );
never executed: return ( ((void *)0) );
void *)0)
never executed: return ( ((void *)0) );
0
79)
never executed: return ( ((void *)0) );
never executed: return ( ((void *)0) );
;
never executed: return ( ((void *)0) );
 } __attribute__((__unused__)) static struct revoked_key_id * revoked_key_id_tree_RB_FIND(struct revoked_key_id_tree *head, struct revoked_key_id *elm) { struct revoked_key_id *tmp = (head)->rbh_root; int comp; while (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
) { comp = key_id_cmp(elm, tmp); if (comp < 0
comp < 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_left;
never executed: tmp = (tmp)->tree_entry.rbe_left;
 else if (comp > 0
comp > 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_right;
never executed: tmp = (tmp)->tree_entry.rbe_right;
 else return
never executed: return (tmp);
 (tmp);
never executed: return (tmp);
 } return
never executed: return ( ((void *)0) );
 (
never executed: return ( ((void *)0) );
0
80((
never executed: return ( ((void *)0) );
never executed: return ( ((void *)0) );
void *)0)
never executed: return ( ((void *)0) );
0
81)
never executed: return ( ((void *)0) );
never executed: return ( ((void *)0) );
;
never executed: return ( ((void *)0) );
 } __attribute__((__unused__)) static struct revoked_key_id * revoked_key_id_tree_RB_NFIND(struct revoked_key_id_tree *head, struct revoked_key_id *elm) { struct revoked_key_id *tmp = (head)->rbh_root; struct revoked_key_id *res = 		0
82((void *)0)-
83; int comp; while (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
) { comp = key_id_cmp(elm, tmp); if (comp < 0
comp < 0Description
TRUEnever evaluated
FALSEnever evaluated
) { res = tmp; tmp = (tmp)->tree_entry.rbe_left; }
never executed: end of block
 else if (comp > 0
comp > 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_right;
never executed: tmp = (tmp)->tree_entry.rbe_right;
 else return
never executed: return (tmp);
 (tmp);
never executed: return (tmp);
 } return
never executed: return (res);
 (res);
never executed: return (res);
 } __attribute__((__unused__)) static struct revoked_key_id * revoked_key_id_tree_RB_NEXT(struct revoked_key_id *elm) { if ((
(elm)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_right
(elm)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
) { elm = (elm)->tree_entry.rbe_right; while ((
(elm)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_left
(elm)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) elm = (elm)->tree_entry.rbe_left;
never executed: elm = (elm)->tree_entry.rbe_left;
 }
never executed: end of block
 else { if ((
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_parent
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
 && (
(elm == ((elm)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
elm == ((elm)->tree_entry.rbe_parent)->tree_entry.rbe_left)
(elm == ((elm)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) elm = (elm)->tree_entry.rbe_parent;
never executed: elm = (elm)->tree_entry.rbe_parent;
 else { while ((
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_parent
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
 && (
(elm == ((elm)...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
elm == ((elm)->tree_entry.rbe_parent)->tree_entry.rbe_right)
(elm == ((elm)...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) elm = (elm)->tree_entry.rbe_parent;
never executed: elm = (elm)->tree_entry.rbe_parent;
 elm = (elm)->tree_entry.rbe_parent; }
never executed: end of block
 } return
never executed: return (elm);
 (elm);
never executed: return (elm);
 } __attribute__((__unused__)) static struct revoked_key_id * revoked_key_id_tree_RB_PREV(struct revoked_key_id *elm) { if ((
(elm)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_left
(elm)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) { elm = (elm)->tree_entry.rbe_left; while ((
(elm)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_right
(elm)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
) elm = (elm)->tree_entry.rbe_right;
never executed: elm = (elm)->tree_entry.rbe_right;
 }
never executed: end of block
 else { if ((
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_parent
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
 && (
(elm == ((elm)...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
elm == ((elm)->tree_entry.rbe_parent)->tree_entry.rbe_right)
(elm == ((elm)...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) elm = (elm)->tree_entry.rbe_parent;
never executed: elm = (elm)->tree_entry.rbe_parent;
 else { while ((
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_parent
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
 && (
(elm == ((elm)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
elm == ((elm)->tree_entry.rbe_parent)->tree_entry.rbe_left)
(elm == ((elm)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) elm = (elm)->tree_entry.rbe_parent;
never executed: elm = (elm)->tree_entry.rbe_parent;
 elm = (elm)->tree_entry.rbe_parent; }
never executed: end of block
 } return
never executed: return (elm);
 (elm);
never executed: return (elm);
 } __attribute__((__unused__)) static struct revoked_key_id * revoked_key_id_tree_RB_MINMAX(struct revoked_key_id_tree *head, int val) { struct revoked_key_id *tmp = (head)->rbh_root; struct revoked_key_id *parent = 		0
84((void *)0)-
85; while (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
) { parent = tmp; if (val < 0
val < 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_left;
never executed: tmp = (tmp)->tree_entry.rbe_left;
 else tmp = (tmp)->tree_entry.rbe_right;
never executed: tmp = (tmp)->tree_entry.rbe_right;
 } return
never executed: return (parent);
 (parent);
never executed: return (parent);
 };		0
86-
87-
88struct revoked_blob {-
89 u_char *blob;-
90 size_t len;-
91 struct { struct revoked_blob *rbe_left; struct revoked_blob *rbe_right; struct revoked_blob *rbe_parent; int rbe_color; } tree_entry;-
92};-
93static int blob_cmp(struct revoked_blob *a, struct revoked_blob *b);-
94struct revoked_blob_tree { struct revoked_blob *rbh_root; };-
95__attribute__((__unused__)) static void revoked_blob_tree_RB_INSERT_COLOR(struct revoked_blob_tree *head, struct revoked_blob *elm) { struct revoked_blob *parent, *gparent, *tmp; while ((
(parent = (elm...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
parent = (elm)->tree_entry.rbe_parent)
(parent = (elm...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
 && (
(parent)->tree...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_color == 1
(parent)->tree...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
) { gparent = (parent)->tree_entry.rbe_parent; if (parent == (gparent)->tree_entry.rbe_left
parent == (gpa...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) { tmp = (gparent)->tree_entry.rbe_right; if (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
 && (
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_color == 1
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
) { (tmp)->tree_entry.rbe_color = 0; do { (parent)->tree_entry.rbe_color = 0; (gparent)->tree_entry.rbe_color = 1; } while (0); elm = gparent; continue;
never executed: continue;
 } if ((
(parent)->tree...e_right == elmDescription
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_right == elm
(parent)->tree...e_right == elmDescription
TRUEnever evaluated
FALSEnever evaluated
) { do { (tmp) = (parent)->tree_entry.rbe_right; if (((
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_right = (tmp)->tree_entry.rbe_left)
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_left = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = parent; parent = elm; elm = tmp; }
never executed: end of block
 do { (parent)->tree_entry.rbe_color = 0; (gparent)->tree_entry.rbe_color = 1; } while (0); do { (tmp) = (gparent)->tree_entry.rbe_left; if (((
((gparent)->tr...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
gparent)->tree_entry.rbe_left = (tmp)->tree_entry.rbe_right)
((gparent)->tr...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_parent = (gparent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (gparent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(gparent) == (...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
gparent) == ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(gparent) == (...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_right = (gparent); (gparent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); }
never executed: end of block
 else { tmp = (gparent)->tree_entry.rbe_left; if (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
 && (
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_color == 1
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
) { (tmp)->tree_entry.rbe_color = 0; do { (parent)->tree_entry.rbe_color = 0; (gparent)->tree_entry.rbe_color = 1; } while (0); elm = gparent; continue;
never executed: continue;
 } if ((
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left == elm
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
) { do { (tmp) = (parent)->tree_entry.rbe_left; if (((
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left = (tmp)->tree_entry.rbe_right)
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_right = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = parent; parent = elm; elm = tmp; }
never executed: end of block
 do { (parent)->tree_entry.rbe_color = 0; (gparent)->tree_entry.rbe_color = 1; } while (0); do { (tmp) = (gparent)->tree_entry.rbe_right; if (((
((gparent)->tr...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
gparent)->tree_entry.rbe_right = (tmp)->tree_entry.rbe_left)
((gparent)->tr...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_parent = (gparent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (gparent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(gparent) == (...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
gparent) == ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(gparent) == (...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((gparent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_left = (gparent); (gparent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); }
never executed: end of block
 } (head->rbh_root)->tree_entry.rbe_color = 0; }
never executed: end of block
 __attribute__((__unused__)) static void revoked_blob_tree_RB_REMOVE_COLOR(struct revoked_blob_tree *head, struct revoked_blob *parent, struct revoked_blob *elm) { struct revoked_blob *tmp; while ((elm ==
elm == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
96((
elm == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
elm == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
elm == ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
97|| (
(elm)->tree_en...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_color == 0
(elm)->tree_en...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) && elm != (head)->rbh_root
elm != (head)->rbh_rootDescription
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left == elm
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
) { tmp = (parent)->tree_entry.rbe_right; if ((
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_color == 1
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
) { do { (tmp)->tree_entry.rbe_color = 0; (parent)->tree_entry.rbe_color = 1; } while (0); do { (tmp) = (parent)->tree_entry.rbe_right; if (((
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_right = (tmp)->tree_entry.rbe_left)
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_left = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = (parent)->tree_entry.rbe_right; }
never executed: end of block
 if (((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
98((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
99|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) && ((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
100((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
101|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
)) { (tmp)->tree_entry.rbe_color = 1; elm = parent; parent = (elm)->tree_entry.rbe_parent; }
never executed: end of block
 else { if ((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
102((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
103|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) { struct revoked_blob *oleft; if ((
(oleft = (tmp)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
oleft = (tmp)->tree_entry.rbe_left)
(oleft = (tmp)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (oleft)->tree_entry.rbe_color = 0;
oleft)->tree_entry.rbe_color = 0;
never executed: (oleft)->tree_entry.rbe_color = 0;
 (tmp)->tree_entry.rbe_color = 1; do { (oleft) = (tmp)->tree_entry.rbe_left; if (((
((tmp)->tree_e...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left = (oleft)->tree_entry.rbe_right)
((tmp)->tree_e...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((oleft)->tree_entry.rbe_right)->tree_entry.rbe_parent = (tmp); }
never executed: end of block
 do {} while (0); if (((
((oleft)->tree...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
oleft)->tree_entry.rbe_parent = (tmp)->tree_entry.rbe_parent)
((oleft)->tree...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(tmp) == ((tmp...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
tmp) == ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left
(tmp) == ((tmp...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oleft);
tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oleft);
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oleft);
 else ((
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oleft);
tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oleft);
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oleft);
 } else (
never executed: (head)->rbh_root = (oleft);
head)->rbh_root = (oleft);
never executed: (head)->rbh_root = (oleft);
 (oleft)->tree_entry.rbe_right = (tmp); (tmp)->tree_entry.rbe_parent = (oleft); do {} while (0); if (((
((oleft)->tree...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
oleft)->tree_entry.rbe_parent)
((oleft)->tree...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = (parent)->tree_entry.rbe_right; }
never executed: end of block
 (tmp)->tree_entry.rbe_color = (parent)->tree_entry.rbe_color; (parent)->tree_entry.rbe_color = 0; if ((
(tmp)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right
(tmp)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_color = 0;
tmp)->tree_entry.rbe_right)->tree_entry.rbe_color = 0;
never executed: ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_color = 0;
 do { (tmp) = (parent)->tree_entry.rbe_right; if (((
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_right = (tmp)->tree_entry.rbe_left)
((parent)->tre...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_left = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); elm = (head)->rbh_root; break;
never executed: break;
 } } else { tmp = (parent)->tree_entry.rbe_left; if ((
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_color == 1
(tmp)->tree_en...rbe_color == 1Description
TRUEnever evaluated
FALSEnever evaluated
) { do { (tmp)->tree_entry.rbe_color = 0; (parent)->tree_entry.rbe_color = 1; } while (0); do { (tmp) = (parent)->tree_entry.rbe_left; if (((
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left = (tmp)->tree_entry.rbe_right)
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_right = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = (parent)->tree_entry.rbe_left; }
never executed: end of block
 if (((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
104((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
105|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) && ((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
106((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
107|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
)) { (tmp)->tree_entry.rbe_color = 1; elm = parent; parent = (elm)->tree_entry.rbe_parent; }
never executed: end of block
 else { if ((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left ==
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
108((
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(tmp)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
 		0
109|| ((
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left)->tree_entry.rbe_color == 0
((tmp)->tree_e...rbe_color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) { struct revoked_blob *oright; if ((
(oright = (tmp...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
oright = (tmp)->tree_entry.rbe_right)
(oright = (tmp...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (oright)->tree_entry.rbe_color = 0;
oright)->tree_entry.rbe_color = 0;
never executed: (oright)->tree_entry.rbe_color = 0;
 (tmp)->tree_entry.rbe_color = 1; do { (oright) = (tmp)->tree_entry.rbe_right; if (((
((tmp)->tree_e...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_right = (oright)->tree_entry.rbe_left)
((tmp)->tree_e...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((oright)->tree_entry.rbe_left)->tree_entry.rbe_parent = (tmp); }
never executed: end of block
 do {} while (0); if (((
((oright)->tre...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
oright)->tree_entry.rbe_parent = (tmp)->tree_entry.rbe_parent)
((oright)->tre...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(tmp) == ((tmp...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
tmp) == ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left
(tmp) == ((tmp...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oright);
tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oright);
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_left = (oright);
 else ((
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oright);
tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oright);
never executed: ((tmp)->tree_entry.rbe_parent)->tree_entry.rbe_right = (oright);
 } else (
never executed: (head)->rbh_root = (oright);
head)->rbh_root = (oright);
never executed: (head)->rbh_root = (oright);
 (oright)->tree_entry.rbe_left = (tmp); (tmp)->tree_entry.rbe_parent = (oright); do {} while (0); if (((
((oright)->tre...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
oright)->tree_entry.rbe_parent)
((oright)->tre...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); tmp = (parent)->tree_entry.rbe_left; }
never executed: end of block
 (tmp)->tree_entry.rbe_color = (parent)->tree_entry.rbe_color; (parent)->tree_entry.rbe_color = 0; if ((
(tmp)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_left
(tmp)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_color = 0;
tmp)->tree_entry.rbe_left)->tree_entry.rbe_color = 0;
never executed: ((tmp)->tree_entry.rbe_left)->tree_entry.rbe_color = 0;
 do { (tmp) = (parent)->tree_entry.rbe_left; if (((
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left = (tmp)->tree_entry.rbe_right)
((parent)->tre...try.rbe_right)Description
TRUEnever evaluated
FALSEnever evaluated
) { ((tmp)->tree_entry.rbe_right)->tree_entry.rbe_parent = (parent); }
never executed: end of block
 do {} while (0); if (((
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent = (parent)->tree_entry.rbe_parent)
((tmp)->tree_e...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
parent) == ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left
(parent) == ((...entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_left = (tmp);
 else ((
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
never executed: ((parent)->tree_entry.rbe_parent)->tree_entry.rbe_right = (tmp);
 } else (
never executed: (head)->rbh_root = (tmp);
head)->rbh_root = (tmp);
never executed: (head)->rbh_root = (tmp);
 (tmp)->tree_entry.rbe_right = (parent); (parent)->tree_entry.rbe_parent = (tmp); do {} while (0); if (((
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
tmp)->tree_entry.rbe_parent)
((tmp)->tree_entry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
) do {}
never executed: end of block
 while (0); } while (0); elm = (head)->rbh_root; break;
never executed: break;
 } } } if (elm
elmDescription
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (elm)->tree_entry.rbe_color = 0;
elm)->tree_entry.rbe_color = 0;
never executed: (elm)->tree_entry.rbe_color = 0;
 }
never executed: end of block
 __attribute__((__unused__)) static struct revoked_blob * revoked_blob_tree_RB_REMOVE(struct revoked_blob_tree *head, struct revoked_blob *elm) { struct revoked_blob *child, *parent, *old = elm; int color; if ((
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_left ==
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
110((
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
111) child = (elm)->tree_entry.rbe_right;
never executed: child = (elm)->tree_entry.rbe_right;
 else if ((
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_right ==
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
112((
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
(elm)->tree_en...== ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
113) child = (elm)->tree_entry.rbe_left;
never executed: child = (elm)->tree_entry.rbe_left;
 else { struct revoked_blob *left; elm = (elm)->tree_entry.rbe_right; while ((
(left = (elm)-...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
left = (elm)->tree_entry.rbe_left)
(left = (elm)-...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) elm = left;
never executed: elm = left;
 child = (elm)->tree_entry.rbe_right; parent = (elm)->tree_entry.rbe_parent; color = (elm)->tree_entry.rbe_color; if (child
childDescription
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (child)->tree_entry.rbe_parent = parent;
child)->tree_entry.rbe_parent = parent;
never executed: (child)->tree_entry.rbe_parent = parent;
 if (parent
parentDescription
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left == elm
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (parent)->tree_entry.rbe_left = child;
parent)->tree_entry.rbe_left = child;
never executed: (parent)->tree_entry.rbe_left = child;
 else (
never executed: (parent)->tree_entry.rbe_right = child;
parent)->tree_entry.rbe_right = child;
never executed: (parent)->tree_entry.rbe_right = child;
 do {} while (0); }
never executed: end of block
 else (
never executed: (head)->rbh_root = child;
head)->rbh_root = child;
never executed: (head)->rbh_root = child;
 if ((
(elm)->tree_en..._parent == oldDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_parent == old
(elm)->tree_en..._parent == oldDescription
TRUEnever evaluated
FALSEnever evaluated
) parent = elm;
never executed: parent = elm;
 (elm)->tree_entry = (old)->tree_entry; if ((
(old)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
old)->tree_entry.rbe_parent
(old)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
) { if (((
((old)->tree_e...be_left == oldDescription
TRUEnever evaluated
FALSEnever evaluated
old)->tree_entry.rbe_parent)->tree_entry.rbe_left == old
((old)->tree_e...be_left == oldDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((old)->tree_entry.rbe_parent)->tree_entry.rbe_left = elm;
old)->tree_entry.rbe_parent)->tree_entry.rbe_left = elm;
never executed: ((old)->tree_entry.rbe_parent)->tree_entry.rbe_left = elm;
 else ((
never executed: ((old)->tree_entry.rbe_parent)->tree_entry.rbe_right = elm;
old)->tree_entry.rbe_parent)->tree_entry.rbe_right = elm;
never executed: ((old)->tree_entry.rbe_parent)->tree_entry.rbe_right = elm;
 do {} while (0); }
never executed: end of block
 else (
never executed: (head)->rbh_root = elm;
head)->rbh_root = elm;
never executed: (head)->rbh_root = elm;
 ((old)->tree_entry.rbe_left)->tree_entry.rbe_parent = elm; if ((
(old)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
old)->tree_entry.rbe_right
(old)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
) ((
never executed: ((old)->tree_entry.rbe_right)->tree_entry.rbe_parent = elm;
old)->tree_entry.rbe_right)->tree_entry.rbe_parent = elm;
never executed: ((old)->tree_entry.rbe_right)->tree_entry.rbe_parent = elm;
 if (parent
parentDescription
TRUEnever evaluated
FALSEnever evaluated
) { left = parent; do { do {} while (0); }
never executed: end of block
 while ((
(left = (left)...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
left = (left)->tree_entry.rbe_parent)
(left = (left)...ry.rbe_parent)Description
TRUEnever evaluated
FALSEnever evaluated
); }
never executed: end of block
 goto
never executed: goto color;
 color;
never executed: goto color;
 } parent = (elm)->tree_entry.rbe_parent; color = (elm)->tree_entry.rbe_color; if (child
childDescription
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (child)->tree_entry.rbe_parent = parent;
child)->tree_entry.rbe_parent = parent;
never executed: (child)->tree_entry.rbe_parent = parent;
 if (parent
parentDescription
TRUEnever evaluated
FALSEnever evaluated
) { if ((
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
parent)->tree_entry.rbe_left == elm
(parent)->tree...be_left == elmDescription
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (parent)->tree_entry.rbe_left = child;
parent)->tree_entry.rbe_left = child;
never executed: (parent)->tree_entry.rbe_left = child;
 else (
never executed: (parent)->tree_entry.rbe_right = child;
parent)->tree_entry.rbe_right = child;
never executed: (parent)->tree_entry.rbe_right = child;
 do {} while (0); }
never executed: end of block
 else (
never executed: (head)->rbh_root = child;
head)->rbh_root = child;
never executed: (head)->rbh_root = child;
 color:
code before this statement never executed: color:
 if (color == 0
color == 0Description
TRUEnever evaluated
FALSEnever evaluated
) revoked_blob_tree_RB_REMOVE_COLOR(head, parent, child);
never executed: revoked_blob_tree_RB_REMOVE_COLOR(head, parent, child);
 return
never executed: return (old);
 (old);
never executed: return (old);
 } __attribute__((__unused__)) static struct revoked_blob * revoked_blob_tree_RB_INSERT(struct revoked_blob_tree *head, struct revoked_blob *elm) { struct revoked_blob *tmp; struct revoked_blob *parent = 		0
114((void *)0)-
115; int comp = 0; tmp = (head)->rbh_root; while (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
) { parent = tmp; comp = (blob_cmp)(elm, parent); if (comp < 0
comp < 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_left;
never executed: tmp = (tmp)->tree_entry.rbe_left;
 else if (comp > 0
comp > 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_right;
never executed: tmp = (tmp)->tree_entry.rbe_right;
 else return
never executed: return (tmp);
 (tmp);
never executed: return (tmp);
 } do { (elm)->tree_entry.rbe_parent = parent; (elm)->tree_entry.rbe_left = (elm)->tree_entry.rbe_right = 		0
116((void *)0)-
117; (elm)->tree_entry.rbe_color = 1; } while (0); if (parent !=
parent != ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
118((
parent != ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
parent != ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
void *)0)
parent != ((void *)0)Description
TRUEnever evaluated
FALSEnever evaluated
0
119) { if (comp < 0
comp < 0Description
TRUEnever evaluated
FALSEnever evaluated
) (
never executed: (parent)->tree_entry.rbe_left = elm;
parent)->tree_entry.rbe_left = elm;
never executed: (parent)->tree_entry.rbe_left = elm;
 else (
never executed: (parent)->tree_entry.rbe_right = elm;
parent)->tree_entry.rbe_right = elm;
never executed: (parent)->tree_entry.rbe_right = elm;
 do {} while (0); }
never executed: end of block
 else (
never executed: (head)->rbh_root = elm;
head)->rbh_root = elm;
never executed: (head)->rbh_root = elm;
 revoked_blob_tree_RB_INSERT_COLOR(head, elm); return
never executed: return ( ((void *)0) );
 (
never executed: return ( ((void *)0) );
0
120((
never executed: return ( ((void *)0) );
never executed: return ( ((void *)0) );
void *)0)
never executed: return ( ((void *)0) );
0
121)
never executed: return ( ((void *)0) );
never executed: return ( ((void *)0) );
;
never executed: return ( ((void *)0) );
 } __attribute__((__unused__)) static struct revoked_blob * revoked_blob_tree_RB_FIND(struct revoked_blob_tree *head, struct revoked_blob *elm) { struct revoked_blob *tmp = (head)->rbh_root; int comp; while (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
) { comp = blob_cmp(elm, tmp); if (comp < 0
comp < 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_left;
never executed: tmp = (tmp)->tree_entry.rbe_left;
 else if (comp > 0
comp > 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_right;
never executed: tmp = (tmp)->tree_entry.rbe_right;
 else return
never executed: return (tmp);
 (tmp);
never executed: return (tmp);
 } return
never executed: return ( ((void *)0) );
 (
never executed: return ( ((void *)0) );
0
122((
never executed: return ( ((void *)0) );
never executed: return ( ((void *)0) );
void *)0)
never executed: return ( ((void *)0) );
0
123)
never executed: return ( ((void *)0) );
never executed: return ( ((void *)0) );
;
never executed: return ( ((void *)0) );
 } __attribute__((__unused__)) static struct revoked_blob * revoked_blob_tree_RB_NFIND(struct revoked_blob_tree *head, struct revoked_blob *elm) { struct revoked_blob *tmp = (head)->rbh_root; struct revoked_blob *res = 		0
124((void *)0)-
125; int comp; while (tmp
tmpDescription
TRUEnever evaluated
FALSEnever evaluated
) { comp = blob_cmp(elm, tmp); if (comp < 0
comp < 0Description
TRUEnever evaluated
FALSEnever evaluated
) { res = tmp; tmp = (tmp)->tree_entry.rbe_left; }
never executed: end of block
 else if (comp > 0
comp > 0Description
TRUEnever evaluated
FALSEnever evaluated
) tmp = (tmp)->tree_entry.rbe_right;
never executed: tmp = (tmp)->tree_entry.rbe_right;
 else return
never executed: return (tmp);
 (tmp);
never executed: return (tmp);
 } return
never executed: return (res);
 (res);
never executed: return (res);
 } __attribute__((__unused__)) static struct revoked_blob * revoked_blob_tree_RB_NEXT(struct revoked_blob *elm) { if ((
(elm)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_right
(elm)->tree_entry.rbe_rightDescription
TRUEnever evaluated
FALSEnever evaluated
) { elm = (elm)->tree_entry.rbe_right; while ((
(elm)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_left
(elm)->tree_entry.rbe_leftDescription
TRUEnever evaluated
FALSEnever evaluated
) elm = (elm)->tree_entry.rbe_left;
never executed: elm = (elm)->tree_entry.rbe_left;
 }
never executed: end of block
 else { if ((
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_parent
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
 && (
(elm == ((elm)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
elm == ((elm)->tree_entry.rbe_parent)->tree_entry.rbe_left)
(elm == ((elm)...ntry.rbe_left)Description
TRUEnever evaluated
FALSEnever evaluated
) elm = (elm)->tree_entry.rbe_parent;
never executed: elm = (elm)->tree_entry.rbe_parent;
 else { while ((
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever evaluated
elm)->tree_entry.rbe_parent
(elm)->tree_entry.rbe_parentDescription
TRUEnever evaluated
FALSEnever e