| dir.h (144020) | dir.h (201526) |
|---|---|
| 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 144020 2005-03-23 12:56:15Z harti $ | 40 * $FreeBSD: head/usr.bin/make/dir.h 201526 2010-01-04 18:57:22Z obrien $ |
| 41 */ 42 43#ifndef dir_h_6002e3b8 44#define dir_h_6002e3b8 45 46#include <sys/queue.h> 47#include "hash.h" 48 49struct GNode; 50struct Lst; 51struct Dir; 52 53struct PathElement; 54TAILQ_HEAD(Path, PathElement); 55 56void Dir_Init(void); 57void Dir_InitDot(void); 58Boolean Dir_HasWildcards(const char *); | 41 */ 42 43#ifndef dir_h_6002e3b8 44#define dir_h_6002e3b8 45 46#include <sys/queue.h> 47#include "hash.h" 48 49struct GNode; 50struct Lst; 51struct Dir; 52 53struct PathElement; 54TAILQ_HEAD(Path, PathElement); 55 56void Dir_Init(void); 57void Dir_InitDot(void); 58Boolean Dir_HasWildcards(const char *); |
| 59int Dir_FindHereOrAbove(char *, char *, char *, int); |
|
| 59int Dir_MTime(struct GNode *); 60void Dir_PrintDirectories(void); 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 71#endif /* dir_h_6002e3b8 */ | 60int Dir_MTime(struct GNode *); 61void Dir_PrintDirectories(void); 62 63struct Dir *Path_AddDir(struct Path *, const char *); 64void Path_Clear(struct Path *); 65void Path_Concat(struct Path *, const struct Path *); 66void Path_Duplicate(struct Path *, const struct Path *); 67void Path_Expand(char *, struct Path *, struct Lst *); 68char *Path_FindFile(char *, struct Path *); 69char *Path_MakeFlags(const char *, const struct Path *); 70void Path_Print(const struct Path *); 71 72#endif /* dir_h_6002e3b8 */ |