1/*- 2 * Copyright (c) 1998 Michael Smith <msmith@freebsd.org> 3 * 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 * 14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24 * SUCH DAMAGE. 25 */ 26 27#include <sys/cdefs.h> 28__FBSDID("$FreeBSD: stable/11/stand/common/misc.c 332154 2018-04-06 21:37:25Z kevans $"); 29 30#include <string.h> 31#include <stand.h> 32#include <bootstrap.h> 33 34/* 35 * Concatenate the (argc) elements of (argv) into a single string, and return 36 * a copy of same. 37 */ 38char * 39unargv(int argc, char *argv[]) 40{ 41 size_t hlong; 42 int i; 43 char *cp; 44 45 for (i = 0, hlong = 0; i < argc; i++) 46 hlong += strlen(argv[i]) + 2; 47 48 if(hlong == 0) 49 return(NULL); 50 51 cp = malloc(hlong); 52 cp[0] = 0; 53 for (i = 0; i < argc; i++) { 54 strcat(cp, argv[i]); 55 if (i < (argc - 1)) 56 strcat(cp, " "); 57 } 58 59 return(cp); 60} 61 62/* 63 * Get the length of a string in kernel space 64 */ 65size_t 66strlenout(vm_offset_t src) 67{ 68 char c; 69 size_t len; 70 71 for (len = 0; ; len++) { 72 archsw.arch_copyout(src++, &c, 1); 73 if (c == 0) 74 break; 75 } 76 return(len); 77} 78 79/* 80 * Make a duplicate copy of a string in kernel space 81 */ 82char * 83strdupout(vm_offset_t str) 84{ 85 char *result, *cp; 86 87 result = malloc(strlenout(str) + 1); 88 for (cp = result; ;cp++) { 89 archsw.arch_copyout(str++, cp, 1); 90 if (*cp == 0) 91 break; 92 } 93 return(result); 94} 95 96/* Zero a region in kernel space. */ 97void 98kern_bzero(vm_offset_t dest, size_t len) 99{ 100 char buf[256]; 101 size_t chunk, resid; 102 103 bzero(buf, sizeof(buf)); 104 resid = len; 105 while (resid > 0) { 106 chunk = min(sizeof(buf), resid); 107 archsw.arch_copyin(buf, dest, chunk); 108 resid -= chunk; 109 dest += chunk; 110 } 111} 112 113/* 114 * Read the specified part of a file to kernel space. Unlike regular 115 * pread, the file pointer is advanced to the end of the read data, 116 * and it just returns 0 if successful. 117 */ 118int 119kern_pread(int fd, vm_offset_t dest, size_t len, off_t off) 120{ 121 122 if (lseek(fd, off, SEEK_SET) == -1) { 123#ifdef DEBUG 124 printf("\nlseek failed\n"); 125#endif 126 return (-1); 127 } 128 if ((size_t)archsw.arch_readin(fd, dest, len) != len) { 129#ifdef DEBUG 130 printf("\nreadin failed\n"); 131#endif 132 return (-1); 133 } 134 return (0); 135} 136 137/* 138 * Read the specified part of a file to a malloced buffer. The file 139 * pointer is advanced to the end of the read data. 140 */ 141/* coverity[ -tainted_data_return ] */ 142void * 143alloc_pread(int fd, off_t off, size_t len) 144{ 145 void *buf; 146 147 buf = malloc(len); 148 if (buf == NULL) { 149#ifdef DEBUG 150 printf("\nmalloc(%d) failed\n", (int)len); 151#endif 152 return (NULL); 153 } 154 if (lseek(fd, off, SEEK_SET) == -1) { 155#ifdef DEBUG 156 printf("\nlseek failed\n"); 157#endif 158 free(buf); 159 return (NULL); 160 } 161 if ((size_t)read(fd, buf, len) != len) { 162#ifdef DEBUG 163 printf("\nread failed\n"); 164#endif 165 free(buf); 166 return (NULL); 167 } 168 return (buf); 169} 170 171/* 172 * Display a region in traditional hexdump format. 173 */ 174void 175hexdump(caddr_t region, size_t len) 176{ 177 caddr_t line; 178 int x, c; 179 char lbuf[80]; 180#define emit(fmt, args...) {sprintf(lbuf, fmt , ## args); pager_output(lbuf);} 181 182 pager_open(); 183 for (line = region; line < (region + len); line += 16) { 184 emit("%08lx ", (long) line); 185 186 for (x = 0; x < 16; x++) { 187 if ((line + x) < (region + len)) { 188 emit("%02x ", *(uint8_t *)(line + x)); 189 } else { 190 emit("-- "); 191 } 192 if (x == 7) 193 emit(" "); 194 } 195 emit(" |"); 196 for (x = 0; x < 16; x++) { 197 if ((line + x) < (region + len)) { 198 c = *(uint8_t *)(line + x); 199 if ((c < ' ') || (c > '~')) /* !isprint(c) */ 200 c = '.'; 201 emit("%c", c); 202 } else { 203 emit(" "); 204 } 205 } 206 emit("|\n"); 207 } 208 pager_close(); 209} 210 211void 212dev_cleanup(void) 213{ 214 int i; 215 216 /* Call cleanup routines */ 217 for (i = 0; devsw[i] != NULL; ++i) 218 if (devsw[i]->dv_cleanup != NULL) 219 (devsw[i]->dv_cleanup)(); 220} 221