Lines Matching refs:entry
99 struct quota_id *entry;
105 entry = rb_entry(node, struct quota_id, node);
106 node = rb_next(&entry->node);
108 rb_erase(&entry->node, root);
109 kfree(entry);
122 struct quota_id *entry = NULL;
130 entry = rb_entry(node, struct quota_id, node);
132 if (id < entry->id)
134 else if (id > entry->id)
140 if (!entry) {
145 if (id > entry->id) {
146 node = rb_next(&entry->node);
151 entry = rb_entry(node, struct quota_id, node);
155 *qid = make_kqid(&init_user_ns, qid->type, entry->id);
162 * Load dquot with limits from existing entry, or create the new entry if
171 struct quota_id *new_entry, *entry;
181 entry = rb_entry(parent, struct quota_id, node);
183 if (id < entry->id)
185 else if (id > entry->id)
191 /* We don't have entry for this id yet, create it */
210 entry = new_entry;
215 dquot->dq_dqb.dqb_bhardlimit = entry->bhardlimit;
216 dquot->dq_dqb.dqb_bsoftlimit = entry->bsoftlimit;
217 dquot->dq_dqb.dqb_ihardlimit = entry->ihardlimit;
218 dquot->dq_dqb.dqb_isoftlimit = entry->isoftlimit;
270 struct quota_id *entry = NULL;
279 entry = rb_entry(node, struct quota_id, node);
281 if (id < entry->id)
283 else if (id > entry->id)
289 /* We should always find the entry in the rb tree */
297 /* Remove entry from the tree */
298 rb_erase(&entry->node, info->dqi_priv);
299 kfree(entry);
303 entry->bhardlimit = dquot->dq_dqb.dqb_bhardlimit;
304 entry->bsoftlimit = dquot->dq_dqb.dqb_bsoftlimit;
305 entry->ihardlimit = dquot->dq_dqb.dqb_ihardlimit;
306 entry->isoftlimit = dquot->dq_dqb.dqb_isoftlimit;