static str_list_type
dir_list_search_list P3C(str_llist_type *, dirs, const_string*, names,
boolean, search_all)
{
str_llist_elt_type *elt;
str_list_type ret;
unsigned allocated = INIT_ALLOC;
string potential = XTALLOC(allocated, char);
ret = str_list_init ();
for (elt = *dirs; elt; elt = STR_LLIST_NEXT(*elt)) {
const_string dir = STR_LLIST (*elt);
unsigned dir_len = strlen (dir);
int i;
for (i = 0; names[i]; i++) {
const_string name = names[i];
unsigned name_len;
/* Don't bother with absolute & explicit relative. */
if (kpse_absolute_p(name, true))
continue;
name_len = strlen(name);
while (dir_len + name_len + 1 > allocated) {
allocated += allocated;
XRETALLOC (potential, allocated, char);
}
strcpy (potential, dir);
strcat (potential+dir_len, name);
if (kpse_readable_file (potential)) {
str_list_add (&ret, potential);
/* Move this element towards the top of the list. */
str_llist_float (dirs, elt);
/* If caller only wanted one file returned, no need to
terminate the list with NULL; the caller knows to only look
at the first element. */
if (!search_all)
return ret;
/* Start new filename. */
allocated = INIT_ALLOC;
potential = XTALLOC(allocated, char);
}
}
}
/* If we get here, either we didn't find any files, or we were finding
all the files. But we're done with the last filename, anyway. */
free (potential);
return ret;
}
/* ... */
static void expand_append P3C(str_list_type*, partial,
const_string, text, const_string, p)
{
string new_string;
unsigned len;
str_list_type tmp;
tmp = str_list_init();
len = p - text;
new_string = (string)xmalloc(len+1);
strncpy(new_string, text, len);
new_string[len]=0;
str_list_add(&tmp, new_string);
str_list_concat_elements(partial, tmp);
}
static str_list_type brace_expand P1C(const_string *, text)
{
str_list_type result, partial, recurse;
const_string p;
result = str_list_init();
partial = str_list_init();
for (p = *text; *p && *p != '}'; ++p) {
/* FIXME: Should be IS_ENV_SEP(*p) */
if (*p == ENV_SEP || *p == ',') {
expand_append(&partial, *text, p);
str_list_concat(&result, partial);
str_list_free(&partial);
*text = p+1;
partial = str_list_init();
} else if (*p == '{') {
expand_append(&partial, *text, p);
++p;
recurse = brace_expand(&p);
str_list_concat_elements(&partial, recurse);
str_list_free(&recurse);
/* Check for missing closing brace. */
if (*p != '}') {
WARNING1 ("%s: Unmatched {", *text);
}
*text = p+1;
} else if (*p == '$') {
/* Skip ${VAR} */
if (*(p+1) == '{')
for (p+=2; *p!='}';++p);
}
}
expand_append(&partial, *text, p);
str_list_concat(&result, partial);
str_list_free(&partial);
*text = p;
return result;
}
static str_list_type
absolute_search P1C(string, name)
{
str_list_type ret_list;
string found = kpse_readable_file (name);
/* Some old compilers can't initialize structs. */
ret_list = str_list_init ();
/* If NAME wasn't found, free the expansion. */
if (name != found)
free (name);
/* Add `found' to the return list even if it's null; that tells
the caller we didn't find anything. */
str_list_add (&ret_list, found);
return ret_list;
}
hash_lookup P2C(hash_table_type, table, const_string, key)
{
hash_element_type *p;
str_list_type ret;
unsigned n = hash (table, key);
ret = str_list_init ();
/* Look at everything in this bucket. */
for (p = table.buckets[n]; p != NULL; p = p->next)
if (FILESTRCASEEQ (key, p->key))
/* Cast because the general str_list_type shouldn't force const data. */
str_list_add (&ret, (string) p->value);
/* If we found anything, mark end of list with null. */
if (STR_LIST (ret))
str_list_add (&ret, NULL);
#ifdef KPSE_DEBUG
if (KPSE_DEBUG_P (KPSE_DEBUG_HASH))
{
DEBUGF1 ("hash_lookup(%s) =>", key);
if (!STR_LIST (ret))
fputs (" (nil)\n", stderr);
else
{
string *r;
for (r = STR_LIST (ret); *r; r++)
{
putc (' ', stderr);
if (kpse_debug_hash_lookup_int)
fprintf (stderr, "%ld", (long) *r);
else
fputs (*r, stderr);
}
putc ('\n', stderr);
}
fflush (stderr);
}
#endif
return STR_LIST (ret);
}
search_list P4C(const_string, path, const_string*, names,
boolean, must_exist, boolean, all)
{
str_list_type ret_list;
const_string* namep;
string elt;
boolean done = false;
#ifdef __DJGPP__
/* We will use `stat' heavily, so let's request for
the fastest possible version of `stat', by telling
it what members of struct stat do we really need.
We need to set this on each call because this is a
library function; the caller might need other options
from `stat'. Thus save the flags and restore them
before exit.
This call tells `stat' that we do NOT need to recognize
executable files (neither by an extension nor by a magic
signature); that we do NOT need time stamp of root directories;
and that we do NOT need the write access bit in st_mode.
Note that `kpse_set_progname' needs the EXEC bits,
but it was already called by the time we get here. */
unsigned short save_djgpp_flags = _djstat_flags;
_djstat_flags = _STAT_EXEC_MAGIC | _STAT_EXEC_EXT
| _STAT_ROOT_TIME | _STAT_WRITEBIT;
#endif
ret_list = str_list_init();
if (KPSE_DEBUG_P (KPSE_DEBUG_SEARCH)) {
DEBUGF1 ("start search(files=[%s", *names);
for (namep = names+1; *namep != NULL; namep++) {
fputc(' ', stderr);
fputs(*namep, stderr);
}
fprintf (stderr, "], must_exist=%d, find_all=%d, path=%s).\n",
must_exist, all, path);
}
/* No need to do any expansion on names. */
for (namep = names; *namep; namep++) {
if (kpse_absolute_p(*namep, true) && kpse_readable_file(*namep)) {
str_list_add(&ret_list, xstrdup(*namep));
/* I know, I know... */
goto out;
}
}
/* Look at each path element in turn. */
for (elt = kpse_path_element (path); !done && elt;
elt = kpse_path_element (NULL))
{
str_list_type *found;
boolean allow_disk_search = true;
if (elt[0] == '!' && elt[1] == '!') {
/* !! magic -> disallow disk searches. */
allow_disk_search = false;
elt += 2;
}
/* See elt-dirs.c for side effects of this function. */
kpse_normalize_path(elt);
/* Try ls-R, unless we're searching for texmf.cnf. */
found = first_search ? NULL : kpse_db_search_list(names, elt, all);
/* Search the filesystem if (1) the path spec allows it, and either
(2a) we are searching for texmf.cnf ; or
(2b) no db exists; or
(2c) no db's are relevant to this elt; or
(3) MUST_EXIST && NAME was not in the db.
In (2*), `found' will be NULL.
In (3), `found' will be an empty list. */
if (allow_disk_search && (!found || (must_exist && !STR_LIST(*found)))) {
str_llist_type *dirs = kpse_element_dirs (elt);
if (dirs && *dirs) {
if (!found)
found = XTALLOC1 (str_list_type);
*found = dir_list_search_list (dirs, names, all);
}
}
/* Did we find anything? */
if (found && STR_LIST (*found)) {
if (all) {
str_list_concat (&ret_list, *found);
} else {
str_list_add (&ret_list, STR_LIST_ELT (*found, 0));
done = true;
}
}
}
out:
if (STR_LIST_LENGTH (ret_list) == 0
|| (all && STR_LIST_LAST_ELT (ret_list) != NULL))
str_list_add (&ret_list, NULL);
if (first_search) {
first_search = false;
} else {
/* Record the filenames we found, if desired. And wrap them in a
debugging line if we're doing that. */
if (KPSE_DEBUG_P (KPSE_DEBUG_SEARCH)) {
DEBUGF1 ("search([%s", *names);
for (namep = names+1; *namep != NULL; namep++) {
fputc(' ', stderr);
fputs(*namep, stderr);
}
fputs ("]) =>", stderr);
}
log_search (ret_list);
if (KPSE_DEBUG_P (KPSE_DEBUG_SEARCH))
putc ('\n', stderr);
}
#ifdef __DJGPP__
/* Undo any side effects. */
_djstat_flags = save_djgpp_flags;
#endif
return STR_LIST (ret_list);
}
static str_list_type
path_search P4C(const_string, path, string, name,
boolean, must_exist, boolean, all)
{
string elt;
str_list_type ret_list;
boolean done = false;
ret_list = str_list_init (); /* some compilers lack struct initialization */
for (elt = kpse_path_element (path); !done && elt;
elt = kpse_path_element (NULL)) {
str_list_type *found;
boolean allow_disk_search = true;
if (*elt == '!' && *(elt + 1) == '!') {
/* Those magic leading chars in a path element means don't search the
disk for this elt. And move past the magic to get to the name. */
allow_disk_search = false;
elt += 2;
}
/* See elt-dirs.c for side effects of this function */
kpse_normalize_path(elt);
/* Try ls-R, unless we're searching for texmf.cnf. Our caller
(search), also tests first_search, and does the resetting. */
found = first_search ? NULL : kpse_db_search (name, elt, all);
/* Search the filesystem if (1) the path spec allows it, and either
(2a) we are searching for texmf.cnf ; or
(2b) no db exists; or
(2c) no db's are relevant to this elt; or
(3) MUST_EXIST && NAME was not in the db.
In (2*), `found' will be NULL.
In (3), `found' will be an empty list. */
if (allow_disk_search && (!found || (must_exist && !STR_LIST (*found)))) {
str_llist_type *dirs = kpse_element_dirs (elt);
if (dirs && *dirs) {
if (!found)
found = XTALLOC1 (str_list_type);
*found = dir_list_search (dirs, name, all);
}
}
/* Did we find anything anywhere? */
if (found && STR_LIST (*found))
if (all)
str_list_concat (&ret_list, *found);
else {
str_list_add (&ret_list, STR_LIST_ELT (*found, 0));
done = true;
}
/* Free the list space, if any (but not the elements). */
if (found) {
str_list_free (found);
free (found);
}
}
/* Free the expanded name we were passed. It can't be in the return
list, since the path directories got unconditionally prepended. */
free (name);
return ret_list;
}
void remove_data_files_and_list(pkg_t * pkg)
{
str_list_t installed_dirs;
str_list_t *installed_files;
str_list_elt_t *iter;
char *file_name;
conffile_t *conffile;
int removed_a_dir;
pkg_t *owner;
int rootdirlen = 0;
int r;
installed_files = pkg_get_installed_files(pkg);
if (installed_files == NULL) {
opkg_msg(ERROR,
"Failed to determine installed "
"files for %s. None removed.\n", pkg->name);
return;
}
str_list_init(&installed_dirs);
/* don't include trailing slash */
if (opkg_config->offline_root)
rootdirlen = strlen(opkg_config->offline_root);
for (iter = str_list_first(installed_files); iter;
iter = str_list_next(installed_files, iter)) {
file_name = (char *)iter->data;
owner = file_hash_get_file_owner(file_name);
if (owner != pkg)
/* File may have been claimed by another package. */
continue;
if (!file_is_symlink(file_name) && file_is_dir(file_name)) {
str_list_append(&installed_dirs, file_name);
continue;
}
conffile = pkg_get_conffile(pkg, file_name + rootdirlen);
if (conffile) {
if (conffile_has_been_modified(conffile)) {
opkg_msg(NOTICE, "Not deleting modified conffile %s.\n",
file_name);
continue;
}
}
if (!opkg_config->noaction) {
opkg_msg(INFO, "Deleting %s.\n", file_name);
unlink(file_name);
} else
opkg_msg(INFO, "Not deleting %s. (noaction)\n", file_name);
file_hash_remove(file_name);
}
/* Remove empty directories */
if (!opkg_config->noaction) {
do {
removed_a_dir = 0;
for (iter = str_list_first(&installed_dirs); iter;
iter = str_list_next(&installed_dirs, iter)) {
file_name = (char *)iter->data;
r = rmdir(file_name);
if (r == 0) {
opkg_msg(INFO, "Deleting %s.\n", file_name);
removed_a_dir = 1;
str_list_remove(&installed_dirs, &iter);
}
}
} while (removed_a_dir);
}
pkg_free_installed_files(pkg);
pkg_remove_installed_files_list(pkg);
/* Don't print warning for dirs that are provided by other packages */
for (iter = str_list_first(&installed_dirs); iter;
iter = str_list_next(&installed_dirs, iter)) {
file_name = (char *)iter->data;
owner = file_hash_get_file_owner(file_name);
if (owner) {
free(iter->data);
iter->data = NULL;
str_list_remove(&installed_dirs, &iter);
}
}
/* cleanup */
while (!void_list_empty(&installed_dirs)) {
iter = str_list_pop(&installed_dirs);
free(iter->data);
free(iter);
}
str_list_deinit(&installed_dirs);
}
str_list_type *
kpathsea_db_search_list (kpathsea kpse, string* names,
const_string path_elt, boolean all)
{
const_string *db_dirs, *orig_dirs;
const_string last_slash, name, path;
string temp_str = NULL;
boolean done;
unsigned e;
const_string *aliases, *r;
int n;
str_list_type *ret = NULL;
boolean relevant = false;
/* If we failed to build the database (or if this is the recursive
call to build the db path), quit. */
if (kpse->db.buckets == NULL)
return NULL;
/* Don't bother doing any lookups if this `path_elt' isn't covered by
any of database directories. We do this not so much because the
extra couple of hash lookups matter -- they don't -- but rather
because we want to return NULL in this case, so path_search can
know to do a disk search. */
for (e = 0; !relevant && e < STR_LIST_LENGTH (kpse->db_dir_list); e++) {
relevant = elt_in_db (STR_LIST_ELT (kpse->db_dir_list, e), path_elt);
}
if (!relevant)
return NULL;
done = false;
ret = XTALLOC1 (str_list_type);
*ret = str_list_init ();
/* Handle each name. */
for (n = 0; !done && names[n]; n++) {
name = names[n];
/* Absolute names should have been caught in our caller. */
if (kpathsea_absolute_p(kpse, name, true))
continue;
/* When tex-glyph.c calls us looking for, e.g., dpi600/cmr10.pk, we
won't find it unless we change NAME to just `cmr10.pk' and append
`/dpi600' to PATH_ELT. We are justified in using a literal `/'
here, since that's what tex-glyph.c unconditionally uses in
DPI_BITMAP_SPEC. But don't do anything if the / begins NAME; that
should never happen. */
last_slash = strrchr (name, '/');
if (last_slash && last_slash != name) {
unsigned len = last_slash - name + 1;
string dir_part = (string)xmalloc (len);
strncpy (dir_part, name, len - 1);
dir_part[len - 1] = 0;
path = temp_str = concat3 (path_elt, "/", dir_part);
name = last_slash + 1;
free (dir_part);
} else {
path = path_elt;
}
/* If we have aliases for this name, use them. */
if (kpse->alias_db.buckets)
aliases = hash_lookup (kpse->alias_db, name);
else
aliases = NULL;
if (!aliases) {
aliases = XTALLOC1 (const_string);
aliases[0] = NULL;
}
{ /* Push aliases up by one and insert the original name at front. */
unsigned i;
unsigned len = 1; /* Have NULL element already allocated. */
for (r = aliases; *r; r++)
len++;
aliases = (const_string *) xrealloc ((void *) aliases,
(len + 1) * sizeof(const_string));
for (i = len; i > 0; i--) {
aliases[i] = aliases[i - 1];
}
aliases[0] = name;
}
for (r = aliases; !done && *r; r++) {
const_string ctry = *r;
/* We have an ls-R db. Look up `try'. */
orig_dirs = db_dirs = hash_lookup (kpse->db, ctry);
/* For each filename found, see if it matches the path element. For
example, if we have .../cx/cmr10.300pk and .../ricoh/cmr10.300pk,
and the path looks like .../cx, we don't want the ricoh file. */
while (!done && db_dirs && *db_dirs) {
string db_file = concat (*db_dirs, ctry);
boolean matched = match (db_file, path);
#ifdef KPSE_DEBUG
if (KPATHSEA_DEBUG_P (KPSE_DEBUG_SEARCH))
DEBUGF3 ("db:match(%s,%s) = %d\n", db_file, path, matched);
#endif
/* We got a hit in the database. Now see if the file actually
exists, possibly under an alias. */
if (matched) {
string found = NULL;
if (kpathsea_readable_file (kpse, db_file)) {
found = db_file;
} else {
const_string *a;
free (db_file); /* `db_file' wasn't on disk. */
/* The hit in the DB doesn't exist in disk. Now try all its
aliases. For example, suppose we have a hierarchy on CD,
thus `mf.bas', but ls-R contains `mf.base'. Find it anyway.
Could probably work around this with aliases, but
this is pretty easy and shouldn't hurt. The upshot is that
if one of the aliases actually exists, we use that. */
for (a = aliases + 1; *a && !found; a++) {
string atry = concat (*db_dirs, *a);
if (kpathsea_readable_file (kpse, atry))
found = atry;
else
free (atry);
}
}
/* If we have a real file, add it to the list, maybe done. */
if (found) {
str_list_add (ret, found);
if (!all && found)
done = true;
}
} else { /* no match in the db */
free (db_file);
}
/* On to the next directory, if any. */
db_dirs++;
}
/* This is just the space for the pointers, not the strings. */
if (orig_dirs && *orig_dirs)
free (orig_dirs);
}
free ((void *) aliases);
if (temp_str)
free (temp_str);
}
return ret;
}
void
kpathsea_init_db (kpathsea kpse)
{
const_string db_path;
string *db_files;
string *orig_db_files;
str_list_type unique_list;
int dbi;
boolean ok = false;
assert (sizeof(DB_NAME) == sizeof(DB_NAME_LC));
db_path = kpathsea_init_format (kpse, kpse_db_format);
db_files = kpathsea_path_search_list_generic (kpse, db_path, db_names,
true, true);
orig_db_files = db_files;
/* Mac OS X and others can use a case-insensitive, case-preserving
filesystem by default, in which case ls-R and ls-r point to the
same file. Also, Windows is case-insensitive. In these cases,
we want to avoid reading the same file multiple times. */
dbi = 0;
unique_list = str_list_init ();
while (db_files[dbi] != NULL) {
string path1 = db_files[dbi];
string path2 = db_files[dbi + 1];
/* first-pass check in case path1/path2 aren't even
potentially equal; mainly in case the order from
kpathsea_path_search_list_generic changes. */
if (path2
&& strcasecmp (path1, path2) == 0
&& same_file_p (path1, path2)) {
/* they are the same, skip over path1, we'll add path2
on the next iteration (when it's path1). */
#ifdef KPSE_DEBUG
if (KPATHSEA_DEBUG_P (KPSE_DEBUG_HASH)) {
DEBUGF2 ("db:init(): skipping db same_file_p %s, will add %s.\n",
path1, path2);
}
#endif
free (path1);
} else {
/* they are not the same, add path1. */
#ifdef KPSE_DEBUG
if (KPATHSEA_DEBUG_P (KPSE_DEBUG_HASH)) {
DEBUGF1 ("db:init(): using db file %s.\n", path1);
}
#endif
str_list_add (&unique_list, path1);
}
/* could be more clever and increment by two, but then would
have to avoid jumping off the end of db_files */
dbi++;
}
/* always add a NULL terminator. */
str_list_add (&unique_list, NULL);
free (orig_db_files);
db_files = STR_LIST (unique_list);
orig_db_files = db_files;
/* Must do this after the path searching (which ends up calling
kpse_db_search recursively), so kpse->db.buckets stays NULL. */
kpse->db = hash_create (DB_HASH_SIZE);
while (db_files && *db_files) {
if (db_build (kpse, &(kpse->db), *db_files))
ok = true;
free (*db_files);
db_files++;
}
if (!ok) {
/* If db can't be built, leave `size' nonzero (so we don't
rebuild it), but clear `buckets' (so we don't look in it). */
free (kpse->db.buckets);
kpse->db.buckets = NULL;
}
free (orig_db_files);
/* Add the content of any alias databases. There may exist more than
one alias file along DB_NAME files. This duplicates the above code
-- should be a function. */
ok = false;
db_files = kpathsea_all_path_search (kpse, db_path, ALIAS_NAME);
orig_db_files = db_files;
kpse->alias_db = hash_create (ALIAS_HASH_SIZE);
while (db_files && *db_files) {
if (alias_build (kpse, &(kpse->alias_db), *db_files))
ok = true;
free (*db_files);
db_files++;
}
if (!ok) {
free (kpse->alias_db.buckets);
kpse->alias_db.buckets = NULL;
}
free (orig_db_files);
}
