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 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97
|
/* $Id: pathgetlink.c,v 1.1.1.1 2004/12/23 04:04:21 ellson Exp $ $Revision: 1.1.1.1 $ */
/* vim:set shiftwidth=4 ts=8: */
/**********************************************************
* This software is part of the graphviz package *
* http://www.graphviz.org/ *
* *
* Copyright (c) 1994-2004 AT&T Corp. *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Corp. *
* *
* Information and Software Systems Research *
* AT&T Research, Florham Park NJ *
**********************************************************/
/*
* Glenn Fowler
* AT&T Bell Laboratories
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "errno.h"
#ifdef UNIV_MAX
#include <ctype.h>
#endif
#ifdef HAVE_UNISTD_H
# include <unistd.h>
#endif
/*
* return external representation for symbolic link text of name in buf
* the link text string length is returned
*/
int pathgetlink(const char *name, char *buf, int siz)
{
int n;
if ((n = readlink(name, buf, siz)) < 0)
return (-1);
if (n >= siz) {
errno = EINVAL;
return (-1);
}
buf[n] = 0;
#ifdef UNIV_MAX
if (isspace(*buf)) {
register char *s;
register char *t;
register char *u;
register char *v;
int match = 0;
char tmp[PATH_MAX];
s = buf;
t = tmp;
while (isalnum(*++s) || *s == '_' || *s == '.');
if (*s++) {
for (;;) {
if (!*s || isspace(*s)) {
if (match) {
*t = 0;
n = t - tmp;
strcpy(buf, tmp);
}
break;
}
if (t >= &tmp[sizeof(tmp)])
break;
*t++ = *s++;
if (!match && t < &tmp[sizeof(tmp) - univ_size + 1])
for (n = 0; n < UNIV_MAX; n++) {
if (*(v = s - 1) == *(u = univ_name[n])) {
while (*u && *v++ == *u)
u++;
if (!*u) {
match = 1;
strcpy(t - 1, univ_cond);
t += univ_size - 1;
s = v;
break;
}
}
}
}
}
}
#endif
return (n);
}
|