geom_bsd_enc.c 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196
  1. /*-
  2. * SPDX-License-Identifier: BSD-3-Clause
  3. *
  4. * Copyright (c) 2002 Poul-Henning Kamp
  5. * Copyright (c) 2002 Networks Associates Technology, Inc.
  6. * All rights reserved.
  7. *
  8. * This software was developed for the FreeBSD Project by Poul-Henning Kamp
  9. * and NAI Labs, the Security Research Division of Network Associates, Inc.
  10. * under DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the
  11. * DARPA CHATS research program.
  12. *
  13. * Redistribution and use in source and binary forms, with or without
  14. * modification, are permitted provided that the following conditions
  15. * are met:
  16. * 1. Redistributions of source code must retain the above copyright
  17. * notice, this list of conditions and the following disclaimer.
  18. * 2. Redistributions in binary form must reproduce the above copyright
  19. * notice, this list of conditions and the following disclaimer in the
  20. * documentation and/or other materials provided with the distribution.
  21. * 3. The names of the authors may not be used to endorse or promote
  22. * products derived from this software without specific prior written
  23. * permission.
  24. *
  25. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
  26. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  27. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  28. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  29. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  30. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  31. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  32. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  33. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  34. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  35. * SUCH DAMAGE.
  36. */
  37. /*
  38. * Functions to encode and decode struct disklabel and struct partition into
  39. * a bytestream of little endianness and correct packing.
  40. *
  41. * NB! This file must be usable both in kernel and userland.
  42. */
  43. #include <sys/types.h>
  44. #include <sys/endian.h>
  45. #include <sys/disklabel.h>
  46. #include <sys/errno.h>
  47. #ifdef _KERNEL
  48. #include <sys/systm.h>
  49. #else
  50. #include <string.h>
  51. #endif
  52. void
  53. bsd_partition_le_dec(u_char *ptr, struct partition *d)
  54. {
  55. d->p_size = le32dec(ptr + 0);
  56. d->p_offset = le32dec(ptr + 4);
  57. d->p_fsize = le32dec(ptr + 8);
  58. d->p_fstype = ptr[12];
  59. d->p_frag = ptr[13];
  60. d->p_cpg = le16dec(ptr + 14);
  61. }
  62. int
  63. bsd_disklabel_le_dec(u_char *ptr, struct disklabel *d, int maxpart)
  64. {
  65. int i;
  66. u_char *p, *pe;
  67. uint16_t sum;
  68. d->d_magic = le32dec(ptr + 0);
  69. if (d->d_magic != DISKMAGIC)
  70. return(EINVAL);
  71. d->d_magic2 = le32dec(ptr + 132);
  72. if (d->d_magic2 != DISKMAGIC) {
  73. return(EINVAL);
  74. }
  75. d->d_npartitions = le16dec(ptr + 138);
  76. if (d->d_npartitions > maxpart) {
  77. return(EINVAL);
  78. }
  79. pe = ptr + 148 + 16 * d->d_npartitions;
  80. sum = 0;
  81. for (p = ptr; p < pe; p += 2)
  82. sum ^= le16dec(p);
  83. if (sum != 0) {
  84. return(EINVAL);
  85. }
  86. d->d_type = le16dec(ptr + 4);
  87. d->d_subtype = le16dec(ptr + 6);
  88. bcopy(ptr + 8, d->d_typename, 16);
  89. bcopy(ptr + 24, d->d_packname, 16);
  90. d->d_secsize = le32dec(ptr + 40);
  91. d->d_nsectors = le32dec(ptr + 44);
  92. d->d_ntracks = le32dec(ptr + 48);
  93. d->d_ncylinders = le32dec(ptr + 52);
  94. d->d_secpercyl = le32dec(ptr + 56);
  95. d->d_secperunit = le32dec(ptr + 60);
  96. d->d_sparespertrack = le16dec(ptr + 64);
  97. d->d_sparespercyl = le16dec(ptr + 66);
  98. d->d_acylinders = le32dec(ptr + 68);
  99. d->d_rpm = le16dec(ptr + 72);
  100. d->d_interleave = le16dec(ptr + 74);
  101. d->d_trackskew = le16dec(ptr + 76);
  102. d->d_cylskew = le16dec(ptr + 78);
  103. d->d_headswitch = le32dec(ptr + 80);
  104. d->d_trkseek = le32dec(ptr + 84);
  105. d->d_flags = le32dec(ptr + 88);
  106. d->d_drivedata[0] = le32dec(ptr + 92);
  107. d->d_drivedata[1] = le32dec(ptr + 96);
  108. d->d_drivedata[2] = le32dec(ptr + 100);
  109. d->d_drivedata[3] = le32dec(ptr + 104);
  110. d->d_drivedata[4] = le32dec(ptr + 108);
  111. d->d_spare[0] = le32dec(ptr + 112);
  112. d->d_spare[1] = le32dec(ptr + 116);
  113. d->d_spare[2] = le32dec(ptr + 120);
  114. d->d_spare[3] = le32dec(ptr + 124);
  115. d->d_spare[4] = le32dec(ptr + 128);
  116. d->d_checksum = le16dec(ptr + 136);
  117. d->d_npartitions = le16dec(ptr + 138);
  118. d->d_bbsize = le32dec(ptr + 140);
  119. d->d_sbsize = le32dec(ptr + 144);
  120. for (i = 0; i < d->d_npartitions; i++)
  121. bsd_partition_le_dec(ptr + 148 + 16 * i, &d->d_partitions[i]);
  122. return(0);
  123. }
  124. void
  125. bsd_partition_le_enc(u_char *ptr, struct partition *d)
  126. {
  127. le32enc(ptr + 0, d->p_size);
  128. le32enc(ptr + 4, d->p_offset);
  129. le32enc(ptr + 8, d->p_fsize);
  130. ptr[12] = d->p_fstype;
  131. ptr[13] = d->p_frag;
  132. le16enc(ptr + 14, d->p_cpg);
  133. }
  134. void
  135. bsd_disklabel_le_enc(u_char *ptr, struct disklabel *d)
  136. {
  137. int i;
  138. u_char *p, *pe;
  139. uint16_t sum;
  140. le32enc(ptr + 0, d->d_magic);
  141. le16enc(ptr + 4, d->d_type);
  142. le16enc(ptr + 6, d->d_subtype);
  143. bcopy(d->d_typename, ptr + 8, 16);
  144. bcopy(d->d_packname, ptr + 24, 16);
  145. le32enc(ptr + 40, d->d_secsize);
  146. le32enc(ptr + 44, d->d_nsectors);
  147. le32enc(ptr + 48, d->d_ntracks);
  148. le32enc(ptr + 52, d->d_ncylinders);
  149. le32enc(ptr + 56, d->d_secpercyl);
  150. le32enc(ptr + 60, d->d_secperunit);
  151. le16enc(ptr + 64, d->d_sparespertrack);
  152. le16enc(ptr + 66, d->d_sparespercyl);
  153. le32enc(ptr + 68, d->d_acylinders);
  154. le16enc(ptr + 72, d->d_rpm);
  155. le16enc(ptr + 74, d->d_interleave);
  156. le16enc(ptr + 76, d->d_trackskew);
  157. le16enc(ptr + 78, d->d_cylskew);
  158. le32enc(ptr + 80, d->d_headswitch);
  159. le32enc(ptr + 84, d->d_trkseek);
  160. le32enc(ptr + 88, d->d_flags);
  161. le32enc(ptr + 92, d->d_drivedata[0]);
  162. le32enc(ptr + 96, d->d_drivedata[1]);
  163. le32enc(ptr + 100, d->d_drivedata[2]);
  164. le32enc(ptr + 104, d->d_drivedata[3]);
  165. le32enc(ptr + 108, d->d_drivedata[4]);
  166. le32enc(ptr + 112, d->d_spare[0]);
  167. le32enc(ptr + 116, d->d_spare[1]);
  168. le32enc(ptr + 120, d->d_spare[2]);
  169. le32enc(ptr + 124, d->d_spare[3]);
  170. le32enc(ptr + 128, d->d_spare[4]);
  171. le32enc(ptr + 132, d->d_magic2);
  172. le16enc(ptr + 136, 0);
  173. le16enc(ptr + 138, d->d_npartitions);
  174. le32enc(ptr + 140, d->d_bbsize);
  175. le32enc(ptr + 144, d->d_sbsize);
  176. for (i = 0; i < d->d_npartitions; i++)
  177. bsd_partition_le_enc(ptr + 148 + 16 * i, &d->d_partitions[i]);
  178. pe = ptr + 148 + 16 * d->d_npartitions;
  179. sum = 0;
  180. for (p = ptr; p < pe; p += 2)
  181. sum ^= le16dec(p);
  182. le16enc(ptr + 136, sum);
  183. }