[llvm-commits] CVS: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/Makefile aquery.c archie.c archie.h atalloc.c copyright.h dirsend.c get_pauth.c get_vdir.c patchlevel.h pauthent.h pcompat.h perrmesg.c perrno.h pfs.h pmachine.h pprot.h procquery.c ptalloc.c rdgram.h regex.c regex.h stcopy.c support.c vl_comp.c vlalloc.c vms.h
Chris Lattner
lattner at cs.uiuc.edu
Tue Oct 5 11:20:09 PDT 2004
Changes in directory llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client:
Makefile added (r1.1)
aquery.c added (r1.1)
archie.c added (r1.1)
archie.h added (r1.1)
atalloc.c added (r1.1)
copyright.h added (r1.1)
dirsend.c added (r1.1)
get_pauth.c added (r1.1)
get_vdir.c added (r1.1)
patchlevel.h added (r1.1)
pauthent.h added (r1.1)
pcompat.h added (r1.1)
perrmesg.c added (r1.1)
perrno.h added (r1.1)
pfs.h added (r1.1)
pmachine.h added (r1.1)
pprot.h added (r1.1)
procquery.c added (r1.1)
ptalloc.c added (r1.1)
rdgram.h added (r1.1)
regex.c added (r1.1)
regex.h added (r1.1)
stcopy.c added (r1.1)
support.c added (r1.1)
vl_comp.c added (r1.1)
vlalloc.c added (r1.1)
vms.h added (r1.1)
---
Log message:
New "Benchmark". Of course running it just prints usage info, but whatever.
---
Diffs of the changes: (+5517 -0)
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/Makefile
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/Makefile:1.1
*** /dev/null Tue Oct 5 13:20:08 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/Makefile Tue Oct 5 13:19:57 2004
***************
*** 0 ****
--- 1,5 ----
+ LEVEL = ../../../..
+
+ PROG = archie
+ include $(LEVEL)/MultiSource/Makefile.multisrc
+
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/aquery.c
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/aquery.c:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/aquery.c Tue Oct 5 13:19:57 2004
***************
*** 0 ****
--- 1,257 ----
+ /*
+ * aquery.c : Programmatic Prospero interface to Archie
+ *
+ * Copyright (c) 1991 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ *
+ * Originally part of the Prospero Archie client by Clifford
+ * Neuman (bcn at isi.edu). Modifications, addition of programmatic interface,
+ * and new sorting code by George Ferguson (ferguson at cs.rochester.edu)
+ * and Brendan Kehoe (brendan at cs.widener.edu). MSDOS and OS2 modifications
+ * to use with PC/TCP by Mark Towfiq (towfiq at FTP.COM).
+ *
+ * v1.2.1 - 11/19/91 (mmt) - added MSDOS & OS2 stuff
+ * v1.2.0 - 09/17/91 (bpk) - added BULL & USG stuff, thanks to Jim Sillas
+ * v1.1.3 - 08/30/91 (bpk) - cast index()
+ * v1.1.2 - 08/20/91 (bcn) - make it do it properly (new invdatecmplink)
+ * v1.1.1 - 08/20/91 (bpk) - made sorting go inverted as we purport it does
+ */
+ #include <copyright.h>
+
+ #include <stdio.h>
+
+ #include <pfs.h>
+ #include <perrno.h>
+ #include <archie.h>
+
+ #include <pmachine.h>
+ #ifdef NEED_STRING_H
+ # include <string.h> /* for char *index() */
+ #else
+ # include <strings.h> /* for char *index() */
+ #endif
+
+ static void translateArchieResponse();
+
+ extern int pwarn;
+ extern char p_warn_string[];
+
+ /*
+ * archie_query : Sends a request to _host_, telling it to search for
+ * _string_ using _query_type_ as the search method.
+ * No more than _max_hits_ matches are to be returned
+ * skipping over _offset_ matches.
+ *
+ * archie_query returns a linked list of virtual links.
+ * If _flags_ does not include AQ_NOTRANS, then the Archie
+ * responses will be translated. If _flags_ does not include
+ * AQ_NOSORT, then the list will be sorted using _cmp_proc_ to
+ * compare pairs of links. If _cmp_proc_ is NULL or AQ_DEFCMP,
+ * then the default comparison procedure, defcmplink(), is used
+ * sorting by host, then filename. If cmp_proc is AQ_INVDATECMP
+ * then invdatecmplink() is used, sorting inverted by date.
+ * otherwise a user-defined comparison procedure is called.
+ *
+ * archie_query returns NULL and sets perrno if the query
+ * failed. Note that it can return NULL with perrno == PSUCCESS
+ * if the query didn't fail but there were simply no matches.
+ *
+ * query_type: S Substring search ignoring case
+ * C Substring search with case significant
+ * R Regular expression search
+ * = Exact String Match
+ * s,c,e Tries exact match first and falls back to S, C, or R
+ * if not found.
+ *
+ * cmp_proc: AQ_DEFCMP Sort by host, then filename
+ * AQ_INVDATECMP Sort inverted by date
+ *
+ * flags: AQ_NOSORT Don't sort results
+ * AQ_NOTRANS Don't translate results
+ */
+
+ extern void bzero(char *b,int length);
+ extern int get_vdir(char *dhost,char *dfile,char *components,VDIR1 dir,
+ long flags,VLINK filters,char *acomp);
+
+ VLINK archie_query(char *host,char *string,int max_hits,int offset,
+ char query_type,int (*cmp_proc)(),int flags)
+ {
+ char qstring[MAX_VPATH]; /* For construting the query */
+ VLINK links; /* Matches returned by server */
+ VDIR_ST dir_st; /* Filled in by get_vdir */
+ VDIR1 dir= &dir_st;
+
+ VLINK p,q,r,lowest,nextp,pnext,pprev;
+ int tmp;
+
+ /* Set the cmp_proc if not given */
+ if (cmp_proc == NULL) cmp_proc = defcmplink;
+
+ /* Make the query string */
+ sprintf(qstring,"ARCHIE/MATCH(%d,%d,%c)/%s",
+ max_hits,offset,query_type,string);
+
+ /* Initialize Prospero structures */
+ perrno = PSUCCESS; *p_err_string = '\0';
+ pwarn = PNOWARN; *p_warn_string = '\0';
+ vdir_init(dir);
+
+ /* Retrieve the list of matches, return error if there was one */
+ #if defined(MSDOS)
+ if(tmp = get_vdir(host, qstring, "", dir, (long)GVD_ATTRIB|GVD_NOSORT,
+ NULL, NULL)) {
+ #else
+ if((tmp = get_vdir(host,qstring,"",dir,GVD_ATTRIB|GVD_NOSORT,NULL,NULL))) {
+ # endif
+ perrno = tmp;
+ return(NULL);
+ }
+
+ /* Save the links, and clear in dir in case it's used again */
+ links = dir->links; dir->links = NULL;
+
+ /* As returned, list is sorted by suffix, and conflicting */
+ /* suffixes appear on a list of "replicas". We want to */
+ /* create a one-dimensional list sorted by host then filename */
+ /* and maybe by some other parameter */
+
+ /* First flatten the doubly-linked list */
+ for (p = links; p != NULL; p = nextp) {
+ nextp = p->next;
+ if (p->replicas != NULL) {
+ p->next = p->replicas;
+ p->next->previous = p;
+ for (r = p->replicas; r->next != NULL; r = r->next)
+ /*EMPTY*/ ;
+ r->next = nextp;
+ nextp->previous = r;
+ p->replicas = NULL;
+ }
+ }
+
+ /* Translate the filenames unless NOTRANS was given */
+ if (!(flags & AQ_NOTRANS))
+ for (p = links; p != NULL; p = p->next)
+ translateArchieResponse(p);
+
+ /* If NOSORT given, then just hand it back */
+ if (flags & AQ_NOSORT) {
+ perrno = PSUCCESS;
+ return(links);
+ }
+
+ /* Otherwise sort it using a selection sort and the given cmp_proc */
+ for (p = links; p != NULL; p = nextp) {
+ nextp = p->next;
+ lowest = p;
+ for (q = p->next; q != NULL; q = q->next)
+ if ((*cmp_proc)(q,lowest) < 0)
+ lowest = q;
+ if (p != lowest) {
+ /* swap the two links */
+ pnext = p->next;
+ pprev = p->previous;
+ if (lowest->next != NULL)
+ lowest->next->previous = p;
+ p->next = lowest->next;
+ if (nextp == lowest) {
+ p->previous = lowest;
+ } else {
+ lowest->previous->next = p;
+ p->previous = lowest->previous;
+ }
+ if (nextp == lowest) {
+ lowest->next = p;
+ } else {
+ pnext->previous = lowest;
+ lowest->next = pnext;
+ }
+ if (pprev != NULL)
+ pprev->next = lowest;
+ lowest->previous = pprev;
+ /* keep the head of the list in the right place */
+ if (links == p)
+ links = lowest;
+ }
+ }
+
+ /* Return the links */
+ perrno = PSUCCESS;
+ return(links);
+ }
+
+ /*
+ * translateArchieResponse:
+ *
+ * If the given link is for an archie-pseudo directory, fix it.
+ * This is called unless AQ_NOTRANS was given to archie_query().
+ */
+ static void translateArchieResponse(VLINK l)
+ {
+ char *slash;
+
+ if (strcmp(l->type,"DIRECTORY") == 0) {
+ if (strncmp(l->filename,"ARCHIE/HOST",11) == 0) {
+ l->type = stcopyr("EXTERNAL(AFTP,DIRECTORY)",l->type);
+ l->host = stcopyr(l->filename+12,l->host);
+ /*
+ slash = (char *)index(l->host,'/');
+ */
+ slash = strchr(l->host,(int) '/');
+ if (slash) {
+ l->filename = stcopyr(slash,l->filename);
+ *slash++ = '\0';
+ } else
+ l->filename = stcopyr("",l->filename);
+ }
+ }
+ }
+
+ /*
+ * defcmplink: The default link comparison function for sorting. Compares
+ * links p and q first by host then by filename. Returns < 0 if p
+ * belongs before q, > 0 if p belongs after q, and == 0 if their
+ * host and filename fields are identical.
+ */
+
+ int defcmplink(VLINK p,VLINK q)
+ {
+ int result;
+
+ if ((result=strcmp(p->host,q->host)) != 0)
+ return(result);
+ else
+ return(strcmp(p->filename,q->filename));
+ }
+
+ /*
+ * invdatecmplink: An alternative comparison function for sorting that
+ * compares links p and q first by LAST-MODIFIED date,
+ * if they both have that attribute. If both links
+ * don't have that attribute or the dates are the
+ * same, it then calls defcmplink() and returns its
+ * value.
+ */
+
+ int invdatecmplink(VLINK p,VLINK q)
+ {
+ PATTRIB pat,qat;
+ char *pdate,*qdate;
+ int result;
+
+ pdate = qdate = NULL;
+ for (pat = p->lattrib; pat; pat = pat->next)
+ if(strcmp(pat->aname,"LAST-MODIFIED") == 0)
+ pdate = pat->value.ascii;
+ for (qat = q->lattrib; qat; qat = qat->next)
+ if(strcmp(qat->aname,"LAST-MODIFIED") == 0)
+ qdate = qat->value.ascii;
+ if(!pdate && !qdate) return(defcmplink(p,q));
+ if(!pdate) return(1);
+ if(!qdate) return(-1);
+ if((result=strcmp(qdate,pdate)) == 0) return(defcmplink(p,q));
+ else return(result);
+ }
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/archie.c
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/archie.c:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/archie.c Tue Oct 5 13:19:57 2004
***************
*** 0 ****
--- 1,290 ----
+ /*
+ * Copyright (c) 1991 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ *
+ * v1.2.1 - 11/21/91 (bkc) - added CUTCP library support for MSDOS
+ * v1.2.0 - 11/19/91 (mmt) - added MSDOS & OS2 stuff
+ * v1.1.2 - 08/27/91 (bpk) - added <pmachine.h> for index()
+ * v1.1.1 - 08/22/91 (bpk) - added 0-9 as arguments
+ */
+
+ #include <string.h>
+ #include <copyright.h>
+
+ /*
+ * Archie client using the Prospero protocol.
+ *
+ * Suggestions and improvements to Brendan Kehoe (brendan at cs.widener.edu).
+ */
+
+ #include <stdio.h>
+ #if defined(OS2)
+ # include <pctcp.h>
+ #endif
+ #ifdef MSDOS
+ # include <string.h>
+ # include <stdlib.h>
+ # ifdef CUTCP
+ # include <msdos/cutcp.h>
+ # include <msdos/hostform.h>
+ # endif
+ #endif
+
+ #include <pfs.h>
+ #include <rdgram.h>
+ #include <archie.h>
+ #include <pmachine.h>
+
+ int listflag = 0;
+ int sortflag = 0; /* 1 = by date */
+ char *progname;
+ #ifdef DEBUG
+ extern int pfs_debug;
+ #endif
+ extern int rdgram_priority;
+
+ /* To keep the code clean.. */
+ #ifdef VMS
+ # define NFLAG "\"N\""
+ # define LFLAG "\"L\""
+ # define A_EXIT SS$_NORMAL
+ #else
+ # define NFLAG "N"
+ # define LFLAG "L"
+ # define A_EXIT 1
+ #endif
+ #ifdef CUTCP
+ # define HFLAG "[H config.tel]]"
+ #else
+ # define HFLAG "]"
+ #endif
+
+ #define ARCHIE_HOST "archie.rutgers.edu"
+
+ void main(int argc,char *argv[])
+ {
+ char *cur_arg;
+ char qtype = '='; /* Default to exact string match */
+ char etype = '='; /* Type if only -e is specified */
+ int eflag = 0; /* Exact flag specified */
+ int max_hits = MAX_HITS;
+ int offset = 0;
+ int exitflag = 0; /* Display release identifier */
+ int tmp;
+ char *host = ARCHIE_HOST;
+ char *p;
+ static char *archies[] = { ARCHIES };
+ #ifdef CUTCP
+ int hostset = 0;
+ #endif
+ char *getenv();
+
+ progname = "archie";
+ argc--; argv++;
+
+ #ifdef CUTCP
+ if(getenv("CONFIGTEL"))
+ if(Shostfile(getenv("CONFIGTEL")) < 0) {
+ fprintf(stderr,"Error, couldn't open configtel file %s\n",
+ getenv("CONFIGTEL"));
+ exit(1);
+ }
+ #endif
+
+ if ((p = getenv("ARCHIE_HOST")) != (char *)NULL)
+ host = p;
+
+ while (argc > 0 && **argv == '-') {
+ cur_arg = argv[0]+1;
+
+ /* If a - by itself, or --, then no more arguments */
+ if(!*cur_arg || ((*cur_arg == '-') && (!*(cur_arg+1)))) {
+ argc--, argv++;
+ goto scandone;
+ }
+
+ while (*cur_arg) {
+ switch (*cur_arg++) {
+ #ifdef DEBUG
+ case 'D': /* Debug level */
+ pfs_debug = 1; /* Default debug level */
+ if(*cur_arg && strchr("0123456789",(int) *cur_arg)) {
+ sscanf(cur_arg,"%d",&pfs_debug);
+ cur_arg += strspn(cur_arg,"0123456789");
+ }
+ else if(argc > 2) {
+ tmp = sscanf(argv[1],"%d",&pfs_debug);
+ if (tmp == 1) {argc--;argv++;}
+ }
+ break;
+ #endif
+ #ifdef CUTCP
+ case 'H' :
+ if(Shostfile(argv[1]) < 0) {
+ fprintf(stderr,"Error, couldn't open configtel file %s\n",argv[1]);
+ exit(1);
+ }
+ argc--;argv++;
+ break;
+ #endif
+ #ifndef XARCHIE
+ case 'L':
+ printf("Known archie servers:\n");
+ for (tmp = 0; tmp < NARCHIES; tmp++)
+ printf("\t%s\n", archies[tmp]);
+ printf(" * %s is the default Archie server.\n", ARCHIE_HOST);
+ printf(" * For the most up-to-date list, write to an Archie server and give it\n the command `servers'.\n");
+ exitflag = 1;
+ break;
+ #endif
+
+ case 'N': /* Priority (nice) */
+ rdgram_priority = RDGRAM_MAX_PRI; /* Use this if no # */
+ if(*cur_arg && strchr("-0123456789",(int) *cur_arg)) {
+ sscanf(cur_arg,"%d",&rdgram_priority);
+ cur_arg += strspn(cur_arg,"-0123456789");
+ }
+ else if(argc > 2) {
+ tmp = sscanf(argv[1],"%d",&rdgram_priority);
+ if (tmp == 1) {argc--;argv++;}
+ }
+ if(rdgram_priority > RDGRAM_MAX_SPRI)
+ rdgram_priority = RDGRAM_MAX_PRI;
+ if(rdgram_priority < RDGRAM_MIN_PRI)
+ rdgram_priority = RDGRAM_MIN_PRI;
+ break;
+
+ case 'c': /* substring (case sensitive) */
+ qtype = 'C';
+ etype = 'c';
+ break;
+
+ case 'e': /* Exact match */
+ /* If -e specified by itself, then we use the */
+ /* default value of etype which must be '=' */
+ eflag++;
+ break;
+
+ case 'h': /* Host */
+ host = argv[1];
+ #ifdef CUTCP
+ hostset++;
+ #endif
+ argc--; argv++;
+ break;
+
+ case 'l': /* List one match per line */
+ listflag++;
+ break;
+
+ case '0': case '1': case '2': case '3': case '4':
+ case '5': case '6': case '7': case '8': case '9':
+ cur_arg--;
+ case 'm': /* Max hits */
+ max_hits = -1;
+ if(*cur_arg && strchr("0123456789",(int) *cur_arg)) {
+ sscanf(cur_arg,"%d",&max_hits);
+ cur_arg += strspn(cur_arg,"0123456789");
+ }
+ else if(argc > 1) {
+ tmp = sscanf(argv[1],"%d",&max_hits);
+ if (tmp == 1) {argc--;argv++;}
+ }
+ if (max_hits < 1) {
+ fprintf(stderr, "%s: -m option requires a value for max hits (>= 1)\n",
+ progname);
+ exit(A_EXIT);
+ }
+ break;
+
+ case 'o': /* Offset */
+ if(argc > 1) {
+ tmp = sscanf(argv[1],"%d",&offset);
+ if (tmp != 1)
+ argc = -1;
+ else {
+ argc--; argv++;
+ }
+ }
+ break;
+
+ case 'r': /* Regular expression search */
+ qtype = 'R';
+ etype = 'r';
+ break;
+
+ case 's': /* substring (case insensitive) */
+ qtype = 'S';
+ etype = 's';
+ break;
+
+ case 't': /* Sort inverted by date */
+ sortflag = 1;
+ break;
+
+ case 'v': /* Display version */
+ fprintf(stderr,
+ "Client version %s based upon Prospero version %s\n",
+ CLIENT_VERSION, PFS_RELEASE);
+ exitflag++;
+ break;
+
+ default:
+ fprintf(stderr,"Usage: %s [-[cers][l][t][m#][h host][%s][%s#]%s string\n", progname, LFLAG, NFLAG, HFLAG);
+ exit(A_EXIT);
+ }
+ }
+ argc--; argv++;
+ }
+
+ scandone:
+
+ if (eflag) qtype = etype;
+
+ if ((argc != 1) && exitflag) exit(0);
+
+ if (argc != 1) {
+ fprintf(stderr, "Usage: %s [-[cers][l][t][m#][h host][%s][%s#]%s string\n", progname, LFLAG, NFLAG, HFLAG);
+ fprintf(stderr," -c : case sensitive substring search\n");
+ fprintf(stderr," -e : exact string match (default)\n");
+ fprintf(stderr," -r : regular expression search\n");
+ fprintf(stderr," -s : case insensitive substring search\n");
+ fprintf(stderr," -l : list one match per line\n");
+ fprintf(stderr," -t : sort inverted by date\n");
+ fprintf(stderr," -m# : specifies maximum number of hits to return (default %d)\n", max_hits);
+ fprintf(stderr," -h host : specifies server host\n");
+ fprintf(stderr," -%s : list known servers and current default\n", LFLAG);
+ fprintf(stderr," -%s# : specifies query niceness level (0-35765)\n", NFLAG);
+ #ifdef CUTCP
+ fprintf(stderr,"-H config.tel: specify location of config.tel file\n");
+ #endif
+ exit(A_EXIT);
+ }
+
+ #ifdef CUTCP
+ if(argc = Snetinit()) {
+ fprintf(stderr,"Error %d from SNetinit (bad or missing config.tel ?)\n",argc);
+ if(argc == -2)
+ netshut(); /* rarp lookup failure */
+ exit(1);
+ }
+ if(!hostset) { /* if no host on command line, look in config.tel file
+ for name=archie */
+ struct machinfo *mp;
+
+ mp = Shostlook("archie");
+ if(mp) {
+ host = mp->hname ? mp->hname : mp->sname;
+ }
+ }
+ #endif
+
+ procquery(host, argv[0], max_hits, offset, qtype, sortflag, listflag);
+
+ #ifdef CUTCP
+ netshut();
+ #endif
+ exit(0);
+ }
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/archie.h
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/archie.h:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/archie.h Tue Oct 5 13:19:57 2004
***************
*** 0 ****
--- 1,77 ----
+ /*
+ * archie.h : Definitions for the programmatic Prospero interface to Archie
+ *
+ * Written by Brendan Kehoe (brendan at cs.widener.edu),
+ * George Ferguson (ferguson at cs.rochester.edu), and
+ * Clifford Neuman (bcn at isi.edu).
+ */
+
+ #ifdef VMS
+ /*
+ * This has to be edited if you're running VMS, cuz I gave up after about
+ * an hour trying to make DCL do /define(archie_host="\"FOO\"")
+ *
+ * Edit ARCHIE_HOST to be one of :
+ * archie.ans.net (USA [NY])
+ * archie.rutgers.edu (USA [NJ])
+ * archie.sura.net (USA [MD])
+ * archie.mcgill.ca (Canada)
+ * archie.funet.fi (Finland/Mainland Europe)
+ * archie.au (Australia)
+ * archie.doc.ic.ac.uk (Great Britain/Ireland)
+ */
+ #define ARCHIE_HOST "archie.ans.net"
+ #endif /* VMS */
+
+ /* You can't touch this. */
+ #ifndef XARCHIE
+ # define ARCHIES "archie.ans.net (USA [NY])","archie.rutgers.edu (USA [NJ])","archie.sura.net (USA [MD])","archie.mcgill.ca (Canada)","archie.funet.fi (Finland/Mainland Europe)","archie.au (Australia)","archie.doc.ic.ac.uk (Great Britain/Ireland)"
+ # define NARCHIES 7
+ #endif
+
+ /*
+ * Default value for max hits. Note that this is normally different
+ * for different client implementations. Doing so makes it easier to
+ * collect statistics on the use of the various clients.
+ */
+ #ifdef VMS
+ # define MAX_HITS 98 /* VMS Client */
+ #else
+ # ifdef XARCHIE
+ # define MAX_HITS 99 /* X Client */
+ # else
+ # define MAX_HITS 95 /* Normal client */
+ # endif
+ #endif
+
+ /*
+ * CLIENT_VERSION may be used to identify the version of the client if
+ * distributed separately from the Prospero distribution. The version
+ * command should then identify both the client version and the Prospero
+ * version identifiers.
+ */
+ #ifdef XARCHIE
+ # define CLIENT_VERSION "1.3-X"
+ #else
+ # define CLIENT_VERSION "1.3"
+ #endif
+
+ /* Procedures from user/aquery.c */
+
+ /* archie_query(host,string,max_hits,offset,query_type,cmp_proc,flags) */
+ /* extern VLINK archie_query(); */
+
+ extern VLINK archie_query(char *host,char *string,int max_hits,int offset,
+ char query_type,int (*cmp_proc)(),int flags);
+
+ /* defcmplink(p,q) and invdatecmplink(p,q) */
+ extern int defcmplink(); /* Compare by host then by filename */
+ extern int invdatecmplink(); /* Compare links inverted by date */
+
+ /* Definitions for the comparison procedures */
+ #define AQ_DEFCMP defcmplink
+ #define AQ_INVDATECMP invdatecmplink
+
+ /* Flags */
+ #define AQ_NOSORT 0x01 /* Don't sort */
+ #define AQ_NOTRANS 0x02 /* Don't translate Archie responses */
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/atalloc.c
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/atalloc.c:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/atalloc.c Tue Oct 5 13:19:57 2004
***************
*** 0 ****
--- 1,93 ----
+ /*
+ * Copyright (c) 1989, 1990 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ */
+
+ #include <copyright.h>
+ #include <stdio.h>
+ #include <stdlib.h>
+
+ #include <pfs.h>
+ #include <pmachine.h> /* for correct definition of ZERO */
+
+ static PATTRIB lfree = NULL;
+ int pattrib_count = 0;
+ int pattrib_max = 0;
+
+ extern void bzero(char *b,int length);
+
+ /*
+ * atalloc - allocate and initialize vlink structure
+ *
+ * ATALLOC returns a pointer to an initialized structure of type
+ * PATTRIB. If it is unable to allocate such a structure, it
+ * returns NULL.
+ */
+
+ PATTRIB atalloc(void)
+ {
+ PATTRIB at;
+ if(lfree) {
+ at = lfree;
+ lfree = lfree->next;
+ }
+ else {
+ at = (PATTRIB) malloc(sizeof(PATTRIB_ST));
+ if (!at) return(NULL);
+ pattrib_max++;
+ }
+
+ pattrib_count++;
+
+ ZERO(at);
+ /* Initialize and fill in default values; all items are
+ 0 [or NULL] save precedence */
+ at->precedence = ATR_PREC_OBJECT;
+
+ return(at);
+ }
+
+ /*
+ * atfree - free a PATTRIB structure
+ *
+ * ATFREE takes a pointer to a PATTRRIB structure and adds it to
+ * the free list for later reuse.
+ */
+
+ void atfree(PATTRIB at)
+ {
+ if(at->aname) stfree(at->aname);
+
+ if((strcmp(at->avtype,"ASCII") == 0) && at->value.ascii)
+ stfree(at->value.ascii);
+ if((strcmp(at->avtype,"LINK") == 0) && at->value.link)
+ vlfree(at->value.link);
+
+ if(at->avtype) stfree(at->avtype);
+
+ at->next = lfree;
+ at->previous = NULL;
+ lfree = at;
+ pattrib_count--;
+ }
+
+ /*
+ * atlfree - free a PATTRIB structure
+ *
+ * ATLFREE takes a pointer to a PATTRIB structure frees it and any linked
+ * PATTRIB structures. It is used to free an entrie list of PATTRIB
+ * structures.
+ */
+
+ void atlfree(PATTRIB at)
+ {
+ PATTRIB nxt;
+
+ while(at != NULL) {
+ nxt = at->next;
+ atfree(at);
+ at = nxt;
+ }
+ }
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/copyright.h
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/copyright.h:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/copyright.h Tue Oct 5 13:19:57 2004
***************
*** 0 ****
--- 1,20 ----
+ /*
+ Copyright (c) 1989, 1990, 1991 by the University of Washington
+
+ Permission to use, copy, modify, and distribute this software and its
+ documentation for non-commercial purposes and without fee is hereby
+ granted, provided that the above copyright notice appear in all copies
+ and that both the copyright notice and this permission notice appear in
+ supporting documentation, and that the name of the University of
+ Washington not be used in advertising or publicity pertaining to
+ distribution of the software without specific, written prior
+ permission. The University of Washington makes no representations
+ about the suitability of this software for any purpose. It is
+ provided "as is" without express or implied warranty.
+
+ Prospero was written by Clifford Neuman (bcn at isi.edu).
+
+ Questions concerning this software should be directed to
+ info-prospero at isi.edu.
+
+ */
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/dirsend.c
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/dirsend.c:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/dirsend.c Tue Oct 5 13:19:57 2004
***************
*** 0 ****
--- 1,1093 ----
+ /*
+ * Copyright (c) 1989, 1990, 1991 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ *
+ * v1.2.8 - 12/17/91 (jwb) - fixed warning message
+ * v1.2.7 - 12/13/91 (bpk) - took out XARCHIE code since we've diverged
+ * v1.2.6 - 12/13/91 (jwb) - UCX stuff
+ * v1.2.5 - 11/21/91 (bkc) - new version for CUTCP, ugly as it is.
+ * v1.2.4 - 11/19/91 (mmt) - added MSDOS & OS2 stuff
+ * v1.2.3 - 11/04/91 (bcn) - removed host comparison and replaced with check
+ * for connection id (undoes effect of v1.2.2.).
+ * v1.2.2 - 11/02/91 (gf) - removed extra inet_ntoa() calls and stuff for
+ * multi-interface nets (lmjm at doc.imperial.ac.uk)
+ * v1.2.1 - 10/20/91 (gf) - asynch implementation
+ * v1.2.0 - 09/17/91 (bpk) - added BULL & USG stuff, thanks to Jim Sillas
+ * v1.1.2 - 08/30/91 (bpk) - added VMS support
+ * v1.1.1 - 08/29/91 (bcn) - changed backoff handling
+ * v1.1.0 - 08/13/91 (gf) - added XArchie status calls
+ *
+ * gf: 20 Oct 1991:
+ * Broken into pieces so that under X dirsend() doesn't block in select()
+ * but rather uses Xt calls to allow continued event processing. If
+ * XARCHIE is not defined, can still be used since processEvent() will
+ * use select() in this case.
+ */
+
+ /* If you're going to hack on this, I'd suggest using unifdef with -UCUTCP
+ and possibly -UVMS, for your working copy. When you've got your changes
+ done, come back and add them into this main file. It's getting pretty
+ nasty down there. */
+
+ #include <copyright.h>
+ #include <stdio.h>
+ #include <stdlib.h>
+ #include <unistd.h>
+ #include <errno.h>
+
+ #ifdef VMS
+ # ifdef WOLLONGONG
+ # include "twg$tcp:[netdist.include]netdb.h"
+ # else /* not Wollongong */
+ # ifdef UCX
+ # include netdb
+ # else /* Multinet */
+ # include "multinet_root:[multinet.include]netdb.h"
+ # endif
+ # endif
+ # include <vms.h>
+ #else /* not VMS */
+ # include <sys/types.h> /* this may/will define FD_SET etc */
+ # ifdef u3b2
+ # include <sys/inet.h> /* THIS does FD_SET etc on AT&T 3b2s. */
+ # endif /* u3b2 */
+ # include <pmachine.h>
+ # if defined(NEED_TIME_H) && !defined(AUX)
+ # include <time.h>
+ # else
+ # include <sys/time.h>
+ # endif
+ # ifdef NEED_STRING_H
+ # include <string.h>
+ # else
+ # include <strings.h>
+ # endif
+ # ifdef CUTCP
+ # include <msdos/cutcp.h>
+ # include <msdos/netevent.h>
+ # include <msdos/hostform.h>
+ # else /* not CUTCP */
+ # include <netdb.h>
+ # include <sys/socket.h>
+ # endif
+ # ifdef NEED_SELECT_H
+ # include <sys/select.h>
+ # endif /* NEED_SELECT_H */
+ # ifndef IN_H
+ # include <netinet/in.h>
+ # define IN_H
+ # endif
+ # ifndef hpux
+ # include <arpa/inet.h>
+ # endif
+ #endif /* !VMS */
+
+ /* Interactive UNIX keeps some of the socket definitions in funny places. */
+ #ifdef ISC
+ # include <net/errno.h>
+ #endif /* ISC */
+
+ #include <pfs.h>
+ #include <pprot.h>
+ #include <pcompat.h>
+ #include <perrno.h>
+
+ /* Gnu C currently fails to pass structures on Sparcs properly. This directly
+ effects the calling of inet_ntoa(). To get around it, we use this hack;
+ take the address of what's being called to inet_ntoa, so it gets it
+ properly. This won't be necessary with gcc 2.0. */
+ #if defined(sun) && defined(__GNUC__) && !defined(__GNU_LIBRARY__)
+ # define SUN_GNU_FIX &
+ #else
+ # define SUN_GNU_FIX
+ #endif
+
+ static int notprived = 0;
+ #ifndef MSDOS
+ extern int errno;
+ #endif
+ extern int perrno;
+ extern int rdgram_priority;
+ #ifdef DEBUG
+ extern int pfs_debug;
+ #endif
+ extern int pfs_disable_flag;
+
+ char *nlsindex();
+
+ #define max(X, Y) ((X) > (Y) ? (X) : (Y))
+
+ static int dir_udp_port = 0; /* Remote UDP port number */
+
+ #ifdef CUTCP
+ # define NS_TIMEOUT 15
+ #endif
+
+ static unsigned short next_conn_id = 0;
+
+ static int client_dirsrv_timeout = CLIENT_DIRSRV_TIMEOUT;
+ static int client_dirsrv_retry = CLIENT_DIRSRV_RETRY;
+
+ /* These were parameters to dirsend() */
+ static PTEXT pkt;
+ static char *hostname;
+ static struct sockaddr_in *hostaddr;
+
+ /* These were locals in dirsend(). Note that the initializations here
+ * are really meaningless since we have to redo them for each call to
+ * dirsend() since they were formerly automatically initialized.
+ */
+ static PTEXT first = NULL; /* First returned packet */
+ static PTEXT next; /* The one we are waiting for */
+ static PTEXT vtmp; /* For reorganizing linked list */
+ static PTEXT comp_thru; /* We have all packets though */
+ static int lp = -1; /* Opened UDP port */
+ static int hdr_len; /* Header Length */
+ static int nd_pkts; /* Number of packets we want */
+ static int no_pkts; /* Number of packets we have */
+ static int pkt_cid; /* Packet connection identifier */
+ static unsigned short this_conn_id; /* Connection ID we are using */
+ static unsigned short recvd_thru; /* Received through */
+ static short priority; /* Priority for request */
+ static short one = 0; /* Pointer to value 1 */
+ static short zero = 0; /* Pointer to value 0 */
+ static char *seqtxt; /* Pointer to text w/ sequence # */
+ static struct sockaddr_in us; /* Our address */
+ static struct sockaddr_in to; /* Address to send query */
+ static struct sockaddr_in from; /* Reply received from */
+ static int from_sz; /* Size of from structure */
+ static struct hostent *host; /* Host info from gethostbyname */
+ static long newhostaddr; /* New host address from *host */
+ static int req_udp_port=0; /* Requested port (optional) */
+ static char *openparen; /* Delimits port in name */
+ static char hostnoport[500];/* Host name without port */
+ static int ns; /* Number of bytes actually sent */
+ static int nr; /* Number of bytes received */
+ static SELECTARG readfds; /* Used for select */
+ static int tmp;
+ static char *ctlptr; /* Pointer to control field */
+ static short stmp; /* Temp short for conversions */
+ static int backoff; /* Server requested backoff */
+ static unsigned char rdflag11; /* First byte of flags (bit vect)*/
+ static unsigned char rdflag12; /* Second byte of flags (int) */
+ static int scpflag = 0; /* Set if any sequencd cont pkts */
+ static int ackpend = 0; /* Acknowledgement pending */
+ static int gaps = 0; /* Gaps present in recvd pkts */
+ static struct timeval timeout; /* Time to wait for response */
+ static struct timeval ackwait; /* Time to wait before acking */
+ static struct timeval gapwait; /* Time to wait b4 filling gaps */
+ static struct timeval *selwait; /* Time to wait for select */
+ static int retries; /* was = client_dirsrv_retry */
+ char to_hostname[512]; /* lmjm: saves inet_ntoa() str */
+
+ /* These are added so dirsend() "blocks" properly */
+ static PTEXT dirsendReturn;
+ static int dirsendDone;
+
+ /* And here are the values for dirsendDone */
+ #define DSRET_DONE 1
+ #define DSRET_SEND_ERROR -1
+ #define DSRET_RECV_ERROR -2
+ #define DSRET_SELECT_ERROR -3
+ #define DSRET_TIMEOUT -4
+ #define DSRET_ABORTED -5
+
+ /* New procedures to break up dirsend() */
+ static int initDirsend();
+ static void retryDirsend(), keepWaitingDirsend();
+ static void timeoutProc();
+ static void readProc();
+
+ /* Wrappers around X calls to allow non-X usage */
+ static void processEvent();
+
+ /* Extra stuff for the asynchronous X version of dirsend() */
+ typedef char *XtPointer;
+ typedef char *XtInputId;
+ typedef char *XtIntervalId;
+
+ static XtInputId inputId;
+ static XtIntervalId timerId = (XtIntervalId)0;
+
+ /*
+ * dirsend - send packet and receive response
+ *
+ * DIRSEND takes a pointer to a structure of type PTEXT, a hostname,
+ * and a pointer to a host address. It then sends the supplied
+ * packet off to the directory server on the specified host. If
+ * hostaddr points to a valid address, that address is used. Otherwise,
+ * the hostname is looked up to obtain the address. If hostaddr is a
+ * non-null pointer to a 0 address, then the address will be replaced
+ * with that found in the hostname lookup.
+ *
+ * DIRSEND will wait for a response and retry an appropriate
+ * number of times as defined by timeout and retries (both static
+ * variables). It will collect however many packets form the reply, and
+ * return them in a structure (or structures) of type PTEXT.
+ *
+ * DIRSEND will free the packet that it is presented as an argument.
+ * The packet is freed even if dirsend fails.
+ */
+
+ PTEXT dirsend(PTEXT pkt_p,char *hostname_p,struct sockaddr_in *hostaddr_p)
+ {
+ /* copy parameters to globals since other routines use them */
+ pkt = pkt_p;
+ hostname = hostname_p;
+ hostaddr = hostaddr_p;
+ /* Do the initializations of formerly auto variables */
+ first = NULL;
+ lp = -1;
+ one = 0;
+ zero = 0;
+ req_udp_port=0;
+ scpflag = 0;
+ ackpend = 0;
+ gaps = 0;
+ retries = client_dirsrv_retry;
+
+ if (initDirsend() < 0)
+ return(NULL);
+
+ /* set the first timeout */
+ retryDirsend();
+
+ dirsendReturn = NULL;
+ dirsendDone = 0;
+ /* Until one of the callbacks says to return, keep processing events */
+ while (!dirsendDone)
+ processEvent();
+
+ /* Return whatever we're supposed to */
+ return(dirsendReturn);
+ }
+
+
+ /* - - - - - - - - */
+ /* This function does all the initialization that used to be done at the
+ * start of dirsend(), including opening the socket descriptor "lp". It
+ * returns the descriptor if successful, otherwise -1 to indicate that
+ * dirsend() should return NULL immediately.
+ */
+
+ static int initDirsend(void)
+ {
+ if(one == 0) one = htons((short) 1);
+
+ priority = htons(rdgram_priority);
+
+ timeout.tv_sec = client_dirsrv_timeout;
+ timeout.tv_usec = 0;
+
+ ackwait.tv_sec = 0;
+ ackwait.tv_usec = 500000;
+
+ gapwait.tv_sec = (client_dirsrv_timeout < 5 ? client_dirsrv_timeout : 5);
+ gapwait.tv_usec = 0;
+
+ comp_thru = NULL;
+ perrno = 0;
+ nd_pkts = 0;
+ no_pkts = 0;
+ pkt_cid = 0;
+
+ /* Find first connection ID */
+ if(next_conn_id == 0) {
+ srand(getpid()+time(0)); /* XXX: arg ok, but not right type. */
+ next_conn_id = rand();
+ }
+
+
+ /* If necessary, find out what udp port to send to */
+ if (dir_udp_port == 0) {
+ register struct servent *sp;
+ tmp = pfs_enable; pfs_enable = PMAP_DISABLE;
+ #ifdef USE_ASSIGNED_PORT
+ /* UCX needs 0 & -1 */
+ if ((sp = getservbyname("prospero","udp")) <= 0) {
+ #ifdef DEBUG
+ if (pfs_debug)
+ fprintf(stderr, "dirsrv: udp/prospero unknown service - using %d\n",
+ PROSPERO_PORT);
+ #endif
+ dir_udp_port = htons((u_short) PROSPERO_PORT);
+ }
+ #else
+ /* UCX needs 0 & -1 */
+ sp = getservbyname("dirsrv","udp");
+ if (sp == (struct servent *)0 || sp == (struct servent *)-1) {
+ #ifdef DEBUG
+ if (pfs_debug)
+ fprintf(stderr, "dirsrv: udp/dirsrv unknown service - using %d\n",
+ DIRSRV_PORT);
+ #endif
+ dir_udp_port = htons((unsigned short) DIRSRV_PORT);
+ }
+ #endif
+ else dir_udp_port = sp->s_port;
+ pfs_enable = tmp;
+ #ifdef DEBUG
+ if (pfs_debug > 3)
+ fprintf(stderr,"dir_udp_port is %d\n", ntohs(dir_udp_port));
+ #endif
+ }
+
+ /* If we were given the host address, then use it. Otherwise */
+ /* lookup the hostname. If we were passed a host address of */
+ /* 0, we must lookup the host name, then replace the old value */
+ if(!hostaddr || (hostaddr->sin_addr.s_addr == 0)) {
+ /* I we have a null host name, return an error */
+ if((hostname == NULL) || (*hostname == '\0')) {
+ #ifdef DEBUG
+ if (pfs_debug)
+ fprintf(stderr, "dirsrv: Null hostname specified\n");
+ #endif
+ perrno = DIRSEND_BAD_HOSTNAME;
+ ptlfree(pkt);
+ /* return(NULL); */
+ return(-1);
+ }
+ /* If a port is included, save it away */
+ if((openparen = strchr(hostname,(int) '('))) {
+ sscanf(openparen+1,"%d",&req_udp_port);
+ strncpy(hostnoport,hostname,400);
+ if((openparen - hostname) < 400) {
+ *(hostnoport + (openparen - hostname)) = '\0';
+ hostname = hostnoport;
+ }
+ }
+ tmp = pfs_enable; pfs_enable = PMAP_DISABLE;
+ if((host = gethostbyname(hostname)) == NULL) {
+ pfs_enable = tmp;
+ /* Check if a numeric address */
+ newhostaddr = inet_addr(hostname);
+ if(newhostaddr == -1) {
+ #ifdef DEBUG
+ if (pfs_debug)
+ fprintf(stderr, "dirsrv: Can't resolve host %s\n",hostname);
+ #endif
+ perrno = DIRSEND_BAD_HOSTNAME;
+ ptlfree(pkt);
+ /* return(NULL); */
+ return(-1);
+ }
+ bzero((char *)&to, S_AD_SZ);
+ to.sin_family = AF_INET;
+ bcopy(&newhostaddr,&to.sin_addr, 4);
+ if(hostaddr) bcopy(&to,hostaddr, S_AD_SZ);
+ }
+ else {
+ pfs_enable = tmp;
+ bzero((char *)&to, S_AD_SZ);
+ to.sin_family = host->h_addrtype;
+ #ifdef CUTCP
+ bcopy(&host->h_addr, &to.sin_addr, host->h_length);
+ #else
+ bcopy(host->h_addr, &to.sin_addr, host->h_length);
+ #endif
+ if(hostaddr) bcopy(&to, hostaddr, S_AD_SZ);
+ }
+ }
+ else bcopy(hostaddr, &to, S_AD_SZ);
+ /* lmjm: Save away the hostname */
+ strncpy(to_hostname,
+ inet_ntoa(/* SUN_GNU_FIX */ to.sin_addr),
+ sizeof(to_hostname)-1);
+
+ if(req_udp_port) to.sin_port = htons(req_udp_port);
+ else to.sin_port = dir_udp_port;
+
+ /* If a port was specified in hostaddr, use it, otherwise fill it in */
+ if(hostaddr) {
+ if(hostaddr->sin_port) to.sin_port = hostaddr->sin_port;
+ else hostaddr->sin_port = to.sin_port;
+ }
+
+ #ifndef CUTCP
+ /* Must open a new port each time. we do not want to see old */
+ /* responses to messages we are done with */
+ if ((lp = socket(AF_INET, SOCK_DGRAM, 0)) < 0) {
+ #ifdef DEBUG
+ if (pfs_debug)
+ fprintf(stderr,"dirsrv: Can't open socket\n");
+ #endif
+ perrno = DIRSEND_UDP_CANT;
+ ptlfree(pkt);
+ /* return(NULL); */
+ return(-1);
+ }
+ #endif /* not CUTCP */
+
+ /* Try to bind it to a privileged port - loop through candidate */
+ /* ports trying to bind. If failed, that's OK, we will let the */
+ /* system assign a non-privileged port later */
+ #ifndef CUTCP
+ if(!notprived) {
+ for(tmp = PROS_FIRST_PRIVP; tmp < PROS_FIRST_PRIVP+PROS_NUM_PRIVP;
+ tmp++) {
+ #endif
+ bzero((char *)&us, sizeof(us));
+ us.sin_family = AF_INET;
+ #ifndef CUTCP
+ us.sin_port = htons((unsigned short) tmp);
+ if (bind(lp, (struct sockaddr *)&us, sizeof(us))) {
+ if(errno != EADDRINUSE) {
+ notprived++;
+ break;
+ }
+ }
+ else break;
+ }
+ }
+ #else
+ us.sin_port = htons(PROS_FIRST_PRIVP);
+ netulisten(PROS_FIRST_PRIVP);
+ #endif
+
+ #ifndef USE_V3_PROT
+ /* Add header */
+ if(rdgram_priority) {
+ pkt->start -= 15;
+ pkt->length += 15;
+ *(pkt->start) = (char) 15;
+ bzero(pkt->start+9,4);
+ *(pkt->start+11) = 0x02;
+ bcopy(&priority,pkt->start+13,2);
+ }
+ else {
+ pkt->start -= 9;
+ pkt->length += 9;
+ *(pkt->start) = (char) 9;
+ }
+ this_conn_id = htons(next_conn_id++);
+ if(next_conn_id == 0) next_conn_id++;
+ bcopy(&this_conn_id,pkt->start+1,2);
+ bcopy(&one,pkt->start+3,2);
+ bcopy(&one,pkt->start+5,2);
+ bzero(pkt->start+7,2);
+ #endif
+
+ #ifdef DEBUG
+ if (pfs_debug > 2) {
+ #ifndef USE_V3_PROT
+ if (to.sin_family == AF_INET) {
+ if(req_udp_port)
+ fprintf(stderr,"Sending message to %s+%d(%d)...",
+ to_hostname, req_udp_port, ntohs(this_conn_id));
+ else fprintf(stderr,"Sending message to %s(%d)...",
+ to_hostname, ntohs(this_conn_id));
+ }
+ #else
+ if (to.sin_family == AF_INET)
+ fprintf(stderr,"Sending message to %s...", to_hostname);
+ #endif /* USE_V3_PROT */
+ else
+ fprintf(stderr,"Sending message...");
+ (void) fflush(stderr);
+ }
+ #endif /* DEBUG */
+
+ first = ptalloc();
+ next = first;
+
+ #ifndef CUTCP
+ return(lp);
+ #else
+ return(1);
+ #endif /* CUTCP */
+ }
+
+ /* - - - - - - - - */
+ /*
+ * This used to be a label to goto to retry the last packet. Now we resend
+ * the packet and call keepWaitingDirsend() to wait for a reply. (We
+ * call keepWaitingDirsend() because formerly the code dropped through
+ * the keep_waiting label.)
+ */
+
+ static void retryDirsend(void)
+ {
+ #ifdef CUTCP
+ int lretry = 3;
+ #endif
+ gaps = ackpend = 0;
+
+ #ifndef CUTCP
+ ns = sendto(lp,(char *)(pkt->start), pkt->length, 0, (struct sockaddr *)&to, S_AD_SZ);
+ #else
+ while(--lretry) {
+ ns = netusend(&to.sin_addr,ntohs(to.sin_port),ntohs(us.sin_port),
+ (char *) pkt->start, pkt->length);
+ if(!ns)
+ break;
+ Stask();
+ Stask();
+ Stask();
+ }
+ #endif /* CUTCP */
+
+ #ifndef CUTCP
+ if(ns != pkt->length) {
+ #else
+ if(ns != 0) {
+ #endif
+ #ifdef DEBUG
+ if (pfs_debug) {
+ fprintf(stderr,"\nsent only %d/%d: ",ns, pkt->length);
+ perror("");
+ }
+ #endif
+ close(lp);
+ perrno = DIRSEND_NOT_ALL_SENT;
+ ptlfree(first);
+ ptlfree(pkt);
+ /* return(NULL); */
+ dirsendReturn = NULL;
+ dirsendDone = DSRET_SEND_ERROR;
+ }
+ #ifdef DEBUG
+ if (pfs_debug > 2) fprintf(stderr,"Sent.\n");
+ #endif
+ keepWaitingDirsend();
+ }
+
+ /* - - - - - - - - */
+ /*
+ * This used to be a label to goto to set the appropriate timeout value
+ * and blocked in select(). Now we set selwait and the SELECTARGs to the
+ * appropriate values, and in X register a new timeout, then return to
+ * allow event processing.
+ */
+
+ static void keepWaitingDirsend(void)
+ {
+ /* We come back to this point (by a goto) if the packet */
+ /* received is only part of the response, or if the */
+ /* response came from the wrong host */
+
+ #ifdef DEBUG
+ if (pfs_debug > 2) fprintf(stderr,"Waiting for reply...");
+ #endif
+
+ #ifndef CUTCP
+ FD_ZERO(&readfds);
+ FD_SET(lp, &readfds);
+ #endif
+
+ if(ackpend) selwait = &ackwait;
+ else if(gaps) selwait = &gapwait;
+ else selwait = &timeout;
+ }
+
+ /* - - - - - - - - */
+ /*
+ * This routine is called when a timeout occurs. It includes the code that
+ * was formerly used when select() returned 0 (indicating a timeout).
+ */
+ /*ARGSUSED*/
+
+ static void timeoutProc(XtPointer client_data,XtIntervalId *id)
+ {
+ if (gaps || ackpend) { /* Send acknowledgment */
+ /* Acks are piggybacked on retries - If we have received */
+ /* an ack from the server, then the packet sent is only */
+ /* an ack and the rest of the message will be empty */
+ #ifdef DEBUG
+ if (pfs_debug > 2) {
+ fprintf(stderr,"Acknowledging (%s).\n",
+ (ackpend ? "requested" : "gaps"));
+ }
+ #endif
+ retryDirsend();
+ return;
+ }
+
+ if (retries-- > 0) {
+ timeout.tv_sec = CLIENT_DIRSRV_BACKOFF(timeout.tv_sec);
+ #ifdef DEBUG
+ if (pfs_debug > 2) {
+ fprintf(stderr,"Timed out. Setting timeout to %d seconds.\n",
+ (int) timeout.tv_sec);
+ }
+ #endif
+ retryDirsend();
+ return;
+ }
+
+ #ifdef DEBUG
+ if (pfs_debug) {
+ fprintf(stderr, "select failed(timeoutProc): readfds=%x ",
+ readfds);
+ perror("");
+ }
+ #endif
+ #ifndef CUTCP
+ close(lp);
+ #endif
+ perrno = DIRSEND_SELECT_FAILED;
+ ptlfree(first);
+ ptlfree(pkt);
+ /* return(NULL); */
+ dirsendReturn = NULL;
+ dirsendDone = DSRET_TIMEOUT;
+ }
+
+ /* - - - - - - - - */
+ /*
+ * This function is called whenever there's something to read on the
+ * connection. It includes the code that was run when select() returned
+ * greater than 0 (indicating read ready).
+ */
+ /*ARGSUSED*/
+
+ static void readProc(XtPointer client_data,int *source,XtInputId *id)
+ {
+ #ifdef CUTCP
+ int lretry = 3;
+ #endif
+
+ from_sz = sizeof(from);
+ next->start = next->dat;
+
+ #ifndef CUTCP
+ if ((nr = recvfrom(lp, next->start, sizeof(next->dat), 0, (struct sockaddr *)&from, &from_sz)) < 0) {
+ #else
+ nr = neturead(next->start);
+ if (nr < 1) {
+ #endif
+ #ifdef DEBUG
+ if (pfs_debug) perror("recvfrom");
+ #endif
+ #ifndef CUTCP
+ close(lp);
+ #endif
+ perrno = DIRSEND_BAD_RECV;
+ ptlfree(first);
+ ptlfree(pkt);
+ /* return(NULL) */
+ dirsendReturn = NULL;
+ dirsendDone = DSRET_RECV_ERROR;
+ return;
+ }
+
+ next->length = nr;
+ next->start[next->length] = 0;
+
+ #ifdef DEBUG
+ if (pfs_debug > 2)
+ fprintf(stderr,"Received packet from %s\n",
+ /*
+ inet_ntoa(SUN_GNU_FIX *(struct in_addr *)&from.sin_addr));
+ */
+ inet_ntoa(from.sin_addr));
+ #endif
+
+
+ /* For the current format, if the first byte is less than */
+ /* 20, then the first two bits are a version number and the next six */
+ /* are the header length (including the first byte). */
+ if((hdr_len = (unsigned char) *(next->start)) < 20) {
+ ctlptr = next->start + 1;
+ next->seq = 0;
+ if(hdr_len >= 3) { /* Connection ID */
+ bcopy(ctlptr,(char *) &stmp,2);
+ if(stmp) pkt_cid = ntohs(stmp);
+ ctlptr += 2;
+ }
+ if(pkt_cid && this_conn_id && (pkt_cid != this_conn_id)) {
+ /* The packet is not for us */
+ /* goto keep_waiting; */
+ keepWaitingDirsend();
+ return;
+ }
+ if(hdr_len >= 5) { /* Packet number */
+ bcopy(ctlptr,&stmp,2);
+ next->seq = ntohs(stmp);
+ ctlptr += 2;
+ }
+ else { /* No packet number specified, so this is the only one */
+ next->seq = 1;
+ nd_pkts = 1;
+ }
+ if(hdr_len >= 7) { /* Total number of packets */
+ bcopy(ctlptr,&stmp,2); /* 0 means don't know */
+ if(stmp) nd_pkts = ntohs(stmp);
+ ctlptr += 2;
+ }
+ if(hdr_len >= 9) { /* Receievd through */
+ bcopy(ctlptr,&stmp,2); /* 1 means received request */
+ #ifndef USE_V3_PROT
+ if((stmp) && (ntohs(stmp) == 1)) {
+ /* Future retries will be acks only */
+ pkt->length = 9;
+ bcopy(&zero,pkt->start+3,2);
+ #ifdef DEBUG
+ if(pfs_debug > 2)
+ fprintf(stderr,"Server acked request - retries will be acks only\n");
+ #endif
+ }
+ #endif
+ ctlptr += 2;
+ }
+ if(hdr_len >= 11) { /* Backoff */
+ bcopy(ctlptr,&stmp,2);
+ if(stmp) {
+ backoff = ntohs(stmp);
+ #ifdef DEBUG
+ if(pfs_debug > 2)
+ fprintf(stderr,"Backing off to %d seconds\n", backoff);
+ #endif
+ timeout.tv_sec = backoff;
+ if ((backoff > 60) && (first == next) && (no_pkts == 0)) {
+ /* Probably a long queue on the server - don't give up */
+ retries = client_dirsrv_retry;
+ }
+ }
+ ctlptr += 2;
+ }
+ if(hdr_len >= 12) { /* Flags (1st byte) */
+ bcopy(ctlptr,&rdflag11,1);
+ if(rdflag11 & 0x80) {
+ #ifdef DEBUG
+ if(pfs_debug > 2)
+ fprintf(stderr,"Ack requested\n");
+ #endif
+ ackpend++;
+ }
+ if(rdflag11 & 0x40) {
+ #ifdef DEBUG
+ if(pfs_debug > 2)
+ fprintf(stderr,"Sequenced control packet\n");
+ #endif
+ next->length = -1;
+ scpflag++;
+ }
+ ctlptr += 1;
+ }
+ if(hdr_len >= 13) { /* Flags (2nd byte) */
+ /* Reserved for future use */
+ bcopy(ctlptr,&rdflag12,1);
+ ctlptr += 1;
+ }
+ if(next->seq == 0) {
+ /* goto keep_waiting; */
+ keepWaitingDirsend();
+ return;
+ }
+ if(next->length >= 0) next->length -= hdr_len;
+ next->start += hdr_len;
+ goto done_old;
+ }
+
+ pkt_cid = 0;
+
+ /* if intermediate format (between old and new), then process */
+ /* and go to done_old */
+ ctlptr = next->start + max(0,next->length-20);
+ while(*ctlptr) ctlptr++;
+ /* Control fields start after the terminating null */
+ ctlptr++;
+ /* Until old version are gone, must be 4 extra bytes minimum */
+ /* When no version 3 servers, can remove the -4 */
+ if(ctlptr < (next->start + next->length - 4)) {
+ /* Connection ID */
+ bcopy(ctlptr,&stmp,2);
+ if(stmp) pkt_cid = ntohs(stmp);
+ ctlptr += 2;
+ if(pkt_cid && this_conn_id && (pkt_cid != this_conn_id)) {
+ /* The packet is not for us */
+ /* goto keep_waiting; */
+ keepWaitingDirsend();
+ return;
+ }
+ /* Packet number */
+ if(ctlptr < (next->start + next->length)) {
+ bcopy(ctlptr,&stmp,2);
+ next->seq = ntohs(stmp);
+ ctlptr += 2;
+ }
+ /* Total number of packets */
+ if(ctlptr < (next->start + next->length)) {
+ bcopy(ctlptr,&stmp,2);
+ if(stmp) nd_pkts = ntohs(stmp);
+ ctlptr += 2;
+ }
+ /* Receievd through */
+ if(ctlptr < (next->start + next->length)) {
+ /* Not supported by clients */
+ ctlptr += 2;
+ }
+ /* Backoff */
+ if(ctlptr < (next->start + next->length)) {
+ bcopy(ctlptr,&stmp,2);
+ backoff = ntohs(stmp);
+ #ifdef DEBUG
+ if(pfs_debug > 2)
+ fprintf(stderr,"Backing off to %d seconds\n", backoff);
+ #endif
+ if(backoff) timeout.tv_sec = backoff;
+ ctlptr += 2;
+ }
+ if(next->seq == 0) {
+ /* goto keep_waiting; */
+ keepWaitingDirsend();
+ return;
+ }
+ goto done_old;
+
+ }
+
+ /* Notes that we have to start searching 11 bytes before the */
+ /* expected start of the MULTI-PACKET line because the message */
+ /* might include up to 10 bytes of data after the trailing null */
+ /* The order of those bytes is two bytes each for Connection ID */
+ /* Packet-no, of, Received-through, Backoff */
+ seqtxt = nlsindex(next->start + max(0,next->length - 40),"MULTI-PACKET");
+ if(seqtxt) seqtxt+= 13;
+
+ if((nd_pkts == 0) && (no_pkts == 0) && (seqtxt == NULL)) goto all_done;
+
+ tmp = sscanf(seqtxt,"%d OF %d", &(next->seq), &nd_pkts);
+ #ifdef DEBUG
+ if (pfs_debug && (tmp == 0))
+ fprintf(stderr,"Cant read packet sequence number: %s", seqtxt);
+ #endif
+ done_old:
+ #ifdef DEBUG
+ if(pfs_debug > 2) fprintf(stderr,"Packet %d of %d\n",next->seq,nd_pkts);
+ #endif
+ if ((first == next) && (no_pkts == 0)) {
+ if(first->seq == 1) {
+ comp_thru = first;
+ /* If only one packet, then return it */
+ if(nd_pkts == 1) goto all_done;
+ }
+ else gaps++;
+ no_pkts = 1;
+ next = ptalloc();
+ /* goto keep_waiting; */
+ keepWaitingDirsend();
+ return;
+ }
+
+ if(comp_thru && (next->seq <= comp_thru->seq))
+ ptfree(next);
+ else if (next->seq < first->seq) {
+ vtmp = first;
+ first = next;
+ first->next = vtmp;
+ first->previous = NULL;
+ vtmp->previous = first;
+ if(first->seq == 1) comp_thru = first;
+ no_pkts++;
+ }
+ else {
+ vtmp = (comp_thru ? comp_thru : first);
+ while (vtmp->seq < next->seq) {
+ if(vtmp->next == NULL) {
+ vtmp->next = next;
+ next->previous = vtmp;
+ next->next = NULL;
+ no_pkts++;
+ goto ins_done;
+ }
+ vtmp = vtmp->next;
+ }
+ if(vtmp->seq == next->seq)
+ ptfree(next);
+ else {
+ vtmp->previous->next = next;
+ next->previous = vtmp->previous;
+ next->next = vtmp;
+ vtmp->previous = next;
+ no_pkts++;
+ }
+ }
+
+ ins_done:
+
+ while(comp_thru && comp_thru->next &&
+ (comp_thru->next->seq == (comp_thru->seq + 1))) {
+ comp_thru = comp_thru->next;
+ #ifndef USE_V3_PROT
+ recvd_thru = htons(comp_thru->seq);
+ bcopy(&recvd_thru,pkt->start+7,2); /* Let server know we got it */
+ #endif
+ /* We've made progress, so reset retry count */
+ retries = client_dirsrv_retry;
+ /* Also, next retry will be only an acknowledgement */
+ /* but for now, we can't fill in the ack field */
+ #ifdef DEBUG
+ if(pfs_debug > 2)
+ fprintf(stderr,"Packets now received through %d\n",comp_thru->seq);
+ #endif
+ }
+
+ /* See if there are any gaps */
+ if(!comp_thru || comp_thru->next) gaps++;
+ else gaps = 0;
+
+ if ((nd_pkts == 0) || (no_pkts < nd_pkts)) {
+ next = ptalloc();
+ /* goto keep_waiting; */
+ keepWaitingDirsend();
+ return;
+ }
+
+ all_done:
+ if(ackpend) { /* Send acknowledgement if requested */
+ #ifdef DEBUG
+ if (pfs_debug > 2) {
+ if (to.sin_family == AF_INET)
+ fprintf(stderr,"Acknowledging final packet to %s(%d)\n",
+ to_hostname, ntohs(this_conn_id));
+ else
+ fprintf(stderr,"Acknowledging final packet\n");
+ (void) fflush(stderr);
+ }
+ #endif
+ #ifndef CUTCP
+ ns = sendto(lp,(char *)(pkt->start), pkt->length, 0, (struct sockaddr *)&to, S_AD_SZ);
+ #else
+ while(--lretry) {
+ ns = netusend(&to.sin_addr, ntohs(to.sin_port), ntohs(us.sin_port),(char *) pkt->start, pkt->length);
+ if(!ns)
+ break;
+ Stask();
+ Stask();
+ }
+ #endif
+
+ #ifndef CUTCP
+ if(ns != pkt->length) {
+ #else
+ if(ns != 0) {
+ #endif
+
+ #ifdef DEBUG
+ if (pfs_debug) {
+ fprintf(stderr,"\nsent only %d/%d: ",ns, pkt->length);
+ perror("");
+ }
+ #endif
+ }
+
+ }
+ #ifndef CUTCP
+ close(lp);
+ #endif
+ ptlfree(pkt);
+
+ /* Get rid of any sequenced control packets */
+ if(scpflag) {
+ while(first && (first->length < 0)) {
+ vtmp = first;
+ first = first->next;
+ if(first) first->previous = NULL;
+ ptfree(vtmp);
+ }
+ vtmp = first;
+ while(vtmp && vtmp->next) {
+ if(vtmp->next->length < 0) {
+ if(vtmp->next->next) {
+ vtmp->next = vtmp->next->next;
+ ptfree(vtmp->next->previous);
+ vtmp->next->previous = vtmp;
+ }
+ else {
+ ptfree(vtmp->next);
+ vtmp->next = NULL;
+ }
+ }
+ vtmp = vtmp->next;
+ }
+ }
+
+ /* return(first); */
+ dirsendReturn = first;
+ dirsendDone = DSRET_DONE;
+
+ }
+
+ static void processEvent(void)
+ {
+ #ifdef CUTCP
+ unsigned long now;
+ #endif
+ /* select - either recv is ready, or timeout */
+ /* see if timeout or error or wrong descriptor */
+ #ifndef CUTCP
+ tmp = select(lp + 1, &readfds, (SELECTARG *)0, (SELECTARG *)0, selwait);
+ if (tmp == 0) {
+ timeoutProc(NULL,&timerId);
+ } else if ((tmp < 0) || !FD_ISSET(lp,&readfds)) {
+ #ifdef DEBUG
+ if (pfs_debug) {
+ fprintf(stderr, "select failed(processEvent): readfds=%x ",
+ readfds);
+ perror("");
+ }
+ #endif
+ close(lp);
+ #else /* CUTCP's flood. */
+ /* while not timeout in selwait loop, stask looking for uevents */
+ now = time(NULL) + selwait->tv_sec;
+ #ifdef DEBUG
+ if(pfs_debug) {
+ fprintf(stderr,"Waiting %d seconds\n",selwait->tv_sec);
+ }
+
+ #endif
+ while(now > time(NULL)) {
+ int i, cl, dat;
+
+ Stask();
+ if (0 < (i = Sgetevent(USERCLASS, &cl, &dat))) {
+ /* got a user class event */
+ if(cl == USERCLASS &&
+ i == UDPDATA) {
+ readProc(NULL,&lp,&inputId);
+ return;
+ }
+ }
+ if(kbhit()) {
+ int c = getch();
+ if(c == 27 || c == 3)
+ break;
+ fprintf(stderr,"Press <ESCAPE> to abort\n");
+ }
+ }
+ if(now <= time(NULL)) { /* timeout */
+ timeoutProc(NULL,&timerId);
+ return;
+ }
+
+ #endif /* CUTCP */
+ perrno = DIRSEND_SELECT_FAILED;
+ ptlfree(first);
+ ptlfree(pkt);
+ /* return(NULL); */
+ dirsendReturn = NULL;
+ dirsendDone = DSRET_SELECT_ERROR;
+ #ifndef CUTCP
+ } else {
+ readProc(NULL,&lp,&inputId);
+ }
+ #endif /* CUTCP */
+ }
+
+ void abortDirsend(void)
+ {
+ if (!dirsendDone) {
+ #ifndef CUTCP
+ close(lp);
+ #endif
+ ptlfree(first);
+ ptlfree(pkt);
+ dirsendReturn = NULL;
+ dirsendDone = DSRET_ABORTED;
+ }
+ return;
+ }
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/get_pauth.c
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/get_pauth.c:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/get_pauth.c Tue Oct 5 13:19:57 2004
***************
*** 0 ****
--- 1,93 ----
+ /*
+ * Copyright (c) 1989, 1990 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ *
+ * v1.2.2 - 11/19/91 (mmt) - added MSDOS & OS2 stuff
+ * v1.2.1 - 09/17/91 (bpk) - added BULL & USG stuff, thanks to Jim Sillas
+ * v1.2.0 - 09/17/91 (bpk) - fixed it up (thanks to synful)
+ * v1.1.1 - 08/30/91 (bpk) - added VMS support
+ */
+
+ #include <copyright.h>
+ #include <stdio.h>
+ #include <unistd.h>
+ #ifndef VMS
+ # include <sys/types.h> /* this may/will define FD_SET etc */
+ # include <pmachine.h>
+ #endif
+
+ #ifdef NEED_STRING_H
+ # include <string.h>
+ #else
+ # include <strings.h>
+ #endif
+
+ #ifndef VMS
+ # if defined(MSDOS) && !defined(OS2)
+ # ifndef CUTCP
+ # include <rwconf.h>
+ # endif
+ # else
+ # include <pwd.h>
+ # endif
+ #else
+ # include <jpidef.h>
+ # include <vms.h>
+ #endif
+
+ #include <pcompat.h>
+ #include <pauthent.h>
+
+ PAUTH get_pauth(int type)
+ {
+ static PAUTH_ST no_auth_st;
+ static PAUTH no_auth = NULL;
+ #if !defined(VMS) && !defined(MSDOS) || defined(OS2)
+ struct passwd *whoiampw;
+ #else
+ char username[13];
+ unsigned short usernamelen;
+ struct {
+ unsigned short buflen;
+ unsigned short itmcod;
+ char *bufadr;
+ unsigned short *retlenadr;
+ unsigned long null;
+ } jpi_itemlist;
+ #endif
+
+ if(no_auth == NULL) {
+ no_auth = &no_auth_st;
+ strcpy(no_auth->auth_type,"UNAUTHENTICATED");
+
+ /* find out who we are */
+ #ifndef VMS
+ #if defined(MSDOS) && !defined(OS2)
+ #ifndef CUTCP
+ if (!getconf("general", "user", no_auth->authenticator, 250)
+ || (strlen (no_auth->authenticator) == 0))
+ #endif
+ strcpy(no_auth->authenticator,"nobody");
+ #else /* not MSDOS */
+ DISABLE_PFS(whoiampw = getpwuid(getuid()));
+ if (whoiampw == 0) strcpy(no_auth->authenticator,"nobody");
+ else strcpy(no_auth->authenticator, whoiampw->pw_name);
+ #endif /* not MSDOS */
+ #else
+ jpi_itemlist.buflen = sizeof(username);
+ jpi_itemlist.itmcod = JPI$_USERNAME;
+ jpi_itemlist.bufadr = &username;
+ jpi_itemlist.retlenadr = &usernamelen;
+ jpi_itemlist.null = 0;
+ if (SYS$GETJPI(0, 0, 0, &jpi_itemlist, 0, 0, 0) & 0x1)
+ {
+ username[usernamelen] = 0;
+ strcpy(no_auth->authenticator, username);
+ } else
+ strcpy(no_auth->authenticator, "nobody");
+ #endif
+ }
+ return(no_auth);
+ }
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/get_vdir.c
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/get_vdir.c:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/get_vdir.c Tue Oct 5 13:19:57 2004
***************
*** 0 ****
--- 1,487 ----
+ /*
+ * Copyright (c) 1989, 1990, 1991 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ *
+ * v1.2.2 - 11/19/91 (mmt) - added MSDOS & OS2 stuff
+ * v1.2.1 - 10/23/91 (bpk) - added missing code
+ * v1.2.0 - 09/17/91 (bpk) - added new get_vdir code
+ * v1.1.1 - 08/30/91 (bpk) - cast rindex()
+ */
+
+ #include <copyright.h>
+ #include <stdio.h>
+
+ #include <pfs.h>
+ #include <pprot.h>
+ #include <perrno.h>
+ #include <pcompat.h>
+ #include <pauthent.h>
+ #include <pmachine.h>
+
+ #ifdef NEED_STRING_H
+ # include <string.h>
+ #else
+ # include <strings.h>
+ #endif
+
+ #ifdef DEBUG
+ extern int pfs_debug;
+ #endif
+
+ extern int pwarn;
+ extern char p_warn_string[];
+ extern int perrno;
+ extern char p_err_string[];
+
+ extern int wcmatch(char *s,char *template);
+ extern int vl_insert(VLINK vl,VDIR1 vd,int allow_conflict);
+ extern int ul_insert(VLINK ul,VDIR1 vd,VLINK p);
+ extern int scan_error(char *erst);
+
+ /*
+ * get_vdir - Get contents of a directory given its location
+ *
+ * GET_VDIR takes a directory location, a list of desired
+ * components, a pointer to a directory structure to be
+ * filled in, and flags. It then queries the appropriate
+ * directory server and retrieves the desired information.
+ *
+ * ARGS: dhost - Host on which directory resides
+ * dfile - Directory on that host
+ * components - The names from the directory we want
+ * dir - Structure to be filled in
+ * flags - Options. See FLAGS
+ * filters - filters to be applied to result
+ * acomp - Pointer to remaining components
+ *
+ * FLAGS: GVD_UNION - Do not expand union links
+ * GVD_EXPAND - Expand union links locally
+ * GVD_REMEXP - Request remote expansion (& local if refused)
+ * GVD_LREMEXP - Request remote expansion of local union links
+ * GVD_VERIFY - Only verify that args are for a directory
+ * GVD_ATTRIB - Request attributes from directory server
+ * GVD_NOSORT - Do not sort links when adding to directory
+ *
+ * RETURNS: PSUCCESS (0) or error code
+ * On some codes addition information in p_err_string
+ *
+ * NOTES: If acomp is non-null the string it points to might be modified
+ *
+ * If the directory passed as an argument already has
+ * links or union links, then those lists will be freed
+ * before the new contents are filled in.
+ *
+ * If a filter is passed to the procedure, and application of
+ * the filter results in additional union link, then those links
+ * will (or will not) be expanded as specified in the FLAGS field.
+ *
+ * If the list of components in NULL, or the null string, then
+ * get_vdir will return all links in the requested directory.
+ *
+ * BUGS: Doesn't process union links yet
+ * Doesn't process errors returned from server
+ * Doesn't expand union links if requested to
+ */
+ int get_vdir(char *dhost,char *dfile,char *components,VDIR1 dir,long flags,
+ VLINK filters,char *acomp)
+ {
+ PTEXT request; /* Text of request to dir server */
+ PTEXT resp; /* Response from dir server */
+
+ char ulcomp[MAX_VPATH];/* Work space for new current component */
+ char *comp = components;
+
+ VLINK cur_link = NULL;/* Current link being filled in */
+ VLINK exp = NULL; /* The current ulink being expanded */
+ VLINK pul = NULL; /* Prev union link (insert new one after it) */
+ VLINK l; /* Temp link pointer */
+ int mcomp; /* Flag - check multiple components */
+ int unresp; /* Flag - received unresolved response */
+ int getattrib = 0; /* Get attributes from server */
+ int vl_insert_flag; /* Flags to vl_insert */
+
+ int fwdcnt = MAX_FWD_DEPTH;
+
+ int no_links = 0; /* Count of number of links found */
+
+ char options[40]; /* LIST option */
+ char *opt; /* After leading + */
+
+ PAUTH authinfo;
+
+ /* Treat null string like NULL (return entire directory) */
+ if(!components || !*components) comp = NULL;
+
+ if(acomp && !filters) mcomp = 1;
+ else mcomp = 0;
+
+ if(flags&GVD_ATTRIB) {
+ getattrib++;
+ flags &= (~GVD_ATTRIB);
+ }
+
+ if(flags&GVD_NOSORT) vl_insert_flag = VLI_NOSORT;
+ else vl_insert_flag = VLI_ALLOW_CONF;
+ flags &= (~GVD_NOSORT);
+
+ if(filters) comp = NULL;
+
+ perrno = 0;
+
+ authinfo = get_pauth(PFSA_UNAUTHENTICATED);
+
+ *options = '\0';
+
+ if(getattrib) {
+ strcat(options,"+ATTRIBUTES");
+ flags &= (~GVD_ATTRIB);
+ }
+
+ if(!filters) { /* Can't do remote expansion if filters to be applied */
+ if(flags == GVD_REMEXP) strcat(options,"+EXPAND");
+ if(flags == GVD_LREMEXP) strcat(options,"+LEXPAND");
+ }
+
+ /* If all we are doing is verifying that dfile is a directory */
+ /* then we do not want a big response from the directory */
+ /* server. A NOT-FOUND is sufficient. */
+ if(flags == GVD_VERIFY)
+ #ifdef NEWVERIFYOPT
+ strcat(options,"+VERIFY");
+ #else
+ comp = "%#$PRobably_nOn_existaNT$#%";
+ #endif
+
+ if(*options) opt = options+1;
+ else opt = "''";
+
+ startover:
+ request = ptalloc();
+
+ sprintf(request->start,
+ "VERSION %d\nAUTHENTICATOR %s %s\nDIRECTORY ASCII %s\nLIST %s COMPONENTS %s%s%s\n",
+ VFPROT_VNO, authinfo->auth_type, authinfo->authenticator,
+ dfile,opt, (comp ? comp : ""), (mcomp ? "/" : ""),
+ (mcomp ? acomp : ""));
+
+ request->length = strlen(request->start);
+
+ #ifdef DEBUG
+ if(pfs_debug > 2)
+ fprintf(stderr,"Sending message to dirsrv:\n%s",request->start);
+ #endif
+
+ #if defined(MSDOS)
+ resp = dirsend(request,dhost,0L);
+ #else
+ resp = dirsend(request,dhost,0);
+ #endif
+
+ #ifdef DEBUG
+ if(pfs_debug && (resp == NULL)) {
+ fprintf(stderr,"Dirsend failed: %d\n",perrno);
+ }
+ #endif
+
+ /* If we don't get a response, then if the requested */
+ /* directory, return error, if a ulink, mark it unexpanded */
+ if(resp == NULL) {
+ if(exp) exp->expanded = FAILED;
+ else return(perrno);
+ }
+
+ unresp = 0;
+
+ /* Here we must parse reponse and put in directory */
+ /* While looking at each packet */
+ while(resp) {
+ PTEXT vtmp;
+ char *line;
+
+ vtmp = resp;
+ #ifdef DEBUG
+ if(pfs_debug > 3) fprintf(stderr,"%s\n",resp->start);
+ #endif
+ /* Look at each line in packet */
+ for(line = resp->start;line != NULL;line = nxtline(line)) {
+ switch (*line) {
+
+ /* Temporary variables to hold link info */
+ char l_linktype;
+ char l_name[MAX_DIR_LINESIZE];
+ char l_type[MAX_DIR_LINESIZE];
+ char l_htype[MAX_DIR_LINESIZE];
+ char l_host[MAX_DIR_LINESIZE];
+ char l_ntype[MAX_DIR_LINESIZE];
+ char l_fname[MAX_DIR_LINESIZE];
+ int l_version;
+ char t_unresolved[MAX_DIR_LINESIZE];
+ int l_magic;
+ int tmp;
+
+ case 'L': /* LINK or LINK-INFO */
+ if(strncmp(line,"LINK-INFO",9) == 0) {
+ PATTRIB at;
+ PATTRIB last_at;
+ at = parse_attribute(line);
+ if(!at) break;
+
+ /* Cant have link info without a link */
+ if(!cur_link) {
+ perrno = DIRSRV_BAD_FORMAT;
+ atfree(at);
+ break;
+ }
+
+ if(cur_link->lattrib) {
+ last_at = cur_link->lattrib;
+ while(last_at->next) last_at = last_at->next;
+ at->previous = last_at;
+ last_at->next = at;
+ }
+ else {
+ cur_link->lattrib = at;
+ at->previous = NULL;
+ }
+ break;
+ }
+
+ /* Not LINK-INFO, must be LINK - if not check for error */
+ if(strncmp(line,"LINK",4) != 0) goto scanerr;
+
+ /* If only verifying, don't want to change dir */
+ if(flags == GVD_VERIFY) {
+ break;
+ }
+ /* If first link and some links in dir, free them */
+ if(!no_links++) {
+ if(dir->links) vllfree(dir->links); dir->links=NULL;
+ if(dir->ulinks) vllfree(dir->ulinks); dir->ulinks=NULL;
+ }
+
+ cur_link = vlalloc();
+
+ /* parse and insert file info */
+ tmp = sscanf(line,"LINK %c %s %s %s %s %s %s %d %d", &l_linktype,
+ l_type, l_name, l_htype, l_host,
+ l_ntype, l_fname, &(cur_link->version),
+ &(cur_link->f_magic_no));
+
+ if(tmp != 9) {
+ perrno = DIRSRV_BAD_FORMAT;
+ vlfree(cur_link);
+ break;
+ }
+
+ cur_link->linktype = l_linktype;
+ cur_link->type = stcopyr(l_type,cur_link->type);
+ cur_link->name = stcopyr(unquote(l_name),cur_link->name);
+ cur_link->hosttype = stcopyr(l_htype,cur_link->hosttype);
+ cur_link->host = stcopyr(l_host,cur_link->host);
+ cur_link->nametype = stcopyr(l_ntype,cur_link->nametype);
+ cur_link->filename = stcopyr(l_fname,cur_link->filename);
+
+ /* Double check to make sure we don't get */
+ /* back unwanted components */
+ /* OK to keep if special (URP) links */
+ /* or if mcomp specified */
+ if(!mcomp && (cur_link->linktype == 'L') &&
+ (!wcmatch(cur_link->name,comp))) {
+ vlfree(cur_link);
+ break;
+ }
+
+ /* If other optional info was sent back, it must */
+ /* also be parsed before inserting link *** */
+
+
+ if(cur_link->linktype == 'L')
+ vl_insert(cur_link,dir,vl_insert_flag);
+ else {
+ tmp = ul_insert(cur_link,dir,pul);
+
+ /* If inserted after pul, next one after cur_link */
+ if(pul && (!tmp || (tmp == UL_INSERT_SUPERSEDING)))
+ pul = cur_link;
+ }
+
+ break;
+
+ case 'F': /* FILTER, FAILURE or FORWARDED*/
+ /* FORWARDED */
+ if(strncmp(line,"FORWARDED",9) == 0) {
+ if(fwdcnt-- <= 0) {
+ ptlfree(resp);
+ perrno = PFS_MAX_FWD_DEPTH;
+ return(perrno);
+ }
+ /* parse and start over */
+
+ tmp = sscanf(line,"FORWARDED %s %s %s %s %d %d",
+ l_htype,l_host,l_ntype,l_fname,
+ &l_version, &l_magic);
+
+ dhost = stcopy(l_host);
+ dfile = stcopy(l_fname);
+
+ if(tmp < 4) {
+ perrno = DIRSRV_BAD_FORMAT;
+ break;
+ }
+
+ ptlfree(resp);
+ goto startover;
+ }
+ if(strncmp(line,"FILTER",6) != 0) goto scanerr;
+ break;
+
+
+ case 'M': /* MULTI-PACKET (processed by dirsend) */
+ case 'P': /* PACKET (processed by dirsend) */
+ break;
+
+ case 'N': /* NOT-A-DIRECTORY or NONE-FOUND */
+ /* NONE-FOUND, we just have no links to insert */
+ /* It is not an error, but we must clear any */
+ /* old links in the directory arg */
+ if(strncmp(line,"NONE-FOUND",10) == 0) {
+ /* If only verifying, don't want to change dir */
+ if(flags == GVD_VERIFY) {
+ break;
+ }
+
+ /* If first link and some links in dir, free them */
+ if(!no_links++) {
+ if(dir->links) vllfree(dir->links);
+ if(dir->ulinks) vllfree(dir->ulinks);
+ dir->links = NULL;
+ dir->ulinks = NULL;
+ }
+ break;
+ }
+ /* If NOT-A-DIRECTORY or anything else, scan error */
+ goto scanerr;
+
+ case 'U': /* UNRESOLVED */
+ if(strncmp(line,"UNRESOLVED",10) != 0) {
+ goto scanerr;
+ }
+ tmp = sscanf(line,"UNRESOLVED %s", t_unresolved);
+ if(tmp < 1) {
+ perrno = DIRSRV_BAD_FORMAT;
+ break;
+ }
+ /* If multiple components were resolved */
+ if(strlen(t_unresolved) < strlen(acomp)) {
+ strcpy(ulcomp,acomp);
+ /* ulcomp is the components that were resolved */
+ *(ulcomp+strlen(acomp)-strlen(t_unresolved)-1) = '\0';
+ /* Comp gets the last component resolved */
+ comp = strrchr(ulcomp,(int) '/');
+ if(comp) comp++;
+ else comp = ulcomp;
+ /* Let rd_vdir know what remains */
+ strcpy(acomp,t_unresolved);
+ }
+ unresp = 1;
+ break;
+
+ case 'V': /* VERSION-NOT-SUPPORTED */
+ if(strncmp(line,"VERSION-NOT-SUPPORTED",21) == 0) {
+ perrno = DIRSRV_BAD_VERS;
+ return(perrno);
+ }
+ goto scanerr;
+
+ scanerr:
+ default:
+ if(*line && (tmp = scan_error(line))) {
+ ptlfree(resp);
+ return(tmp);
+ }
+ break;
+ }
+ }
+
+ resp = resp->next;
+
+ ptfree(vtmp);
+ }
+
+ /* We sent multiple components and weren't told any */
+ /* were unresolved */
+ if(mcomp && !unresp) {
+ /* ulcomp is the components that were resolved */
+ strcpy(ulcomp,acomp);
+ /* Comp gets the last component resolved */
+ comp = strrchr(ulcomp,(int) '/');
+ if(comp) comp++;
+ else comp = ulcomp;
+ /* If we have union links to resolve, only one component remains */
+ mcomp = 0;
+ /* Let rd_vdir know what remains */
+ *acomp = '\0';
+ }
+
+ /* If only verifying, we already know it is a directory */
+ if(flags == GVD_VERIFY) return(PSUCCESS);
+
+ /* Don't return if matching was delayed by the need to filter */
+ /* if FIND specified, and dir->links is non null, then we have */
+ /* found a match, and should return. */
+ if((flags & GVD_FIND) && dir->links && (!filters))
+ return(PSUCCESS);
+
+ /* If expand specified, and ulinks must be expanded, making sure */
+ /* that the order of the links is maintained properly */
+
+ expand_ulinks:
+
+ if((flags != GVD_UNION) && (flags != GVD_VERIFY)) {
+
+ l = dir->ulinks;
+
+ /* Find first unexpanded ulink */
+ while(l && l->expanded && (l->linktype == 'U')) l = l->next;
+
+ /* Only expand if a FILE or DIRECTORY - Mark as */
+ /* failed otherwise */
+ /* We must still add support for symbolic ulinks */
+ if(l) {
+ if ((strcmp(l->type,"DIRECTORY") == 0) ||
+ (strcmp(l->type,"FILE") == 0)) {
+ l->expanded = TRUE;
+ exp = l;
+ pul = l;
+ dhost = l->host;
+ dfile = l->filename;
+ goto startover; /* was get_contents; */
+ }
+ else l->expanded = FAILED;
+ }
+ }
+
+ /* Double check to make sure we don't get */
+ /* back unwanted components */
+ /* OK to keep if special (URP) links */
+ if(components && *components) {
+ l = dir->links;
+ while(l) {
+ VLINK ol;
+ if((l->linktype == 'L') && (!wcmatch(l->name,components))) {
+ if(l == dir->links)
+ dir->links = l->next;
+ else l->previous->next = l->next;
+ if(l->next) l->next->previous = l->previous;
+ ol = l;
+ l = l->next;
+ vlfree(ol);
+ }
+ else l = l->next;
+ }
+ }
+
+ return(PSUCCESS);
+ }
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/patchlevel.h
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/patchlevel.h:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/patchlevel.h Tue Oct 5 13:19:57 2004
***************
*** 0 ****
--- 1,18 ----
+ /*
+ * Archie v1.3
+ *
+ * History:
+ *
+ * 01/10/92 v1.3.1 - Release.
+ * 01/09/92 v1.3 - Release.
+ * 12/13/91 - added UCX support
+ * 12/03/91 - added CUTCP support
+ * 11/20/91 v1.2 - Release.
+ * 11/18/91 - ported to DOS & OS/2
+ * 11/12/91 - finally got to test under Multinet 3.0
+ * 10/03/91 - replaced regex.c for oz
+ * 09/25/91 - added Wollongong support
+ * 08/30/91 - ported to VMS
+ * 08/20/91 v1.1 - Major revisions
+ * 07/31/91 v1.0 - Original
+ */
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/pauthent.h
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/pauthent.h:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/pauthent.h Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,45 ----
+ /*
+ * Copyright (c) 1989, 1990, 1991 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ */
+
+ #include <copyright.h>
+
+ #define PFSA_UNAUTHENTICATED 1
+
+ struct pfs_auth_info {
+ char auth_type[100];
+ char authenticator[250];
+ };
+
+ typedef struct pfs_auth_info *PAUTH;
+ typedef struct pfs_auth_info PAUTH_ST;
+
+ PAUTH get_pauth();
+
+ #ifndef VMS
+ # ifndef IN_H
+ # include <netinet/in.h>
+ # define IN_H
+ # endif
+ #else
+ # ifndef _ARCHIE_VMS
+ # include <vms.h>
+ # endif
+ #endif
+
+ struct client_info {
+ int ainfo_type;
+ char *auth_type;
+ char *authenticator;
+ char *userid;
+ short port;
+ struct in_addr haddr;
+ struct pfs_auth_info *previous;
+ struct pfs_auth_info *next;
+ };
+
+ typedef struct client_info *CINFO;
+ typedef struct client_info CINFO_ST;
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/pcompat.h
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/pcompat.h:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/pcompat.h Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,45 ----
+ /*
+ * Copyright (c) 1989, 1990 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ */
+
+ #include <copyright.h>
+
+ /*
+ * pcompat.h - Definitions for compatability library
+ *
+ * This file contains the defintions used by the compatability
+ * library. Among the definitions are the possible values for
+ * pfs_disable_flag. This file also contains the external
+ * declaration of that variable. Note, however that the
+ * the module pfs_disable_flag.o is included in libpfs.a
+ * because some of the routines in that library set it.
+ * The only place it is checked, however, is in pfs_access,
+ * found in libpcompat.a
+ *
+ */
+
+ extern int pfs_default;
+ extern int pfs_enable;
+
+ /* Definitions for values of pfs_enable */
+ #define PMAP_DISABLE 0
+ #define PMAP_ENABLE 1
+ #define PMAP_COLON 2
+ #define PMAP_ATSIGN_NF 3
+ #define PMAP_ATSIGN 4
+
+ #define DISABLE_PFS(stmt) {int DpfStmp; DpfStmp = pfs_enable;\
+ pfs_enable = PMAP_DISABLE; \
+ stmt; \
+ pfs_enable = DpfStmp;}
+
+ /* Definitions for PFS_ACCESS */
+ #define PFA_MAP 0 /* Map the file name only */
+ #define PFA_CREATE 1 /* Create file if not found */
+ #define PFA_CRMAP 2 /* Map file name. Map to new name if not found */
+ #define PFA_RO 4 /* Access to file is read only */
+
+ #define check_pfs_default() if(pfs_default == -1) get_pfs_default()
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/perrmesg.c
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/perrmesg.c:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/perrmesg.c Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,182 ----
+ /*
+ * Copyright (c) 1989, 1990, 1991 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ */
+
+ #include <copyright.h>
+ #include <perrno.h>
+ #include <stdio.h>
+
+ /* This file and perrno.h should always be updated simultaneously */
+
+ int perrno = 0;
+ int pwarn = 0;
+ char p_err_string[P_ERR_STRING_SZ];
+ char p_warn_string[P_ERR_STRING_SZ];
+
+ char *p_err_text[256] = {
+ /* 0 */ "Success (prospero)",
+ /* 1 */ "Port unknown (dirsend)",
+ /* 2 */ "Can't open local UDP port (dirsend)",
+ /* 3 */ "Can't resolve hostname (dirsend)",
+ /* 4 */ "Unable to send entire message (dirsend)",
+ /* 5 */ "Timed out (dirsend)",
+ /* 6 */ "Recvfrom failed (dirsend)",
+ /* 7 */ "", /* 8 */ "", /* 9 */ "", /* 10 */ "",
+ /* 11 */ "Sendto failed (reply)",
+ /* 12 */ "", /* 13 */ "", /* 14 */ "", /* 15 */ "",
+ /* 16 */ "", /* 17 */ "", /* 18 */ "", /* 19 */ "",
+ /* 20 */ "",
+ /* 21 */ "Link already exists (vl_insert)",
+ /* 22 */ "Link with same name already exists (vl_insert)",
+ /* 23 */ "", /* 24 */ "",
+ /* 25 */ "Link already exists (ul_insert)",
+ /* 26 */ "Replacing existing link (ul_insert)",
+ /* 27 */ "Previous entry not found in dir->ulinks (ul_insert)",
+ /* 28 */ "", /* 29 */ "", /* 30 */ "", /* 31 */ "",
+ /* 32 */ "", /* 33 */ "", /* 34 */ "", /* 35 */ "",
+ /* 36 */ "", /* 37 */ "", /* 38 */ "", /* 39 */ "",
+ /* 40 */ "",
+ /* 41 */ "Temporary not found (rd_vdir)",
+ /* 42 */ "Namespace not closed with object (rd_vdir)",
+ /* 43 */ "Alias for namespace not defined (rd_vdir)",
+ /* 44 */ "Specified namespace not found (rd_vdir)",
+ /* 45 */ "", /* 46 */ "", /* 47 */ "", /* 48 */ "",
+ /* 49 */ "", /* 50 */ "",
+ /* 51 */ "File access method not supported (pfs_access)",
+ /* 52 */ "", /* 53 */ "", /* 54 */ "",
+ /* 55 */ "Pointer to cached copy - delete on close (pmap_cache)",
+ /* 56 */ "Unable to retrieve file (pmap_cache)",
+ /* 57 */ "", /* 58 */ "", /* 59 */ "", /* 60 */ "",
+ /* 61 */ "Directory already exists (mk_vdir)",
+ /* 62 */ "Link with same name already exists (mk_vdir)",
+ /* 63 */ "", /* 64 */ "",
+ /* 65 */ "Not a virtual system (vfsetenv)",
+ /* 66 */ "Can't find directory (vfsetenv)",
+ /* 67 */ "", /* 68 */ "", /* 69 */ "", /* 70 */ "",
+ /* 71 */ "Link already exists (add_vlink)",
+ /* 72 */ "Link with same name already exists (add_vlink)",
+ /* 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 */ "", /* 98 */ "", /* 99 */ "", /* 100 */ "",
+ /* 101 */ "", /* 102 */ "", /* 103 */ "", /* 104 */ "",
+ /* 105 */ "", /* 106 */ "", /* 107 */ "", /* 108 */ "",
+ /* 109 */ "", /* 110 */ "", /* 111 */ "", /* 112 */ "",
+ /* 113 */ "", /* 114 */ "", /* 115 */ "", /* 116 */ "",
+ /* 117 */ "", /* 118 */ "", /* 119 */ "", /* 120 */ "",
+ /* 121 */ "", /* 122 */ "", /* 123 */ "", /* 124 */ "",
+ /* 125 */ "", /* 126 */ "", /* 127 */ "", /* 128 */ "",
+ /* 129 */ "", /* 130 */ "", /* 131 */ "", /* 132 */ "",
+ /* 133 */ "", /* 134 */ "", /* 135 */ "", /* 136 */ "",
+ /* 137 */ "", /* 138 */ "", /* 139 */ "", /* 140 */ "",
+ /* 141 */ "", /* 142 */ "", /* 143 */ "", /* 144 */ "",
+ /* 145 */ "", /* 146 */ "", /* 147 */ "", /* 148 */ "",
+ /* 149 */ "", /* 150 */ "", /* 151 */ "", /* 152 */ "",
+ /* 153 */ "", /* 154 */ "", /* 155 */ "", /* 156 */ "",
+ /* 157 */ "", /* 158 */ "", /* 159 */ "", /* 160 */ "",
+ /* 161 */ "", /* 162 */ "", /* 163 */ "", /* 164 */ "",
+ /* 165 */ "", /* 166 */ "", /* 167 */ "", /* 168 */ "",
+ /* 169 */ "", /* 170 */ "", /* 171 */ "", /* 172 */ "",
+ /* 173 */ "", /* 174 */ "", /* 175 */ "", /* 176 */ "",
+ /* 177 */ "", /* 178 */ "", /* 179 */ "", /* 180 */ "",
+ /* 181 */ "", /* 182 */ "", /* 183 */ "", /* 184 */ "",
+ /* 185 */ "", /* 186 */ "", /* 187 */ "", /* 188 */ "",
+ /* 189 */ "", /* 190 */ "", /* 191 */ "", /* 192 */ "",
+ /* 193 */ "", /* 194 */ "", /* 195 */ "", /* 196 */ "",
+ /* 197 */ "", /* 198 */ "", /* 199 */ "", /* 200 */ "",
+ /* 201 */ "", /* 202 */ "", /* 203 */ "", /* 204 */ "",
+ /* 205 */ "", /* 206 */ "", /* 207 */ "", /* 208 */ "",
+ /* 209 */ "", /* 210 */ "", /* 211 */ "", /* 212 */ "",
+ /* 213 */ "", /* 214 */ "", /* 215 */ "", /* 216 */ "",
+ /* 217 */ "", /* 218 */ "", /* 219 */ "", /* 220 */ "",
+ /* 221 */ "", /* 222 */ "", /* 223 */ "", /* 224 */ "",
+ /* 225 */ "", /* 226 */ "", /* 227 */ "", /* 228 */ "",
+ /* 229 */ "",
+ /* 230 */ "File not found (prospero)",
+ /* 231 */ "Directory not found (prospero)",
+ /* 232 */ "Symbolic links nested too deep (prospero)",
+ /* 233 */ "Environment not initialized - source vfsetup.source then run vfsetup",
+ /* 234 */ "Can't traverse an external file (prospero)",
+ /* 235 */ "Forwarding chain is too long (prospero)",
+ /* 236 */ "", /* 237 */ "", /* 238 */ "", /* 239 */ "",
+ /* 240 */ "", /* 241 */ "",
+ /* 242 */ "Authentication required (prospero server)",
+ /* 243 */ "Not authorized (prospero server)",
+ /* 244 */ "Not found (prospero server)",
+ /* 245 */ "Bad version number (prospero server)",
+ /* 246 */ "Not a directory (prospero server)",
+ /* 247 */ "Already exists (prospero server)",
+ /* 248 */ "Link with same name already exists (prospero server)",
+ /* 249 */ "", /* 250 */ "",
+ /* 251 */ "Command not implemented on server (dirsrv)",
+ /* 252 */ "Bad format for response (dirsrv)",
+ /* 253 */ "Protocol error (prospero server)",
+ /* 254 */ "Unspecified server failure (prospero server)",
+ /* 255 */ "Generic Failure (prospero)"};
+
+ char *p_warn_text[256] = {
+ /* 0 */ "No warning",
+ /* 1 */ "You are using an old version of this program",
+ /* 2 */ "From server",
+ /* 3 */ "Unrecognized line in response from server",
+ /* 4-254 */ "", "", "", "", "", "", "", "", "", "", "", "", "",
+ "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "",
+ "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "",
+ "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "",
+ "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "",
+ "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "",
+ "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "",
+ "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "",
+ "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "",
+ "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "",
+ "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "",
+ "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "",
+ "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "",
+ "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "",
+ "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "", "",
+ /* 255 */ ""};
+
+ #ifndef ARCHIE
+
+ void perrmesg(char *prefix,int no,char *text)
+ {
+ fprintf(stderr,"%s%s%s%s\n", (prefix ? prefix : ""),
+ (no ? p_err_text[no] : p_err_text[perrno]),
+ ((text ? (*text ? " - " : "") :
+ (!no && *p_err_string ? " - " : ""))),
+ (text ? text : (no ? "" : p_err_string)));
+ }
+
+ void sperrmesg(char *buf,char *prefix,int no,char *text)
+ {
+ sprintf(buf,"%s%s%s%s\n", (prefix ? prefix : ""),
+ (no ? p_err_text[no] : p_err_text[perrno]),
+ ((text ? (*text ? " - " : "") :
+ (!no && *p_err_string ? " - " : ""))),
+ (text ? text : (no ? "" : p_err_string)));
+ }
+
+ void pwarnmesg(char *prefix,int no,char *text)
+ {
+ fprintf(stderr,"%s%s%s%s\n", (prefix ? prefix : ""),
+ (no ? p_warn_text[no] : p_warn_text[pwarn]),
+ ((text ? (*text ? " - " : "") :
+ (!no && *p_warn_string ? " - " : ""))),
+ (text ? text : (no ? "" : p_warn_string)));
+ }
+
+ void spwarnmesg(char *buf,char *prefix,int no,char *text)
+ {
+ sprintf(buf,"%s%s%s%s\n", (prefix ? prefix : ""),
+ (no ? p_warn_text[no] : p_warn_text[pwarn]),
+ ((text ? (*text ? " - " : "") :
+ (!no && *p_warn_string ? " - " : ""))),
+ (text ? text : (no ? "" : p_warn_string)));
+ }
+ #endif
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/perrno.h
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/perrno.h:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/perrno.h Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,123 ----
+ /*
+ * Copyright (c) 1989, 1990 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ */
+
+ #include <copyright.h>
+
+ /* this file and p_err_text.c should be updated simultaneously */
+
+ /*
+ * perrno.h - definitions for perrno
+ *
+ * This file contains the declarations and defintions of of the external
+ * error values in which errors are returned by the pfs and psrv
+ * libraries.
+ */
+
+ #define P_ERR_STRING_SZ 100 /* Size of error string */
+
+ extern int perrno;
+ extern char p_err_string[];
+ extern char *p_err_text[];
+
+ extern int pwarn;
+ extern char p_warn_string[];
+ extern char *p_warn_text[];
+
+ /* Error codes returned or found in verrno */
+
+ #ifndef PSUCCESS
+ #define PSUCCESS 0
+ #endif
+
+ /* dirsend (perrno) */
+ #define DIRSEND_PORT_UNKN 1 /* DIRSRV UDP port unknown */
+ #define DIRSEND_UDP_CANT 2 /* Can't open local UDP port */
+ #define DIRSEND_BAD_HOSTNAME 3 /* Can't resolve hostname */
+ #define DIRSEND_NOT_ALL_SENT 4 /* Didn't send entire message */
+ #define DIRSEND_SELECT_FAILED 5 /* Select failed */
+ #define DIRSEND_BAD_RECV 6 /* Recvfrom failed */
+
+ /* reply */
+ #define REPLY_NOTSENT 11 /* Reply: sendto failed */
+
+ /* vl_insert */
+ #define VL_INSERT_ALREADY_THERE 21 /* Link already exists */
+ #define VL_INSERT_CONFLICT 22 /* Link exists with same name */
+
+ /* ul_insert */
+ #define UL_INSERT_ALREADY_THERE 25 /* Link already exists */
+ #define UL_INSERT_SUPERSEDING 26 /* Replacing existing link */
+ #define UL_INSERT_POS_NOTFOUND 27 /* Prv entry not in dir->ulinks */
+
+ /* rd_vdir */
+ #define RVD_DIR_NOT_THERE 41 /* Temporary NOT_FOUND */
+ #define RVD_NO_CLOSED_NS 42 /* Namespace not closed w/ object:: */
+ #define RVD_NO_NS_ALIAS 43 /* No alias for namespace NS#: */
+ #define RVD_NS_NOT_FOUND 44 /* Specified namespace not found */
+
+ /* pfs_access */
+ #define PFSA_AM_NOT_SUPPORTED 51 /* Access method not supported */
+
+ /* pmap_cache */
+ #define PMC_DELETE_ON_CLOSE 55 /* Delete cached copy on close */
+ #define PMC_RETRIEVE_FAILED 56 /* Unable to retrieve file */
+
+ /* mk_vdir */
+ /* #define MKVD_ALREADY_EXISTS 61 Directory already exists */
+ /* #define MKVD_NAME_CONFLICT 62 Link with name already exists */
+
+ /* vfsetenv */
+ #define VFSN_NOT_A_VS 65 /* Not a virtual system */
+ #define VFSN_CANT_FIND_DIR 66 /* Not a virtual system */
+
+ /* add_vlink */
+ /* #define ADDVL_ALREADY_EXISTS 71 Directory already exists */
+ /* #define ADDVL_NAME_CONFLICT 72 Link with name already exists */
+
+ /* Local error codes on server */
+
+ /* dsrdir */
+ #define DSRDIR_NOT_A_DIRECTORY 111 /* Not a directory name */
+ /* dsrfinfo */
+ #define DSRFINFO_NOT_A_FILE 121 /* Object not found */
+ #define DSRFINFO_FORWARDED 122 /* Object has moved */
+
+ /* Error codes that may be returned by various procedures */
+ #define PFS_FILE_NOT_FOUND 230 /* File not found */
+ #define PFS_DIR_NOT_FOUND 231 /* Directory in path not found */
+ #define PFS_SYMLINK_DEPTH 232 /* Max sym-link depth exceeded */
+ #define PFS_ENV_NOT_INITIALIZED 233 /* Can't read environment */
+ #define PFS_EXT_USED_AS_DIR 234 /* Can't use externals as dirs */
+ #define PFS_MAX_FWD_DEPTH 235 /* Exceeded max forward depth */
+
+ /* Error codes returned by directory server */
+ /* some of these duplicate errors from individual routines */
+ /* some of those error codes should be eliminated */
+ #define DIRSRV_AUTHENT_REQ 242 /* Authentication required */
+ #define DIRSRV_NOT_AUTHORIZED 243 /* Not authorized */
+ #define DIRSRV_NOT_FOUND 244 /* Not found */
+ #define DIRSRV_BAD_VERS 245
+ #define DIRSRV_NOT_DIRECTORY 246
+ #define DIRSRV_ALREADY_EXISTS 247 /* Identical link already exists */
+ #define DIRSRV_NAME_CONFLICT 248 /* Link with name already exists */
+
+ #define DIRSRV_UNIMPLEMENTED 251 /* Unimplemented command */
+ #define DIRSRV_BAD_FORMAT 252
+ #define DIRSRV_ERROR 253
+ #define DIRSRV_SERVER_FAILED 254 /* Unspecified server failure */
+
+ #ifndef PFAILURE
+ #define PFAILURE 255
+ #endif
+
+ /* Warning codes */
+
+ #define PNOWARN 0 /* No warning indicated */
+ #define PWARN_OUT_OF_DATE 1 /* Software is out of date */
+ #define PWARN_MSG_FROM_SERVER 2 /* Warning in p_warn_string */
+ #define PWARN_UNRECOGNIZED_RESP 3 /* Unrecognized line in response */
+ #define PWARNING 255 /* Warning in p_warn_string */
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/pfs.h
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/pfs.h:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/pfs.h Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,376 ----
+ /*
+ * Copyright (c) 1989, 1990, 1991 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ *
+ * v1.2.0 - 11/19/91 (mmt) - added MSDOS & OS2 stuff
+ * v1.1.2 - 08/30/91 (bpk) - added VMS support
+ * v1.1.1 - 08/20/91 (bpk) - 4.2 -> 4.2B
+ */
+
+ #include <copyright.h>
+
+ #ifdef VMS
+ # include <vms.h>
+ #else /* not VMS */
+ # ifndef _TYPES_
+ # include <sys/types.h>
+ # endif /* _TYPES_ */
+ # ifndef IN_H
+ # include <netinet/in.h>
+ # define IN_H
+ # endif
+ #endif /* VMS */
+
+ #ifndef NULL
+ # ifdef MSDOS
+ # include <stdio.h>
+ # else
+ # define NULL 0
+ # endif /* MSDOS */
+ #endif /* NULL */
+
+ #define PFS_RELEASE "Beta.4.2D"
+ /* moved up for vdir_init */
+ #define ZERO(p) bzero((char *)(p), sizeof(*(p)))
+
+ /* General Definitions */
+
+ #define MAX_PTXT_LEN 1250 /* Max length of PTEXT structure */
+ #define MAX_PTXT_HDR 32 /* Max offset for start */
+ #define P_ERR_STRING_SZ 100 /* Size of error string */
+ #define MAX_VPATH 1024 /* Max length of virtual pathname */
+
+ /* Definition of text structure used to pass text around */
+
+ struct ptext {
+ int length; /* Length of text (from start) */
+ char *start; /* Start of text */
+ char dat[MAX_PTXT_LEN+2*MAX_PTXT_HDR];/* The data itself */
+ unsigned long mbz; /* ZERO to catch runaway strings */
+ struct ptext *previous; /* Previous element in list */
+ struct ptext *next; /* Next element in linked list */
+ int seq; /* Sequence Number */
+ };
+
+ typedef struct ptext *PTEXT;
+ typedef struct ptext PTEXT_ST;
+
+ /* Request structure: maintains information about server requests */
+ struct preq {
+ int cid; /* Connection ID */
+ short priority; /* Connection priority */
+ int pf_priority; /* Priority assigned by pri_func */
+ int recv_tot; /* Total # of packets received */
+ int trns_tot; /* Total # of packets to transmit */
+ struct ptext *cpkt; /* Current packet being filled in */
+ struct ptext *recv; /* Received packets */
+ struct ptext *trns; /* Transmitted packets */
+ int rcvd_thru; /* Received all packets through # */
+ struct preq *previous; /* Previous element in list */
+ struct preq *next; /* Next element in linked list */
+ struct sockaddr_in fromto; /* Sender/Destination */
+ };
+
+ typedef struct preq *PREQ;
+ typedef struct preq PREQ_ST;
+
+
+ /* Definition of structure containing information on virtual link */
+
+ struct vlink {
+ int dontfree; /* Flag: don't free this link */
+ char *name; /* Component of path name */
+ char linktype; /* L = Link, U = Union, N= Native */
+ int expanded; /* Has a union link been expanded */
+ char *type; /* Type of object pointed to */
+ struct vlink *filters; /* Filters associated with link */
+ struct vlink *replicas; /* Replicas (* see comment below) */
+ char *hosttype; /* Type of hostname */
+ char *host; /* Files physical location */
+ char *nametype; /* Type of filename */
+ char *filename; /* System level filename */
+ long version; /* Version number of destination */
+ long f_magic_no; /* File's magic number */
+ struct acl *acl; /* ACL for link */
+ long dest_exp; /* Expiration for dest of link */
+ long link_exp; /* Expiration of link itself */
+ char *args; /* Arguments if this is a filter */
+ struct pattrib *lattrib; /* Attributes associated w/ link */
+ struct pfile *f_info; /* Info to be assoicated w/ file */
+ struct vlink *previous; /* Previous elt in linked list */
+ struct vlink *next; /* Next element in linked list */
+ };
+
+ typedef struct vlink *VLINK;
+ typedef struct vlink VLINK_ST;
+
+ /* * Note that vlink->replicas is not really a list of replicas of the */
+ /* object. Instead, it is a list of the objects returned during name */
+ /* resolution that share the same name as the current object. Such */
+ /* an object should only be considered a replica if it also shares */
+ /* the same non-zero magic number. */
+
+ /* Definition of structure continiaing virtual directory information */
+
+ struct vdir {
+ int version; /* Version of local directory fmt */
+ int inc_native; /* Include the native directory */
+ long magic_no; /* Magic number of current file */
+ struct acl *dacl; /* Default acl for links in dir */
+ struct pfile *f_info; /* Directory file info */
+ struct vlink *links; /* The directory entries */
+ struct vlink *lastlink; /* Last directory entry */
+ struct vlink *ulinks; /* The entries for union links */
+ struct vdir *previous; /* Previous element in linked list */
+ struct vdir *next; /* Next element in linked list */
+ };
+
+ typedef struct vdir *VDIR1;
+ typedef struct vdir VDIR_ST;
+
+ /* Initialize directory */
+ #define vdir_init(dir) ZERO(dir)
+ /* XXX: was
+
+ dir->version = 0; dir->inc_native = 0; \
+ dir->magic_no = 0; dir->f_info = NULL; \
+ dir->links = NULL; dir->lastlink = NULL; \
+ dir->ulinks = NULL; dir->dacl = NULL; \
+ dir->previous = NULL; dir->next = NULL;
+ */
+
+ #define vdir_copy(d1,d2) d2->version = d1->version; \
+ d2->inc_native = d1->inc_native; \
+ d2->magic_no = d1->magic_no; \
+ d2->f_info = d1->f_info; \
+ d2->links = d1->links; \
+ d2->lastlink = d1->lastlink; \
+ d2->ulinks = d1->ulinks; \
+ d2->dacl = d1->dacl; \
+ d2->previous = d1->previous; \
+ d2->next = d1->next;
+
+ /* Values of ->inc_native in vdir structure */
+ #define VDIN_REALONLY -1 /* Include native files, but not . and .. */
+ #define VDIN_NONATIVE 0 /* Do not include files from native directory */
+ #define VDIN_INCLNATIVE 1 /* Include files from native directory */
+ #define VDIN_NATIVEONLY 2 /* All entries in directory are from native dir */
+ #define VDIN_PSEUDO 3 /* Directory is not real */
+
+
+ /* Definition of structure containing information on a specific file */
+
+ union avalue {
+ char *ascii; /* Character string */
+ struct vlink *link; /* A link */
+ };
+
+
+ struct pattrib {
+ char precedence; /* Precedence for link attribute */
+ char *aname; /* Name of the attribute */
+ char *avtype; /* Type of the attribute value */
+ union avalue value; /* Attribute Value */
+ struct pattrib *previous; /* Previous element in linked list */
+ struct pattrib *next; /* Next element in linked list */
+ };
+
+ typedef struct pattrib *PATTRIB;
+ typedef struct pattrib PATTRIB_ST;
+
+ #define ATR_PREC_OBJECT 'O' /* Authoritative answer for object */
+ #define ATR_PREC_LINK 'L' /* Authoritative answer for link */
+ #define ATR_PREC_CACHED 'C' /* Object info cached w/ link */
+ #define ATR_PREC_REPLACE 'R' /* From link (replaces O) */
+ #define ATR_PREC_ADD 'A' /* From link (additional value) */
+
+ /* **** Incomplete **** */
+ struct pfile {
+ int version; /* Version of local finfo format */
+ long f_magic_no; /* Magic number of current file */
+ long exp; /* Expiration date of timeout */
+ long ttl; /* Time to live after reference */
+ long last_ref; /* Time of last reference */
+ struct vlink *forward; /* List of forwarding pointers */
+ struct vlink *backlinks; /* Partial list of back links */
+ struct pattrib *attributes; /* List of file attributes */
+ struct pfile *previous; /* Previous element in linked list */
+ struct pfile *next; /* Next element in linked list */
+ };
+
+ typedef struct pfile *PFILE;
+ typedef struct pfile PFILE_ST;
+
+ /* Definition of structure contining an access control list entry */
+
+ struct acl {
+ int acetype; /* Access Contol Entry type */
+ char *atype; /* Authentication type */
+ char *rights; /* Rights */
+ char *principals; /* Authorized principals */
+ struct restrict *restrictions; /* Restrictions on use */
+ struct acl *previous; /* Previous elt in linked list */
+ struct acl *next; /* Next element in linked list */
+ };
+ typedef struct acl *ACL;
+ typedef struct acl ACL_ST;
+
+ #define ACL_NONE 0 /* Nobody authorized by ths entry */
+ #define ACL_DEFAULT 1 /* System default */
+ #define ACL_SYSTEM 2 /* System administrator */
+ #define ACL_OWNER 3 /* Directory owner */
+ #define ACL_DIRECTORY 4 /* Same as directory */
+ #define ACL_ANY 5 /* Any user */
+ #define ACL_AUTHENT 6 /* Authenticated principal */
+ #define ACL_LGROUP 7 /* Local group */
+ #define ACL_GROUP 8 /* External group */
+ #define ACL_ASRTHOST 10 /* Check host and asserted userid */
+ #define ACL_TRSTHOST 11 /* ASRTHOST from privileged port */
+
+
+ /* Definition of structure contining access restrictions */
+ /* for future extensions */
+ struct restrict {
+ struct acl *previous; /* Previous elt in linked list */
+ struct acl *next; /* Next element in linked list */
+ };
+
+ /* Definitions for send_to_dirsrv */
+ #define CLIENT_DIRSRV_TIMEOUT 4 /* time between retries */
+ #define CLIENT_DIRSRV_BACKOFF(x) (2 * x) /* Backoff algorithm */
+ #define CLIENT_DIRSRV_RETRY 3 /* retry this many times */
+
+ /* Definitions for rd_vlink and rd_vdir */
+ #define SYMLINK_NESTING 10 /* Max nesting depth for sym links */
+
+ /* Definition fo check_acl */
+ #define ACL_NESTING 10 /* Max depth for ACL group nesting */
+
+ /* Flags for mk_vdir */
+ #define MKVD_LPRIV 1 /* Minimize privs for creator in new ACL */
+
+ /* Flags for get_vdir */
+ #define GVD_UNION 0 /* Do not expand union links */
+ #define GVD_EXPAND 1 /* Expand union links locally */
+ #define GVD_LREMEXP 3 /* Request remote expansion of local links */
+ #define GVD_REMEXP 7 /* Request remote expansion of all links */
+ #define GVD_VERIFY 8 /* Only verify args are for a directory */
+ #define GVD_FIND 16 /* Stop expanding when match is found */
+ #define GVD_ATTRIB 32 /* Request attributes from remote server */
+ #define GVD_NOSORT 64 /* Do not sort links when adding to dir */
+
+ /* Flags for rd_vdir */
+ #define RVD_UNION GVD_UNION
+ #define RVD_EXPAND GVD_EXPAND
+ #define RVD_LREMEXP GVD_LREMEXP
+ #define RVD_REMEXP GVD_REMEXP
+ #define RVD_DFILE_ONLY GVD_VERIFY /* Only return ptr to dir file */
+ #define RVD_FIND GVD_FIND
+ #define RVD_ATTRIB GVD_ATTRIB
+ #define RVD_NOSORT GVD_NOSORT
+ #define RVD_NOCACHE 128
+
+ /* Flags for add_vlink */
+ #define AVL_UNION 1 /* Link is a union link */
+
+ /* Flags for vl_insert */
+ #define VLI_NOCONFLICT 0 /* Do not insert links w/ conflicting names */
+ #define VLI_ALLOW_CONF 1 /* Allow links with conflicting names */
+ #define VLI_NOSORT 2 /* Allow conflicts and don't sort */
+
+ /* Flags for mapname */
+ #define MAP_READWRITE 0 /* Named file to be read and written */
+ #define MAP_READONLY 1 /* Named file to be read only */
+
+ /* Flags for modify_acl */
+ #define MACL_NOSYSTEM 0x01
+ #define MACL_NOSELF 0x02
+ #define MACL_DEFAULT 0x08
+ #define MACL_SET 0x0C
+ #define MACL_INSERT 0x14
+ #define MACL_DELETE 0x10
+ #define MACL_ADD 0x1C
+ #define MACL_SUBTRACT 0x18
+ #define MACL_LINK 0x00
+ #define MACL_DIRECTORY 0x20
+ #define MACL_OBJECT 0x60
+ #define MACL_INCLUDE 0x40
+
+ #define MACL_OP (MACL_DEFAULT|MACL_SET|MACL_INSERT|\
+ MACL_DELETE|MACL_ADD|MACL_SUBTRACT)
+
+ #define MACL_OTYPE (MACL_LINK|MACL_DIRECTORY|MACL_OBJECT|MACL_INCLUDE)
+
+ /* Access methods returned by Pget_am */
+ #define P_AM_ERROR 0
+ #define P_AM_FTP 1
+ #define P_AM_AFTP 2 /* Anonymous FTP */
+ #define P_AM_NFS 4
+ #define P_AM_KNFS 8 /* Kerberized NFS */
+ #define P_AM_AFS 16
+
+ /* Return codes */
+
+ #define PSUCCESS 0
+ #define PFAILURE 255
+
+ /* Hush up warnings. */
+ void vllfree();
+
+ /* Procedures in libpfs.a */
+
+ char *pget_wdhost(), *pget_wdfile(), *pget_wd(), *pget_hdhost();
+ char *pget_hdfile(), *pget_hd(), *pget_rdhost(), *pget_rdfile();
+ char *pget_dhost(), *pget_dfile(), *pget_vsname(), *nlsindex();
+ char *sindex(), *strtok(), *nxtline(), *unquote(), *stcopy();
+ char *stcopyr(), *readheader(), *month_sname();
+
+ long asntotime();
+ void procquery(char *host,char *str,int max_hits,int offset,
+ char query_type,int sortflag,int listflag);
+
+ PTEXT ptalloc();
+ PTEXT dirsend();
+ void ptfree();
+ void ptlfree();
+
+ PREQ pralloc();
+ PREQ get_next_request();
+
+ VLINK rd_slink();
+ VLINK rd_vlink();
+ VLINK vl_delete();
+ VLINK vlalloc();
+ VLINK vlcopy();
+ void vlfree();
+
+ PFILE pfalloc();
+
+ PATTRIB parse_attribute();
+ PATTRIB atalloc();
+ PATTRIB pget_at();
+ void atfree();
+ void atlfree();
+
+ ACL acalloc();
+ ACL get_acl();
+
+ void stfree();
+
+ /* Miscellaneous useful definitions */
+ #ifndef TRUE
+ #define TRUE 1
+ #define FALSE 0
+ #endif
+
+ #define AUTHORIZED 1
+ #define NOT_AUTHORIZED 0
+ #define NEG_AUTHORIZED -1
+
+ #ifndef NULL
+ #define NULL 0
+ #endif
+
+ #define FAILED -1
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/pmachine.h
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/pmachine.h:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/pmachine.h Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,111 ----
+ /*
+ * Miscellaneous system dependencies.
+ *
+ * I kept the name pmachine.h because it was already in all of the files...this
+ * barely resembles the pmachine.h that comes with the real Prospero, tho.
+ *
+ * v1.2.1 - 12/13/91 (bpk) - added 3b2
+ * v1.2.0 - 11/19/91 (mmt) - added MSDOS & OS2 stuff
+ */
+
+ #ifdef u3b2
+ # define USG
+ # define NOREGEX
+ # define MAXPATHLEN 1024 /* There's no maxpathlen in any 3b2 .h file. */
+ #endif
+
+ #ifdef hpux
+ # ifndef bcopy
+ # define FUNCS /* HP/UX 8.0 has the fns. */
+ # endif
+ # define NOREGEX
+ # define NEED_STRING_H
+ #endif
+
+ #if defined(USG) || defined(SYSV)
+ # define FUNCS
+ #endif
+
+ #ifdef ISC
+ # define FUNCS
+ # define STRSPN
+ # define NOREGEX
+ #endif
+
+ #ifdef CUTCP
+ # define FUNCS
+ # define NOREGEX
+ # define NEED_STRING_H
+ # define SELECTARG int
+ # define MSDOS
+ #endif
+
+ #ifdef OS2
+ # define NOREGEX
+ # include <pctcp.h>
+ #endif
+ #ifdef MSDOS
+ # define USG
+ # define NOREGEX
+ # include <string.h>
+ # include <stdlib.h>
+ #endif
+
+ #ifdef _AIX
+ # ifdef u370
+ # define FUNCS
+ # endif /* AIX/370 */
+ # define _NONSTD_TYPES
+ # define _BSD_INCLUDES
+ # define NEED_STRING_H
+ # define NEED_SELECT_H
+ # define NEED_TIME_H
+ #endif
+
+ /* ==== */
+ #ifdef FUNCS
+ # define index strchr
+ /* According to mycroft. */
+ # ifdef _IBMR2
+ char *strchr();
+ # endif
+ # define rindex strrchr
+ # ifndef AUX
+ # define bcopy(a,b,n) memcpy(b,a,n)
+ # define bzero(a,n) memset(a,0,n)
+ # ifdef _IBMR2
+ char *memset();
+ # endif
+ # endif
+ #endif
+
+ #if defined(_IBMR2) || defined(_BULL_SOURCE)
+ # define NEED_SELECT_H
+ #endif
+ #if defined(USG) || defined(UTS)
+ # define NEED_STRING_H
+ #endif
+ #if defined(USG) || defined(UTS) || defined(AUX)
+ # define NEED_TIME_H
+ #endif
+
+ #ifdef VMS
+ /* Get the system status stuff. */
+ # include <ssdef.h>
+ #endif /* VMS */
+
+ /*
+ * FD_SET: lib/pfs/dirsend.c, user/vget/ftp.c
+ */
+ #ifndef CUTCP
+
+ #define SELECTARG fd_set
+ #if !defined(FD_SET) && !defined(VMS) && !defined(NEED_SELECT_H)
+ #define FD_SETSIZE 32
+ #define FD_SET(n, p) ((p)->fds_bits[(n)/NFDBITS] |= (1 << ((n) % NFDBITS)))
+ #define FD_CLR(n, p) ((p)->fds_bits[(n)/NFDBITS] &= ~(1 << ((n) % NFDBITS)))
+ #define FD_ISSET(n, p) ((p)->fds_bits[(n)/NFDBITS] & (1 << ((n) % NFDBITS)))
+ #define FD_ZERO(p) bzero((char *)(p), sizeof(*(p)))
+ #endif
+
+ #endif /* not CUTCP */
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/pprot.h
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/pprot.h:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/pprot.h Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,59 ----
+ /*
+ * Copyright (c) 1989, 1990, 1991 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ *
+ * v1.2.0 - 11/19/91 (mmt) - added MSDOS & OS2 stuff
+ */
+
+ #include <copyright.h>
+
+ #ifndef MAXPATHLEN
+ # ifdef VMS
+ # define MAXPATHLEN 32
+ # else /* not VMS */
+ # if defined(MSDOS) && !defined(OS2)
+ # define MAXPATHLEN 255
+ # else /* not MSDOS */
+ # ifdef ISC
+ # define MAXPATHLEN 512
+ # else /* not Interactive..normal! (gasp) */
+ # include <sys/param.h>
+ # endif /* ISC */
+ # endif /* MSDOS && !OS2 */
+ # endif /* VMS */
+ #endif
+
+ /* Protocol Definitions */
+
+ #define VFPROT_VNO 1 /* Protocol Version Number */
+
+ #define DIRSRV_PORT 1525 /* Server port used if not in srvtab */
+ #define PROSPERO_PORT 191 /* Officially assigned prived port */
+ #define PROS_FIRST_PRIVP 901 /* First privileged port to try */
+ #define PROS_NUM_PRIVP 20 /* Number of privileged ports to try */
+
+ #define MAXPKT 1024 /* Max size of response from server */
+ #define SEQ_SIZE 32 /* Max size of sequence text in resp */
+ #define MAX_DIR_LINESIZE 160+MAXPATHLEN /* Max linesize in directory */
+
+ #define MAX_FWD_DEPTH 20 /* Max fwd pointers to follow */
+
+ #define S_AD_SZ sizeof(struct sockaddr_in)
+
+ /* Replacement for strtok that doesn't keep state. Both the variable */
+ /* S and the variable S_next must be defined. To initialize, assign */
+ /* the string to be stepped through to S_next, then call get_token on */
+ /* S. The first token will be in S, and S_next will point to the next */
+ /* token. Like strtok, this macro does modify the string passed to it */
+ #define get_token(S,C) \
+ S = S/**/_next; \
+ if(S) { \
+ while(*S == C) S++; \
+ S/**/_next = index(S,C); \
+ if(S/**/_next) *(S/**/_next++) = '\0'; \
+ if(!*S) S = NULL; \
+ }
+
+
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/procquery.c
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/procquery.c:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/procquery.c Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,213 ----
+ /*
+ * procquery.c : Routines for processing results from Archie
+ *
+ * Originally part of the Prospero Archie client by Cliff Neuman (bcn at isi.edu).
+ * Modified by Brendan Kehoe (brendan at cs.widener.edu).
+ * Re-modified by George Ferguson (ferguson at cs.rochester.edu).
+ *
+ * Copyright (c) 1991 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ *
+ * v1.2.2 - 11/19/91 (mmt) - added MSDOS & OS2 stuff
+ * v1.2.1 - 10/18/91 (bpk) - warning stuff
+ * v1.2.0 - 09/20/91 (bpk) - VMS under Multinet 3.0 too
+ * v1.1.1 - 08/20/91 (bpk) - took out archie_query from error msg
+ */
+ #include <copyright.h>
+ #include <stdio.h>
+ #include <pfs.h>
+ #include <perrno.h>
+ #include <pmachine.h>
+ #include <archie.h>
+
+ # include <time.h>
+
+ extern int client_dirsrv_timeout,client_dirsrv_retry; /* dirsend.c */
+ extern char *progname;
+
+
+ /*
+ * Functions defined here
+ */
+
+ extern void procquery(char *host,char *str,int max_hits,int offset,
+ char query_type,int sortflag,int listflag);
+
+ void display_link(VLINK l,int listflag);
+
+ /*
+ * Data defined here
+ */
+ extern int pwarn, perrno;
+ #ifdef DEBUG
+ int pfs_debug;
+ #endif
+ static struct tm *presenttime;
+ static char lastpath[MAX_VPATH] = "\001";
+ static char lasthost[MAX_VPATH] = "\001";
+
+ /* - - - - - - - - */
+ /*
+ * display_link : Prints the contents of the given virtual link. If
+ * listflag is 0, then this uses last{host,path} to save state
+ * between calls for a less verbose output. If listflag is non-zero
+ * then all information is printed every time.
+ */
+ void display_link(VLINK l,int listflag)
+ {
+ PATTRIB ap;
+ char linkpath[MAX_VPATH];
+ int dirflag = 0;
+ #ifdef MSDOS
+ unsigned long size = 0L;
+ #else
+ int size = 0;
+ #endif
+ char *modes = "";
+ char archie_date[20];
+ char *gt_date = "";
+ int gt_year = 0;
+ int gt_mon = 0;
+ int gt_day = 0;
+ int gt_hour = 0;
+ int gt_min = 0;
+
+ /* Initialize local buffers */
+ *archie_date = '\0';
+
+ /* Remember if we're looking at a directory */
+ if (sindex(l->type,"DIRECTORY"))
+ dirflag = 1;
+ else
+ dirflag = 0;
+
+ /* Extract the linkpath from the filename */
+ strcpy(linkpath,l->filename);
+ *(linkpath + (strlen(linkpath) - strlen(l->name) - 1)) = '\0';
+
+ /* Is this a new host? */
+ if (strcmp(l->host,lasthost) != 0) {
+ if (!listflag)
+ printf("\nHost %s\n\n",l->host);
+ strcpy(lasthost,l->host);
+ *lastpath = '\001';
+ }
+
+ /* Is this a new linkpath (location)? */
+ if(strcmp(linkpath,lastpath) != 0) {
+ if (!listflag)
+ printf(" Location: %s\n",(*linkpath ? linkpath : "/"));
+ strcpy(lastpath,linkpath);
+ }
+
+ /* Parse the attibutes of this link */
+ for (ap = l->lattrib; ap; ap = ap->next) {
+ if (strcmp(ap->aname,"SIZE") == 0) {
+ #ifdef MSDOS
+ sscanf(ap->value.ascii,"%lu",&size);
+ #else
+ sscanf(ap->value.ascii,"%d",&size);
+ #endif
+ } else if(strcmp(ap->aname,"UNIX-MODES") == 0) {
+ modes = ap->value.ascii;
+ } else if(strcmp(ap->aname,"LAST-MODIFIED") == 0) {
+ gt_date = ap->value.ascii;
+ sscanf(gt_date,"%4d%2d%2d%2d%2d",>_year,
+ >_mon, >_day, >_hour, >_min);
+ if ((12 * (presenttime->tm_year + 1900 - gt_year) +
+ presenttime->tm_mon - gt_mon) > 6)
+ sprintf(archie_date,"%s %2d %4d",month_sname(gt_mon),
+ gt_day, gt_year);
+ else
+ sprintf(archie_date,"%s %2d %02d:%02d",month_sname(gt_mon),
+ gt_day, gt_hour, gt_min);
+ }
+ }
+
+ /* Print this link's information */
+ if (listflag)
+ #if defined(MSDOS)
+ printf("%s %6lu %s %s%s\n",gt_date,size,l->host,l->filename,
+ (dirflag ? "/" : ""));
+ #else
+ printf("%s %6d %s %s%s\n",gt_date,size,l->host,l->filename,
+ (dirflag ? "/" : ""));
+ #endif
+ else
+ #ifdef MSDOS
+ printf(" %9s %s %10lu %s %s\n",(dirflag ? "DIRECTORY" : "FILE"),
+ modes,size,archie_date,l->name);
+ #else
+ printf(" %9s %s %10d %s %s\n",(dirflag ? "DIRECTORY" : "FILE"),
+ modes,size,archie_date,l->name);
+ #endif /* MSDOS */
+
+
+ /* Free the attibutes */
+ atlfree(l->lattrib);
+ l->lattrib = NULL;
+ }
+
+ /* - - - - - - - - */
+ /*
+ * procquery : Process the given query and display the results. If
+ * sortflag is non-zero, then the results are sorted by increasing
+ * date, else by host/filename. If listflag is non-zero then each
+ * entry is printed on a separate, complete line. Note that listflag
+ * is ignored by xarchie.
+ */
+ void procquery(char *host,char *str,int max_hits,int offset,char query_type,
+ int sortflag,int listflag)
+ {
+ VLINK l;
+ long now;
+
+ /* initialize data structures for this query */
+ (void)time(&now);
+ presenttime = localtime(&now);
+
+ /* Do the query */
+ if (sortflag == 1)
+ l = archie_query(host,str,max_hits,offset,query_type,AQ_INVDATECMP,0);
+ else
+ l = archie_query(host,str,max_hits,offset,query_type,NULL,0);
+
+ /* Error? */
+ if (perrno != PSUCCESS) {
+ if (p_err_text[perrno]) {
+ if (*p_err_string)
+ fprintf(stderr, "%s: failed: %s - %s\n", progname,
+ p_err_text[perrno], p_err_string);
+ else
+ fprintf(stderr, "%s failed: %s\n", progname, p_err_text[perrno]);
+ } else
+ fprintf(stderr, "%s failed: Undefined error %d (prospero)",
+ (char*) perrno,0);
+ }
+
+ /* Warning? */
+ if (pwarn != PNOWARN) {
+ if (*p_warn_string)
+ fprintf(stderr, "%s: Warning! %s - %s\n", progname,
+ p_warn_text[pwarn], p_warn_string);
+ else
+ fprintf(stderr, "%s: Warning! %s\n", progname, p_warn_text[pwarn]);
+ }
+
+
+ /* Display the results */
+
+ if (l == (VLINK)NULL && pwarn == PNOWARN && perrno == PSUCCESS) {
+ if (! listflag) puts ("No matches.");
+ exit (1);
+ }
+
+ *lasthost = '\001';
+ *lastpath = '\001';
+ while (l != NULL) {
+ display_link(l,listflag);
+ l = l->next;
+ }
+ }
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/ptalloc.c
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/ptalloc.c:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/ptalloc.c Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,88 ----
+ /*
+ * Copyright (c) 1989, 1990, 1991 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ *
+ * v1.2.0 - 11/19/91 (mmt) - added MSDOS & OS2 stuff
+ */
+
+ #include <copyright.h>
+ #include <stdio.h>
+ #include <stdlib.h>
+
+ #include <pfs.h>
+ #include <pmachine.h> /* for correct definition of ZERO */
+ #ifdef MSDOS
+ # define free _pfree /* otherwise we get conflicts with free() */
+ #endif
+
+ static PTEXT free1 = NULL;
+ int ptext_count = 0;
+ int ptext_max = 0;
+
+ /*
+ * ptalloc - allocate and initialize ptext structure
+ *
+ * PTALLOC returns a pointer to an initialized structure of type
+ * PTEXT. If it is unable to allocate such a structure, it
+ * returns NULL.
+ */
+
+ extern void bzero(char *b,int length);
+
+ PTEXT ptalloc(void)
+ {
+ PTEXT vt;
+ if(free1) {
+ vt = free1;
+ free1 = free1->next;
+ }
+ else {
+ vt = (PTEXT) malloc(sizeof(PTEXT_ST));
+ if (!vt) return(NULL);
+ ptext_max++;
+ }
+ ptext_count++;
+
+ /* nearly all parts are 0 [or NULL] */
+ ZERO(vt);
+ /* The offset is to leave room for additional headers */
+ vt->start = vt->dat + MAX_PTXT_HDR;
+
+ return(vt);
+ }
+
+ /*
+ * ptfree - free a VTEXT structure
+ *
+ * VTFREE takes a pointer to a VTEXT structure and adds it to
+ * the free list for later reuse.
+ */
+
+ void ptfree(PTEXT vt)
+ {
+ vt->next = free1;
+ vt->previous = NULL;
+ free1 = vt;
+ ptext_count--;
+ }
+
+ /*
+ * ptlfree - free a VTEXT structure
+ *
+ * VTLFREE takes a pointer to a VTEXT structure frees it and any linked
+ * VTEXT structures. It is used to free an entrie list of VTEXT
+ * structures.
+ */
+
+ void ptlfree(PTEXT vt)
+ {
+ PTEXT nxt;
+
+ while(vt != NULL) {
+ nxt = vt->next;
+ ptfree(vt);
+ vt = nxt;
+ }
+ }
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/rdgram.h
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/rdgram.h:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/rdgram.h Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,16 ----
+ /*
+ * Copyright (c) 1991 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ */
+
+ #include <copyright.h>
+
+ /* Queuing priorities for datagrams */
+ #define RDGRAM_MAX_PRI 32765 /* Maximum user proiority */
+ #define RDGRAM_MAX_SPRI 32767 /* Maximum priority for system use */
+ #define RDGRAM_MIN_PRI -32765 /* Maximum user proiority */
+ #define RDGRAM_MIN_SPRI -32768 /* Maximum priority for system use */
+
+ int rdgram_priority = 0;
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/regex.c
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/regex.c:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/regex.c Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,685 ----
+ #include <pmachine.h>
+
+ #ifdef NOREGEX
+ /*
+ * These routines are BSD regex(3)/ed(1) compatible regular-expression
+ * routines written by Ozan S. Yigit, Computer Science, York University.
+ * Parts of the code that are not needed by Prospero have been removed,
+ * but most of the accompanying information has been left intact.
+ * This file is to be included on those operating systems that do not
+ * support re_comp and re_exec.
+ */
+
+ /*
+ * regex - Regular expression pattern matching
+ * and replacement
+ *
+ * by: Ozan S. Yigit (oz at nexus.yorku.ca)
+ * Dept. of Computing Services
+ * York University
+ *
+ * These routines are the PUBLIC DOMAIN equivalents
+ * of regex routines as found in 4.nBSD UN*X, with minor
+ * extensions.
+ *
+ * Modification history:
+ *
+ * $Log: regex.c,v $
+ * Revision 1.1 2004/10/05 18:19:58 lattner
+ * New "Benchmark". Of course running it just prints usage info, but whatever.
+ *
+ * Revision 1.3 89/04/01 14:18:09 oz
+ * Change all references to a dfa: this is actually an nfa.
+ *
+ * Revision 1.2 88/08/28 15:36:04 oz
+ * Use a complement bitmap to represent NCL.
+ * This removes the need to have seperate
+ * code in the pmatch case block - it is
+ * just CCL code now.
+ *
+ * Use the actual CCL code in the CLO
+ * section of pmatch. No need for a recursive
+ * pmatch call.
+ *
+ * Use a bitmap table to set char bits in an
+ * 8-bit chunk.
+ *
+ * Routines:
+ * re_comp: compile a regular expression into
+ * a NFA.
+ *
+ * char *re_comp(s)
+ * char *s;
+ *
+ * re_exec: execute the NFA to match a pattern.
+ *
+ * int re_exec(s)
+ * char *s;
+ *
+ * Regular Expressions:
+ *
+ * [1] char matches itself, unless it is a special
+ * character (metachar): . \ [ ] * + ^ $
+ *
+ * [2] . matches any character.
+ *
+ * [3] \ matches the character following it, except
+ * when followed by a left or right round bracket,
+ * a digit 1 to 9 or a left or right angle bracket.
+ * (see [7], [8] and [9])
+ * It is used as an escape character for all
+ * other meta-characters, and itself. When used
+ * in a set ([4]), it is treated as an ordinary
+ * character.
+ *
+ * [4] [set] matches one of the characters in the set.
+ * If the first character in the set is "^",
+ * it matches a character NOT in the set, i.e.
+ * complements the set. A shorthand S-E is
+ * used to specify a set of characters S upto
+ * E, inclusive. The special characters "]" and
+ * "-" have no special meaning if they appear
+ * as the first chars in the set.
+ * examples: match:
+ *
+ * [a-z] any lowercase alpha
+ *
+ * [^]-] any char except ] and -
+ *
+ * [^A-Z] any char except uppercase
+ * alpha
+ *
+ * [a-zA-Z] any alpha
+ *
+ * [5] * any regular expression form [1] to [4], followed by
+ * closure char (*) matches zero or more matches of
+ * that form.
+ *
+ * [6] + same as [5], except it matches one or more.
+ *
+ * [7] a regular expression in the form [1] to [10], enclosed
+ * as \(form\) matches what form matches. The enclosure
+ * creates a set of tags, used for [8] and for
+ * pattern substution. The tagged forms are numbered
+ * starting from 1.
+ *
+ * [8] a \ followed by a digit 1 to 9 matches whatever a
+ * previously tagged regular expression ([7]) matched.
+ *
+ * [9] \< a regular expression starting with a \< construct
+ * \> and/or ending with a \> construct, restricts the
+ * pattern matching to the beginning of a word, and/or
+ * the end of a word. A word is defined to be a character
+ * string beginning and/or ending with the characters
+ * A-Z a-z 0-9 and _. It must also be preceded and/or
+ * followed by any character outside those mentioned.
+ *
+ * [10] a composite regular expression xy where x and y
+ * are in the form [1] to [10] matches the longest
+ * match of x followed by a match for y.
+ *
+ * [11] ^ a regular expression starting with a ^ character
+ * $ and/or ending with a $ character, restricts the
+ * pattern matching to the beginning of the line,
+ * or the end of line. [anchors] Elsewhere in the
+ * pattern, ^ and $ are treated as ordinary characters.
+ *
+ *
+ * Acknowledgements:
+ *
+ * HCR's Hugh Redelmeier has been most helpful in various
+ * stages of development. He convinced me to include BOW
+ * and EOW constructs, originally invented by Rob Pike at
+ * the University of Toronto.
+ *
+ * References:
+ * Software tools Kernighan & Plauger
+ * Software tools in Pascal Kernighan & Plauger
+ * Grep [rsx-11 C dist] David Conroy
+ * ed - text editor Un*x Programmer's Manual
+ * Advanced editing on Un*x B. W. Kernighan
+ * regexp routines Henry Spencer
+ *
+ * Notes:
+ *
+ * This implementation uses a bit-set representation for character
+ * classes for speed and compactness. Each character is represented
+ * by one bit in a 128-bit block. Thus, CCL always takes a
+ * constant 16 bytes in the internal nfa, and re_exec does a single
+ * bit comparison to locate the character in the set.
+ *
+ * Examples:
+ *
+ * pattern: foo*.*
+ * compile: CHR f CHR o CLO CHR o END CLO ANY END END
+ * matches: fo foo fooo foobar fobar foxx ...
+ *
+ * pattern: fo[ob]a[rz]
+ * compile: CHR f CHR o CCL bitset CHR a CCL bitset END
+ * matches: fobar fooar fobaz fooaz
+ *
+ * pattern: foo\\+
+ * compile: CHR f CHR o CHR o CHR \ CLO CHR \ END END
+ * matches: foo\ foo\\ foo\\\ ...
+ *
+ * pattern: \(foo\)[1-3]\1 (same as foo[1-3]foo)
+ * compile: BOT 1 CHR f CHR o CHR o EOT 1 CCL bitset REF 1 END
+ * matches: foo1foo foo2foo foo3foo
+ *
+ * pattern: \(fo.*\)-\1
+ * compile: BOT 1 CHR f CHR o CLO ANY END EOT 1 CHR - REF 1 END
+ * matches: foo-foo fo-fo fob-fob foobar-foobar ...
+ *
+ */
+
+ #define MAXNFA 1024
+ #define MAXTAG 10
+
+ #define OKP 1
+ #define NOP 0
+
+ #define CHR 1
+ #define ANY 2
+ #define CCL 3
+ #define BOL 4
+ #define EOL 5
+ #define BOT 6
+ #define EOT 7
+ #define BOW 8
+ #define EOW 9
+ #define REF 10
+ #define CLO 11
+
+ #define END 0
+
+ /*
+ * The following defines are not meant
+ * to be changeable. They are for readability
+ * only.
+ *
+ */
+ #define MAXCHR 128
+ #define CHRBIT 8
+ #define BITBLK MAXCHR/CHRBIT
+ #define BLKIND 0170
+ #define BITIND 07
+
+ #define ASCIIB 0177
+
+ typedef /*unsigned*/ char CHAR;
+
+ static int tagstk[MAXTAG]; /* subpat tag stack..*/
+ static CHAR nfa[MAXNFA]; /* automaton.. */
+ static int sta = NOP; /* status of lastpat */
+
+ static CHAR bittab[BITBLK]; /* bit table for CCL */
+ /* pre-set bits... */
+ static CHAR bitarr[] = {1,2,4,8,16,32,64,128};
+
+ static int internal_error;
+
+ static void chset(register CHAR c)
+ {
+ bittab[((c) & BLKIND) >> 3] |= bitarr[(c) & BITIND];
+ }
+
+ #define badpat(x) return (*nfa = END, x)
+ #define store(x) *mp++ = x
+
+ char *re_comp(char *pat)
+ {
+ register char *p; /* pattern pointer */
+ register CHAR *mp = nfa; /* nfa pointer */
+ register CHAR *lp; /* saved pointer.. */
+ register CHAR *sp = nfa; /* another one.. */
+
+ register int tagi = 0; /* tag stack index */
+ register int tagc = 1; /* actual tag count */
+
+ register int n;
+ register CHAR mask; /* xor mask -CCL/NCL */
+ int c1, c2;
+
+ if (!pat || !*pat)
+ if (sta)
+ return 0;
+ else
+ badpat("No previous regular expression");
+ sta = NOP;
+
+ for (p = pat; *p; p++) {
+ lp = mp;
+ switch(*p) {
+
+ case '.': /* match any char.. */
+ store(ANY);
+ break;
+
+ case '^': /* match beginning.. */
+ if (p == pat)
+ store(BOL);
+ else {
+ store(CHR);
+ store(*p);
+ }
+ break;
+
+ case '$': /* match endofline.. */
+ if (!*(p+1))
+ store(EOL);
+ else {
+ store(CHR);
+ store(*p);
+ }
+ break;
+
+ case '[': /* match char class..*/
+ store(CCL);
+
+ if (*++p == '^') {
+ mask = 0377;
+ p++;
+ }
+ else
+ mask = 0;
+
+ if (*p == '-') /* real dash */
+ chset(*p++);
+ if (*p == ']') /* real brac */
+ chset(*p++);
+ while (*p && *p != ']') {
+ if (*p == '-' && *(p+1) && *(p+1) != ']') {
+ p++;
+ c1 = *(p-2) + 1;
+ c2 = *p++;
+ while (c1 <= c2)
+ chset(c1++);
+ }
+ #ifdef EXTEND
+ else if (*p == '\\' && *(p+1)) {
+ p++;
+ chset(*p++);
+ }
+ #endif
+ else
+ chset(*p++);
+ }
+ if (!*p)
+ badpat("Missing ]");
+
+ for (n = 0; n < BITBLK; bittab[n++] = (char) 0)
+ store(mask ^ bittab[n]);
+
+ break;
+
+ case '*': /* match 0 or more.. */
+ case '+': /* match 1 or more.. */
+ if (p == pat)
+ badpat("Empty closure");
+ lp = sp; /* previous opcode */
+ if (*lp == CLO) /* equivalence.. */
+ break;
+ switch(*lp) {
+
+ case BOL:
+ case BOT:
+ case EOT:
+ case BOW:
+ case EOW:
+ case REF:
+ badpat("Illegal closure");
+ default:
+ break;
+ }
+
+ if (*p == '+')
+ for (sp = mp; lp < sp; lp++)
+ store(*lp);
+
+ store(END);
+ store(END);
+ sp = mp;
+ while (--mp > lp)
+ *mp = mp[-1];
+ store(CLO);
+ mp = sp;
+ break;
+
+ case '\\': /* tags, backrefs .. */
+ switch(*++p) {
+
+ case '(':
+ if (tagc < MAXTAG) {
+ tagstk[++tagi] = tagc;
+ store(BOT);
+ store(tagc++);
+ }
+ else
+ badpat("Too many \\(\\) pairs");
+ break;
+ case ')':
+ if (*sp == BOT)
+ badpat("Null pattern inside \\(\\)");
+ if (tagi > 0) {
+ store(EOT);
+ store(tagstk[tagi--]);
+ }
+ else
+ badpat("Unmatched \\)");
+ break;
+ case '<':
+ store(BOW);
+ break;
+ case '>':
+ if (*sp == BOW)
+ badpat("Null pattern inside \\<\\>");
+ store(EOW);
+ break;
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ n = *p-'0';
+ if (tagi > 0 && tagstk[tagi] == n)
+ badpat("Cyclical reference");
+ if (tagc > n) {
+ store(REF);
+ store(n);
+ }
+ else
+ badpat("Undetermined reference");
+ break;
+ #ifdef EXTEND
+ case 'b':
+ store(CHR);
+ store('\b');
+ break;
+ case 'n':
+ store(CHR);
+ store('\n');
+ break;
+ case 'f':
+ store(CHR);
+ store('\f');
+ break;
+ case 'r':
+ store(CHR);
+ store('\r');
+ break;
+ case 't':
+ store(CHR);
+ store('\t');
+ break;
+ #endif
+ default:
+ store(CHR);
+ store(*p);
+ }
+ break;
+
+ default : /* an ordinary char */
+ store(CHR);
+ store(*p);
+ break;
+ }
+ sp = lp;
+ }
+ if (tagi > 0)
+ badpat("Unmatched \\(");
+ store(END);
+ sta = OKP;
+ return 0;
+ }
+
+
+ static char *bol;
+ static char *bopat[MAXTAG];
+ static char *eopat[MAXTAG];
+ char *pmatch();
+
+ /*
+ * re_exec:
+ * execute nfa to find a match.
+ *
+ * special cases: (nfa[0])
+ * BOL
+ * Match only once, starting from the
+ * beginning.
+ * CHR
+ * First locate the character without
+ * calling pmatch, and if found, call
+ * pmatch for the remaining string.
+ * END
+ * re_comp failed, poor luser did not
+ * check for it. Fail fast.
+ *
+ * If a match is found, bopat[0] and eopat[0] are set
+ * to the beginning and the end of the matched fragment,
+ * respectively.
+ *
+ */
+
+ int re_exec(register char *lp)
+ {
+ register char c;
+ register char *ep = 0;
+ register CHAR *ap = nfa;
+
+ bol = lp;
+
+ bopat[0] = 0;
+ bopat[1] = 0;
+ bopat[2] = 0;
+ bopat[3] = 0;
+ bopat[4] = 0;
+ bopat[5] = 0;
+ bopat[6] = 0;
+ bopat[7] = 0;
+ bopat[8] = 0;
+ bopat[9] = 0;
+
+ switch(*ap) {
+
+ case BOL: /* anchored: match from BOL only */
+ ep = pmatch(lp,ap);
+ break;
+ case CHR: /* ordinary char: locate it fast */
+ c = *(ap+1);
+ while (*lp && *lp != c)
+ lp++;
+ if (!*lp) /* if EOS, fail, else fall thru. */
+ return 0;
+ default: /* regular matching all the way. */
+ while (*lp) {
+ if ((ep = pmatch(lp,ap)))
+ break;
+ lp++;
+ }
+ break;
+ case END: /* munged automaton. fail always */
+ return 0;
+ }
+ if (!ep)
+ return 0;
+
+ if (internal_error)
+ return -1;
+
+ bopat[0] = lp;
+ eopat[0] = ep;
+ return 1;
+ }
+
+ /*
+ * pmatch:
+ * internal routine for the hard part
+ *
+ * This code is mostly snarfed from an early
+ * grep written by David Conroy. The backref and
+ * tag stuff, and various other mods are by oZ.
+ *
+ * special cases: (nfa[n], nfa[n+1])
+ * CLO ANY
+ * We KNOW ".*" will match ANYTHING
+ * upto the end of line. Thus, go to
+ * the end of line straight, without
+ * calling pmatch recursively. As in
+ * the other closure cases, the remaining
+ * pattern must be matched by moving
+ * backwards on the string recursively,
+ * to find a match for xy (x is ".*" and
+ * y is the remaining pattern) where
+ * the match satisfies the LONGEST match
+ * for x followed by a match for y.
+ * CLO CHR
+ * We can again scan the string forward
+ * for the single char without recursion,
+ * and at the point of failure, we execute
+ * the remaining nfa recursively, as
+ * described above.
+ *
+ * At the end of a successful match, bopat[n] and eopat[n]
+ * are set to the beginning and end of subpatterns matched
+ * by tagged expressions (n = 1 to 9).
+ *
+ */
+
+ /*
+ * character classification table for word boundary
+ * operators BOW and EOW. the reason for not using
+ * ctype macros is that we can let the user add into
+ * our own table. see re_modw. This table is not in
+ * the bitset form, since we may wish to extend it
+ * in the future for other character classifications.
+ *
+ * TRUE for 0-9 A-Z a-z _
+ */
+ static char chrtyp[MAXCHR] = {
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 0, 0,
+ 0, 0, 0, 0, 0, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 0, 0, 0, 0, 1, 0, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 0, 0, 0, 0, 0
+ };
+
+ #define inascii(x) (0177&(x))
+ #define iswordc(x) chrtyp[inascii(x)]
+ #define isinset(x,y) ((x)[((y)&BLKIND)>>3] & bitarr[(y)&BITIND])
+
+ /*
+ * skip values for CLO XXX to skip past the closure
+ *
+ */
+
+ #define ANYSKIP 2 /* [CLO] ANY END ... */
+ #define CHRSKIP 3 /* [CLO] CHR chr END ... */
+ #define CCLSKIP 18 /* [CLO] CCL 16bytes END ... */
+
+ static char *pmatch(register char *lp,register CHAR *ap)
+ {
+ register int op, c, n;
+ register char *e; /* extra pointer for CLO */
+ register char *bp; /* beginning of subpat.. */
+ register char *ep; /* ending of subpat.. */
+ char *are; /* to save the line ptr. */
+
+ while ((op = *ap++) != END)
+ switch(op) {
+
+ case CHR:
+ if (*lp++ != *ap++)
+ return 0;
+ break;
+ case ANY:
+ if (!*lp++)
+ return 0;
+ break;
+ case CCL:
+ c = *lp++;
+ if (!isinset(ap,c))
+ return 0;
+ ap += BITBLK;
+ break;
+ case BOL:
+ if (lp != bol)
+ return 0;
+ break;
+ case EOL:
+ if (*lp)
+ return 0;
+ break;
+ case BOT:
+ bopat[*ap++] = lp;
+ break;
+ case EOT:
+ eopat[*ap++] = lp;
+ break;
+ case BOW:
+ if (lp!=bol && iswordc(lp[-1]) || !iswordc(*lp))
+ return 0;
+ break;
+ case EOW:
+ if (lp==bol || !iswordc(lp[-1]) || iswordc(*lp))
+ return 0;
+ break;
+ case REF:
+ n = *ap++;
+ bp = bopat[n];
+ ep = eopat[n];
+ while (bp < ep)
+ if (*bp++ != *lp++)
+ return 0;
+ break;
+ case CLO:
+ are = lp;
+ switch(*ap) {
+
+ case ANY:
+ while (*lp)
+ lp++;
+ n = ANYSKIP;
+ break;
+ case CHR:
+ c = *(ap+1);
+ while (*lp && c == *lp)
+ lp++;
+ n = CHRSKIP;
+ break;
+ case CCL:
+ while ((c = *lp) && isinset(ap+1,c))
+ lp++;
+ n = CCLSKIP;
+ break;
+ default:
+ internal_error++;
+ return 0;
+ }
+
+ ap += n;
+
+ while (lp >= are) {
+ if (e = pmatch(lp, ap))
+ return e;
+ --lp;
+ }
+ return 0;
+ default:
+ internal_error++;
+ return 0;
+ }
+ return lp;
+ }
+ #endif /* Need regex libraries? Compile to nothing if not. */
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/regex.h
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/regex.h:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/regex.h Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,23 ----
+ /*
+ * regex.h : External defs for Ozan Yigit's regex functions, for systems
+ * that don't have them builtin. See regex.c for copyright and other
+ * details.
+ *
+ * Note that this file can be included even if we're linking against the
+ * system routines, since the interface is (deliberately) identical.
+ *
+ * George Ferguson, ferguson at cs.rochester.edu, 11 Sep 1991.
+ */
+
+ #if defined(AUX) || defined(USG)
+ /* Let them use ours if they wish. */
+ # ifndef NOREGEX
+ extern char *regcmp();
+ extern char *regex();
+ #define re_comp regcmp
+ #define re_exec regex
+ # endif
+ #else
+ extern char *re_comp();
+ extern int re_exec();
+ #endif
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/stcopy.c
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/stcopy.c:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/stcopy.c Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,103 ----
+ /*
+ * Copyright (c) 1989, 1990, 1991 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ *
+ * v1.2.1 - 11/19/91 (mmt) - added MSDOS & OS2 stuff
+ * v1.2.0 - 09/17/91 (bpk) - added BULL & USG stuff, thanks to Jim Sillas
+ */
+
+ #include <copyright.h>
+ #include <stdio.h>
+ #include <stdlib.h>
+ #include <pmachine.h>
+
+ #ifdef NEED_STRING_H
+ # include <string.h>
+ #else
+ # include <strings.h>
+ #endif
+
+ #if defined(MSDOS)
+ # include <stdlib.h>
+ #endif
+
+ char *stcopyr();
+
+ int string_count = 0;
+ int string_max = 0;
+
+ /*
+ * stcopy - allocate space for and copy a string
+ *
+ * STCOPY takes a string as an argument, allocates space for
+ * a copy of the string, copies the string to the allocated space,
+ * and returns a pointer to the copy.
+ */
+
+ char *stcopy(char *st)
+ {
+ if (!st) return(NULL);
+ if (string_max < ++string_count) string_max = string_count;
+
+ return strcpy((char *)malloc(strlen(st) + 1), st);
+ }
+
+ /*
+ * stcopyr - copy a string allocating space if necessary
+ *
+ * STCOPYR takes a string, S, as an argument, and a pointer to a second
+ * string, R, which is to be replaced by S. If R is long enough to
+ * hold S, S is copied. Otherwise, new space is allocated, and R is
+ * freed. S is then copied to the newly allocated space. If S is
+ * NULL, then R is freed and NULL is returned.
+ *
+ * In any event, STCOPYR returns a pointer to the new copy of S,
+ * or a NULL pointer.
+ */
+
+ char *stcopyr(char *s,char *r)
+ {
+ int sl;
+
+ if(!s && r) {
+ free(r);
+ string_count--;
+ return(NULL);
+ }
+ else if (!s) return(NULL);
+
+ sl = strlen(s) + 1;
+
+ if(r) {
+ if ((strlen(r) + 1) < sl) {
+ free(r);
+ r = (char *) malloc(sl);
+ }
+ }
+ else {
+ r = (char *) malloc(sl);
+ string_count++;
+ if(string_max < string_count) string_max = string_count;
+ }
+
+ return strcpy(r,s);
+ }
+
+ /*
+ * stfree - free space allocated by stcopy or stalloc
+ *
+ * STFREE takes a string that was returned by stcopy or stalloc
+ * and frees the space that was allocated for the string.
+ */
+
+ void stfree(char *st)
+ {
+ if(st) {
+ free(st);
+ string_count--;
+ }
+ }
+
+
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/support.c
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/support.c:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/support.c Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,792 ----
+ /*
+ * Copyright (c) 1989, 1990, 1991 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ *
+ * v1.2.2 - 11/19/91 (mmt) - added MSDOS & OS2 stuff
+ * v1.2.1 - 09/23/91 (gf) - made it use regex.h---much nicer
+ * v1.2.0 - 09/17/91 (bpk) - added BULL & USG stuff, thanks to Jim Sillas
+ * v1.1.1 - 08/30/91 (bpk) - added VMS support; cast index()
+ */
+
+ /*
+ * Miscellaneous routines pulled from ~beta/lib/pfs and ~beta/lib/filters
+ */
+
+ #include <copyright.h>
+ #include <stdio.h>
+
+ #include <errno.h>
+
+ #ifdef VMS
+ # ifdef WOLLONGONG
+ # include "twg$tcp:[netdist.include]netdb.h"
+ # else /* not Wollongong */
+ # ifdef UCX
+ # include netdb
+ # else /* Multinet */
+ # include "multinet_root:[multinet.include]netdb.h"
+ # endif
+ # endif
+ # include <vms.h>
+ #else /* not VMS */
+ # include <sys/types.h>
+ # include <pmachine.h>
+ # ifdef NEED_STRING_H
+ # include <string.h>
+ # else
+ # include <strings.h>
+ # endif
+ # ifndef CUTCP
+ # include <netdb.h>
+ # endif
+ # if !defined(MSDOS) || defined(OS2)
+ # include <sys/file.h>
+ # include <sys/param.h>
+ # endif
+ #endif /* VMS */
+
+ #include <pfs.h>
+ #include <pprot.h>
+ #include <perrno.h>
+ #include <pcompat.h>
+ #include <pauthent.h>
+
+ #include "regex.h"
+
+ int pfs_enable = PMAP_ATSIGN;
+
+ #ifndef FALSE
+ # define TRUE 1
+ # define FALSE 0
+ #endif
+
+ extern int vl_comp(VLINK vl1,VLINK vl2);
+ extern int vl_equal(VLINK vl1,VLINK vl2);
+
+ /*
+ * wcmatch - Match string s against template containing widlcards
+ *
+ * WCMATCH takes a string and a template, and returns
+ * true if the string matches the template, and
+ * FALSE otherwise.
+ *
+ * ARGS: s - string to be tested
+ * template - Template containing optional wildcards
+ *
+ * RETURNS: TRUE (non-zero) on match. FALSE (0) otherwise.
+ *
+ * NOTE: If template is NULL, will return TRUE.
+ *
+ */
+
+ int wcmatch(char *s,char *template)
+ {
+ char temp[200];
+ char *p = temp;
+
+ if(!template) return(TRUE);
+ *p++ = '^';
+
+ while(*template) {
+ if(*template == '*') {*(p++)='.'; *(p++) = *(template++);}
+ else if(*template == '?') {*(p++)='.';template++;}
+ else if(*template == '.') {*(p++)='\\';*(p++)='.';template++;}
+ else if(*template == '[') {*(p++)='\\';*(p++)='[';template++;}
+ else if(*template == '$') {*(p++)='\\';*(p++)='$';template++;}
+ else if(*template == '^') {*(p++)='\\';*(p++)='^';template++;}
+ else if(*template == '\\') {*(p++)='\\';*(p++)='\\';template++;}
+ else *(p++) = *(template++);
+ }
+
+ *p++ = '$';
+ *p++ = '\0';
+
+ if(re_comp(temp)) return(FALSE);
+
+ #ifdef AUX
+ if (re_exec(s) == (char *)NULL)
+ return 0;
+ return 1;
+ #else
+ return(re_exec(s));
+ #endif
+ }
+
+ /*
+ * ul_insert - Insert a union link at the right location
+ *
+ * UL_INSERT takes a directory and a union link to be added
+ * to a the list of union links in the directory. It then
+ * inserts the union link in the right spot in the linked
+ * list of union links associated with that directory.
+ *
+ * If an identical link already exists, then the link which
+ * would be evaluated earlier (closer to the front of the list)
+ * wins and the other one is freed. If this happens, an error
+ * will also be returned.
+ *
+ * ARGS: ul - link to be inserted
+ * vd - directory to get link
+ * p - vl that this link will apper after
+ * NULL - This vl will go at end of list
+ * vd - This vl will go at head of list
+ *
+ * RETURNS: Success, or UL_INSERT_ALREADY_THERE or UL_INSERT_SUPERSEDING
+ */
+
+ int ul_insert(VLINK ul,VDIR1 vd,VLINK p)
+ {
+ VLINK current;
+
+ /* This is the first ul in the directory */
+ if(vd->ulinks == NULL) {
+ vd->ulinks = ul;
+ ul->previous = NULL;
+ ul->next = NULL;
+ return(PSUCCESS);
+ }
+
+ /* This ul will go at the head of the list */
+ if(p == (VLINK) vd) {
+ ul->next = vd->ulinks;
+ ul->next->previous = ul;
+ vd->ulinks = ul;
+ ul->previous = NULL;
+ }
+ /* Otherwise, decide if it must be inserted at all */
+ /* If an identical link appears before the position */
+ /* at which the new one is to be inserted, we can */
+ /* return without inserting it */
+ else {
+ current = vd->ulinks;
+
+ while(current) {
+ /* p == NULL means we insert after last link */
+ if(!p && (current->next == NULL))
+ p = current;
+
+ if(vl_comp(current,ul) == 0) {
+ vlfree(ul);
+ return(UL_INSERT_ALREADY_THERE);
+ }
+
+ if(current == p) break;
+ current = current->next;
+ }
+
+ /* If current is null, p was not found */
+ if(current == NULL)
+ return(UL_INSERT_POS_NOTFOUND);
+
+ /* Insert ul */
+ ul->next = p->next;
+ p->next = ul;
+ ul->previous = p;
+ if(ul->next) ul->next->previous = ul;
+ }
+
+ /* Check for identical links after ul */
+ current = ul->next;
+
+ while(current) {
+ if(vl_comp(current,ul) == 0) {
+ current->previous->next = current->next;
+ if(current->next)
+ current->next->previous = current->previous;
+ vlfree(current);
+ return(UL_INSERT_SUPERSEDING);
+ }
+ current = current->next;
+ }
+
+ return(PSUCCESS);
+ }
+
+ /*
+ * vl_insert - Insert a directory link at the right location
+ *
+ * VL_INSERT takes a directory and a link to be added to a
+ * directory and inserts it in the linked list of links for
+ * that directory.
+ *
+ * If a link already exists with the same name, and if the
+ * information associated with the new link matches that in
+ * the existing link, an error is returned. If the information
+ * associated with the new link is different, but the magic numbers
+ * match, then the new link will be added as a replica of the
+ * existing link. If the magic numbers do not match, the new
+ * link will only be added to the list of "replicas" if the
+ * allow_conflict flag has been set.
+ *
+ * If the link is not added, an error is returned and the link
+ * is freed. Ordering for the list of links is by the link name.
+ *
+ * If vl is a union link, then VL_INSERT calls ul_insert with an
+ * added argument indicating the link is to be included at the
+ * end of the union link list.
+ *
+ * ARGS: vl - Link to be inserted, vd - directory to get link
+ * allow_conflict - insert links with conflicting names
+ *
+ * RETURNS: Success, or VL_INSERT_ALREADY_THERE
+ */
+
+ int vl_insert(VLINK vl,VDIR1 vd,int allow_conflict)
+ {
+ VLINK current; /* To step through list */
+ VLINK crep; /* To step through list of replicas */
+ int retval; /* Temp for checking returned values */
+
+ /* This can also be used to insert union links at end of list */
+ if(vl->linktype == 'U') return(ul_insert(vl,vd,NULL));
+
+ /* If this is the first link in the directory */
+ if(vd->links == NULL) {
+ vd->links = vl;
+ vl->previous = NULL;
+ vl->next = NULL;
+ vd->lastlink = vl;
+ return(PSUCCESS);
+ }
+
+ /* If no sorting is to be done, just insert at end of list */
+ if(allow_conflict == VLI_NOSORT) {
+ vd->lastlink->next = vl;
+ vl->previous = vd->lastlink;
+ vl->next = NULL;
+ vd->lastlink = vl;
+ return(PSUCCESS);
+ }
+
+ /* If it is to be inserted at start of list */
+ if(vl_comp(vl,vd->links) < 0) {
+ vl->next = vd->links;
+ vl->previous = NULL;
+ vl->next->previous = vl;
+ vd->links = vl;
+ return(PSUCCESS);
+ }
+
+ current = vd->links;
+
+ /* Otherwise, we must find the right spot to insert it */
+ while((retval = vl_comp(vl,current)) > 0) {
+ if(!current->next) {
+ /* insert at end */
+ vl->previous = current;
+ vl->next = NULL;
+ current->next = vl;
+ vd->lastlink = vl;
+ return(PSUCCESS);
+ }
+ current = current->next;
+ }
+
+ /* If we found an equivilant entry already in list */
+ if(!retval) {
+ if(vl_equal(vl,current)) {
+ vlfree(vl);
+ return(VL_INSERT_ALREADY_THERE);
+ }
+ if((allow_conflict == VLI_NOCONFLICT) &&
+ ((vl->f_magic_no != current->f_magic_no) ||
+ (vl->f_magic_no==0)))
+ return(VL_INSERT_CONFLICT);
+ /* Insert the link into the list of "replicas" */
+ /* If magic is 0, then create a pseudo magic number */
+ if(vl->f_magic_no == 0) vl->f_magic_no = -1;
+ crep = current->replicas;
+ if(!crep) {
+ current->replicas = vl;
+ vl->next = NULL;
+ vl->previous = NULL;
+ }
+ else {
+ while(crep->next) {
+ /* If magic was 0, then we need a unique magic number */
+ if((crep->f_magic_no < 0) && (vl->f_magic_no < 1))
+ (vl->f_magic_no)--;
+ crep = crep->next;
+ }
+ /* If magic was 0, then we need a unique magic number */
+ if((crep->f_magic_no < 0) && (vl->f_magic_no < 1))
+ (vl->f_magic_no)--;
+ crep->next = vl;
+ vl->previous = crep;
+ vl->next = NULL;
+ }
+ return(PSUCCESS);
+ }
+
+ /* We found the spot where vl is to be inserted */
+ vl->next = current;
+ vl->previous = current->previous;
+ current->previous = vl;
+ vl->previous->next = vl;
+ return(PSUCCESS);
+ }
+
+ /*
+ * nlsindex - Find first instance of string 2 in string 1 following newline
+ *
+ * NLSINDEX scans string 1 for the first instance of string
+ * 2 that immediately follows a newline. If found, NLSINDEX
+ * returns a pointer to the first character of that instance.
+ * If no instance is found, NLSINDEX returns NULL (0).
+ *
+ * NOTE: This function is only useful for searching strings that
+ * consist of multiple lines. s1 is assumed to be preceeded
+ * by a newline. Thus, if s2 is at the start of s1, it will
+ * be found.
+ * ARGS: s1 - string to be searched
+ * s2 - string to be found
+ * RETURNS: First instance of s2 in s1, or NULL (0) if not found
+ */
+
+ char *nlsindex(char *s1,char *s2)
+ {
+ register int s2len = strlen(s2);
+ char *curline = s1; /* Pointer to start of current line */
+
+ /* In case s2 appears at start of s1 */
+ if(strncmp(curline,s2,s2len) == 0)
+ return(curline);
+
+ /* Check remaining lines of s1 */
+ while((curline = strchr(curline,(int) '\n')) != NULL) {
+ curline++;
+ if(strncmp(curline,s2,s2len) == 0)
+ return(curline);
+ }
+
+ /* We didn't find it */
+ return(NULL);
+ }
+
+ /*
+ * month_sname - Return a month name from it's number
+ *
+ * MONTH_SNAME takes a number in the range 0
+ * to 12 and returns a pointer to a string
+ * representing the three letter abbreviation
+ * for that month. If the argument is out of
+ * range, MONTH_SNAME returns a pointer to "Unk".
+ *
+ * ARGS: n - Number of the month
+ * RETURNS: Abbreviation for selected month
+ */
+
+ char *month_sname(int n)
+ {
+ static char *name[] = { "Unk",
+ "Jan","Feb","Mar","Apr","May","Jun",
+ "Jul","Aug","Sep","Oct","Nov","Dec"
+ };
+ return((n < 1 || n > 12) ? name[0] : name[n]);
+ }
+
+ /*
+ * sindex - Find first instance of string 2 in string 1
+ *
+ * SINDEX scans string 1 for the first instance of string
+ * 2. If found, SINDEX returns a pointer to the first
+ * character of that instance. If no instance is found,
+ * SINDEX returns NULL (0).
+ *
+ * ARGS: s1 - string to be searched
+ * s2 - string to be found
+ * RETURNS: First instance of s2 in s1, or NULL (0) if not found
+ */
+
+ char *sindex(char *s1,char *s2)
+ {
+ register int s2len = strlen(s2);
+ char *s = s1; /* Temp pointer to string */
+
+ /* Check for first character of s2 */
+ while((s = strchr(s,(int) *s2)) != NULL) {
+ if(strncmp(s,s2,s2len) == 0)
+ return(s);
+ s++;
+ }
+
+ /* We didn't find it */
+ return(NULL);
+ }
+
+ int scan_error(char *erst)
+ {
+ *p_err_string = '\0';
+
+ if(strncmp(erst,"NOT-A-DIRECTORY",15) == 0)
+ return(DIRSRV_NOT_DIRECTORY);
+
+ if(strncmp(erst,"UNIMPLEMENTED",13) == 0) {
+ perrno = DIRSRV_UNIMPLEMENTED;
+ sscanf(erst+13,"%*[^\n \t\r]%*[ \t]%[^\n]",p_err_string);
+ return(perrno);
+ }
+
+ if(strncmp(erst,"WARNING ",8) == 0) {
+ erst += 8;
+ *p_warn_string = '\0';
+ sscanf(erst,"%*[^\n \t\r]%*[ \t]%[^\n]",p_warn_string);
+ /* Return values for warnings are negative */
+ if(strncmp(erst,"OUT-OF-DATE",11) == 0) {
+ pwarn = PWARN_OUT_OF_DATE;
+ return(PSUCCESS);
+ }
+ if(strncmp(erst,"MESSAGE",7) == 0) {
+ pwarn = PWARN_MSG_FROM_SERVER;
+ return(PSUCCESS);
+ }
+ pwarn = PWARNING;
+ sscanf(erst,"%[^\n]",p_warn_string);
+ return(PSUCCESS);
+ }
+ else if(strncmp(erst,"ERROR",5) == 0) {
+ if(*(erst+5)) sscanf(erst+6,"%[^\n]",p_err_string);
+ perrno = DIRSRV_ERROR;
+ return(perrno);
+ }
+ /* The rest start with "FAILURE" */
+ else if(strncmp(erst,"FAILURE",7) != 0) {
+ /* Unrecognized - Give warning, but return PSUCCESS */
+ if(pwarn == 0) {
+ *p_warn_string = '\0';
+ pwarn = PWARN_UNRECOGNIZED_RESP;
+ sscanf(erst,"%[^\n]",p_warn_string);
+ }
+ return(PSUCCESS);
+ }
+
+ if(strncmp(erst,"FAILURE ",8) != 0) {
+ perrno = PFAILURE;
+ return(perrno);
+ }
+ erst += 8;
+
+ sscanf(erst,"%*[^\n \t\r]%*[ \t]%[^\n]",p_err_string);
+
+ /* Still to add */
+ /* DIRSRV_AUTHENT_REQ 242 */
+ /* DIRSRV_BAD_VERS 245 */
+
+ if(strncmp(erst,"NOT-FOUND",9) == 0)
+ perrno = DIRSRV_NOT_FOUND;
+ else if(strncmp(erst,"NOT-AUTHORIZED",13) == 0)
+ perrno = DIRSRV_NOT_AUTHORIZED;
+ else if(strncmp(erst,"ALREADY-EXISTS",14) == 0)
+ perrno = DIRSRV_ALREADY_EXISTS;
+ else if(strncmp(erst,"NAME-CONFLICT",13) == 0)
+ perrno = DIRSRV_NAME_CONFLICT;
+ else if(strncmp(erst,"SERVER-FAILED",13) == 0)
+ perrno = DIRSRV_SERVER_FAILED;
+ /* Use it whether it starts with FAILURE or not */
+ else if(strncmp(erst,"NOT-A-DIRECTORY",15) == 0)
+ perrno = DIRSRV_NOT_DIRECTORY;
+ else perrno = PFAILURE;
+
+ return(perrno);
+ }
+
+ PATTRIB parse_attribute(char *line)
+ {
+ char l_precedence[MAX_DIR_LINESIZE];
+ char l_name[MAX_DIR_LINESIZE];
+ char l_type[MAX_DIR_LINESIZE];
+ char l_value[MAX_DIR_LINESIZE];
+ PATTRIB at;
+ int tmp;
+
+ tmp = sscanf(line,"OBJECT-INFO %s %s %[^\n]", l_name, l_type, l_value);
+
+ if(tmp < 3) {
+ tmp = sscanf(line,"LINK-INFO %s %s %s %[^\n]", l_precedence,
+ l_name, l_type, l_value);
+ if(tmp < 4) {
+ perrno = DIRSRV_BAD_FORMAT;
+ return(NULL);
+ }
+ }
+
+ at = atalloc();
+
+ if(tmp == 4) {
+ if(strcmp(l_precedence,"CACHED") == 0)
+ at->precedence = ATR_PREC_CACHED;
+ else if(strcmp(l_precedence,"LINK") == 0)
+ at->precedence = ATR_PREC_LINK;
+ else if(strcmp(l_precedence,"REPLACEMENT") == 0)
+ at->precedence = ATR_PREC_REPLACE;
+ else if(strcmp(l_precedence,"ADDITIONAL") == 0)
+ at->precedence = ATR_PREC_ADD;
+ }
+
+ at->aname = stcopy(l_name);
+ at->avtype = stcopy(l_type);
+ if(strcmp(l_type,"ASCII") == 0)
+ at->value.ascii = stcopy(l_value);
+ else if(strcmp(l_type,"LINK") == 0) {
+ char ftype[MAX_DIR_LINESIZE];
+ char lname[MAX_DIR_LINESIZE];
+ char htype[MAX_DIR_LINESIZE];
+ char host[MAX_DIR_LINESIZE];
+ char ntype[MAX_DIR_LINESIZE];
+ char fname[MAX_DIR_LINESIZE];
+ VLINK al;
+
+ al = vlalloc();
+ at->value.link = al;
+
+ tmp = sscanf(l_value,"%c %s %s %s %s %s %s %d %d",
+ &(al->linktype),
+ ftype,lname,htype,host,ntype,fname,
+ &(al->version),
+ &(al->f_magic_no));
+ if(tmp == 9) {
+ al->type = stcopyr(ftype,al->type);
+ al->name = stcopyr(unquote(lname),al->name);
+ al->hosttype = stcopyr(htype,al->hosttype);
+ al->host = stcopyr(host,al->host);
+ al->nametype = stcopyr(ntype,al->nametype);
+ al->filename = stcopyr(fname,al->filename);
+ }
+ else {
+ perrno = DIRSRV_BAD_FORMAT;
+ return(NULL);
+ }
+
+ }
+
+ return(at);
+ }
+
+ /*
+ * nxtline - Find the next line in the string
+ *
+ * NXTLINE takes a string and returns a pointer to
+ * the character immediately following the next newline.
+ *
+ * ARGS: s - string to be searched
+ *
+ * RETURNS: Next line or NULL (0) on failure
+ */
+
+ char *nxtline(char *s)
+ /* String to be searched */
+ {
+ s = strchr(s,(int) '\n');
+ if(s) return(++s);
+ else return(NULL);
+ }
+
+
+ /*
+ * unquote - unquote string if necessary
+ *
+ * UNQUOTE takes a string and unquotes it if it has been quoted.
+ *
+ * ARGS: s - string to be unquoted
+ *
+ * RETURNS: The original string. If the string has been quoted, then the
+ * result appears in static storage, and must be copied if
+ * it is to last beyond the next call to quote.
+ *
+ */
+
+ char *unquote(char *s)
+ /* String to be quoted */
+ {
+ static char unquoted[200];
+ char *c = unquoted;
+
+ if(*s != '\'') return(s);
+
+ s++;
+
+ /* This should really treat a quote followed by other */
+ /* than a quote or a null as an error */
+ while(*s) {
+ if(*s == '\'') s++;
+ if(*s) *c++ = *s++;
+ }
+
+ *c++ = '\0';
+
+ return(unquoted);
+ }
+
+ #if defined(DEBUG) && defined(STRSPN)
+ /* needed for -D option parsing */
+ /*
+ * strspn - Count initial characters from chrs in s
+ *
+ * STRSPN counts the occurances of chacters from chrs
+ * in the string s preceeding the first occurance of
+ * a character not in s.
+ *
+ * ARGS: s - string to be checked
+ * chrs - string of characters we are looking for
+ *
+ * RETURNS: Count of initial characters from chrs in s
+ */
+
+ int strspn(char *s,char *chrs)
+ {
+ char *cp; /* Pointer to the current character in chrs */
+ int count; /* Count of characters seen so far */
+
+ count = 0;
+
+ while(*s) {
+ for(cp = chrs;*cp;cp++)
+ if(*cp == *s) {
+ s++;
+ count++;
+ goto done;
+ }
+ return(count);
+ done:
+ ;
+ }
+ return(count);
+ }
+ #endif
+
+ #ifdef CUTCP
+
+ char *inet_ntoa(struct in_addr in)
+ {
+ static char buff[36];
+
+ unsigned char *c = (char *) &in.address;
+ sprintf(buff,"%d.%d.%d.%d",*c,*(c+1),*(c+2),*(c+3));
+ return(buff);
+ }
+
+ long inet_addr(char *cp)
+ {
+ long value = 0;
+ unsigned v1,v2,v3,v4;
+
+ v1 = v2 = v3 = v4 = 0xff;
+ sscanf(cp,"%d.%d.%d.%d",&v1,&v2,&v3,&v4);
+ value = (v1 << 24) | (v2 << 16) | (v3 << 8) | v4;
+ return(value);
+ }
+
+ struct hostent *gethostbyname(char *name)
+ {
+ struct machinfo *mp;
+ int mnum;
+ unsigned long now;
+ static struct hostent ht;
+ extern int pfs_debug;
+
+ mp = Shostlook(name);
+ if(!mp || (!mp->hostip[0])) { /* DNS lookup */
+ #ifdef DEBUG
+ if (pfs_debug)
+ fprintf(stderr, "Domain name lookup of %s\n", name);
+ #endif
+ mnum = Sdomain(name); /* start a DNS lookup */
+ now = time(NULL) + NS_TIMEOUT;
+ while(now > time(NULL)) {
+ int i, class, dat;
+
+ Stask();
+ i = Sgetevent(USERCLASS, &class, &dat);
+ if(i == DOMOK) { /* domain lookup ok */
+ mp = Slooknum(mnum);
+ #ifdef DEBUG
+ if (pfs_debug)
+ fprintf(stderr, "Domain name lookup of %s Completed OK\n", name);
+ #endif
+ break;
+ }
+ }
+ if(!mp) { /* get here if timeout */
+ #ifdef DEBUG
+ if (pfs_debug)
+ fprintf(stderr, "Domain name lookup of %s Failed\n", name);
+ #endif
+ return(NULL);
+ }
+ }
+ ht.h_addr = *((unsigned long *) mp->hostip);
+ ht.h_length = 4;
+ ht.h_addrtype = AF_INET;
+ return(&ht);
+
+ }
+ #endif /* CUTCP */
+
+ #ifdef GETENV
+ /*
+ * Copyright (c) 1987 Regents of the University of California.
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms are permitted
+ * provided that: (1) source distributions retain this entire copyright
+ * notice and comment, and (2) distributions including binaries display
+ * the following acknowledgement: ``This product includes software
+ * developed by the University of California, Berkeley and its contributors''
+ * in the documentation or other materials provided with the distribution
+ * and in all advertising materials mentioning features or use of this
+ * software. Neither the name of the University nor the names of its
+ * contributors may be used to endorse or promote products derived
+ * from this software without specific prior written permission.
+ * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
+ * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
+ * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
+ */
+
+ #if defined(LIBC_SCCS) && !defined(lint)
+ static char sccsid[] = "@(#)getenv.c 5.7 (Berkeley) 6/1/90";
+ #endif /* LIBC_SCCS and not lint */
+
+ #include <stdlib.h>
+ #include <stddef.h>
+
+ /*
+ * getenv --
+ * Returns ptr to value associated with name, if any, else NULL.
+ */
+
+ char *getenv(char *name)
+ {
+ int offset;
+ char *_findenv();
+
+ return(_findenv(name, &offset));
+ }
+
+ /*
+ * _findenv --
+ * Returns pointer to value associated with name, if any, else NULL.
+ * Sets offset to be the offset of the name/value combination in the
+ * environmental array, for use by setenv(3) and unsetenv(3).
+ * Explicitly removes '=' in argument name.
+ *
+ * This routine *should* be a static; don't use it.
+ */
+
+ char * _findenv(register char *name,int *offset)
+ {
+ extern char **environ;
+ register int len;
+ register char **P, *C;
+
+ for (C = name, len = 0; *C && *C != '='; ++C, ++len);
+ for (P = environ; *P; ++P)
+ if (!strncmp(*P, name, len))
+ if (*(C = *P + len) == '=') {
+ *offset = P - environ;
+ return(++C);
+ }
+ return(NULL);
+ }
+ #endif
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/vl_comp.c
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/vl_comp.c:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/vl_comp.c Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,68 ----
+ /*
+ * Copyright (c) 1989, 1990, 1991 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ */
+
+ #include <copyright.h>
+ #include <pfs.h>
+
+ /*
+ * vl_comp - compare the names of two virtual links
+ *
+ * VL_COMP compares the names of two links. It returns
+ * 0 if they are equal, negative if vl1 < vl2, and positive if
+ * vl1 > vl2.
+ *
+ * ARGS: vl1,vl2 - Virtual links to be compared
+ *
+ * RETURNS: 0 if equal, + is vl1 > vl2, - if vl1 < vl2
+ *
+ * NOTES: Order of significance is as follows. Existence,
+ * name. If names do not exist, then hosttype, host,
+ * native filenametype, native filename. The only time
+ * the name will not exist if if the link is a union link.
+ */
+
+ int vl_comp(VLINK vl1,VLINK vl2)
+ {
+ int retval;
+
+ if(vl1->name && !vl2->name) return(1);
+ if(!vl1->name && vl2->name) return(-1);
+ if(vl1->name && vl2->name && (*(vl1->name) || *(vl2->name)))
+ return(strcmp(vl1->name,vl2->name));
+
+ retval = strcmp(vl1->hosttype,vl2->hosttype);
+ if(!retval) retval = strcmp(vl1->host,vl2->host);
+ if(!retval) retval = strcmp(vl1->nametype,vl2->nametype);
+ if(!retval) retval = strcmp(vl1->filename,vl2->filename);
+ return(retval);
+ }
+
+ /*
+ * vl_equal - compare the values of two virtual links
+ *
+ * VL_EQUAL compares the values of two links. It returns
+ * 1 if all important fields are the same, and 0 otherwise.
+ *
+ * ARGS: vl1,vl2 - Virtual links to be compared
+ *
+ * RETURNS: 1 if equal, 0 if not equal
+ *
+ */
+
+ int vl_equal(VLINK vl1,VLINK vl2)
+ {
+ return strcmp(vl1->name, vl2->name) == 0 &&
+ vl1->linktype == vl2->linktype &&
+ strcmp(vl1->type, vl2->type) == 0 &&
+ strcmp(vl1->hosttype, vl2->hosttype) == 0 &&
+ strcmp(vl1->host, vl2->host) == 0 &&
+ strcmp(vl1->nametype, vl2->nametype) == 0 &&
+ strcmp(vl1->filename, vl2->filename) == 0 &&
+ vl1->version == vl2->version &&
+ vl1->f_magic_no == vl2->f_magic_no ;
+
+ }
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/vlalloc.c
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/vlalloc.c:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/vlalloc.c Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,108 ----
+ /*
+ * Copyright (c) 1989, 1990, 1991 by the University of Washington
+ *
+ * For copying and distribution information, please see the file
+ * <copyright.h>.
+ */
+
+ #include <copyright.h>
+ #include <stdio.h>
+ #include <stdlib.h>
+
+ #include <pfs.h>
+ #include <pmachine.h>
+
+ static VLINK lfree = NULL;
+ int vlink_count = 0;
+ int vlink_max = 0;
+
+ extern void bzero(char *b,int length);
+
+ /*
+ * vlalloc - allocate and initialize vlink structure
+ *
+ * VLALLOC returns a pointer to an initialized structure of type
+ * VLINK. If it is unable to allocate such a structure, it
+ * returns NULL.
+ */
+ VLINK vlalloc(void)
+ {
+ VLINK vl;
+ if(lfree) {
+ vl = lfree;
+ lfree = lfree->next;
+ }
+ else {
+ vl = (VLINK) malloc(sizeof(VLINK_ST));
+ if (!vl) return(NULL);
+ vlink_max++;
+ }
+
+ vlink_count++;
+
+ /* Initialize and fill in default values */
+ /* Since all but four are set to a zero-value,
+ why not just wipe it clean? */
+ ZERO(vl);
+
+ vl->linktype = 'L';
+ vl->type = stcopy("FILE");
+ vl->hosttype = stcopy("INTERNET-D");
+ vl->nametype = stcopy("ASCII");
+
+ return(vl);
+ }
+
+ /*
+ * vlfree - free a VLINK structure
+ *
+ * VLFREE takes a pointer to a VLINK structure and adds it to
+ * the free list for later reuse.
+ */
+
+ void vlfree(VLINK vl)
+ {
+ extern int string_count;
+
+ if(vl->dontfree) return;
+ /* many of these don't need to call stfree(); since a check
+ for pointer validity's already done before even calling
+ it, we can just call free() here then do one big decrement
+ of string_count at the end. */
+ if(vl->name) free(vl->name);
+ stfree(vl->type);
+ if(vl->replicas) vllfree(vl->replicas);
+ stfree(vl->hosttype);
+ if(vl->host) free(vl->host);
+ stfree(vl->nametype);
+ if(vl->filename) free(vl->filename);
+ if(vl->args) free(vl->args);
+ if(vl->lattrib) atlfree(vl->lattrib);
+ /* No allocation routines for f_info yet */
+ vl->f_info = NULL;
+ vl->next = lfree;
+ vl->previous = NULL;
+ lfree = vl;
+ vlink_count--;
+ string_count -= 4; /* freed name, host, filename, and args */
+ }
+
+ /*
+ * vllfree - free a VLINK structure
+ *
+ * VLLFREE takes a pointer to a VLINK structure frees it and any linked
+ * VLINK structures. It is used to free an entrie list of VLINK
+ * structures.
+ */
+
+ void vllfree(VLINK vl)
+ {
+ VLINK nxt;
+
+ while((vl != NULL) && !vl->dontfree) {
+ nxt = vl->next;
+ vlfree(vl);
+ vl = nxt;
+ }
+ }
+
Index: llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/vms.h
diff -c /dev/null llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/vms.h:1.1
*** /dev/null Tue Oct 5 13:20:09 2004
--- llvm-test/MultiSource/Benchmarks/Prolangs-C/archie-client/vms.h Tue Oct 5 13:19:58 2004
***************
*** 0 ****
--- 1,47 ----
+ #ifndef _ARCHIE_VMS
+ #define _ARCHIE_VMS
+ #include <pmachine.h>
+
+ #if !defined(MULTINET_30) && !defined(WOLLONGONG) && !defined(UCX)
+ #include "[.vms]pseudos.h"
+ #include "[.vms]types.h"
+ #include "[.vms]in.h"
+ #include "[.vms]signal.h"
+ #include "[.vms]socket.h"
+ #include "[.vms]time.h"
+
+ #else
+
+ /* time_t gets multiply defined <ekup> */
+ #ifndef __TYPES
+ #define __TYPES
+ #endif
+ #ifdef MULTINET_30
+ # include "multinet_root:[multinet.include.sys]types.h"
+ # include "multinet_root:[multinet.include.netinet]in.h"
+ # include "multinet_root:[multinet.include.sys]socket.h"
+ # include "multinet_root:[multinet.include.sys]time.h"
+ #endif /* MULTINET_30 */
+
+ #ifdef WOLLONGONG
+ /* We don't want size_t defined. */
+ # ifndef __STDDEF
+ # define __STDDEF
+ # endif
+ # include "twg$tcp:[netdist.include.sys]types.h"
+ # include "twg$tcp:[netdist.include.netinet]in.h"
+ # include "twg$tcp:[netdist.include.sys]socket.h"
+ # include "twg$tcp:[netdist.include.sys]time.h"
+ #endif /* WOLLONGONG */
+
+ #ifdef UCX
+ # include <types.h>
+ # include <in.h>
+ # include <socket.h>
+ # include <time.h>
+ # include "[.vms]fd.h"
+ #endif /* UCX */
+
+ #endif /* Multinet or Wallongong or UCX */
+
+ #endif /* _ARCHIE_VMS */
More information about the llvm-commits
mailing list