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