@@ -4170,13 +4170,13 @@ static int __cil_user_val_array_insert(hashtab_key_t key, hashtab_datum_t datum,
static int __cil_bool_val_array_insert(hashtab_key_t key, hashtab_datum_t datum, void *data)
{
policydb_t *pdb = data;
- cond_bool_datum_t *bool = (cond_bool_datum_t *)datum;
+ cond_bool_datum_t *boolean = (cond_bool_datum_t *)datum;
- if (bool->s.value < 1 || bool->s.value > pdb->p_bools.nprim) {
+ if (boolean->s.value < 1 || boolean->s.value > pdb->p_bools.nprim) {
return -EINVAL;
}
- pdb->p_bool_val_to_name[bool->s.value - 1] = (char *)key;
- pdb->bool_val_to_struct[bool->s.value - 1] = bool;
+ pdb->p_bool_val_to_name[boolean->s.value - 1] = (char *)key;
+ pdb->bool_val_to_struct[boolean->s.value - 1] = boolean;
return 0;
}
@@ -1008,13 +1008,13 @@ static void cil_validatetrans_to_policy(FILE *out, struct cil_db *db, struct cil
static void cil_bools_to_policy(FILE *out, struct cil_list *bools)
{
struct cil_list_item *i1;
- struct cil_bool *bool;
+ struct cil_bool *boolean;
const char *value;
cil_list_for_each(i1, bools) {
- bool = i1->data;
- value = bool->value ? "true" : "false";
- fprintf(out, "bool %s %s;\n", bool->datum.fqn, value);
+ boolean = i1->data;
+ value = boolean->value ? "true" : "false";
+ fprintf(out, "bool %s %s;\n", boolean->datum.fqn, value);
}
}
@@ -1437,12 +1437,12 @@ static int __cil_te_rules_to_policy_helper(struct cil_tree_node *node, uint32_t
*finished = CIL_TREE_SKIP_HEAD;
break;
case CIL_BOOLEANIF: {
- struct cil_booleanif *bool = node->data;
+ struct cil_booleanif *boolean = node->data;
struct cil_tree_node *n;
struct cil_condblock *cb;
fprintf(args->out, "if ");
- cil_cond_expr_to_policy(args->out, bool->datum_expr, CIL_TRUE);
+ cil_cond_expr_to_policy(args->out, boolean->datum_expr, CIL_TRUE);
fprintf(args->out," {\n");
n = node->cl_head;
cb = n != NULL ? n->data : NULL;
@@ -1106,11 +1106,11 @@ static int bool_copy_callback(hashtab_key_t key, hashtab_datum_t datum,
{
int ret;
expand_state_t *state;
- cond_bool_datum_t *bool, *new_bool;
+ cond_bool_datum_t *boolean, *new_bool;
char *id, *new_id;
id = key;
- bool = (cond_bool_datum_t *) datum;
+ boolean = (cond_bool_datum_t *) datum;
state = (expand_state_t *) data;
if (!is_id_enabled(id, state->base, SYM_BOOLS)) {
@@ -1118,7 +1118,7 @@ static int bool_copy_callback(hashtab_key_t key, hashtab_datum_t datum,
return 0;
}
- if (bool->flags & COND_BOOL_FLAGS_TUNABLE) {
+ if (boolean->flags & COND_BOOL_FLAGS_TUNABLE) {
/* Skip tunables */
return 0;
}
@@ -1152,10 +1152,10 @@ static int bool_copy_callback(hashtab_key_t key, hashtab_datum_t datum,
return -1;
}
- state->boolmap[bool->s.value - 1] = new_bool->s.value;
+ state->boolmap[boolean->s.value - 1] = new_bool->s.value;
- new_bool->state = bool->state;
- new_bool->flags = bool->flags;
+ new_bool->state = boolean->state;
+ new_bool->flags = boolean->flags;
return 0;
}
Avoid using the identifier `bool` to improve support with future C standards. C23 is about to make `bool` a predefined macro (see N2654). Signed-off-by: Christian Göttsche <cgzones@googlemail.com> --- libsepol/cil/src/cil_binary.c | 8 ++++---- libsepol/cil/src/cil_policy.c | 12 ++++++------ libsepol/src/expand.c | 12 ++++++------ 3 files changed, 16 insertions(+), 16 deletions(-)