scheme.c revision 287122
1/*- 2 * Copyright (c) 2013,2014 Juniper Networks, Inc. 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/10/usr.bin/mkimg/scheme.c 287122 2015-08-25 04:03:51Z marcel $"); 29 30#include <sys/types.h> 31#include <sys/linker_set.h> 32#include <sys/queue.h> 33#include <sys/stat.h> 34#include <assert.h> 35#include <err.h> 36#include <errno.h> 37#include <limits.h> 38#include <stdint.h> 39#include <stdlib.h> 40#include <string.h> 41#include <unistd.h> 42 43#include "image.h" 44#include "mkimg.h" 45#include "scheme.h" 46 47static struct { 48 const char *name; 49 enum alias alias; 50} scheme_alias[] = { 51 { "ebr", ALIAS_EBR }, 52 { "efi", ALIAS_EFI }, 53 { "fat32", ALIAS_FAT32 }, 54 { "freebsd", ALIAS_FREEBSD }, 55 { "freebsd-boot", ALIAS_FREEBSD_BOOT }, 56 { "freebsd-nandfs", ALIAS_FREEBSD_NANDFS }, 57 { "freebsd-swap", ALIAS_FREEBSD_SWAP }, 58 { "freebsd-ufs", ALIAS_FREEBSD_UFS }, 59 { "freebsd-vinum", ALIAS_FREEBSD_VINUM }, 60 { "freebsd-zfs", ALIAS_FREEBSD_ZFS }, 61 { "mbr", ALIAS_MBR }, 62 { "ntfs", ALIAS_NTFS }, 63 { NULL, ALIAS_NONE } /* Keep last! */ 64}; 65 66static struct mkimg_scheme *scheme; 67static void *bootcode; 68 69static enum alias 70scheme_parse_alias(const char *name) 71{ 72 u_int idx; 73 74 idx = 0; 75 while (scheme_alias[idx].name != NULL) { 76 if (strcasecmp(scheme_alias[idx].name, name) == 0) 77 return (scheme_alias[idx].alias); 78 idx++; 79 } 80 return (ALIAS_NONE); 81} 82 83int 84scheme_select(const char *spec) 85{ 86 struct mkimg_scheme *s, **iter; 87 88 SET_FOREACH(iter, schemes) { 89 s = *iter; 90 if (strcasecmp(spec, s->name) == 0) { 91 scheme = s; 92 return (0); 93 } 94 } 95 return (EINVAL); 96} 97 98struct mkimg_scheme * 99scheme_selected(void) 100{ 101 102 return (scheme); 103} 104 105int 106scheme_bootcode(int fd) 107{ 108 struct stat sb; 109 110 if (scheme == NULL || scheme->bootcode == 0) 111 return (ENXIO); 112 113 if (fstat(fd, &sb) == -1) 114 return (errno); 115 if (sb.st_size > scheme->bootcode) 116 return (EFBIG); 117 118 bootcode = malloc(scheme->bootcode); 119 if (bootcode == NULL) 120 return (ENOMEM); 121 memset(bootcode, 0, scheme->bootcode); 122 if (read(fd, bootcode, sb.st_size) != sb.st_size) { 123 free(bootcode); 124 bootcode = NULL; 125 return (errno); 126 } 127 return (0); 128} 129 130int 131scheme_check_part(struct part *p) 132{ 133 struct mkimg_alias *iter; 134 enum alias alias; 135 136 assert(scheme != NULL); 137 138 /* Check the partition type alias */ 139 alias = scheme_parse_alias(p->alias); 140 if (alias == ALIAS_NONE) 141 return (EINVAL); 142 143 iter = scheme->aliases; 144 while (iter->alias != ALIAS_NONE) { 145 if (alias == iter->alias) 146 break; 147 iter++; 148 } 149 if (iter->alias == ALIAS_NONE) 150 return (EINVAL); 151 p->type = iter->type; 152 153 /* Validate the optional label. */ 154 if (p->label != NULL) { 155 if (strlen(p->label) > scheme->labellen) 156 return (EINVAL); 157 } 158 159 return (0); 160} 161 162u_int 163scheme_max_parts(void) 164{ 165 166 return ((scheme == NULL) ? 0 : scheme->nparts); 167} 168 169u_int 170scheme_max_secsz(void) 171{ 172 173 return ((scheme == NULL) ? INT_MAX+1U : scheme->maxsecsz); 174} 175 176lba_t 177scheme_metadata(u_int where, lba_t start) 178{ 179 180 return ((scheme == NULL) ? start : scheme->metadata(where, start)); 181} 182 183int 184scheme_write(lba_t end) 185{ 186 187 return ((scheme == NULL) ? 0 : scheme->write(end, bootcode)); 188} 189