]>
Commit | Line | Data |
---|---|---|
e9ce8d39 A |
1 | /* |
2 | * Copyright (c) 1999 Apple Computer, Inc. All rights reserved. | |
3 | * | |
4 | * @APPLE_LICENSE_HEADER_START@ | |
5 | * | |
6 | * The contents of this file constitute Original Code as defined in and | |
7 | * are subject to the Apple Public Source License Version 1.1 (the | |
8 | * "License"). You may not use this file except in compliance with the | |
9 | * License. Please obtain a copy of the License at | |
10 | * http://www.apple.com/publicsource and read it before using this file. | |
11 | * | |
12 | * This Original Code and all software distributed under the License are | |
13 | * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER | |
14 | * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, | |
15 | * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, | |
16 | * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the | |
17 | * License for the specific language governing rights and limitations | |
18 | * under the License. | |
19 | * | |
20 | * @APPLE_LICENSE_HEADER_END@ | |
21 | */ | |
22 | /* | |
23 | * Copyright (c) 1987, 1993 | |
24 | * The Regents of the University of California. All rights reserved. | |
25 | * | |
26 | * Redistribution and use in source and binary forms, with or without | |
27 | * modification, are permitted provided that the following conditions | |
28 | * are met: | |
29 | * 1. Redistributions of source code must retain the above copyright | |
30 | * notice, this list of conditions and the following disclaimer. | |
31 | * 2. Redistributions in binary form must reproduce the above copyright | |
32 | * notice, this list of conditions and the following disclaimer in the | |
33 | * documentation and/or other materials provided with the distribution. | |
34 | * 3. All advertising materials mentioning features or use of this software | |
35 | * must display the following acknowledgement: | |
36 | * This product includes software developed by the University of | |
37 | * California, Berkeley and its contributors. | |
38 | * 4. Neither the name of the University nor the names of its contributors | |
39 | * may be used to endorse or promote products derived from this software | |
40 | * without specific prior written permission. | |
41 | * | |
42 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
43 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
44 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
45 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
46 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
47 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
48 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
49 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
50 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
51 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
52 | * SUCH DAMAGE. | |
53 | */ | |
54 | ||
55 | ||
56 | #include <sys/types.h> | |
57 | #include <sys/stat.h> | |
58 | #include <fcntl.h> | |
59 | #include <errno.h> | |
60 | #include <stdio.h> | |
61 | #include <ctype.h> | |
62 | #include <errno.h> | |
63 | ||
64 | static int _gettemp(); | |
65 | ||
66 | int | |
67 | mkstemp(path) | |
68 | char *path; | |
69 | { | |
70 | int fd; | |
71 | ||
72 | return (_gettemp(path, &fd) ? fd : -1); | |
73 | } | |
74 | ||
75 | char * | |
76 | mktemp(path) | |
77 | char *path; | |
78 | { | |
79 | return(_gettemp(path, (int *)NULL) ? path : (char *)NULL); | |
80 | } | |
81 | ||
82 | static int | |
83 | _gettemp(path, doopen) | |
84 | char *path; | |
85 | register int *doopen; | |
86 | { | |
87 | register char *start, *trv; | |
88 | struct stat sbuf; | |
89 | u_int pid; | |
90 | ||
91 | pid = getpid(); | |
92 | for (trv = path; *trv; ++trv); /* extra X's get set to 0's */ | |
93 | while (*--trv == 'X') { | |
94 | *trv = (pid % 10) + '0'; | |
95 | pid /= 10; | |
96 | } | |
97 | ||
98 | /* | |
99 | * check the target directory; if you have six X's and it | |
100 | * doesn't exist this runs for a *very* long time. | |
101 | */ | |
102 | for (start = trv + 1;; --trv) { | |
103 | if (trv <= path) | |
104 | break; | |
105 | if (*trv == '/') { | |
106 | *trv = '\0'; | |
107 | if (stat(path, &sbuf)) | |
108 | return(0); | |
109 | if (!S_ISDIR(sbuf.st_mode)) { | |
110 | errno = ENOTDIR; | |
111 | return(0); | |
112 | } | |
113 | *trv = '/'; | |
114 | break; | |
115 | } | |
116 | } | |
117 | ||
118 | for (;;) { | |
119 | if (doopen) { | |
120 | if ((*doopen = | |
121 | open(path, O_CREAT|O_EXCL|O_RDWR, 0600)) >= 0) | |
122 | return(1); | |
123 | if (errno != EEXIST) | |
124 | return(0); | |
125 | } | |
126 | else if (stat(path, &sbuf)) | |
127 | return(errno == ENOENT ? 1 : 0); | |
128 | ||
129 | /* tricky little algorithm for backward compatibility */ | |
130 | for (trv = start;;) { | |
131 | if (!*trv) | |
132 | return(0); | |
133 | if (*trv == 'z') | |
134 | *trv++ = 'a'; | |
135 | else { | |
136 | if (isdigit(*trv)) | |
137 | *trv = 'a'; | |
138 | else | |
139 | ++*trv; | |
140 | break; | |
141 | } | |
142 | } | |
143 | } | |
144 | /*NOTREACHED*/ | |
145 | } |