1 /*- 2 * Copyright (c) 1991, 1993, 1994 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 */ 33 34 #ifndef lint 35 static char copyright[] = 36 "@(#) Copyright (c) 1991, 1993, 1994\n\ 37 The Regents of the University of California. All rights reserved.\n"; 38 #endif /* not lint */ 39 40 #ifndef lint 41 static char sccsid[] = "@(#)basename.c 8.3 (Berkeley) 4/2/94"; 42 #endif /* not lint */ 43 44 #include <stdio.h> 45 #include <stdlib.h> 46 #include <string.h> 47 48 void usage __P((void)); 49 50 int 51 main(argc, argv) 52 int argc; 53 char **argv; 54 { 55 char *p; 56 int ch; 57 58 while ((ch = getopt(argc, argv, "")) != EOF) 59 switch(ch) { 60 case '?': 61 default: 62 usage(); 63 } 64 argc -= optind; 65 argv += optind; 66 67 if (argc != 1 && argc != 2) 68 usage(); 69 70 /* 71 * (1) If string is // it is implementation defined whether steps (2) 72 * through (5) are skipped or processed. 73 * 74 * (2) If string consists entirely of slash characters, string shall 75 * be set to a single slash character. In this case, skip steps 76 * (3) through (5). 77 */ 78 for (p = *argv;; ++p) { 79 if (!*p) { 80 if (p > *argv) 81 (void)printf("/\n"); 82 else 83 (void)printf("\n"); 84 exit(0); 85 } 86 if (*p != '/') 87 break; 88 } 89 90 /* 91 * (3) If there are any trailing slash characters in string, they 92 * shall be removed. 93 */ 94 for (; *p; ++p) 95 continue; 96 while (*--p == '/') 97 continue; 98 *++p = '\0'; 99 100 /* 101 * (4) If there are any slash characters remaining in string, the 102 * prefix of string up to an including the last slash character 103 * in string shall be removed. 104 */ 105 while (--p >= *argv) 106 if (*p == '/') 107 break; 108 ++p; 109 110 /* 111 * (5) If the suffix operand is present, is not identical to the 112 * characters remaining in string, and is identical to a suffix 113 * of the characters remaining in string, the suffix suffix 114 * shall be removed from string. 115 */ 116 if (*++argv) { 117 int suffixlen, stringlen, off; 118 119 suffixlen = strlen(*argv); 120 stringlen = strlen(p); 121 122 if (suffixlen < stringlen) { 123 off = stringlen - suffixlen; 124 if (!strcmp(p + off, *argv)) 125 p[off] = '\0'; 126 } 127 } 128 (void)printf("%s\n", p); 129 exit(0); 130 } 131 132 void 133 usage() 134 { 135 136 (void)fprintf(stderr, "usage: basename string [suffix]\n"); 137 exit(1); 138 } 139