1/*- 2 * Copyright (c) 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 * $FreeBSD$ 27 */ 28 29#ifndef _MKIMG_MKIMG_H_ 30#define _MKIMG_MKIMG_H_ 31 32#include <sys/queue.h> 33#include <sys/types.h> 34 35struct part { 36 TAILQ_ENTRY(part) link; 37 char *alias; /* Partition type alias. */ 38 char *contents; /* Contents/size specification. */ 39 u_int kind; /* Content kind. */ 40#define PART_UNDEF 0 41#define PART_KIND_FILE 1 42#define PART_KIND_PIPE 2 43#define PART_KIND_SIZE 3 44 u_int index; /* Partition index (0-based). */ 45 uintptr_t type; /* Scheme-specific partition type. */ 46 lba_t block; /* Block-offset of partition in image. */ 47 lba_t size; /* Size in blocks of partition. */ 48 char *label; /* Partition label. */ 49}; 50 51extern TAILQ_HEAD(partlisthead, part) partlist; 52extern u_int nparts; 53 54extern u_int unit_testing; 55extern u_int verbose; 56 57extern u_int ncyls; 58extern u_int nheads; 59extern u_int nsecs; 60extern u_int secsz; /* Logical block size. */ 61extern u_int blksz; /* Physical block size. */ 62extern uint32_t active_partition; 63 64static inline lba_t 65round_block(lba_t n) 66{ 67 lba_t b = blksz / secsz; 68 return ((n + b - 1) & ~(b - 1)); 69} 70 71static inline lba_t 72round_cylinder(lba_t n) 73{ 74 u_int cyl = nsecs * nheads; 75 u_int r = n % cyl; 76 return ((r == 0) ? n : n + cyl - r); 77} 78 79static inline lba_t 80round_track(lba_t n) 81{ 82 u_int r = n % nsecs; 83 return ((r == 0) ? n : n + nsecs - r); 84} 85 86#if !defined(SPARSE_WRITE) 87#define sparse_write write 88#else 89ssize_t sparse_write(int, const void *, size_t); 90#endif 91 92void mkimg_chs(lba_t, u_int, u_int *, u_int *, u_int *); 93 94struct mkimg_uuid { 95 uint32_t time_low; 96 uint16_t time_mid; 97 uint16_t time_hi_and_version; 98 uint8_t clock_seq_hi_and_reserved; 99 uint8_t clock_seq_low; 100 uint8_t node[6]; 101}; 102typedef struct mkimg_uuid mkimg_uuid_t; 103 104void mkimg_uuid(mkimg_uuid_t *); 105void mkimg_uuid_enc(void *, const mkimg_uuid_t *); 106 107#ifdef __linux__ 108# if !defined(__unused) 109# define __unused __attribute__ ((__unused__)) 110# endif 111#endif 112 113#endif /* _MKIMG_MKIMG_H_ */ 114