1 /* 2 * Generic utility routines for the Common Access Method layer. 3 * 4 * Copyright (c) 1997 Justin T. Gibbs. 5 * All rights reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 1. Redistributions of source code must retain the above copyright 11 * notice, this list of conditions, and the following disclaimer, 12 * without modification, immediately at the beginning of the file. 13 * 2. The name of the author may not be used to endorse or promote products 14 * derived from this software without specific prior written permission. 15 * 16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR 20 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 26 * SUCH DAMAGE. 27 * 28 * $FreeBSD$ 29 */ 30 #include <sys/param.h> 31 32 #include <cam/cam.h> 33 34 void 35 cam_strvis(u_int8_t *dst, const u_int8_t *src, int srclen, int dstlen) 36 { 37 38 /* Trim leading/trailing spaces, nulls. */ 39 while (srclen > 0 && src[0] == ' ') 40 src++, srclen--; 41 while (srclen > 0 42 && (src[srclen-1] == ' ' || src[srclen-1] == '\0')) 43 srclen--; 44 45 while (srclen > 0 && dstlen > 1) { 46 u_int8_t *cur_pos = dst; 47 48 if (*src < 0x20 || *src >= 0x80) { 49 /* SCSI-II Specifies that these should never occur. */ 50 /* non-printable character */ 51 if (dstlen > 4) { 52 *cur_pos++ = '\\'; 53 *cur_pos++ = ((*src & 0300) >> 6) + '0'; 54 *cur_pos++ = ((*src & 0070) >> 3) + '0'; 55 *cur_pos++ = ((*src & 0007) >> 0) + '0'; 56 } else { 57 *cur_pos++ = '?'; 58 } 59 } else { 60 /* normal character */ 61 *cur_pos++ = *src; 62 } 63 src++; 64 srclen--; 65 dstlen -= cur_pos - dst; 66 dst = cur_pos; 67 } 68 *dst = '\0'; 69 } 70 71 /* 72 * Compare string with pattern, returning 0 on match. 73 * Short pattern matches trailing blanks in name, 74 * wildcard '*' in pattern matches rest of name, 75 * wildcard '?' matches a single non-space character. 76 */ 77 int 78 cam_strmatch(const u_int8_t *str, const u_int8_t *pattern, int str_len) 79 { 80 81 while (*pattern != '\0'&& str_len > 0) { 82 83 if (*pattern == '*') { 84 return (0); 85 } 86 if ((*pattern != *str) 87 && (*pattern != '?' || *str == ' ')) { 88 return (1); 89 } 90 pattern++; 91 str++; 92 str_len--; 93 } 94 while (str_len > 0 && *str++ == ' ') 95 str_len--; 96 97 return (str_len); 98 } 99 100 caddr_t 101 cam_quirkmatch(caddr_t target, caddr_t quirk_table, int num_entries, 102 int entry_size, cam_quirkmatch_t *comp_func) 103 { 104 for (; num_entries > 0; num_entries--, quirk_table += entry_size) { 105 if ((*comp_func)(target, quirk_table) == 0) 106 return (quirk_table); 107 } 108 return (NULL); 109 } 110