Deleted Added
full compact
dir.h (143978) dir.h (144020)
1/*-
2 * Copyright (c) 1988, 1989, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
4 * Copyright (c) 1988, 1989 by Adam de Boor
5 * Copyright (c) 1989 by Berkeley Softworks
6 * All rights reserved.
7 *
8 * This code is derived from software contributed to Berkeley by

--- 23 unchanged lines hidden (view full) ---

32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * SUCH DAMAGE.
38 *
39 * @(#)dir.h 8.2 (Berkeley) 4/28/95
1/*-
2 * Copyright (c) 1988, 1989, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
4 * Copyright (c) 1988, 1989 by Adam de Boor
5 * Copyright (c) 1989 by Berkeley Softworks
6 * All rights reserved.
7 *
8 * This code is derived from software contributed to Berkeley by

--- 23 unchanged lines hidden (view full) ---

32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * SUCH DAMAGE.
38 *
39 * @(#)dir.h 8.2 (Berkeley) 4/28/95
40 * $FreeBSD: head/usr.bin/make/dir.h 143978 2005-03-22 12:54:46Z harti $
40 * $FreeBSD: head/usr.bin/make/dir.h 144020 2005-03-23 12:56:15Z harti $
41 */
42
43#ifndef dir_h_6002e3b8
44#define dir_h_6002e3b8
45
41 */
42
43#ifndef dir_h_6002e3b8
44#define dir_h_6002e3b8
45
46#include <sys/queue.h>
46#include "hash.h"
47
48struct GNode;
49struct Lst;
47#include "hash.h"
48
49struct GNode;
50struct Lst;
51struct Dir;
50
52
53struct PathElement;
54TAILQ_HEAD(Path, PathElement);
55
51void Dir_Init(void);
52void Dir_InitDot(void);
53Boolean Dir_HasWildcards(const char *);
56void Dir_Init(void);
57void Dir_InitDot(void);
58Boolean Dir_HasWildcards(const char *);
54void Dir_Expand(char *, struct Lst *, struct Lst *);
55char *Dir_FindFile(char *, struct Lst *);
56int Dir_MTime(struct GNode *);
59int Dir_MTime(struct GNode *);
57void Dir_AddDir(struct Lst *, const char *);
58char *Dir_MakeFlags(const char *, const struct Lst *);
59void Dir_ClearPath(struct Lst *);
60void Dir_Concat(struct Lst *, struct Lst *);
61void Dir_PrintDirectories(void);
60void Dir_PrintDirectories(void);
62void Dir_PrintPath(const struct Lst *);
63void Dir_Destroy(void *);
64void *Dir_CopyDir(void *);
65
61
62struct Dir *Path_AddDir(struct Path *, const char *);
63void Path_Clear(struct Path *);
64void Path_Concat(struct Path *, const struct Path *);
65void Path_Duplicate(struct Path *, const struct Path *);
66void Path_Expand(char *, struct Path *, struct Lst *);
67char *Path_FindFile(char *, struct Path *);
68char *Path_MakeFlags(const char *, const struct Path *);
69void Path_Print(const struct Path *);
70
66#endif /* dir_h_6002e3b8 */
71#endif /* dir_h_6002e3b8 */