2 * This file is part of UBIFS.
4 * Copyright (C) 2006-2008 Nokia Corporation.
6 * This program is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License version 2 as published by
8 * the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
15 * You should have received a copy of the GNU General Public License along with
16 * this program; if not, write to the Free Software Foundation, Inc., 51
17 * Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19 * Author: Adrian Hunter
25 * An orphan is an inode number whose inode node has been committed to the index
26 * with a link count of zero. That happens when an open file is deleted
27 * (unlinked) and then a commit is run. In the normal course of events the inode
28 * would be deleted when the file is closed. However in the case of an unclean
29 * unmount, orphans need to be accounted for. After an unclean unmount, the
30 * orphans' inodes must be deleted which means either scanning the entire index
31 * looking for them, or keeping a list on flash somewhere. This unit implements
32 * the latter approach.
34 * The orphan area is a fixed number of LEBs situated between the LPT area and
35 * the main area. The number of orphan area LEBs is specified when the file
36 * system is created. The minimum number is 1. The size of the orphan area
37 * should be so that it can hold the maximum number of orphans that are expected
38 * to ever exist at one time.
40 * The number of orphans that can fit in a LEB is:
42 * (c->leb_size - UBIFS_ORPH_NODE_SZ) / sizeof(__le64)
44 * For example: a 15872 byte LEB can fit 1980 orphans so 1 LEB may be enough.
46 * Orphans are accumulated in a rb-tree. When an inode's link count drops to
47 * zero, the inode number is added to the rb-tree. It is removed from the tree
48 * when the inode is deleted. Any new orphans that are in the orphan tree when
49 * the commit is run, are written to the orphan area in 1 or more orphan nodes.
50 * If the orphan area is full, it is consolidated to make space. There is
51 * always enough space because validation prevents the user from creating more
52 * than the maximum number of orphans allowed.
55 static int dbg_check_orphans(struct ubifs_info *c);
58 * ubifs_add_orphan - add an orphan.
59 * @c: UBIFS file-system description object
60 * @inum: orphan inode number
62 * Add an orphan. This function is called when an inodes link count drops to
65 int ubifs_add_orphan(struct ubifs_info *c, ino_t inum)
67 struct ubifs_orphan *orphan, *o;
68 struct rb_node **p, *parent = NULL;
70 orphan = kzalloc(sizeof(struct ubifs_orphan), GFP_NOFS);
76 spin_lock(&c->orphan_lock);
77 if (c->tot_orphans >= c->max_orphans) {
78 spin_unlock(&c->orphan_lock);
82 p = &c->orph_tree.rb_node;
85 o = rb_entry(parent, struct ubifs_orphan, rb);
88 else if (inum > o->inum)
91 ubifs_err("orphaned twice");
92 spin_unlock(&c->orphan_lock);
99 rb_link_node(&orphan->rb, parent, p);
100 rb_insert_color(&orphan->rb, &c->orph_tree);
101 list_add_tail(&orphan->list, &c->orph_list);
102 list_add_tail(&orphan->new_list, &c->orph_new);
103 spin_unlock(&c->orphan_lock);
104 dbg_gen("ino %lu", (unsigned long)inum);
109 * ubifs_delete_orphan - delete an orphan.
110 * @c: UBIFS file-system description object
111 * @inum: orphan inode number
113 * Delete an orphan. This function is called when an inode is deleted.
115 void ubifs_delete_orphan(struct ubifs_info *c, ino_t inum)
117 struct ubifs_orphan *o;
120 spin_lock(&c->orphan_lock);
121 p = c->orph_tree.rb_node;
123 o = rb_entry(p, struct ubifs_orphan, rb);
126 else if (inum > o->inum)
130 spin_unlock(&c->orphan_lock);
131 dbg_gen("deleted twice ino %lu",
132 (unsigned long)inum);
137 o->dnext = c->orph_dnext;
139 spin_unlock(&c->orphan_lock);
140 dbg_gen("delete later ino %lu",
141 (unsigned long)inum);
144 rb_erase(p, &c->orph_tree);
148 list_del(&o->new_list);
151 spin_unlock(&c->orphan_lock);
153 dbg_gen("inum %lu", (unsigned long)inum);
157 spin_unlock(&c->orphan_lock);
158 ubifs_err("missing orphan ino %lu", (unsigned long)inum);
163 * ubifs_orphan_start_commit - start commit of orphans.
164 * @c: UBIFS file-system description object
166 * Start commit of orphans.
168 int ubifs_orphan_start_commit(struct ubifs_info *c)
170 struct ubifs_orphan *orphan, **last;
172 spin_lock(&c->orphan_lock);
173 last = &c->orph_cnext;
174 list_for_each_entry(orphan, &c->orph_new, new_list) {
175 ubifs_assert(orphan->new);
178 last = &orphan->cnext;
180 *last = orphan->cnext;
181 c->cmt_orphans = c->new_orphans;
183 dbg_cmt("%d orphans to commit", c->cmt_orphans);
184 INIT_LIST_HEAD(&c->orph_new);
185 if (c->tot_orphans == 0)
189 spin_unlock(&c->orphan_lock);
194 * avail_orphs - calculate available space.
195 * @c: UBIFS file-system description object
197 * This function returns the number of orphans that can be written in the
200 static int avail_orphs(struct ubifs_info *c)
202 int avail_lebs, avail, gap;
204 avail_lebs = c->orph_lebs - (c->ohead_lnum - c->orph_first) - 1;
206 ((c->leb_size - UBIFS_ORPH_NODE_SZ) / sizeof(__le64));
207 gap = c->leb_size - c->ohead_offs;
208 if (gap >= UBIFS_ORPH_NODE_SZ + sizeof(__le64))
209 avail += (gap - UBIFS_ORPH_NODE_SZ) / sizeof(__le64);
214 * tot_avail_orphs - calculate total space.
215 * @c: UBIFS file-system description object
217 * This function returns the number of orphans that can be written in half
218 * the total space. That leaves half the space for adding new orphans.
220 static int tot_avail_orphs(struct ubifs_info *c)
222 int avail_lebs, avail;
224 avail_lebs = c->orph_lebs;
226 ((c->leb_size - UBIFS_ORPH_NODE_SZ) / sizeof(__le64));
231 * do_write_orph_node - write a node to the orphan head.
232 * @c: UBIFS file-system description object
233 * @len: length of node
234 * @atomic: write atomically
236 * This function writes a node to the orphan head from the orphan buffer. If
237 * %atomic is not zero, then the write is done atomically. On success, %0 is
238 * returned, otherwise a negative error code is returned.
240 static int do_write_orph_node(struct ubifs_info *c, int len, int atomic)
245 ubifs_assert(c->ohead_offs == 0);
246 ubifs_prepare_node(c, c->orph_buf, len, 1);
247 len = ALIGN(len, c->min_io_size);
248 err = ubifs_leb_change(c, c->ohead_lnum, c->orph_buf, len);
250 if (c->ohead_offs == 0) {
251 /* Ensure LEB has been unmapped */
252 err = ubifs_leb_unmap(c, c->ohead_lnum);
256 err = ubifs_write_node(c, c->orph_buf, len, c->ohead_lnum,
263 * write_orph_node - write an orphan node.
264 * @c: UBIFS file-system description object
265 * @atomic: write atomically
267 * This function builds an orphan node from the cnext list and writes it to the
268 * orphan head. On success, %0 is returned, otherwise a negative error code
271 static int write_orph_node(struct ubifs_info *c, int atomic)
273 struct ubifs_orphan *orphan, *cnext;
274 struct ubifs_orph_node *orph;
275 int gap, err, len, cnt, i;
277 ubifs_assert(c->cmt_orphans > 0);
278 gap = c->leb_size - c->ohead_offs;
279 if (gap < UBIFS_ORPH_NODE_SZ + sizeof(__le64)) {
283 if (c->ohead_lnum > c->orph_last) {
285 * We limit the number of orphans so that this should
288 ubifs_err("out of space in orphan area");
292 cnt = (gap - UBIFS_ORPH_NODE_SZ) / sizeof(__le64);
293 if (cnt > c->cmt_orphans)
294 cnt = c->cmt_orphans;
295 len = UBIFS_ORPH_NODE_SZ + cnt * sizeof(__le64);
296 ubifs_assert(c->orph_buf);
298 orph->ch.node_type = UBIFS_ORPH_NODE;
299 spin_lock(&c->orphan_lock);
300 cnext = c->orph_cnext;
301 for (i = 0; i < cnt; i++) {
303 orph->inos[i] = cpu_to_le64(orphan->inum);
304 cnext = orphan->cnext;
305 orphan->cnext = NULL;
307 c->orph_cnext = cnext;
308 c->cmt_orphans -= cnt;
309 spin_unlock(&c->orphan_lock);
311 orph->cmt_no = cpu_to_le64(c->cmt_no);
313 /* Mark the last node of the commit */
314 orph->cmt_no = cpu_to_le64((c->cmt_no) | (1ULL << 63));
315 ubifs_assert(c->ohead_offs + len <= c->leb_size);
316 ubifs_assert(c->ohead_lnum >= c->orph_first);
317 ubifs_assert(c->ohead_lnum <= c->orph_last);
318 err = do_write_orph_node(c, len, atomic);
319 c->ohead_offs += ALIGN(len, c->min_io_size);
320 c->ohead_offs = ALIGN(c->ohead_offs, 8);
325 * write_orph_nodes - write orphan nodes until there are no more to commit.
326 * @c: UBIFS file-system description object
327 * @atomic: write atomically
329 * This function writes orphan nodes for all the orphans to commit. On success,
330 * %0 is returned, otherwise a negative error code is returned.
332 static int write_orph_nodes(struct ubifs_info *c, int atomic)
336 while (c->cmt_orphans > 0) {
337 err = write_orph_node(c, atomic);
344 /* Unmap any unused LEBs after consolidation */
345 lnum = c->ohead_lnum + 1;
346 for (lnum = c->ohead_lnum + 1; lnum <= c->orph_last; lnum++) {
347 err = ubifs_leb_unmap(c, lnum);
356 * consolidate - consolidate the orphan area.
357 * @c: UBIFS file-system description object
359 * This function enables consolidation by putting all the orphans into the list
360 * to commit. The list is in the order that the orphans were added, and the
361 * LEBs are written atomically in order, so at no time can orphans be lost by
362 * an unclean unmount.
364 * This function returns %0 on success and a negative error code on failure.
366 static int consolidate(struct ubifs_info *c)
368 int tot_avail = tot_avail_orphs(c), err = 0;
370 spin_lock(&c->orphan_lock);
371 dbg_cmt("there is space for %d orphans and there are %d",
372 tot_avail, c->tot_orphans);
373 if (c->tot_orphans - c->new_orphans <= tot_avail) {
374 struct ubifs_orphan *orphan, **last;
377 /* Change the cnext list to include all non-new orphans */
378 last = &c->orph_cnext;
379 list_for_each_entry(orphan, &c->orph_list, list) {
383 last = &orphan->cnext;
386 *last = orphan->cnext;
387 ubifs_assert(cnt == c->tot_orphans - c->new_orphans);
388 c->cmt_orphans = cnt;
389 c->ohead_lnum = c->orph_first;
393 * We limit the number of orphans so that this should
396 ubifs_err("out of space in orphan area");
399 spin_unlock(&c->orphan_lock);
404 * commit_orphans - commit orphans.
405 * @c: UBIFS file-system description object
407 * This function commits orphans to flash. On success, %0 is returned,
408 * otherwise a negative error code is returned.
410 static int commit_orphans(struct ubifs_info *c)
412 int avail, atomic = 0, err;
414 ubifs_assert(c->cmt_orphans > 0);
415 avail = avail_orphs(c);
416 if (avail < c->cmt_orphans) {
417 /* Not enough space to write new orphans, so consolidate */
418 err = consolidate(c);
423 err = write_orph_nodes(c, atomic);
428 * erase_deleted - erase the orphans marked for deletion.
429 * @c: UBIFS file-system description object
431 * During commit, the orphans being committed cannot be deleted, so they are
432 * marked for deletion and deleted by this function. Also, the recovery
433 * adds killed orphans to the deletion list, and therefore they are deleted
436 static void erase_deleted(struct ubifs_info *c)
438 struct ubifs_orphan *orphan, *dnext;
440 spin_lock(&c->orphan_lock);
441 dnext = c->orph_dnext;
444 dnext = orphan->dnext;
445 ubifs_assert(!orphan->new);
446 ubifs_assert(orphan->del);
447 rb_erase(&orphan->rb, &c->orph_tree);
448 list_del(&orphan->list);
450 dbg_gen("deleting orphan ino %lu", (unsigned long)orphan->inum);
453 c->orph_dnext = NULL;
454 spin_unlock(&c->orphan_lock);
458 * ubifs_orphan_end_commit - end commit of orphans.
459 * @c: UBIFS file-system description object
461 * End commit of orphans.
463 int ubifs_orphan_end_commit(struct ubifs_info *c)
467 if (c->cmt_orphans != 0) {
468 err = commit_orphans(c);
473 err = dbg_check_orphans(c);
478 * ubifs_clear_orphans - erase all LEBs used for orphans.
479 * @c: UBIFS file-system description object
481 * If recovery is not required, then the orphans from the previous session
482 * are not needed. This function locates the LEBs used to record
483 * orphans, and un-maps them.
485 int ubifs_clear_orphans(struct ubifs_info *c)
489 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
490 err = ubifs_leb_unmap(c, lnum);
494 c->ohead_lnum = c->orph_first;
500 * insert_dead_orphan - insert an orphan.
501 * @c: UBIFS file-system description object
502 * @inum: orphan inode number
504 * This function is a helper to the 'do_kill_orphans()' function. The orphan
505 * must be kept until the next commit, so it is added to the rb-tree and the
508 static int insert_dead_orphan(struct ubifs_info *c, ino_t inum)
510 struct ubifs_orphan *orphan, *o;
511 struct rb_node **p, *parent = NULL;
513 orphan = kzalloc(sizeof(struct ubifs_orphan), GFP_KERNEL);
518 p = &c->orph_tree.rb_node;
521 o = rb_entry(parent, struct ubifs_orphan, rb);
524 else if (inum > o->inum)
527 /* Already added - no problem */
533 rb_link_node(&orphan->rb, parent, p);
534 rb_insert_color(&orphan->rb, &c->orph_tree);
535 list_add_tail(&orphan->list, &c->orph_list);
537 orphan->dnext = c->orph_dnext;
538 c->orph_dnext = orphan;
539 dbg_mnt("ino %lu, new %d, tot %d", (unsigned long)inum,
540 c->new_orphans, c->tot_orphans);
545 * do_kill_orphans - remove orphan inodes from the index.
546 * @c: UBIFS file-system description object
548 * @last_cmt_no: cmt_no of last orphan node read is passed and returned here
549 * @outofdate: whether the LEB is out of date is returned here
550 * @last_flagged: whether the end orphan node is encountered
552 * This function is a helper to the 'kill_orphans()' function. It goes through
553 * every orphan node in a LEB and for every inode number recorded, removes
554 * all keys for that inode from the TNC.
556 static int do_kill_orphans(struct ubifs_info *c, struct ubifs_scan_leb *sleb,
557 unsigned long long *last_cmt_no, int *outofdate,
560 struct ubifs_scan_node *snod;
561 struct ubifs_orph_node *orph;
562 unsigned long long cmt_no;
564 int i, n, err, first = 1;
566 list_for_each_entry(snod, &sleb->nodes, list) {
567 if (snod->type != UBIFS_ORPH_NODE) {
568 ubifs_err("invalid node type %d in orphan area at %d:%d",
569 snod->type, sleb->lnum, snod->offs);
570 ubifs_dump_node(c, snod->node);
576 /* Check commit number */
577 cmt_no = le64_to_cpu(orph->cmt_no) & LLONG_MAX;
579 * The commit number on the master node may be less, because
580 * of a failed commit. If there are several failed commits in a
581 * row, the commit number written on orphan nodes will continue
582 * to increase (because the commit number is adjusted here) even
583 * though the commit number on the master node stays the same
584 * because the master node has not been re-written.
586 if (cmt_no > c->cmt_no)
588 if (cmt_no < *last_cmt_no && *last_flagged) {
590 * The last orphan node had a higher commit number and
591 * was flagged as the last written for that commit
592 * number. That makes this orphan node, out of date.
595 ubifs_err("out of order commit number %llu in orphan node at %d:%d",
596 cmt_no, sleb->lnum, snod->offs);
597 ubifs_dump_node(c, snod->node);
600 dbg_rcvry("out of date LEB %d", sleb->lnum);
608 n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3;
609 for (i = 0; i < n; i++) {
610 inum = le64_to_cpu(orph->inos[i]);
611 dbg_rcvry("deleting orphaned inode %lu",
612 (unsigned long)inum);
613 err = ubifs_tnc_remove_ino(c, inum);
616 err = insert_dead_orphan(c, inum);
621 *last_cmt_no = cmt_no;
622 if (le64_to_cpu(orph->cmt_no) & (1ULL << 63)) {
623 dbg_rcvry("last orph node for commit %llu at %d:%d",
624 cmt_no, sleb->lnum, snod->offs);
634 * kill_orphans - remove all orphan inodes from the index.
635 * @c: UBIFS file-system description object
637 * If recovery is required, then orphan inodes recorded during the previous
638 * session (which ended with an unclean unmount) must be deleted from the index.
639 * This is done by updating the TNC, but since the index is not updated until
640 * the next commit, the LEBs where the orphan information is recorded are not
641 * erased until the next commit.
643 static int kill_orphans(struct ubifs_info *c)
645 unsigned long long last_cmt_no = 0;
646 int lnum, err = 0, outofdate = 0, last_flagged = 0;
648 c->ohead_lnum = c->orph_first;
650 /* Check no-orphans flag and skip this if no orphans */
652 dbg_rcvry("no orphans");
656 * Orph nodes always start at c->orph_first and are written to each
657 * successive LEB in turn. Generally unused LEBs will have been unmapped
658 * but may contain out of date orphan nodes if the unmap didn't go
659 * through. In addition, the last orphan node written for each commit is
660 * marked (top bit of orph->cmt_no is set to 1). It is possible that
661 * there are orphan nodes from the next commit (i.e. the commit did not
662 * complete successfully). In that case, no orphans will have been lost
663 * due to the way that orphans are written, and any orphans added will
664 * be valid orphans anyway and so can be deleted.
666 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
667 struct ubifs_scan_leb *sleb;
669 dbg_rcvry("LEB %d", lnum);
670 sleb = ubifs_scan(c, lnum, 0, c->sbuf, 1);
672 if (PTR_ERR(sleb) == -EUCLEAN)
673 sleb = ubifs_recover_leb(c, lnum, 0,
680 err = do_kill_orphans(c, sleb, &last_cmt_no, &outofdate,
682 if (err || outofdate) {
683 ubifs_scan_destroy(sleb);
687 c->ohead_lnum = lnum;
688 c->ohead_offs = sleb->endpt;
690 ubifs_scan_destroy(sleb);
696 * ubifs_mount_orphans - delete orphan inodes and erase LEBs that recorded them.
697 * @c: UBIFS file-system description object
698 * @unclean: indicates recovery from unclean unmount
699 * @read_only: indicates read only mount
701 * This function is called when mounting to erase orphans from the previous
702 * session. If UBIFS was not unmounted cleanly, then the inodes recorded as
703 * orphans are deleted.
705 int ubifs_mount_orphans(struct ubifs_info *c, int unclean, int read_only)
709 c->max_orphans = tot_avail_orphs(c);
712 c->orph_buf = vmalloc(c->leb_size);
718 err = kill_orphans(c);
720 err = ubifs_clear_orphans(c);
726 * Everything below is related to debugging.
729 struct check_orphan {
735 unsigned long last_ino;
736 unsigned long tot_inos;
737 unsigned long missing;
738 unsigned long long leaf_cnt;
739 struct ubifs_ino_node *node;
743 static int dbg_find_orphan(struct ubifs_info *c, ino_t inum)
745 struct ubifs_orphan *o;
748 spin_lock(&c->orphan_lock);
749 p = c->orph_tree.rb_node;
751 o = rb_entry(p, struct ubifs_orphan, rb);
754 else if (inum > o->inum)
757 spin_unlock(&c->orphan_lock);
761 spin_unlock(&c->orphan_lock);
765 static int dbg_ins_check_orphan(struct rb_root *root, ino_t inum)
767 struct check_orphan *orphan, *o;
768 struct rb_node **p, *parent = NULL;
770 orphan = kzalloc(sizeof(struct check_orphan), GFP_NOFS);
778 o = rb_entry(parent, struct check_orphan, rb);
781 else if (inum > o->inum)
788 rb_link_node(&orphan->rb, parent, p);
789 rb_insert_color(&orphan->rb, root);
793 static int dbg_find_check_orphan(struct rb_root *root, ino_t inum)
795 struct check_orphan *o;
800 o = rb_entry(p, struct check_orphan, rb);
803 else if (inum > o->inum)
811 static void dbg_free_check_tree(struct rb_root *root)
813 struct rb_node *this = root->rb_node;
814 struct check_orphan *o;
818 this = this->rb_left;
820 } else if (this->rb_right) {
821 this = this->rb_right;
824 o = rb_entry(this, struct check_orphan, rb);
825 this = rb_parent(this);
827 if (this->rb_left == &o->rb)
828 this->rb_left = NULL;
830 this->rb_right = NULL;
836 static int dbg_orphan_check(struct ubifs_info *c, struct ubifs_zbranch *zbr,
839 struct check_info *ci = priv;
843 inum = key_inum(c, &zbr->key);
844 if (inum != ci->last_ino) {
845 /* Lowest node type is the inode node, so it comes first */
846 if (key_type(c, &zbr->key) != UBIFS_INO_KEY)
847 ubifs_err("found orphan node ino %lu, type %d",
848 (unsigned long)inum, key_type(c, &zbr->key));
851 err = ubifs_tnc_read_node(c, zbr, ci->node);
853 ubifs_err("node read failed, error %d", err);
856 if (ci->node->nlink == 0)
857 /* Must be recorded as an orphan */
858 if (!dbg_find_check_orphan(&ci->root, inum) &&
859 !dbg_find_orphan(c, inum)) {
860 ubifs_err("missing orphan, ino %lu",
861 (unsigned long)inum);
869 static int dbg_read_orphans(struct check_info *ci, struct ubifs_scan_leb *sleb)
871 struct ubifs_scan_node *snod;
872 struct ubifs_orph_node *orph;
876 list_for_each_entry(snod, &sleb->nodes, list) {
878 if (snod->type != UBIFS_ORPH_NODE)
881 n = (le32_to_cpu(orph->ch.len) - UBIFS_ORPH_NODE_SZ) >> 3;
882 for (i = 0; i < n; i++) {
883 inum = le64_to_cpu(orph->inos[i]);
884 err = dbg_ins_check_orphan(&ci->root, inum);
892 static int dbg_scan_orphans(struct ubifs_info *c, struct check_info *ci)
897 /* Check no-orphans flag and skip this if no orphans */
901 buf = __vmalloc(c->leb_size, GFP_NOFS, PAGE_KERNEL);
903 ubifs_err("cannot allocate memory to check orphans");
907 for (lnum = c->orph_first; lnum <= c->orph_last; lnum++) {
908 struct ubifs_scan_leb *sleb;
910 sleb = ubifs_scan(c, lnum, 0, buf, 0);
916 err = dbg_read_orphans(ci, sleb);
917 ubifs_scan_destroy(sleb);
926 static int dbg_check_orphans(struct ubifs_info *c)
928 struct check_info ci;
931 if (!dbg_is_chk_orph(c))
939 ci.node = kmalloc(UBIFS_MAX_INO_NODE_SZ, GFP_NOFS);
941 ubifs_err("out of memory");
945 err = dbg_scan_orphans(c, &ci);
949 err = dbg_walk_index(c, &dbg_orphan_check, NULL, &ci);
951 ubifs_err("cannot scan TNC, error %d", err);
956 ubifs_err("%lu missing orphan(s)", ci.missing);
961 dbg_cmt("last inode number is %lu", ci.last_ino);
962 dbg_cmt("total number of inodes is %lu", ci.tot_inos);
963 dbg_cmt("total number of leaf nodes is %llu", ci.leaf_cnt);
966 dbg_free_check_tree(&ci.root);