2 * Copyright (c) 2008, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
18 dirpool_create(Dirpool *dp)
20 memset(dp, 0, sizeof(*dp));
24 dirpool_make_dirtraverse(Dirpool *dp)
26 Id parent, i, *dirtraverse;
29 dp->dirs = sat_extend_resize(dp->dirs, dp->ndirs, sizeof(Id), DIR_BLOCK);
30 dirtraverse = sat_calloc_block(dp->ndirs, sizeof(Id), DIR_BLOCK);
31 for (parent = 0, i = 0; i < dp->ndirs; i++)
35 parent = -dp->dirs[i];
36 dirtraverse[i] = dirtraverse[parent];
37 dirtraverse[parent] = i + 1;
39 dp->dirtraverse = dirtraverse;
43 dirpool_add_dir(Dirpool *dp, Id parent, Id comp, int create)
45 Id did, d, ds, *dirtraverse;
50 dp->dirs = sat_extend_resize(dp->dirs, dp->ndirs, sizeof(Id), DIR_BLOCK);
52 dp->dirs[1] = 1; /* "" */
54 if (parent == 0 && comp == 1)
57 dirpool_make_dirtraverse(dp);
58 dirtraverse = dp->dirtraverse;
59 ds = dirtraverse[parent];
62 /* ds: first component in this block
63 * ds-1: parent link */
64 for (d = ds--; d < dp->ndirs; d++)
66 if (dp->dirs[d] == comp)
72 ds = dp->dirtraverse[ds];
76 /* a new one, find last parent */
77 for (did = dp->ndirs - 1; did > 0; did--)
78 if (dp->dirs[did] <= 0)
80 if (dp->dirs[did] != -parent)
82 /* make room for parent entry */
83 dp->dirs = sat_extend(dp->dirs, dp->ndirs, 1, sizeof(Id), DIR_BLOCK);
84 dp->dirtraverse = sat_extend(dp->dirtraverse, dp->ndirs, 1, sizeof(Id), DIR_BLOCK);
85 /* new parent block, link in */
86 dp->dirs[dp->ndirs] = -parent;
87 dp->dirtraverse[dp->ndirs] = dp->dirtraverse[parent];
88 dp->dirtraverse[parent] = ++dp->ndirs;
90 /* make room for new entry */
91 dp->dirs = sat_extend(dp->dirs, dp->ndirs, 1, sizeof(Id), DIR_BLOCK);
92 dp->dirtraverse = sat_extend(dp->dirtraverse, dp->ndirs, 1, sizeof(Id), DIR_BLOCK);
93 dp->dirs[dp->ndirs] = comp;
94 dp->dirtraverse[dp->ndirs] = 0;