2 * Copyright (C) 1994-1995, Index Data I/S
4 * Sebastian Hammer, Adam Dickmeiss
7 * Revision 1.5 1995-09-06 16:11:16 adam
8 * Option: only one word key per file.
10 * Revision 1.4 1995/09/04 12:33:41 adam
11 * Various cleanup. YAZ util used instead.
13 * Revision 1.3 1995/09/01 14:06:35 adam
14 * Split of work into more files.
16 * Revision 1.2 1995/09/01 10:57:07 adam
19 * Revision 1.1 1995/09/01 10:34:51 adam
28 #include <sys/types.h>
35 struct dir_entry *dir_open (const char *rep)
39 size_t entry_max = 20;
41 struct dir_entry *entry;
43 logf (LOG_LOG, "dir_open %s", rep);
44 if (!(dir = opendir(rep)))
46 logf (LOG_WARN|LOG_ERRNO, "opendir %s", rep);
51 if (!(entry = malloc (sizeof(*entry) * entry_max)))
53 logf (LOG_FATAL|LOG_ERRNO, "malloc");
56 while ((dent = readdir (dir)))
58 if (strcmp (dent->d_name, ".") == 0 ||
59 strcmp (dent->d_name, "..") == 0)
61 if (idx == entry_max-1)
63 struct dir_entry *entry_n;
65 if (!(entry_n = malloc (sizeof(*entry) * (entry_max + 100))))
67 logf (LOG_FATAL|LOG_ERRNO, "malloc");
70 memcpy (entry_n, entry, idx * sizeof(*entry));
75 if (!(entry[idx].name = malloc (strlen(dent->d_name)+1)))
77 logf (LOG_FATAL|LOG_ERRNO, "malloc");
80 strcpy (entry[idx].name, dent->d_name);
83 entry[idx].name = NULL;
88 static int dir_cmp (const void *p1, const void *p2)
90 return strcmp (((struct dir_entry *) p1)->name,
91 ((struct dir_entry *) p2)->name);
94 void dir_sort (struct dir_entry *e)
99 qsort (e, nmemb, sizeof(*e), dir_cmp);
102 void dir_free (struct dir_entry **e_p)
105 struct dir_entry *e = *e_p;