disk.c 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <bio.h>
  4. #include <ctype.h>
  5. #include <disk.h>
  6. static Disk*
  7. mkwidth(Disk *disk)
  8. {
  9. char buf[40];
  10. sprint(buf, "%lld", disk->size);
  11. disk->width = strlen(buf);
  12. return disk;
  13. }
  14. /*
  15. * Discover the disk geometry by various sleazeful means.
  16. *
  17. * First, if there is a partition table in sector 0,
  18. * see if all the partitions have the same end head
  19. * and sector; if so, we'll assume that that's the
  20. * right count.
  21. *
  22. * If that fails, we'll try looking at the geometry that the ATA
  23. * driver supplied, if any, and translate that as a
  24. * BIOS might.
  25. *
  26. * If that too fails, which should only happen on a SCSI
  27. * disk with no currently defined partitions, we'll try
  28. * various common (h, s) pairs used by BIOSes when faking
  29. * the geometries.
  30. */
  31. typedef struct Table Table;
  32. typedef struct Tentry Tentry;
  33. struct Tentry {
  34. uchar active; /* active flag */
  35. uchar starth; /* starting head */
  36. uchar starts; /* starting sector */
  37. uchar startc; /* starting cylinder */
  38. uchar type; /* partition type */
  39. uchar endh; /* ending head */
  40. uchar ends; /* ending sector */
  41. uchar endc; /* ending cylinder */
  42. uchar xlba[4]; /* starting LBA from beginning of disc */
  43. uchar xsize[4]; /* size in sectors */
  44. };
  45. enum {
  46. Toffset = 446, /* offset of partition table in sector */
  47. Magic0 = 0x55,
  48. Magic1 = 0xAA,
  49. NTentry = 4,
  50. };
  51. struct Table {
  52. Tentry entry[NTentry];
  53. uchar magic[2];
  54. };
  55. static int
  56. partitiongeometry(Disk *disk)
  57. {
  58. char *rawname;
  59. int i, h, rawfd, s;
  60. uchar buf[512];
  61. Table *t;
  62. if(disk->c == 0 || disk->h == 0 || disk->s == 0)
  63. return -1;
  64. t = (Table*)(buf + Toffset);
  65. /*
  66. * look for an MBR first in the /dev/sdXX/data partition, otherwise
  67. * attempt to fall back on the current partition.
  68. */
  69. rawname = malloc(strlen(disk->prefix) + 5); /* prefix + "data" + nul */
  70. if(rawname == nil)
  71. return -1;
  72. strcpy(rawname, disk->prefix);
  73. strcat(rawname, "data");
  74. rawfd = open(rawname, OREAD);
  75. free(rawname);
  76. if(rawfd >= 0
  77. && seek(rawfd, 0, 0) >= 0
  78. && readn(rawfd, buf, 512) == 512
  79. && t->magic[0] == Magic0
  80. && t->magic[1] == Magic1) {
  81. close(rawfd);
  82. } else {
  83. if(rawfd >= 0)
  84. close(rawfd);
  85. if(seek(disk->fd, 0, 0) < 0
  86. || readn(disk->fd, buf, 512) != 512
  87. || t->magic[0] != Magic0
  88. || t->magic[1] != Magic1) {
  89. return -1;
  90. }
  91. }
  92. h = s = -1;
  93. for(i=0; i<NTentry; i++) {
  94. if(t->entry[i].type == 0)
  95. continue;
  96. t->entry[i].ends &= 63;
  97. if(h == -1) {
  98. h = t->entry[i].endh;
  99. s = t->entry[i].ends;
  100. } else {
  101. /*
  102. * Only accept the partition info if every
  103. * partition is consistent.
  104. */
  105. if(h != t->entry[i].endh || s != t->entry[i].ends)
  106. return -1;
  107. }
  108. }
  109. if(h == -1)
  110. return -1;
  111. disk->h = h+1; /* heads count from 0 */
  112. disk->s = s; /* sectors count from 1 */
  113. disk->c = disk->secs / (disk->h*disk->s);
  114. disk->chssrc = Gpart;
  115. return 0;
  116. }
  117. /*
  118. * If there is ATA geometry, use it, perhaps massaged.
  119. */
  120. static int
  121. drivergeometry(Disk *disk)
  122. {
  123. int m;
  124. if(disk->c == 0 || disk->h == 0 || disk->s == 0)
  125. return -1;
  126. disk->chssrc = Gdisk;
  127. if(disk->c < 1024)
  128. return 0;
  129. switch(disk->h) {
  130. case 15:
  131. disk->h = 255;
  132. disk->c /= 17;
  133. return 0;
  134. default:
  135. for(m = 2; m*disk->h < 256; m *= 2) {
  136. if(disk->c/m < 1024) {
  137. disk->c /= m;
  138. disk->h *= m;
  139. return 0;
  140. }
  141. }
  142. /* set to 255, 63 and be done with it */
  143. disk->h = 255;
  144. disk->s = 63;
  145. disk->c = disk->secs / (disk->h * disk->s);
  146. return 0;
  147. }
  148. }
  149. /*
  150. * There's no ATA geometry and no partitions.
  151. * Our guess is as good as anyone's.
  152. */
  153. static struct {
  154. int h;
  155. int s;
  156. } guess[] = {
  157. 64, 32,
  158. 64, 63,
  159. 128, 63,
  160. 255, 63,
  161. };
  162. static int
  163. guessgeometry(Disk *disk)
  164. {
  165. int i;
  166. long c;
  167. disk->chssrc = Gguess;
  168. c = 1024;
  169. for(i=0; i<nelem(guess); i++)
  170. if(c*guess[i].h*guess[i].s >= disk->secs) {
  171. disk->h = guess[i].h;
  172. disk->s = guess[i].s;
  173. disk->c = disk->secs / (disk->h * disk->s);
  174. return 0;
  175. }
  176. /* use maximum values */
  177. disk->h = 255;
  178. disk->s = 63;
  179. disk->c = disk->secs / (disk->h * disk->s);
  180. return 0;
  181. }
  182. static void
  183. findgeometry(Disk *disk)
  184. {
  185. if(partitiongeometry(disk) < 0
  186. && drivergeometry(disk) < 0
  187. && guessgeometry(disk) < 0) { /* can't happen */
  188. print("we're completely confused about your disk; sorry\n");
  189. assert(0);
  190. }
  191. }
  192. static Disk*
  193. openfile(Disk *disk)
  194. {
  195. Dir *d;
  196. if((d = dirfstat(disk->fd)) == nil){
  197. free(disk);
  198. return nil;
  199. }
  200. disk->secsize = 512;
  201. disk->size = d->length;
  202. disk->secs = disk->size / disk->secsize;
  203. disk->offset = 0;
  204. free(d);
  205. findgeometry(disk);
  206. return mkwidth(disk);
  207. }
  208. static Disk*
  209. opensd(Disk *disk)
  210. {
  211. Biobuf b;
  212. char *p, *f[10];
  213. int nf;
  214. Binit(&b, disk->ctlfd, OREAD);
  215. while(p = Brdline(&b, '\n')) {
  216. p[Blinelen(&b)-1] = '\0';
  217. nf = tokenize(p, f, nelem(f));
  218. if(nf >= 3 && strcmp(f[0], "geometry") == 0) {
  219. disk->secsize = strtoll(f[2], 0, 0);
  220. if(nf >= 6) {
  221. disk->c = strtol(f[3], 0, 0);
  222. disk->h = strtol(f[4], 0, 0);
  223. disk->s = strtol(f[5], 0, 0);
  224. }
  225. }
  226. if(nf >= 4 && strcmp(f[0], "part") == 0 && strcmp(f[1], disk->part) == 0) {
  227. disk->offset = strtoll(f[2], 0, 0);
  228. disk->secs = strtoll(f[3], 0, 0) - disk->offset;
  229. }
  230. }
  231. disk->size = disk->secs * disk->secsize;
  232. if(disk->size <= 0) {
  233. strcpy(disk->part, "");
  234. disk->type = Tfile;
  235. return openfile(disk);
  236. }
  237. findgeometry(disk);
  238. return mkwidth(disk);
  239. }
  240. Disk*
  241. opendisk(char *disk, int rdonly, int noctl)
  242. {
  243. char *p, *q;
  244. Disk *d;
  245. d = mallocz(sizeof(*d), 1);
  246. if(d == nil)
  247. return nil;
  248. d->fd = d->wfd = d->ctlfd = -1;
  249. d->rdonly = rdonly;
  250. d->fd = open(disk, OREAD);
  251. if(d->fd < 0) {
  252. werrstr("cannot open disk file");
  253. free(d);
  254. return nil;
  255. }
  256. if(rdonly == 0) {
  257. d->wfd = open(disk, OWRITE);
  258. if(d->wfd < 0)
  259. d->rdonly = 1;
  260. }
  261. if(noctl)
  262. return openfile(d);
  263. p = malloc(strlen(disk) + 4); /* 4: slop for "ctl\0" */
  264. if(p == nil) {
  265. close(d->wfd);
  266. close(d->fd);
  267. free(d);
  268. return nil;
  269. }
  270. strcpy(p, disk);
  271. /* check for floppy(3) disk */
  272. if(strlen(p) >= 7) {
  273. q = p+strlen(p)-7;
  274. if(q[0] == 'f' && q[1] == 'd' && isdigit(q[2]) && strcmp(q+3, "disk") == 0) {
  275. strcpy(q+3, "ctl");
  276. if((d->ctlfd = open(p, ORDWR)) >= 0) {
  277. *q = '\0';
  278. d->prefix = p;
  279. d->type = Tfloppy;
  280. return openfile(d);
  281. }
  282. }
  283. }
  284. /* attempt to find sd(3) disk or partition */
  285. if(q = strrchr(p, '/'))
  286. q++;
  287. else
  288. q = p;
  289. strcpy(q, "ctl");
  290. if((d->ctlfd = open(p, ORDWR)) >= 0) {
  291. *q = '\0';
  292. d->prefix = p;
  293. d->type = Tsd;
  294. d->part = strdup(disk+(q-p));
  295. if(d->part == nil){
  296. close(d->ctlfd);
  297. close(d->wfd);
  298. close(d->fd);
  299. free(p);
  300. free(d);
  301. return nil;
  302. }
  303. return opensd(d);
  304. }
  305. *q = '\0';
  306. d->prefix = p;
  307. /* assume we just have a normal file */
  308. d->type = Tfile;
  309. return openfile(d);
  310. }