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