1da2e3ebdSchin /***********************************************************************
2da2e3ebdSchin *                                                                      *
3da2e3ebdSchin *               This software is part of the ast package               *
4*b30d1939SAndy Fiddaman *          Copyright (c) 1985-2012 AT&T Intellectual Property          *
5da2e3ebdSchin *                      and is licensed under the                       *
6*b30d1939SAndy Fiddaman *                 Eclipse Public License, Version 1.0                  *
77c2fbfb3SApril Chin *                    by AT&T Intellectual Property                     *
8da2e3ebdSchin *                                                                      *
9da2e3ebdSchin *                A copy of the License is available at                 *
10*b30d1939SAndy Fiddaman *          http://www.eclipse.org/org/documents/epl-v10.html           *
11*b30d1939SAndy Fiddaman *         (with md5 checksum b35adb5213ca9657e911e9befb180842)         *
12da2e3ebdSchin *                                                                      *
13da2e3ebdSchin *              Information and Software Systems Research               *
14da2e3ebdSchin *                            AT&T Research                             *
15da2e3ebdSchin *                           Florham Park NJ                            *
16da2e3ebdSchin *                                                                      *
17da2e3ebdSchin *                 Glenn Fowler <gsf@research.att.com>                  *
18da2e3ebdSchin *                  David Korn <dgk@research.att.com>                   *
19da2e3ebdSchin *                   Phong Vo <kpv@research.att.com>                    *
20da2e3ebdSchin *                                                                      *
21da2e3ebdSchin ***********************************************************************/
22da2e3ebdSchin #pragma prototyped
23da2e3ebdSchin /*
24da2e3ebdSchin  * Glenn Fowler
25da2e3ebdSchin  * AT&T Research
26da2e3ebdSchin  *
27da2e3ebdSchin  * return full path to p with mode access using $PATH
28da2e3ebdSchin  * a!=0 enables related root search
29da2e3ebdSchin  * a!=0 && a!="" searches a dir first
30da2e3ebdSchin  * the related root must have a bin subdir
31da2e3ebdSchin  * p==0 sets the cached relative dir to a
32da2e3ebdSchin  * full path returned in path buffer
33da2e3ebdSchin  * if path==0 then the space is malloc'd
34da2e3ebdSchin  */
35da2e3ebdSchin 
36*b30d1939SAndy Fiddaman #define _AST_API_H	1
37*b30d1939SAndy Fiddaman 
38da2e3ebdSchin #include <ast.h>
39da2e3ebdSchin 
40da2e3ebdSchin char*
pathpath(char * path,const char * p,const char * a,int mode)41*b30d1939SAndy Fiddaman pathpath(char* path, const char* p, const char* a, int mode)
42*b30d1939SAndy Fiddaman {
43*b30d1939SAndy Fiddaman 	return pathpath_20100601(p, a, mode, path, PATH_MAX);
44*b30d1939SAndy Fiddaman }
45*b30d1939SAndy Fiddaman 
46*b30d1939SAndy Fiddaman #undef	_AST_API_H
47*b30d1939SAndy Fiddaman 
48*b30d1939SAndy Fiddaman #include <ast_api.h>
49*b30d1939SAndy Fiddaman 
50*b30d1939SAndy Fiddaman char*
pathpath_20100601(const char * p,const char * a,int mode,register char * path,size_t size)51*b30d1939SAndy Fiddaman pathpath_20100601(const char* p, const char* a, int mode, register char* path, size_t size)
52da2e3ebdSchin {
53da2e3ebdSchin 	register char*	s;
54da2e3ebdSchin 	char*		x;
55da2e3ebdSchin 	char		buf[PATH_MAX];
56da2e3ebdSchin 
57da2e3ebdSchin 	static char*	cmd;
58da2e3ebdSchin 
59da2e3ebdSchin 	if (!path)
60*b30d1939SAndy Fiddaman 	{
61da2e3ebdSchin 		path = buf;
62*b30d1939SAndy Fiddaman 		if (!size || size > sizeof(buf))
63*b30d1939SAndy Fiddaman 			size = sizeof(buf);
64*b30d1939SAndy Fiddaman 	}
65da2e3ebdSchin 	if (!p)
66da2e3ebdSchin 	{
67da2e3ebdSchin 		if (cmd)
68da2e3ebdSchin 			free(cmd);
69da2e3ebdSchin 		cmd = a ? strdup(a) : (char*)0;
70da2e3ebdSchin 		return 0;
71da2e3ebdSchin 	}
72*b30d1939SAndy Fiddaman 	if (strlen(p) < size)
73da2e3ebdSchin 	{
74da2e3ebdSchin 		strcpy(path, p);
75da2e3ebdSchin 		if (pathexists(path, mode))
76da2e3ebdSchin 		{
77da2e3ebdSchin 			if (*p != '/' && (mode & PATH_ABSOLUTE))
78da2e3ebdSchin 			{
79da2e3ebdSchin 				getcwd(buf, sizeof(buf));
80da2e3ebdSchin 				s = buf + strlen(buf);
81da2e3ebdSchin 				sfsprintf(s, sizeof(buf) - (s - buf), "/%s", p);
82da2e3ebdSchin 				if (path != buf)
83da2e3ebdSchin 					strcpy(path, buf);
84da2e3ebdSchin 			}
85da2e3ebdSchin 			return (path == buf) ? strdup(path) : path;
86da2e3ebdSchin 		}
87da2e3ebdSchin 	}
88da2e3ebdSchin 	if (*p == '/')
89da2e3ebdSchin 		a = 0;
90da2e3ebdSchin 	else if (s = (char*)a)
91da2e3ebdSchin 	{
92da2e3ebdSchin 		x = s;
93da2e3ebdSchin 		if (strchr(p, '/'))
94da2e3ebdSchin 		{
95da2e3ebdSchin 			a = p;
96da2e3ebdSchin 			p = "..";
97da2e3ebdSchin 		}
98da2e3ebdSchin 		else
99da2e3ebdSchin 			a = 0;
100da2e3ebdSchin 		if ((!cmd || *cmd) && (strchr(s, '/') || (s = cmd)))
101da2e3ebdSchin 		{
102da2e3ebdSchin 			if (!cmd && *s == '/')
103da2e3ebdSchin 				cmd = strdup(s);
104da2e3ebdSchin 			if (strlen(s) < (sizeof(buf) - 6))
105da2e3ebdSchin 			{
106da2e3ebdSchin 				s = strcopy(path, s);
107da2e3ebdSchin 				for (;;)
108da2e3ebdSchin 				{
109da2e3ebdSchin 					do if (s <= path) goto normal; while (*--s == '/');
110da2e3ebdSchin 					do if (s <= path) goto normal; while (*--s != '/');
111da2e3ebdSchin 					strcpy(s + 1, "bin");
112da2e3ebdSchin 					if (pathexists(path, PATH_EXECUTE))
113da2e3ebdSchin 					{
114*b30d1939SAndy Fiddaman 						if (s = pathaccess(path, p, a, mode, path, size))
115da2e3ebdSchin 							return path == buf ? strdup(s) : s;
116da2e3ebdSchin 						goto normal;
117da2e3ebdSchin 					}
118da2e3ebdSchin 				}
119da2e3ebdSchin 			normal: ;
120da2e3ebdSchin 			}
121da2e3ebdSchin 		}
122da2e3ebdSchin 	}
123da2e3ebdSchin 	x = !a && strchr(p, '/') ? "" : pathbin();
124*b30d1939SAndy Fiddaman 	if (!(s = pathaccess(x, p, a, mode, path, size)) && !*x && (x = getenv("FPATH")))
125*b30d1939SAndy Fiddaman 		s = pathaccess(x, p, a, mode, path, size);
126da2e3ebdSchin 	return (s && path == buf) ? strdup(s) : s;
127da2e3ebdSchin }
128