1/***********************************************************************
2*                                                                      *
3*               This software is part of the ast package               *
4*          Copyright (c) 1985-2010 AT&T Intellectual Property          *
5*                      and is licensed under the                       *
6*                  Common Public License, Version 1.0                  *
7*                    by AT&T Intellectual Property                     *
8*                                                                      *
9*                A copy of the License is available at                 *
10*            http://www.opensource.org/licenses/cpl1.0.txt             *
11*         (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9)         *
12*                                                                      *
13*              Information and Software Systems Research               *
14*                            AT&T Research                             *
15*                           Florham Park NJ                            *
16*                                                                      *
17*                 Glenn Fowler <gsf@research.att.com>                  *
18*                  David Korn <dgk@research.att.com>                   *
19*                   Phong Vo <kpv@research.att.com>                    *
20*                                                                      *
21***********************************************************************/
22#pragma prototyped
23/*
24* Glenn Fowler
25* AT&T Bell Laboratories
26*/
27
28#include "univlib.h"
29
30/*
31 * create symbolic name from external representation text in buf
32 * the arg order matches link(2)
33 */
34
35int
36pathsetlink(const char* buf, const char* name)
37{
38	register char*	t = (char*)buf;
39#ifdef UNIV_MAX
40	register char*	s = (char*)buf;
41	register char*	v;
42	int		n;
43	char		tmp[PATH_MAX];
44
45	while (*s)
46	{
47		if (*s++ == univ_cond[0] && !strncmp(s - 1, univ_cond, univ_size))
48		{
49			s--;
50			t = tmp;
51			for (n = 0; n < UNIV_MAX; n++)
52				if (*univ_name[n])
53			{
54				*t++ = ' ';
55#ifdef ATT_UNIV
56				*t++ = '1' + n;
57				*t++ = ':';
58#else
59				for (v = univ_name[n]; *t = *v++; t++);
60				*t++ = '%';
61#endif
62				for (v = (char*)buf; v < s; *t++ = *v++);
63				for (v = univ_name[n]; *t = *v++; t++);
64				for (v = s + univ_size; *t = *v++; t++);
65			}
66			t = tmp;
67			break;
68		}
69	}
70#endif
71	return(symlink(t, name));
72}
73