1da2e3ebdSchin /*********************************************************************** 2da2e3ebdSchin * * 3da2e3ebdSchin * This software is part of the ast package * 4*3e14f97fSRoger A. Faulkner * Copyright (c) 1985-2010 AT&T Intellectual Property * 5da2e3ebdSchin * and is licensed under the * 6da2e3ebdSchin * Common Public License, Version 1.0 * 77c2fbfb3SApril Chin * by AT&T Intellectual Property * 8da2e3ebdSchin * * 9da2e3ebdSchin * A copy of the License is available at * 10da2e3ebdSchin * http://www.opensource.org/licenses/cpl1.0.txt * 11da2e3ebdSchin * (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) * 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 31da2e3ebdSchin #include <ast.h> 32da2e3ebdSchin 33da2e3ebdSchin char* pathrepl(register char * path,const char * match,register const char * replace)34da2e3ebdSchinpathrepl(register char* path, const char* match, register const char* replace) 35da2e3ebdSchin { 36da2e3ebdSchin register const char* m = match; 37da2e3ebdSchin register const char* r; 38da2e3ebdSchin char* t; 39da2e3ebdSchin 40da2e3ebdSchin if (!match) match = ""; 41da2e3ebdSchin if (!replace) replace = ""; 42da2e3ebdSchin if (streq(match, replace)) 43da2e3ebdSchin return(path + strlen(path)); 44da2e3ebdSchin for (;;) 45da2e3ebdSchin { 46da2e3ebdSchin while (*path && *path++ != '/'); 47da2e3ebdSchin if (!*path) break; 48da2e3ebdSchin if (*path == *m) 49da2e3ebdSchin { 50da2e3ebdSchin t = path; 51da2e3ebdSchin while (*m && *m++ == *path) path++; 52da2e3ebdSchin if (!*m && *path == '/') 53da2e3ebdSchin { 54da2e3ebdSchin register char* p; 55da2e3ebdSchin 56da2e3ebdSchin p = t; 57da2e3ebdSchin r = replace; 58da2e3ebdSchin while (p < path && *r) *p++ = *r++; 59da2e3ebdSchin if (p < path) while (*p++ = *path++); 60da2e3ebdSchin else if (*r && p >= path) 61da2e3ebdSchin { 62da2e3ebdSchin register char* u; 63da2e3ebdSchin 64da2e3ebdSchin t = path + strlen(path); 65da2e3ebdSchin u = t + strlen(r); 66da2e3ebdSchin while (t >= path) *u-- = *t--; 67da2e3ebdSchin while (*r) *p++ = *r++; 68da2e3ebdSchin } 69da2e3ebdSchin else p += strlen(p) + 1; 70da2e3ebdSchin return(p - 1); 71da2e3ebdSchin } 72da2e3ebdSchin path = t; 73da2e3ebdSchin m = match; 74da2e3ebdSchin } 75da2e3ebdSchin } 76da2e3ebdSchin return(path); 77da2e3ebdSchin } 78