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 28da2e3ebdSchin #include "univlib.h" 29da2e3ebdSchin 30da2e3ebdSchin /* 31da2e3ebdSchin * create symbolic name from external representation text in buf 32da2e3ebdSchin * the arg order matches link(2) 33da2e3ebdSchin */ 34da2e3ebdSchin 35da2e3ebdSchin int pathsetlink(const char * buf,const char * name)36da2e3ebdSchinpathsetlink(const char* buf, const char* name) 37da2e3ebdSchin { 38da2e3ebdSchin register char* t = (char*)buf; 39da2e3ebdSchin #ifdef UNIV_MAX 40da2e3ebdSchin register char* s = (char*)buf; 41da2e3ebdSchin register char* v; 42da2e3ebdSchin int n; 43da2e3ebdSchin char tmp[PATH_MAX]; 44da2e3ebdSchin 45da2e3ebdSchin while (*s) 46da2e3ebdSchin { 47da2e3ebdSchin if (*s++ == univ_cond[0] && !strncmp(s - 1, univ_cond, univ_size)) 48da2e3ebdSchin { 49da2e3ebdSchin s--; 50da2e3ebdSchin t = tmp; 51da2e3ebdSchin for (n = 0; n < UNIV_MAX; n++) 52da2e3ebdSchin if (*univ_name[n]) 53da2e3ebdSchin { 54da2e3ebdSchin *t++ = ' '; 55da2e3ebdSchin #ifdef ATT_UNIV 56da2e3ebdSchin *t++ = '1' + n; 57da2e3ebdSchin *t++ = ':'; 58da2e3ebdSchin #else 59da2e3ebdSchin for (v = univ_name[n]; *t = *v++; t++); 60da2e3ebdSchin *t++ = '%'; 61da2e3ebdSchin #endif 62da2e3ebdSchin for (v = (char*)buf; v < s; *t++ = *v++); 63da2e3ebdSchin for (v = univ_name[n]; *t = *v++; t++); 64da2e3ebdSchin for (v = s + univ_size; *t = *v++; t++); 65da2e3ebdSchin } 66da2e3ebdSchin t = tmp; 67da2e3ebdSchin break; 68da2e3ebdSchin } 69da2e3ebdSchin } 70da2e3ebdSchin #endif 71da2e3ebdSchin return(symlink(t, name)); 72da2e3ebdSchin } 73