queue.c 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308
  1. /*
  2. * dpkg-split - splitting and joining of multipart *.deb archives
  3. * queue.c - queue management
  4. *
  5. * Copyright © 1995 Ian Jackson <ian@chiark.greenend.org.uk>
  6. *
  7. * This is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * This is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  19. */
  20. /*
  21. * Queue, in /var/lib/dpkg/parts, is a plain directory with one
  22. * file per part.
  23. *
  24. * parts are named
  25. * <md5sum>.<maxpartlen>.<thispartn>.<maxpartn>
  26. * all numbers in hex
  27. */
  28. #include <config.h>
  29. #include <compat.h>
  30. #include <sys/stat.h>
  31. #include <assert.h>
  32. #include <limits.h>
  33. #include <string.h>
  34. #include <fcntl.h>
  35. #include <dirent.h>
  36. #include <unistd.h>
  37. #include <stdlib.h>
  38. #include <stdio.h>
  39. #include <dpkg/i18n.h>
  40. #include <dpkg/dpkg.h>
  41. #include <dpkg/dpkg-db.h>
  42. #include <dpkg/dir.h>
  43. #include <dpkg/myopt.h>
  44. #include "dpkg-split.h"
  45. static bool
  46. decompose_filename(const char *filename, struct partqueue *pq)
  47. {
  48. const char *p;
  49. char *q;
  50. if (strspn(filename, "0123456789abcdef") != MD5HASHLEN ||
  51. filename[MD5HASHLEN] != '.')
  52. return false;
  53. q = nfmalloc(MD5HASHLEN + 1);
  54. memcpy(q, filename, MD5HASHLEN);
  55. q[MD5HASHLEN] = '\0';
  56. pq->info.md5sum= q;
  57. p = filename + MD5HASHLEN + 1;
  58. pq->info.maxpartlen = strtol(p, &q, 16);
  59. if (q == p || *q++ != '.')
  60. return false;
  61. p = q;
  62. pq->info.thispartn = (int)strtol(p, &q, 16);
  63. if (q == p || *q++ != '.')
  64. return false;
  65. p = q;
  66. pq->info.maxpartn = (int)strtol(p, &q, 16);
  67. if (q == p || *q)
  68. return false;
  69. return true;
  70. }
  71. void scandepot(void) {
  72. DIR *depot;
  73. struct dirent *de;
  74. struct partqueue *pq;
  75. char *p;
  76. assert(!queue);
  77. depot = opendir(opt_depotdir);
  78. if (!depot)
  79. ohshite(_("unable to read depot directory `%.250s'"), opt_depotdir);
  80. while ((de= readdir(depot))) {
  81. if (de->d_name[0] == '.') continue;
  82. pq= nfmalloc(sizeof(struct partqueue));
  83. pq->info.fmtversion= pq->info.package= pq->info.version= NULL;
  84. pq->info.orglength= pq->info.thispartoffset= pq->info.thispartlen= 0;
  85. pq->info.headerlen= 0;
  86. p = nfmalloc(strlen(opt_depotdir) + strlen(de->d_name) + 1);
  87. strcpy(p, opt_depotdir);
  88. strcat(p,de->d_name);
  89. pq->info.filename= p;
  90. if (!decompose_filename(de->d_name,pq)) {
  91. pq->info.md5sum= NULL;
  92. pq->info.maxpartlen= pq->info.thispartn= pq->info.maxpartn= 0;
  93. }
  94. pq->nextinqueue= queue;
  95. queue= pq;
  96. }
  97. closedir(depot);
  98. }
  99. static bool
  100. partmatches(struct partinfo *pi, struct partinfo *refi)
  101. {
  102. return (pi->md5sum &&
  103. !strcmp(pi->md5sum,refi->md5sum) &&
  104. pi->maxpartn == refi->maxpartn &&
  105. pi->maxpartlen == refi->maxpartlen);
  106. }
  107. void do_auto(const char *const *argv) {
  108. const char *partfile;
  109. struct partinfo *pi, *refi, *npi, **partlist, *otherthispart;
  110. struct partqueue *pq;
  111. unsigned int i;
  112. int j, ap;
  113. long nr;
  114. FILE *part;
  115. void *buffer;
  116. char *p, *q;
  117. if (!opt_outputfile)
  118. badusage(_("--auto requires the use of the --output option"));
  119. if (!(partfile= *argv++) || *argv)
  120. badusage(_("--auto requires exactly one part file argument"));
  121. refi= nfmalloc(sizeof(struct partqueue));
  122. part= fopen(partfile,"r");
  123. if (!part) ohshite(_("unable to read part file `%.250s'"),partfile);
  124. if (!read_info(part,partfile,refi)) {
  125. if (!opt_npquiet)
  126. printf(_("File `%.250s' is not part of a multipart archive.\n"),partfile);
  127. m_output(stdout, _("<standard output>"));
  128. exit(1);
  129. }
  130. fclose(part);
  131. scandepot();
  132. partlist= nfmalloc(sizeof(struct partinfo*)*refi->maxpartn);
  133. for (i = 0; i < refi->maxpartn; i++)
  134. partlist[i] = NULL;
  135. for (pq= queue; pq; pq= pq->nextinqueue) {
  136. pi= &pq->info;
  137. if (!partmatches(pi,refi)) continue;
  138. npi= nfmalloc(sizeof(struct partinfo));
  139. mustgetpartinfo(pi->filename,npi);
  140. addtopartlist(partlist,npi,refi);
  141. }
  142. /* If we already have a copy of this version we ignore it and prefer the
  143. * new one, but we still want to delete the one in the depot, so we
  144. * save its partinfo (with the filename) for later. This also prevents
  145. * us from accidentally deleting the source file.
  146. */
  147. otherthispart= partlist[refi->thispartn-1];
  148. partlist[refi->thispartn-1]= refi;
  149. for (j=refi->maxpartn-1; j>=0 && partlist[j]; j--);
  150. if (j>=0) {
  151. part= fopen(partfile,"r");
  152. if (!part) ohshite(_("unable to reopen part file `%.250s'"),partfile);
  153. buffer= nfmalloc(refi->filesize);
  154. nr= fread(buffer,1,refi->filesize,part);
  155. if (nr != refi->filesize) rerreof(part,partfile);
  156. if (getc(part) != EOF) ohshit(_("part file `%.250s' has trailing garbage"),partfile);
  157. if (ferror(part)) rerr(partfile);
  158. fclose(part);
  159. p = nfmalloc(strlen(opt_depotdir) + 50);
  160. q = nfmalloc(strlen(opt_depotdir) + 200);
  161. sprintf(p, "%st.%lx", opt_depotdir, (long)getpid());
  162. sprintf(q, "%s%s.%lx.%x.%x", opt_depotdir, refi->md5sum,
  163. refi->maxpartlen,refi->thispartn,refi->maxpartn);
  164. part= fopen(p,"w");
  165. if (!part) ohshite(_("unable to open new depot file `%.250s'"),p);
  166. nr= fwrite(buffer,1,refi->filesize,part);
  167. if (nr != refi->filesize) werr(p);
  168. if (fflush(part))
  169. ohshite(_("unable to flush file '%s'"), p);
  170. if (fsync(fileno(part)))
  171. ohshite(_("unable to sync file '%s'"), p);
  172. if (fclose(part)) werr(p);
  173. if (rename(p,q)) ohshite(_("unable to rename new depot file `%.250s' to `%.250s'"),p,q);
  174. printf(_("Part %d of package %s filed (still want "),refi->thispartn,refi->package);
  175. /* There are still some parts missing. */
  176. for (i=0, ap=0; i<refi->maxpartn; i++)
  177. if (!partlist[i])
  178. printf("%s%d", !ap++ ? "" : i == (unsigned int)j ? _(" and ") : ", ", i + 1);
  179. printf(").\n");
  180. dir_sync_path(opt_depotdir);
  181. } else {
  182. /* We have all the parts. */
  183. reassemble(partlist, opt_outputfile);
  184. /* OK, delete all the parts (except the new one, which we never copied). */
  185. partlist[refi->thispartn-1]= otherthispart;
  186. for (i=0; i<refi->maxpartn; i++)
  187. if (partlist[i])
  188. if (unlink(partlist[i]->filename))
  189. ohshite(_("unable to delete used-up depot file `%.250s'"),partlist[i]->filename);
  190. }
  191. m_output(stderr, _("<standard error>"));
  192. }
  193. void do_queue(const char *const *argv) {
  194. struct partqueue *pq, *qq;
  195. struct partinfo ti;
  196. const char *head;
  197. struct stat stab;
  198. unsigned long bytes;
  199. unsigned int i;
  200. if (*argv)
  201. badusage(_("--%s takes no arguments"), cipaction->olong);
  202. scandepot();
  203. head= N_("Junk files left around in the depot directory:\n");
  204. for (pq= queue; pq; pq= pq->nextinqueue) {
  205. if (pq->info.md5sum) continue;
  206. fputs(gettext(head),stdout); head= "";
  207. if (lstat(pq->info.filename,&stab))
  208. ohshit(_("unable to stat `%.250s'"),pq->info.filename);
  209. if (S_ISREG(stab.st_mode)) {
  210. bytes= stab.st_size;
  211. printf(_(" %s (%lu bytes)\n"),pq->info.filename,bytes);
  212. } else {
  213. printf(_(" %s (not a plain file)\n"),pq->info.filename);
  214. }
  215. }
  216. if (!*head) putchar('\n');
  217. head= N_("Packages not yet reassembled:\n");
  218. for (pq= queue; pq; pq= pq->nextinqueue) {
  219. if (!pq->info.md5sum) continue;
  220. mustgetpartinfo(pq->info.filename,&ti);
  221. fputs(gettext(head),stdout); head= "";
  222. printf(_(" Package %s: part(s) "), ti.package);
  223. bytes= 0;
  224. for (i=0; i<ti.maxpartn; i++) {
  225. for (qq= pq;
  226. qq && !(partmatches(&qq->info,&ti) && qq->info.thispartn == i+1);
  227. qq= qq->nextinqueue);
  228. if (qq) {
  229. printf("%d ",i+1);
  230. if (lstat(qq->info.filename,&stab))
  231. ohshite(_("unable to stat `%.250s'"),qq->info.filename);
  232. if (!S_ISREG(stab.st_mode))
  233. ohshit(_("part file `%.250s' is not a plain file"),qq->info.filename);
  234. bytes+= stab.st_size;
  235. qq->info.md5sum= NULL; /* don't find this package again */
  236. }
  237. }
  238. printf(_("(total %lu bytes)\n"),bytes);
  239. }
  240. m_output(stdout, _("<standard output>"));
  241. }
  242. enum discardwhich { ds_junk, ds_package, ds_all };
  243. static void discardsome(enum discardwhich which, const char *package) {
  244. struct partqueue *pq;
  245. for (pq= queue; pq; pq= pq->nextinqueue) {
  246. switch (which) {
  247. case ds_junk:
  248. if (pq->info.md5sum) continue;
  249. break;
  250. case ds_package:
  251. if (!pq->info.md5sum || strcasecmp(pq->info.package,package)) continue;
  252. break;
  253. case ds_all:
  254. break;
  255. default:
  256. internerr("unknown discardwhich '%d'", which);
  257. }
  258. if (unlink(pq->info.filename))
  259. ohshite(_("unable to discard `%.250s'"),pq->info.filename);
  260. printf(_("Deleted %s.\n"),pq->info.filename);
  261. }
  262. }
  263. void do_discard(const char *const *argv) {
  264. const char *thisarg;
  265. struct partqueue *pq;
  266. scandepot();
  267. if (*argv) {
  268. for (pq= queue; pq; pq= pq->nextinqueue)
  269. if (pq->info.md5sum)
  270. mustgetpartinfo(pq->info.filename,&pq->info);
  271. discardsome(ds_junk,NULL);
  272. while ((thisarg= *argv++)) discardsome(ds_package,thisarg);
  273. } else {
  274. discardsome(ds_all,NULL);
  275. }
  276. }