gettemp.c revision 1.1 1 /* $NetBSD: gettemp.c,v 1.1 1998/07/27 13:42:39 mycroft Exp $ */
2
3 /*
4 * Copyright (c) 1987, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36 #include <sys/cdefs.h>
37 #if defined(LIBC_SCCS) && !defined(lint)
38 #if 0
39 static char sccsid[] = "@(#)mktemp.c 8.1 (Berkeley) 6/4/93";
40 #else
41 __RCSID("$NetBSD: gettemp.c,v 1.1 1998/07/27 13:42:39 mycroft Exp $");
42 #endif
43 #endif /* LIBC_SCCS and not lint */
44
45 #include <sys/types.h>
46 #include <sys/stat.h>
47 #include <fcntl.h>
48 #include <errno.h>
49 #include <stdio.h>
50 #include <stdlib.h>
51 #include <ctype.h>
52 #include <unistd.h>
53 #include <errno.h>
54 #include "local.h"
55
56 int
57 __gettemp(path, doopen)
58 char *path;
59 int *doopen;
60 {
61 char *start, *trv;
62 struct stat sbuf;
63 u_int pid;
64
65 /* To guarantee multiple calls generate unique names even if
66 the file is not created. 676 different possibilities with 7
67 or more X's, 26 with 6 or less. */
68 static char xtra[2] = "aa";
69 int xcnt = 0;
70
71 pid = getpid();
72
73 /* Move to end of path and count trailing X's. */
74 for (trv = path; *trv; ++trv)
75 if (*trv == 'X')
76 xcnt++;
77 else
78 xcnt = 0;
79
80 /* Use at least one from xtra. Use 2 if more than 6 X's. */
81 if (*(trv-1) == 'X')
82 *--trv = xtra[0];
83 if (xcnt > 6 && *(trv-1) == 'X')
84 *--trv = xtra[1];
85
86 /* Set remaining X's to pid digits with 0's to the left. */
87 while (*--trv == 'X') {
88 *trv = (pid % 10) + '0';
89 pid /= 10;
90 }
91
92 /* update xtra for next call. */
93 if (xtra[0] != 'z')
94 xtra[0]++;
95 else {
96 xtra[0] = 'a';
97 if (xtra[1] != 'z')
98 xtra[1]++;
99 else
100 xtra[1] = 'a';
101 }
102
103 /*
104 * check the target directory; if you have six X's and it
105 * doesn't exist this runs for a *very* long time.
106 */
107 for (start = trv + 1;; --trv) {
108 if (trv <= path)
109 break;
110 if (*trv == '/') {
111 *trv = '\0';
112 if (stat(path, &sbuf))
113 return (0);
114 if (!S_ISDIR(sbuf.st_mode)) {
115 errno = ENOTDIR;
116 return (0);
117 }
118 *trv = '/';
119 break;
120 }
121 }
122
123 for (;;) {
124 if (doopen) {
125 if ((*doopen =
126 open(path, O_CREAT|O_EXCL|O_RDWR, 0600)) >= 0)
127 return (1);
128 if (errno != EEXIST)
129 return (0);
130 }
131 else if (lstat(path, &sbuf))
132 return (errno == ENOENT ? 1 : 0);
133
134 /* tricky little algorithm for backward compatibility */
135 for (trv = start;;) {
136 if (!*trv)
137 return (0);
138 if (*trv == 'z')
139 *trv++ = 'a';
140 else {
141 if (isdigit(*trv))
142 *trv = 'a';
143 else
144 ++*trv;
145 break;
146 }
147 }
148 }
149 /*NOTREACHED*/
150 }
151