1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
|
/*
* Copyright 2008-2013 Various Authors
* Copyright 2004 Timo Hirvonen
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, see <http://www.gnu.org/licenses/>.
*/
#ifndef CMUS_LOAD_DIR_H
#define CMUS_LOAD_DIR_H
#include <sys/stat.h>
#include <stdlib.h>
#include <dirent.h>
struct directory {
DIR *d;
int len;
/* we need stat information for symlink targets */
int is_link;
/* stat() information. ie. for the symlink target */
struct stat st;
char path[1024];
};
int dir_open(struct directory *dir, const char *name);
void dir_close(struct directory *dir);
const char *dir_read(struct directory *dir);
struct ptr_array {
/* allocated with malloc(). contains pointers */
void *ptrs;
int alloc;
int count;
};
/* ptr_array.ptrs is either char ** or struct dir_entry ** */
struct dir_entry {
mode_t mode;
char name[];
};
#define PTR_ARRAY(name) struct ptr_array name = { NULL, 0, 0 }
void ptr_array_add(struct ptr_array *array, void *ptr);
static inline void ptr_array_plug(struct ptr_array *array)
{
ptr_array_add(array, NULL);
array->count--;
}
static inline void ptr_array_sort(struct ptr_array *array,
int (*cmp)(const void *a, const void *b))
{
int count = array->count;
if (count)
qsort(array->ptrs, count, sizeof(void *), cmp);
}
static inline void ptr_array_unique(struct ptr_array *array,
int (*cmp)(const void *a, const void *b))
{
void **ptrs = array->ptrs;
int i, j = 0;
for (i = 1; i < array->count; i++) {
if (cmp(&ptrs[i-1], &ptrs[i]) != 0)
ptrs[j++] = ptrs[i];
}
array->count = j;
}
static inline void ptr_array_clear(struct ptr_array *array)
{
void **ptrs = array->ptrs;
for (int i = 0; i != array->count; i++) {
free(ptrs[i]);
}
free(ptrs);
array->ptrs = NULL;
array->alloc = 0;
array->count = 0;
}
#endif
|
