}
static bool
-quota_root_is_visible(struct quota_root *root, struct mailbox *box,
- bool enforce)
+quota_root_is_visible(struct quota_root *root, struct mailbox *box)
{
- if (root->no_enforcing && enforce) {
- /* we don't want to include this root in quota enforcing */
- return FALSE;
- }
if (!quota_root_is_namespace_visible(root, box->list->ns))
return FALSE;
if (array_count(&root->quota->roots) == 1) {
for (; iter->i < count; iter->i++) {
if (iter->box != NULL &&
- !quota_root_is_visible(roots[iter->i], iter->box, FALSE))
+ !quota_root_is_visible(roots[iter->i], iter->box))
continue;
root = roots[iter->i];
ctx->auto_updating = TRUE;
array_foreach(&ctx->quota->roots, rootp) {
- if (!quota_root_is_visible(*rootp, ctx->box, FALSE))
+ if (!quota_root_is_visible(*rootp, ctx->box))
continue;
rule = quota_root_rule_find((*rootp)->set, mailbox_name);
/* find the lowest quota limits from all roots and use them */
roots = array_get(&ctx->quota->roots, &count);
for (i = 0; i < count; i++) {
- if (!quota_root_is_visible(roots[i], ctx->box, TRUE))
+ if (!quota_root_is_visible(roots[i], ctx->box) ||
+ roots[i]->no_enforcing)
continue;
if (quota_root_get_rule_limits(roots[i], mailbox_name,
roots = array_get(&ctx->quota->roots, &count);
t_array_init(&warn_roots, count);
for (i = 0; i < count; i++) {
- if (!quota_root_is_visible(roots[i], ctx->box, FALSE))
+ if (!quota_root_is_visible(roots[i], ctx->box))
continue;
rule = quota_root_rule_find(roots[i]->set,
for (i = 0; i < count; i++) {
uint64_t bytes_limit, count_limit;
- if (!quota_root_is_visible(roots[i], ctx->box, TRUE))
+ if (!quota_root_is_visible(roots[i], ctx->box) ||
+ roots[i]->no_enforcing)
continue;
const char *error;