2 * Copyright (c) 2008, Novell Inc.
4 * This program is licensed under the BSD license, read LICENSE.BSD
5 * for further information
18 dirpool_init(Dirpool *dp)
20 memset(dp, 0, sizeof(*dp));
24 dirpool_free(Dirpool *dp)
27 sat_free(dp->dirtraverse);
31 dirpool_make_dirtraverse(Dirpool *dp)
33 Id parent, i, *dirtraverse;
36 dp->dirs = sat_extend_resize(dp->dirs, dp->ndirs, sizeof(Id), DIR_BLOCK);
37 dirtraverse = sat_calloc_block(dp->ndirs, sizeof(Id), DIR_BLOCK);
38 for (parent = 0, i = 0; i < dp->ndirs; i++)
42 parent = -dp->dirs[i];
43 dirtraverse[i] = dirtraverse[parent];
44 dirtraverse[parent] = i + 1;
46 dp->dirtraverse = dirtraverse;
50 dirpool_add_dir(Dirpool *dp, Id parent, Id comp, int create)
52 Id did, d, ds, *dirtraverse;
59 dp->dirs = sat_extend_resize(dp->dirs, dp->ndirs, sizeof(Id), DIR_BLOCK);
61 dp->dirs[1] = 1; /* "" */
63 if (parent == 0 && comp == 1)
66 dirpool_make_dirtraverse(dp);
67 dirtraverse = dp->dirtraverse;
68 ds = dirtraverse[parent];
71 /* ds: first component in this block
72 * ds-1: parent link */
73 for (d = ds--; d < dp->ndirs; d++)
75 if (dp->dirs[d] == comp)
81 ds = dp->dirtraverse[ds];
85 /* a new one, find last parent */
86 for (did = dp->ndirs - 1; did > 0; did--)
87 if (dp->dirs[did] <= 0)
89 if (dp->dirs[did] != -parent)
91 /* make room for parent entry */
92 dp->dirs = sat_extend(dp->dirs, dp->ndirs, 1, sizeof(Id), DIR_BLOCK);
93 dp->dirtraverse = sat_extend(dp->dirtraverse, dp->ndirs, 1, sizeof(Id), DIR_BLOCK);
94 /* new parent block, link in */
95 dp->dirs[dp->ndirs] = -parent;
96 dp->dirtraverse[dp->ndirs] = dp->dirtraverse[parent];
97 dp->dirtraverse[parent] = ++dp->ndirs;
99 /* make room for new entry */
100 dp->dirs = sat_extend(dp->dirs, dp->ndirs, 1, sizeof(Id), DIR_BLOCK);
101 dp->dirtraverse = sat_extend(dp->dirtraverse, dp->ndirs, 1, sizeof(Id), DIR_BLOCK);
102 dp->dirs[dp->ndirs] = comp;
103 dp->dirtraverse[dp->ndirs] = 0;