edit.c 9.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556
  1. /*
  2. * This file is part of the UCB release of Plan 9. It is subject to the license
  3. * terms in the LICENSE file found in the top-level directory of this
  4. * distribution and at http://akaros.cs.berkeley.edu/files/Plan9License. No
  5. * part of the UCB release of Plan 9, including this file, may be copied,
  6. * modified, propagated, or distributed except according to the terms contained
  7. * in the LICENSE file.
  8. */
  9. /*
  10. * disk partition editor
  11. */
  12. #include <u.h>
  13. #include <libc.h>
  14. #include <bio.h>
  15. #include <ctype.h>
  16. #include <disk.h>
  17. #include "edit.h"
  18. char*
  19. getline(Edit *edit)
  20. {
  21. static int inited;
  22. static Biobuf bin;
  23. char *p;
  24. int n;
  25. if(!inited){
  26. Binit(&bin, 0, OREAD);
  27. inited = 1;
  28. }
  29. p = Brdline(&bin, '\n');
  30. n = Blinelen(&bin);
  31. if(p == nil || n < 1){
  32. if(edit->changed)
  33. fprint(2, "?warning: changes not written\n");
  34. exits(0);
  35. }
  36. p[n - 1] = '\0';
  37. while(isspace(*p))
  38. p++;
  39. return p;
  40. }
  41. Part*
  42. findpart(Edit *edit, char *name)
  43. {
  44. int i;
  45. for(i=0; i<edit->npart; i++)
  46. if(strcmp(edit->part[i]->name, name) == 0)
  47. return edit->part[i];
  48. return nil;
  49. }
  50. static char*
  51. okname(Edit *edit, char *name)
  52. {
  53. int i;
  54. static char msg[100];
  55. if(name[0] == '\0')
  56. return "partition has no name";
  57. // if(strlen(name) >= NAMELEN)
  58. // return "name too long";
  59. //
  60. for(i=0; i<edit->npart; i++) {
  61. if(strcmp(name, edit->part[i]->name) == 0) {
  62. sprint(msg, "already have partition with name \"%s\"", name);
  63. return msg;
  64. }
  65. }
  66. return nil;
  67. }
  68. char*
  69. addpart(Edit *edit, Part *p)
  70. {
  71. int i;
  72. static char msg[100];
  73. char *err;
  74. if((err = okname(edit, p->name)) != nil)
  75. return err;
  76. for(i=0; i<edit->npart; i++) {
  77. if(p->start < edit->part[i]->end && edit->part[i]->start < p->end) {
  78. sprint(msg, "\"%s\" %lld-%lld overlaps with \"%s\" %lld-%lld",
  79. p->name, p->start, p->end,
  80. edit->part[i]->name, edit->part[i]->start, edit->part[i]->end);
  81. // return msg;
  82. }
  83. }
  84. if(edit->npart >= nelem(edit->part))
  85. return "too many partitions";
  86. edit->part[i=edit->npart++] = p;
  87. for(; i > 0 && p->start < edit->part[i-1]->start; i--) {
  88. edit->part[i] = edit->part[i-1];
  89. edit->part[i-1] = p;
  90. }
  91. if(p->changed)
  92. edit->changed = 1;
  93. return nil;
  94. }
  95. char*
  96. delpart(Edit *edit, Part *p)
  97. {
  98. int i;
  99. for(i=0; i<edit->npart; i++)
  100. if(edit->part[i] == p)
  101. break;
  102. assert(i < edit->npart);
  103. edit->npart--;
  104. for(; i<edit->npart; i++)
  105. edit->part[i] = edit->part[i+1];
  106. edit->changed = 1;
  107. return nil;
  108. }
  109. static char*
  110. editdot(Edit *edit, int argc, char **argv)
  111. {
  112. char *err;
  113. int64_t ndot;
  114. if(argc == 1) {
  115. print("\t. %lld\n", edit->dot);
  116. return nil;
  117. }
  118. if(argc > 2)
  119. return "args";
  120. if((err = parseexpr(argv[1], edit->dot, edit->end, edit->end, &ndot)) != nil)
  121. return err;
  122. edit->dot = ndot;
  123. return nil;
  124. }
  125. static char*
  126. editadd(Edit *edit, int argc, char **argv)
  127. {
  128. char *name, *err, *q;
  129. static char msg[100];
  130. int64_t start, end, maxend;
  131. int i;
  132. if(argc < 2)
  133. return "args";
  134. name = estrdup(argv[1]);
  135. if((err = okname(edit, name)) || (err = edit->okname(edit, name)))
  136. return err;
  137. if(argc >= 3)
  138. q = argv[2];
  139. else {
  140. fprint(2, "start %s: ", edit->unit);
  141. q = getline(edit);
  142. }
  143. if((err = parseexpr(q, edit->dot, edit->end, edit->end, &start)) != nil)
  144. return err;
  145. if(start < 0 || start >= edit->end)
  146. return "start out of range";
  147. for(i=0; i < edit->npart; i++) {
  148. if(edit->part[i]->start <= start && start < edit->part[i]->end) {
  149. sprint(msg, "start %s in partition \"%s\"", edit->unit, edit->part[i]->name);
  150. return msg;
  151. }
  152. }
  153. maxend = edit->end;
  154. for(i=0; i < edit->npart; i++)
  155. if(start < edit->part[i]->start && edit->part[i]->start < maxend)
  156. maxend = edit->part[i]->start;
  157. if(argc >= 4)
  158. q = argv[3];
  159. else {
  160. fprint(2, "end [%lld..%lld] ", start, maxend);
  161. q = getline(edit);
  162. }
  163. if((err = parseexpr(q, edit->dot, maxend, edit->end, &end)) != nil)
  164. return err;
  165. if(start == end)
  166. return "size zero partition";
  167. if(end <= start || end > maxend)
  168. return "end out of range";
  169. if(argc > 4)
  170. return "args";
  171. if((err = edit->add(edit, name, start, end)) != nil)
  172. return err;
  173. edit->dot = end;
  174. return nil;
  175. }
  176. static char*
  177. editdel(Edit *edit, int argc, char **argv)
  178. {
  179. Part *p;
  180. if(argc != 2)
  181. return "args";
  182. if((p = findpart(edit, argv[1])) == nil)
  183. return "no such partition";
  184. return edit->del(edit, p);
  185. }
  186. static char *helptext =
  187. ". [newdot] - display or set value of dot\n"
  188. "a name [start [end]] - add partition\n"
  189. "d name - delete partition\n"
  190. "h - print help message\n"
  191. "p - print partition table\n"
  192. "P - print commands to update sd(3) device\n"
  193. "w - write partition table\n"
  194. "q - quit\n";
  195. static char*
  196. edithelp(Edit *edit, int i, char **c)
  197. {
  198. print("%s", helptext);
  199. if(edit->help)
  200. return edit->help(edit);
  201. return nil;
  202. }
  203. static char*
  204. editprint(Edit *edit, int argc, char **c)
  205. {
  206. int64_t lastend;
  207. int i;
  208. Part **part;
  209. if(argc != 1)
  210. return "args";
  211. lastend = 0;
  212. part = edit->part;
  213. for(i=0; i<edit->npart; i++) {
  214. if(lastend < part[i]->start)
  215. edit->sum(edit, nil, lastend, part[i]->start);
  216. edit->sum(edit, part[i], part[i]->start, part[i]->end);
  217. lastend = part[i]->end;
  218. }
  219. if(lastend < edit->end)
  220. edit->sum(edit, nil, lastend, edit->end);
  221. return nil;
  222. }
  223. char*
  224. editwrite(Edit *edit, int argc, char **c)
  225. {
  226. int i;
  227. char *err;
  228. if(argc != 1)
  229. return "args";
  230. if(edit->disk->rdonly)
  231. return "read only";
  232. err = edit->write(edit);
  233. if(err)
  234. return err;
  235. for(i=0; i<edit->npart; i++)
  236. edit->part[i]->changed = 0;
  237. edit->changed = 0;
  238. return nil;
  239. }
  240. static char*
  241. editquit(Edit *edit, int argc, char **c)
  242. {
  243. if(argc != 1) {
  244. return "args";
  245. }
  246. if(edit->changed && (!edit->warned || edit->lastcmd != 'q')) {
  247. edit->warned = 1;
  248. return "changes unwritten";
  249. }
  250. exits(0);
  251. return nil; /* not reached */
  252. }
  253. char*
  254. editctlprint(Edit *edit, int argc, char **c)
  255. {
  256. if(argc != 1)
  257. return "args";
  258. if(edit->printctl)
  259. edit->printctl(edit, 1);
  260. else
  261. ctldiff(edit, 1);
  262. return nil;
  263. }
  264. typedef struct Cmd Cmd;
  265. struct Cmd {
  266. char c;
  267. char *(*fn)(Edit*, int ,char**);
  268. };
  269. Cmd cmds[] = {
  270. {'.', editdot},
  271. {'a', editadd},
  272. {'d', editdel},
  273. {'?', edithelp},
  274. {'h', edithelp},
  275. {'P', editctlprint},
  276. {'p', editprint},
  277. {'w', editwrite},
  278. {'q', editquit},
  279. };
  280. void
  281. runcmd(Edit *edit, char *cmd)
  282. {
  283. char *f[10], *err;
  284. int i, nf;
  285. while(*cmd && isspace(*cmd))
  286. cmd++;
  287. nf = tokenize(cmd, f, nelem(f));
  288. if(nf >= 10) {
  289. fprint(2, "?\n");
  290. return;
  291. }
  292. if(nf < 1)
  293. return;
  294. if(strlen(f[0]) != 1) {
  295. fprint(2, "?\n");
  296. return;
  297. }
  298. err = nil;
  299. for(i=0; i<nelem(cmds); i++) {
  300. if(cmds[i].c == f[0][0]) {
  301. err = cmds[i].fn(edit, nf, f);
  302. break;
  303. }
  304. }
  305. if(i == nelem(cmds)){
  306. if(edit->ext)
  307. err = edit->ext(edit, nf, f);
  308. else
  309. err = "unknown command";
  310. }
  311. if(err)
  312. fprint(2, "?%s\n", err);
  313. edit->lastcmd = f[0][0];
  314. }
  315. static Part*
  316. ctlmkpart(char *name, int64_t start, int64_t end, int changed)
  317. {
  318. Part *p;
  319. p = emalloc(sizeof(*p));
  320. p->name = estrdup(name);
  321. p->ctlname = estrdup(name);
  322. p->start = start;
  323. p->end = end;
  324. p->changed = changed;
  325. return p;
  326. }
  327. static void
  328. rdctlpart(Edit *edit)
  329. {
  330. int i, nline, nf;
  331. char *line[128];
  332. char buf[4096];
  333. int64_t a, b;
  334. char *f[5];
  335. Disk *disk;
  336. disk = edit->disk;
  337. edit->nctlpart = 0;
  338. seek(disk->ctlfd, 0, 0);
  339. if(readn(disk->ctlfd, buf, sizeof buf) <= 0) {
  340. return;
  341. }
  342. nline = getfields(buf, line, nelem(line), 1, "\n");
  343. for(i=0; i<nline; i++){
  344. if(strncmp(line[i], "part ", 5) != 0)
  345. continue;
  346. nf = getfields(line[i], f, nelem(f), 1, " \t\r");
  347. if(nf != 4 || strcmp(f[0], "part") != 0)
  348. break;
  349. a = strtoll(f[2], 0, 0);
  350. b = strtoll(f[3], 0, 0);
  351. if(a >= b)
  352. break;
  353. /* only gather partitions contained in the disk partition we are editing */
  354. if(a < disk->offset || disk->offset+disk->secs < b)
  355. continue;
  356. a -= disk->offset;
  357. b -= disk->offset;
  358. /* the partition we are editing does not count */
  359. if(strcmp(f[1], disk->part) == 0)
  360. continue;
  361. if(edit->nctlpart >= nelem(edit->ctlpart)) {
  362. fprint(2, "?too many partitions in ctl file\n");
  363. exits("ctlpart");
  364. }
  365. edit->ctlpart[edit->nctlpart++] = ctlmkpart(f[1], a, b, 0);
  366. }
  367. }
  368. static int64_t
  369. ctlstart(Part *p)
  370. {
  371. if(p->ctlstart)
  372. return p->ctlstart;
  373. return p->start;
  374. }
  375. static int64_t
  376. ctlend(Part *p)
  377. {
  378. if(p->ctlend)
  379. return p->ctlend;
  380. return p->end;
  381. }
  382. static int
  383. areequiv(Part *p, Part *q)
  384. {
  385. if(p->ctlname[0]=='\0' || q->ctlname[0]=='\0')
  386. return 0;
  387. return strcmp(p->ctlname, q->ctlname) == 0
  388. && ctlstart(p) == ctlstart(q) && ctlend(p) == ctlend(q);
  389. }
  390. static void
  391. unchange(Edit *edit, Part *p)
  392. {
  393. int i;
  394. Part *q;
  395. for(i=0; i<edit->nctlpart; i++) {
  396. q = edit->ctlpart[i];
  397. if(p->start <= q->start && q->end <= p->end) {
  398. q->changed = 0;
  399. }
  400. }
  401. assert(p->changed == 0);
  402. }
  403. int
  404. ctldiff(Edit *edit, int ctlfd)
  405. {
  406. int i, j, waserr;
  407. Part *p;
  408. int64_t offset;
  409. rdctlpart(edit);
  410. /* everything is bogus until we prove otherwise */
  411. for(i=0; i<edit->nctlpart; i++)
  412. edit->ctlpart[i]->changed = 1;
  413. /*
  414. * partitions with same info have not changed,
  415. * and neither have partitions inside them.
  416. */
  417. for(i=0; i<edit->nctlpart; i++)
  418. for(j=0; j<edit->npart; j++)
  419. if(areequiv(edit->ctlpart[i], edit->part[j])) {
  420. unchange(edit, edit->ctlpart[i]);
  421. break;
  422. }
  423. waserr = 0;
  424. /*
  425. * delete all the changed partitions except data (we'll add them back if necessary)
  426. */
  427. for(i=0; i<edit->nctlpart; i++) {
  428. p = edit->ctlpart[i];
  429. if(p->changed)
  430. if(fprint(ctlfd, "delpart %s\n", p->ctlname)<0) {
  431. fprint(2, "delpart failed: %s: %r\n", p->ctlname);
  432. waserr = -1;
  433. }
  434. }
  435. /*
  436. * add all the partitions from the real list;
  437. * this is okay since adding a parition with
  438. * information identical to what is there is a no-op.
  439. */
  440. offset = edit->disk->offset;
  441. for(i=0; i<edit->npart; i++) {
  442. p = edit->part[i];
  443. if(p->ctlname[0]) {
  444. if(fprint(ctlfd, "part %s %lld %lld\n", p->ctlname, offset+ctlstart(p), offset+ctlend(p)) < 0) {
  445. fprint(2, "adding part failed: %s: %r\n", p->ctlname);
  446. waserr = -1;
  447. }
  448. }
  449. }
  450. return waserr;
  451. }
  452. void*
  453. emalloc(uint32_t sz)
  454. {
  455. void *v;
  456. v = malloc(sz);
  457. if(v == nil)
  458. sysfatal("malloc %lu fails", sz);
  459. memset(v, 0, sz);
  460. return v;
  461. }
  462. char*
  463. estrdup(char *s)
  464. {
  465. s = strdup(s);
  466. if(s == nil)
  467. sysfatal("strdup (%.10s) fails", s);
  468. return s;
  469. }