Wed, 31 Dec 2014 06:09:35 +0100
Cloned upstream origin tor-browser at tor-browser-31.3.0esr-4.5-1-build1
revision ID fc1c9ff7c1b2defdbc039f12214767608f46423f for hacking purpose.
michael@0 | 1 | /* |
michael@0 | 2 | * Copyright (c) 1987, 1993 |
michael@0 | 3 | * The Regents of the University of California. All rights reserved. |
michael@0 | 4 | * |
michael@0 | 5 | * Redistribution and use in source and binary forms, with or without |
michael@0 | 6 | * modification, are permitted provided that the following conditions |
michael@0 | 7 | * are met: |
michael@0 | 8 | * 1. Redistributions of source code must retain the above copyright |
michael@0 | 9 | * notice, this list of conditions and the following disclaimer. |
michael@0 | 10 | * 2. Redistributions in binary form must reproduce the above copyright |
michael@0 | 11 | * notice, this list of conditions and the following disclaimer in the |
michael@0 | 12 | * documentation and/or other materials provided with the distribution. |
michael@0 | 13 | * 3. ***REMOVED*** - see |
michael@0 | 14 | * ftp://ftp.cs.berkeley.edu/pub/4bsd/README.Impt.License.Change |
michael@0 | 15 | * 4. Neither the name of the University nor the names of its contributors |
michael@0 | 16 | * may be used to endorse or promote products derived from this software |
michael@0 | 17 | * without specific prior written permission. |
michael@0 | 18 | * |
michael@0 | 19 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
michael@0 | 20 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
michael@0 | 21 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
michael@0 | 22 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
michael@0 | 23 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
michael@0 | 24 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
michael@0 | 25 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
michael@0 | 26 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
michael@0 | 27 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
michael@0 | 28 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
michael@0 | 29 | * SUCH DAMAGE. |
michael@0 | 30 | */ |
michael@0 | 31 | |
michael@0 | 32 | #if defined(LIBC_SCCS) && !defined(lint) |
michael@0 | 33 | static char sccsid[] = "@(#)mktemp.c 8.1 (Berkeley) 6/4/93"; |
michael@0 | 34 | #endif /* LIBC_SCCS and not lint */ |
michael@0 | 35 | |
michael@0 | 36 | #ifdef macintosh |
michael@0 | 37 | #include <unix.h> |
michael@0 | 38 | #else |
michael@0 | 39 | #include <sys/types.h> |
michael@0 | 40 | #include <sys/stat.h> |
michael@0 | 41 | #endif |
michael@0 | 42 | #include <fcntl.h> |
michael@0 | 43 | #include <errno.h> |
michael@0 | 44 | #include <stdio.h> |
michael@0 | 45 | #include <ctype.h> |
michael@0 | 46 | #include "mcom_db.h" |
michael@0 | 47 | |
michael@0 | 48 | #ifndef _WINDOWS |
michael@0 | 49 | #include <unistd.h> |
michael@0 | 50 | #endif |
michael@0 | 51 | |
michael@0 | 52 | #ifdef _WINDOWS |
michael@0 | 53 | #include <process.h> |
michael@0 | 54 | #include "winfile.h" |
michael@0 | 55 | #endif |
michael@0 | 56 | |
michael@0 | 57 | static int _gettemp(char *path, register int *doopen, int extraFlags); |
michael@0 | 58 | |
michael@0 | 59 | int |
michael@0 | 60 | mkstemp(char *path) |
michael@0 | 61 | { |
michael@0 | 62 | #ifdef XP_OS2 |
michael@0 | 63 | FILE *temp = tmpfile(); |
michael@0 | 64 | |
michael@0 | 65 | return (temp ? fileno(temp) : -1); |
michael@0 | 66 | #else |
michael@0 | 67 | int fd; |
michael@0 | 68 | |
michael@0 | 69 | return (_gettemp(path, &fd, 0) ? fd : -1); |
michael@0 | 70 | #endif |
michael@0 | 71 | } |
michael@0 | 72 | |
michael@0 | 73 | int |
michael@0 | 74 | mkstempflags(char *path, int extraFlags) |
michael@0 | 75 | { |
michael@0 | 76 | int fd; |
michael@0 | 77 | |
michael@0 | 78 | return (_gettemp(path, &fd, extraFlags) ? fd : -1); |
michael@0 | 79 | } |
michael@0 | 80 | |
michael@0 | 81 | /* NB: This routine modifies its input string, and does not always restore it. |
michael@0 | 82 | ** returns 1 on success, 0 on failure. |
michael@0 | 83 | */ |
michael@0 | 84 | static int |
michael@0 | 85 | _gettemp(char *path, register int *doopen, int extraFlags) |
michael@0 | 86 | { |
michael@0 | 87 | register char *start, *trv; |
michael@0 | 88 | struct stat sbuf; |
michael@0 | 89 | unsigned int pid; |
michael@0 | 90 | |
michael@0 | 91 | pid = getpid(); |
michael@0 | 92 | for (trv = path; *trv; ++trv); /* extra X's get set to 0's */ |
michael@0 | 93 | while (*--trv == 'X') { |
michael@0 | 94 | *trv = (pid % 10) + '0'; |
michael@0 | 95 | pid /= 10; |
michael@0 | 96 | } |
michael@0 | 97 | |
michael@0 | 98 | /* |
michael@0 | 99 | * check the target directory; if you have six X's and it |
michael@0 | 100 | * doesn't exist this runs for a *very* long time. |
michael@0 | 101 | */ |
michael@0 | 102 | for (start = trv + 1;; --trv) { |
michael@0 | 103 | char saved; |
michael@0 | 104 | if (trv <= path) |
michael@0 | 105 | break; |
michael@0 | 106 | saved = *trv; |
michael@0 | 107 | if (saved == '/' || saved == '\\') { |
michael@0 | 108 | int rv; |
michael@0 | 109 | *trv = '\0'; |
michael@0 | 110 | rv = stat(path, &sbuf); |
michael@0 | 111 | *trv = saved; |
michael@0 | 112 | if (rv) |
michael@0 | 113 | return(0); |
michael@0 | 114 | if (!S_ISDIR(sbuf.st_mode)) { |
michael@0 | 115 | errno = ENOTDIR; |
michael@0 | 116 | return(0); |
michael@0 | 117 | } |
michael@0 | 118 | break; |
michael@0 | 119 | } |
michael@0 | 120 | } |
michael@0 | 121 | |
michael@0 | 122 | for (;;) { |
michael@0 | 123 | if (doopen) { |
michael@0 | 124 | if ((*doopen = |
michael@0 | 125 | open(path, O_CREAT|O_EXCL|O_RDWR|extraFlags, 0600)) >= 0) |
michael@0 | 126 | return(1); |
michael@0 | 127 | if (errno != EEXIST) |
michael@0 | 128 | return(0); |
michael@0 | 129 | } |
michael@0 | 130 | else if (stat(path, &sbuf)) |
michael@0 | 131 | return(errno == ENOENT ? 1 : 0); |
michael@0 | 132 | |
michael@0 | 133 | /* tricky little algorithm for backward compatibility */ |
michael@0 | 134 | for (trv = start;;) { |
michael@0 | 135 | if (!*trv) |
michael@0 | 136 | return(0); |
michael@0 | 137 | if (*trv == 'z') |
michael@0 | 138 | *trv++ = 'a'; |
michael@0 | 139 | else { |
michael@0 | 140 | if (isdigit(*trv)) |
michael@0 | 141 | *trv = 'a'; |
michael@0 | 142 | else |
michael@0 | 143 | ++*trv; |
michael@0 | 144 | break; |
michael@0 | 145 | } |
michael@0 | 146 | } |
michael@0 | 147 | } |
michael@0 | 148 | /*NOTREACHED*/ |
michael@0 | 149 | } |