@@ -338,7 +338,7 @@ static const uint16_t spec_order[] = {
int avtab_read_item(struct avtab *a, void *fp, struct policydb *pol,
int (*insertf)(struct avtab *a, const struct avtab_key *k,
const struct avtab_datum *d, void *p),
- void *p)
+ void *p, u32 *nrules)
{
__le16 buf16[4];
u16 enabled;
@@ -412,6 +412,11 @@ int avtab_read_item(struct avtab *a, void *fp, struct policydb *pol,
if (val & spec_order[i]) {
key.specified = spec_order[i] | enabled;
datum.u.data = le32_to_cpu(buf32[items++]);
+ /* first pass of conditional table read */
+ if (nrules) {
+ (*nrules)++;
+ continue;
+ }
rc = insertf(a, &key, &datum, p);
if (rc)
return rc;
@@ -490,6 +495,12 @@ int avtab_read_item(struct avtab *a, void *fp, struct policydb *pol,
pr_err("SELinux: avtab: invalid type\n");
return -EINVAL;
}
+
+ /* first pass of conditional table read */
+ if (nrules) {
+ (*nrules)++;
+ return 0;
+ }
return insertf(a, &key, &datum, p);
}
@@ -523,7 +534,7 @@ int avtab_read(struct avtab *a, void *fp, struct policydb *pol)
goto bad;
for (i = 0; i < nel; i++) {
- rc = avtab_read_item(a, fp, pol, avtab_insertf, NULL);
+ rc = avtab_read_item(a, fp, pol, avtab_insertf, NULL, NULL);
if (rc) {
if (rc == -ENOMEM)
pr_err("SELinux: avtab: out of memory\n");
@@ -104,7 +104,7 @@ struct policydb;
int avtab_read_item(struct avtab *a, void *fp, struct policydb *pol,
int (*insert)(struct avtab *a, const struct avtab_key *k,
const struct avtab_datum *d, void *p),
- void *p);
+ void *p, u32 *nrules);
int avtab_read(struct avtab *a, void *fp, struct policydb *pol);
int avtab_write_item(struct policydb *p, const struct avtab_node *cur, void *fp);
@@ -321,9 +321,9 @@ static int cond_insertf(struct avtab *a, const struct avtab_key *k,
return 0;
}
-static int cond_read_av_list(struct policydb *p, void *fp,
+static int cond_read_av_list(struct policydb *p, struct policy_file *fp,
struct cond_av_list *list,
- struct cond_av_list *other)
+ struct cond_av_list *other, u32 *nrules)
{
int rc;
__le32 buf[1];
@@ -347,7 +347,7 @@ static int cond_read_av_list(struct policydb *p, void *fp,
for (i = 0; i < len; i++) {
data.dst = &list->nodes[i];
rc = avtab_read_item(&p->te_cond_avtab, fp, p, cond_insertf,
- &data);
+ &data, nrules);
if (rc) {
kfree(list->nodes);
list->nodes = NULL;
@@ -373,7 +373,8 @@ static int expr_node_isvalid(struct policydb *p, struct cond_expr_node *expr)
return 1;
}
-static int cond_read_node(struct policydb *p, struct cond_node *node, void *fp)
+static int cond_read_node(struct policydb *p, struct cond_node *node,
+ struct policy_file *fp, u32 *nrules)
{
__le32 buf[2];
u32 i, len;
@@ -407,16 +408,17 @@ static int cond_read_node(struct policydb *p, struct cond_node *node, void *fp)
return -EINVAL;
}
- rc = cond_read_av_list(p, fp, &node->true_list, NULL);
+ rc = cond_read_av_list(p, fp, &node->true_list, NULL, nrules);
if (rc)
return rc;
- return cond_read_av_list(p, fp, &node->false_list, &node->true_list);
+ return cond_read_av_list(p, fp, &node->false_list, &node->true_list, nrules);
}
-int cond_read_list(struct policydb *p, void *fp)
+int cond_read_list(struct policydb *p, struct policy_file *fp)
{
__le32 buf[1];
- u32 i, len;
+ struct policy_file tmp_fp;
+ u32 i, len, nrules;
int rc;
rc = next_entry(buf, fp, sizeof(buf));
@@ -428,15 +430,25 @@ int cond_read_list(struct policydb *p, void *fp)
p->cond_list = kcalloc(len, sizeof(*p->cond_list), GFP_KERNEL);
if (!p->cond_list)
return -ENOMEM;
+ p->cond_list_len = len;
+
+ /* first pass to only calculate the avrule count */
+ tmp_fp = *fp;
+ nrules = 0;
+ for (i = 0; i < p->cond_list_len; i++) {
+ rc = cond_read_node(p, &p->cond_list[i], &tmp_fp, &nrules);
+ if (rc)
+ goto err;
+ cond_node_destroy(&p->cond_list[i]);
+ }
- rc = avtab_alloc(&(p->te_cond_avtab), p->te_avtab.nel);
+ rc = avtab_alloc(&(p->te_cond_avtab), nrules);
if (rc)
goto err;
- p->cond_list_len = len;
-
- for (i = 0; i < len; i++) {
- rc = cond_read_node(p, &p->cond_list[i], fp);
+ /* second pass to read in the conditional nodes */
+ for (i = 0; i < p->cond_list_len; i++) {
+ rc = cond_read_node(p, &p->cond_list[i], fp, NULL);
if (rc)
goto err;
}
@@ -70,7 +70,7 @@ int cond_destroy_bool(void *key, void *datum, void *p);
int cond_index_bool(void *key, void *datum, void *datap);
int cond_read_bool(struct policydb *p, struct symtab *s, void *fp);
-int cond_read_list(struct policydb *p, void *fp);
+int cond_read_list(struct policydb *p, struct policy_file *fp);
int cond_write_bool(void *key, void *datum, void *ptr);
int cond_write_list(struct policydb *p, void *fp);
Due to how conditional rules are written in the binary policy, the code responsible for loading does not know how many conditional rules there are before creating the avtab structure. Instead, it uses the number of elements in the non-conditional avtab as a hint and allocates the hash table based on it. In the refpolicy and default Fedora policy, the actual sizes of these tables are not similar (~85k vs ~10k) thereby creating more slots than needed and resulting in wasted memory. This patch introduces a two-pass algorithm to calculate the conditional rule count before allocating the avtab nodes array. Albeit with a slight performance penalty in reading a portion of the binary policy twice, this causes the number of hash slots for the conditional array to become 4096 instead of 32768. At 8-bytes per slot on 64-bit architectures, this results in a net savings of 224 KB of heap memory. Signed-off-by: Jacob Satterfield <jsatterfield.linux@gmail.com> --- security/selinux/ss/avtab.c | 15 ++++++++++-- security/selinux/ss/avtab.h | 2 +- security/selinux/ss/conditional.c | 38 ++++++++++++++++++++----------- security/selinux/ss/conditional.h | 2 +- 4 files changed, 40 insertions(+), 17 deletions(-)