1da2e3ebdSchin /***********************************************************************
2da2e3ebdSchin *                                                                      *
3da2e3ebdSchin *               This software is part of the ast package               *
4*b30d1939SAndy Fiddaman *          Copyright (c) 1985-2011 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 Bell Laboratories
26da2e3ebdSchin  *
27da2e3ebdSchin  * in place replace of first occurrence of /match/ with /replace/ in path
28da2e3ebdSchin  * end of path returned
29da2e3ebdSchin  */
30da2e3ebdSchin 
31*b30d1939SAndy Fiddaman #define _AST_API_H	1
32*b30d1939SAndy Fiddaman 
33da2e3ebdSchin #include <ast.h>
34da2e3ebdSchin 
35da2e3ebdSchin char*
pathrepl(char * path,const char * match,const char * replace)36*b30d1939SAndy Fiddaman pathrepl(char* path, const char* match, const char* replace)
37*b30d1939SAndy Fiddaman {
38*b30d1939SAndy Fiddaman 	return pathrepl_20100601(path, PATH_MAX, match, replace);
39*b30d1939SAndy Fiddaman }
40*b30d1939SAndy Fiddaman 
41*b30d1939SAndy Fiddaman #undef	_AST_API_H
42*b30d1939SAndy Fiddaman 
43*b30d1939SAndy Fiddaman #include <ast_api.h>
44*b30d1939SAndy Fiddaman 
45*b30d1939SAndy Fiddaman char*
pathrepl_20100601(register char * path,size_t size,const char * match,register const char * replace)46*b30d1939SAndy Fiddaman pathrepl_20100601(register char* path, size_t size, const char* match, register const char* replace)
47da2e3ebdSchin {
48da2e3ebdSchin 	register const char*	m = match;
49da2e3ebdSchin 	register const char*	r;
50da2e3ebdSchin 	char*			t;
51da2e3ebdSchin 
52*b30d1939SAndy Fiddaman 	if (!match)
53*b30d1939SAndy Fiddaman 		match = "";
54*b30d1939SAndy Fiddaman 	if (!replace)
55*b30d1939SAndy Fiddaman 		replace = "";
56da2e3ebdSchin 	if (streq(match, replace))
57da2e3ebdSchin 		return(path + strlen(path));
58*b30d1939SAndy Fiddaman 	if (!size)
59*b30d1939SAndy Fiddaman 		size = strlen(path) + 1;
60da2e3ebdSchin 	for (;;)
61da2e3ebdSchin 	{
62da2e3ebdSchin 		while (*path && *path++ != '/');
63da2e3ebdSchin 		if (!*path) break;
64da2e3ebdSchin 		if (*path == *m)
65da2e3ebdSchin 		{
66da2e3ebdSchin 			t = path;
67da2e3ebdSchin 			while (*m && *m++ == *path) path++;
68da2e3ebdSchin 			if (!*m && *path == '/')
69da2e3ebdSchin 			{
70da2e3ebdSchin 				register char*	p;
71da2e3ebdSchin 
72da2e3ebdSchin 				p = t;
73da2e3ebdSchin 				r = replace;
74da2e3ebdSchin 				while (p < path && *r) *p++ = *r++;
75da2e3ebdSchin 				if (p < path) while (*p++ = *path++);
76da2e3ebdSchin 				else if (*r && p >= path)
77da2e3ebdSchin 				{
78da2e3ebdSchin 					register char*	u;
79da2e3ebdSchin 
80da2e3ebdSchin 					t = path + strlen(path);
81da2e3ebdSchin 					u = t + strlen(r);
82da2e3ebdSchin 					while (t >= path) *u-- = *t--;
83da2e3ebdSchin 					while (*r) *p++ = *r++;
84da2e3ebdSchin 				}
85da2e3ebdSchin 				else p += strlen(p) + 1;
86da2e3ebdSchin 				return(p - 1);
87da2e3ebdSchin 			}
88da2e3ebdSchin 			path = t;
89da2e3ebdSchin 			m = match;
90da2e3ebdSchin 		}
91da2e3ebdSchin 	}
92da2e3ebdSchin 	return(path);
93da2e3ebdSchin }
94