1 | /*
|
---|
2 | * Copyright (c) 2009 Jiri Svoboda
|
---|
3 | * Copyright (c) 2011, 2012, 2013 Dominik Taborsky
|
---|
4 | * All rights reserved.
|
---|
5 | *
|
---|
6 | * Redistribution and use in source and binary forms, with or without
|
---|
7 | * modification, are permitted provided that the following conditions
|
---|
8 | * are met:
|
---|
9 | *
|
---|
10 | * - Redistributions of source code must retain the above copyright
|
---|
11 | * notice, this list of conditions and the following disclaimer.
|
---|
12 | * - Redistributions in binary form must reproduce the above copyright
|
---|
13 | * notice, this list of conditions and the following disclaimer in the
|
---|
14 | * documentation and/or other materials provided with the distribution.
|
---|
15 | * - The name of the author may not be used to endorse or promote products
|
---|
16 | * derived from this software without specific prior written permission.
|
---|
17 | *
|
---|
18 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
19 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
20 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
21 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
22 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
23 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
24 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
25 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
26 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
27 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
28 | */
|
---|
29 |
|
---|
30 | /** @addtogroup libgpt
|
---|
31 | * @{
|
---|
32 | */
|
---|
33 | /** @file
|
---|
34 | */
|
---|
35 |
|
---|
36 | #ifndef LIBGPT_LIBGPT_H_
|
---|
37 | #define LIBGPT_LIBGPT_H_
|
---|
38 |
|
---|
39 | #define LIBGPT_NAME "libgpt"
|
---|
40 |
|
---|
41 | #include <loc.h>
|
---|
42 | #include <sys/types.h>
|
---|
43 |
|
---|
44 | #include "gpt.h"
|
---|
45 |
|
---|
46 | /** Block address of GPT header. */
|
---|
47 | #define GPT_HDR_BA 1
|
---|
48 | /** Block size of GPT header. */
|
---|
49 | #define GPT_HDR_BS 1
|
---|
50 | /** Minimum number of GPT partition entries */
|
---|
51 | #define GPT_MIN_PART_NUM 128
|
---|
52 | /** Basic number of GPT partition entries */
|
---|
53 | #define GPT_BASE_PART_NUM (GPT_MIN_PART_NUM)
|
---|
54 | /** How much fill we ignore before resizing partition array */
|
---|
55 | #define GPT_IGNORE_FILL_NUM 10
|
---|
56 |
|
---|
57 | /** Unused partition entry */
|
---|
58 | #define GPT_PTE_UNUSED 0
|
---|
59 |
|
---|
60 | /** GPT header signature ("EFI PART" in ASCII) */
|
---|
61 | extern const uint8_t efi_signature[8];
|
---|
62 |
|
---|
63 | typedef struct {
|
---|
64 | /** Raw header. Has more bytes alloced than sizeof(gpt_header_t)!
|
---|
65 | * See gpt_alloc_header() to know why. */
|
---|
66 | gpt_header_t *header;
|
---|
67 | } gpt_t;
|
---|
68 |
|
---|
69 | typedef gpt_entry_t gpt_part_t;
|
---|
70 |
|
---|
71 | typedef struct gpt_parts {
|
---|
72 | /** Number of entries */
|
---|
73 | size_t fill;
|
---|
74 | /** Size of the array */
|
---|
75 | size_t arr_size;
|
---|
76 | /** Resizable partition array */
|
---|
77 | gpt_entry_t *part_array;
|
---|
78 | } gpt_partitions_t;
|
---|
79 |
|
---|
80 |
|
---|
81 | typedef struct gpt_table {
|
---|
82 | gpt_t *gpt;
|
---|
83 | gpt_partitions_t *parts;
|
---|
84 | service_id_t device;
|
---|
85 | } gpt_label_t;
|
---|
86 |
|
---|
87 | struct partition_type {
|
---|
88 | const char *desc;
|
---|
89 | const char *guid;
|
---|
90 | };
|
---|
91 |
|
---|
92 | extern const struct partition_type gpt_ptypes[];
|
---|
93 |
|
---|
94 | extern gpt_label_t * gpt_alloc_label(void);
|
---|
95 | extern void gpt_free_label(gpt_label_t *);
|
---|
96 |
|
---|
97 | extern gpt_t * gpt_alloc_header(size_t);
|
---|
98 | extern int gpt_read_header(gpt_label_t *, service_id_t);
|
---|
99 | extern int gpt_write_header(gpt_label_t *, service_id_t);
|
---|
100 |
|
---|
101 | extern gpt_partitions_t * gpt_alloc_partitions(void);
|
---|
102 | extern int gpt_read_partitions (gpt_label_t *);
|
---|
103 | extern int gpt_write_partitions(gpt_label_t *, service_id_t);
|
---|
104 | extern gpt_part_t * gpt_alloc_partition (void);
|
---|
105 | extern gpt_part_t * gpt_get_partition (gpt_label_t *);
|
---|
106 | extern gpt_part_t * gpt_get_partition_at(gpt_label_t *, size_t);
|
---|
107 | extern int gpt_add_partition (gpt_label_t *, gpt_part_t *);
|
---|
108 | extern int gpt_remove_partition(gpt_label_t *, size_t);
|
---|
109 |
|
---|
110 | extern size_t gpt_get_part_type(gpt_part_t *);
|
---|
111 | extern void gpt_set_part_type(gpt_part_t *, size_t);
|
---|
112 | extern void gpt_set_start_lba(gpt_part_t *, uint64_t);
|
---|
113 | extern uint64_t gpt_get_start_lba(gpt_part_t *);
|
---|
114 | extern void gpt_set_end_lba (gpt_part_t *, uint64_t);
|
---|
115 | extern uint64_t gpt_get_end_lba (gpt_part_t *);
|
---|
116 | extern unsigned char * gpt_get_part_name(gpt_part_t *);
|
---|
117 | extern void gpt_set_part_name(gpt_part_t *, char *, size_t);
|
---|
118 | extern bool gpt_get_flag (gpt_part_t *, GPT_ATTR);
|
---|
119 | extern void gpt_set_flag (gpt_part_t *, GPT_ATTR, bool);
|
---|
120 |
|
---|
121 | extern void gpt_set_random_uuid(uint8_t *);
|
---|
122 | extern uint64_t gpt_get_next_aligned(uint64_t, unsigned int);
|
---|
123 |
|
---|
124 |
|
---|
125 | #define gpt_part_foreach(label, iterator) \
|
---|
126 | for(gpt_part_t * iterator = (label)->parts->part_array; \
|
---|
127 | iterator < (label)->parts->part_array + (label)->parts->arr_size; ++iterator)
|
---|
128 |
|
---|
129 | extern void gpt_free_gpt(gpt_t *);
|
---|
130 | extern void gpt_free_partitions(gpt_partitions_t *);
|
---|
131 |
|
---|
132 | #endif
|
---|
133 |
|
---|