1994-05-27 05:00:24 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1987, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by the University of
|
|
|
|
* California, Berkeley and its contributors.
|
|
|
|
* 4. 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 BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
1996-06-22 10:34:15 +00:00
|
|
|
#if 0
|
1994-05-27 05:00:24 +00:00
|
|
|
static char sccsid[] = "@(#)mktemp.c 8.1 (Berkeley) 6/4/93";
|
1996-06-22 10:34:15 +00:00
|
|
|
#endif
|
|
|
|
static const char rcsid[] =
|
1999-08-28 00:22:10 +00:00
|
|
|
"$FreeBSD$";
|
1994-05-27 05:00:24 +00:00
|
|
|
#endif /* LIBC_SCCS and not lint */
|
|
|
|
|
|
|
|
#include <sys/types.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <fcntl.h>
|
|
|
|
#include <errno.h>
|
|
|
|
#include <stdio.h>
|
1998-02-13 02:13:24 +00:00
|
|
|
#include <stdlib.h>
|
1994-05-27 05:00:24 +00:00
|
|
|
#include <ctype.h>
|
1996-06-22 10:34:15 +00:00
|
|
|
#include <unistd.h>
|
1994-05-27 05:00:24 +00:00
|
|
|
|
1998-03-03 14:38:36 +00:00
|
|
|
char *_mktemp __P((char *));
|
|
|
|
|
1999-04-04 20:28:04 +00:00
|
|
|
static int _gettemp __P((char *, int *, int, int));
|
|
|
|
|
|
|
|
int
|
|
|
|
mkstemps(path, slen)
|
|
|
|
char *path;
|
|
|
|
int slen;
|
|
|
|
{
|
|
|
|
int fd;
|
|
|
|
|
|
|
|
return (_gettemp(path, &fd, 0, slen) ? fd : -1);
|
|
|
|
}
|
1994-05-27 05:00:24 +00:00
|
|
|
|
1996-06-22 10:34:15 +00:00
|
|
|
int
|
|
|
|
mkstemp(path)
|
1994-05-27 05:00:24 +00:00
|
|
|
char *path;
|
|
|
|
{
|
1998-10-20 15:33:21 +00:00
|
|
|
int fd;
|
1994-05-27 05:00:24 +00:00
|
|
|
|
1999-04-04 20:28:04 +00:00
|
|
|
return (_gettemp(path, &fd, 0, 0) ? fd : -1);
|
1994-05-27 05:00:24 +00:00
|
|
|
}
|
|
|
|
|
1998-02-13 02:13:24 +00:00
|
|
|
char *
|
|
|
|
mkdtemp(path)
|
|
|
|
char *path;
|
|
|
|
{
|
1999-04-04 20:28:04 +00:00
|
|
|
return(_gettemp(path, (int *)NULL, 1, 0) ? path : (char *)NULL);
|
1998-02-13 02:13:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
char *
|
|
|
|
_mktemp(path)
|
|
|
|
char *path;
|
|
|
|
{
|
1999-04-04 20:28:04 +00:00
|
|
|
return(_gettemp(path, (int *)NULL, 0, 0) ? path : (char *)NULL);
|
1998-02-13 02:13:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
__warn_references(mktemp,
|
|
|
|
"warning: mktemp() possibly used unsafely; consider using mkstemp()");
|
|
|
|
|
1994-05-27 05:00:24 +00:00
|
|
|
char *
|
|
|
|
mktemp(path)
|
|
|
|
char *path;
|
|
|
|
{
|
1998-02-13 02:13:24 +00:00
|
|
|
return(_mktemp(path));
|
1994-05-27 05:00:24 +00:00
|
|
|
}
|
|
|
|
|
1996-06-22 10:34:15 +00:00
|
|
|
static int
|
1999-04-04 20:28:04 +00:00
|
|
|
_gettemp(path, doopen, domkdir, slen)
|
1994-05-27 05:00:24 +00:00
|
|
|
char *path;
|
|
|
|
register int *doopen;
|
1998-02-13 02:13:24 +00:00
|
|
|
int domkdir;
|
1999-04-04 20:28:04 +00:00
|
|
|
int slen;
|
1994-05-27 05:00:24 +00:00
|
|
|
{
|
1999-04-04 20:28:04 +00:00
|
|
|
register char *start, *trv, *suffp;
|
1994-05-27 05:00:24 +00:00
|
|
|
struct stat sbuf;
|
1998-02-13 02:13:24 +00:00
|
|
|
int pid, rval;
|
|
|
|
|
|
|
|
if (doopen && domkdir) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return(0);
|
|
|
|
}
|
1994-05-27 05:00:24 +00:00
|
|
|
|
1998-02-13 02:13:24 +00:00
|
|
|
for (trv = path; *trv; ++trv)
|
|
|
|
;
|
1999-04-04 20:28:04 +00:00
|
|
|
trv -= slen;
|
|
|
|
suffp = trv;
|
1998-02-13 02:13:24 +00:00
|
|
|
--trv;
|
1999-04-04 20:28:04 +00:00
|
|
|
if (trv < path) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return (0);
|
|
|
|
}
|
1999-12-11 14:48:24 +00:00
|
|
|
pid = getpid();
|
1998-02-13 02:13:24 +00:00
|
|
|
while (*trv == 'X' && pid != 0) {
|
|
|
|
*trv-- = (pid % 10) + '0';
|
1994-05-27 05:00:24 +00:00
|
|
|
pid /= 10;
|
|
|
|
}
|
1998-02-13 02:13:24 +00:00
|
|
|
while (*trv == 'X') {
|
|
|
|
char c;
|
|
|
|
|
|
|
|
pid = (arc4random() & 0xffff) % (26+26);
|
|
|
|
if (pid < 26)
|
|
|
|
c = pid + 'A';
|
|
|
|
else
|
|
|
|
c = (pid - 26) + 'a';
|
|
|
|
*trv-- = c;
|
|
|
|
}
|
1998-03-03 14:38:36 +00:00
|
|
|
start = trv + 1;
|
1994-05-27 05:00:24 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* check the target directory; if you have six X's and it
|
|
|
|
* doesn't exist this runs for a *very* long time.
|
|
|
|
*/
|
1998-02-13 02:13:24 +00:00
|
|
|
if (doopen || domkdir) {
|
1998-03-03 14:38:36 +00:00
|
|
|
for (;; --trv) {
|
1998-02-13 02:13:24 +00:00
|
|
|
if (trv <= path)
|
|
|
|
break;
|
|
|
|
if (*trv == '/') {
|
|
|
|
*trv = '\0';
|
|
|
|
rval = stat(path, &sbuf);
|
|
|
|
*trv = '/';
|
|
|
|
if (rval != 0)
|
|
|
|
return(0);
|
|
|
|
if (!S_ISDIR(sbuf.st_mode)) {
|
|
|
|
errno = ENOTDIR;
|
|
|
|
return(0);
|
|
|
|
}
|
|
|
|
break;
|
1994-05-27 05:00:24 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
if (doopen) {
|
|
|
|
if ((*doopen =
|
Simplify sytem call renaming. Instead of _foo() <-- _libc_foo <-- foo(),
just use _foo() <-- foo(). In the case of a libpthread that doesn't do
call conversion (such as linuxthreads and our upcoming libpthread), this
is adequate. In the case of libc_r, we still need three names, which are
now _thread_sys_foo() <-- _foo() <-- foo().
Convert all internal libc usage of: aio_suspend(), close(), fsync(), msync(),
nanosleep(), open(), fcntl(), read(), and write() to _foo() instead of foo().
Remove all internal libc usage of: creat(), pause(), sleep(), system(),
tcdrain(), wait(), and waitpid().
Make thread cancellation fully POSIX-compliant.
Suggested by: deischen
2000-01-27 23:07:25 +00:00
|
|
|
_open(path, O_CREAT|O_EXCL|O_RDWR, 0600)) >= 0)
|
1994-05-27 05:00:24 +00:00
|
|
|
return(1);
|
|
|
|
if (errno != EEXIST)
|
|
|
|
return(0);
|
1998-02-13 02:13:24 +00:00
|
|
|
} else if (domkdir) {
|
|
|
|
if (mkdir(path, 0700) == 0)
|
|
|
|
return(1);
|
|
|
|
if (errno != EEXIST)
|
|
|
|
return(0);
|
|
|
|
} else if (lstat(path, &sbuf))
|
1994-05-27 05:00:24 +00:00
|
|
|
return(errno == ENOENT ? 1 : 0);
|
|
|
|
|
|
|
|
/* tricky little algorithm for backward compatibility */
|
|
|
|
for (trv = start;;) {
|
1999-12-11 14:48:24 +00:00
|
|
|
if (*trv == '\0' || trv == suffp)
|
1994-05-27 05:00:24 +00:00
|
|
|
return(0);
|
1998-04-14 07:25:05 +00:00
|
|
|
if (*trv == 'Z')
|
1994-05-27 05:00:24 +00:00
|
|
|
*trv++ = 'a';
|
|
|
|
else {
|
1999-11-04 04:57:05 +00:00
|
|
|
if (isdigit((unsigned char)*trv))
|
1994-05-27 05:00:24 +00:00
|
|
|
*trv = 'a';
|
1998-04-14 07:25:05 +00:00
|
|
|
else if (*trv == 'z') /* inc from z to A */
|
|
|
|
*trv = 'A';
|
1994-05-27 05:00:24 +00:00
|
|
|
else
|
|
|
|
++*trv;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/*NOTREACHED*/
|
|
|
|
}
|