queue.c 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287
  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
  9. * published by the Free Software Foundation; either version 2,
  10. * or (at your option) any later version.
  11. *
  12. * This is distributed in the hope that it will be useful, but
  13. * 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/myopt.h>
  43. #include "dpkg-split.h"
  44. static int decompose_filename(const char *filename, struct partqueue *pq) {
  45. const char *p;
  46. char *q;
  47. if (strspn(filename, "0123456789abcdef") != MD5HASHLEN ||
  48. filename[MD5HASHLEN] != '.')
  49. return 0;
  50. q = nfmalloc(MD5HASHLEN + 1);
  51. memcpy(q, filename, MD5HASHLEN);
  52. q[MD5HASHLEN] = '\0';
  53. pq->info.md5sum= q;
  54. p = filename + MD5HASHLEN + 1;
  55. pq->info.maxpartlen= strtol(p,&q,16); if (q==p || *q++ != '.') return 0;
  56. p=q; pq->info.thispartn= (int)strtol(p,&q,16); if (q==p || *q++ != '.') return 0;
  57. p=q; pq->info.maxpartn= (int)strtol(p,&q,16); if (q==p || *q) return 0;
  58. return 1;
  59. }
  60. void scandepot(void) {
  61. DIR *depot;
  62. struct dirent *de;
  63. struct partqueue *pq;
  64. char *p;
  65. assert(!queue);
  66. depot= opendir(depotdir);
  67. if (!depot) ohshite(_("unable to read depot directory `%.250s'"),depotdir);
  68. while ((de= readdir(depot))) {
  69. if (de->d_name[0] == '.') continue;
  70. pq= nfmalloc(sizeof(struct partqueue));
  71. pq->info.fmtversion= pq->info.package= pq->info.version= NULL;
  72. pq->info.orglength= pq->info.thispartoffset= pq->info.thispartlen= 0;
  73. pq->info.headerlen= 0;
  74. p= nfmalloc(strlen(depotdir)+strlen(de->d_name)+1);
  75. strcpy(p,depotdir);
  76. strcat(p,de->d_name);
  77. pq->info.filename= p;
  78. if (!decompose_filename(de->d_name,pq)) {
  79. pq->info.md5sum= NULL;
  80. pq->info.maxpartlen= pq->info.thispartn= pq->info.maxpartn= 0;
  81. }
  82. pq->nextinqueue= queue;
  83. queue= pq;
  84. }
  85. }
  86. static int partmatches(struct partinfo *pi, struct partinfo *refi) {
  87. return (pi->md5sum &&
  88. !strcmp(pi->md5sum,refi->md5sum) &&
  89. pi->maxpartn == refi->maxpartn &&
  90. pi->maxpartlen == refi->maxpartlen);
  91. }
  92. void do_auto(const char *const *argv) {
  93. const char *partfile;
  94. struct partinfo *pi, *refi, *npi, **partlist, *otherthispart;
  95. struct partqueue *pq;
  96. unsigned int i;
  97. int j, ap;
  98. long nr;
  99. FILE *part;
  100. void *buffer;
  101. char *p, *q;
  102. if (!outputfile) badusage(_("--auto requires the use of the --output option"));
  103. if (!(partfile= *argv++) || *argv)
  104. badusage(_("--auto requires exactly one part file argument"));
  105. refi= nfmalloc(sizeof(struct partqueue));
  106. part= fopen(partfile,"r");
  107. if (!part) ohshite(_("unable to read part file `%.250s'"),partfile);
  108. if (!read_info(part,partfile,refi)) {
  109. if (!npquiet)
  110. printf(_("File `%.250s' is not part of a multipart archive.\n"),partfile);
  111. m_output(stdout, _("<standard output>"));
  112. exit(1);
  113. }
  114. fclose(part);
  115. scandepot();
  116. partlist= nfmalloc(sizeof(struct partinfo*)*refi->maxpartn);
  117. for (i = 0; i < refi->maxpartn; i++)
  118. partlist[i] = NULL;
  119. for (pq= queue; pq; pq= pq->nextinqueue) {
  120. pi= &pq->info;
  121. if (!partmatches(pi,refi)) continue;
  122. npi= nfmalloc(sizeof(struct partinfo));
  123. mustgetpartinfo(pi->filename,npi);
  124. addtopartlist(partlist,npi,refi);
  125. }
  126. /* If we already have a copy of this version we ignore it and prefer the
  127. * new one, but we still want to delete the one in the depot, so we
  128. * save its partinfo (with the filename) for later. This also prevents
  129. * us from accidentally deleting the source file.
  130. */
  131. otherthispart= partlist[refi->thispartn-1];
  132. partlist[refi->thispartn-1]= refi;
  133. for (j=refi->maxpartn-1; j>=0 && partlist[j]; j--);
  134. if (j>=0) {
  135. part= fopen(partfile,"r");
  136. if (!part) ohshite(_("unable to reopen part file `%.250s'"),partfile);
  137. buffer= nfmalloc(refi->filesize);
  138. nr= fread(buffer,1,refi->filesize,part);
  139. if (nr != refi->filesize) rerreof(part,partfile);
  140. if (getc(part) != EOF) ohshit(_("part file `%.250s' has trailing garbage"),partfile);
  141. if (ferror(part)) rerr(partfile);
  142. fclose(part);
  143. p= nfmalloc(strlen(depotdir)+50);
  144. q= nfmalloc(strlen(depotdir)+200);
  145. sprintf(p,"%st.%lx",depotdir,(long)getpid());
  146. sprintf(q,"%s%s.%lx.%x.%x",depotdir,refi->md5sum,
  147. refi->maxpartlen,refi->thispartn,refi->maxpartn);
  148. part= fopen(p,"w");
  149. if (!part) ohshite(_("unable to open new depot file `%.250s'"),p);
  150. nr= fwrite(buffer,1,refi->filesize,part);
  151. if (nr != refi->filesize) werr(p);
  152. if (fclose(part)) werr(p);
  153. if (rename(p,q)) ohshite(_("unable to rename new depot file `%.250s' to `%.250s'"),p,q);
  154. printf(_("Part %d of package %s filed (still want "),refi->thispartn,refi->package);
  155. /* There are still some parts missing. */
  156. for (i=0, ap=0; i<refi->maxpartn; i++)
  157. if (!partlist[i])
  158. printf("%s%d", !ap++ ? "" : i == (unsigned int)j ? _(" and ") : ", ", i + 1);
  159. printf(").\n");
  160. } else {
  161. /* We have all the parts. */
  162. reassemble(partlist,outputfile);
  163. /* OK, delete all the parts (except the new one, which we never copied). */
  164. partlist[refi->thispartn-1]= otherthispart;
  165. for (i=0; i<refi->maxpartn; i++)
  166. if (partlist[i])
  167. if (unlink(partlist[i]->filename))
  168. ohshite(_("unable to delete used-up depot file `%.250s'"),partlist[i]->filename);
  169. }
  170. m_output(stderr, _("<standard error>"));
  171. }
  172. void do_queue(const char *const *argv) {
  173. struct partqueue *pq, *qq;
  174. struct partinfo ti;
  175. const char *head;
  176. struct stat stab;
  177. unsigned long bytes;
  178. unsigned int i;
  179. if (*argv)
  180. badusage(_("--%s takes no arguments"), cipaction->olong);
  181. scandepot();
  182. head= N_("Junk files left around in the depot directory:\n");
  183. for (pq= queue; pq; pq= pq->nextinqueue) {
  184. if (pq->info.md5sum) continue;
  185. fputs(gettext(head),stdout); head= "";
  186. if (lstat(pq->info.filename,&stab))
  187. ohshit(_("unable to stat `%.250s'"),pq->info.filename);
  188. if (S_ISREG(stab.st_mode)) {
  189. bytes= stab.st_size;
  190. printf(_(" %s (%lu bytes)\n"),pq->info.filename,bytes);
  191. } else {
  192. printf(_(" %s (not a plain file)\n"),pq->info.filename);
  193. }
  194. }
  195. if (!*head) putchar('\n');
  196. head= N_("Packages not yet reassembled:\n");
  197. for (pq= queue; pq; pq= pq->nextinqueue) {
  198. if (!pq->info.md5sum) continue;
  199. mustgetpartinfo(pq->info.filename,&ti);
  200. fputs(gettext(head),stdout); head= "";
  201. printf(_(" Package %s: part(s) "), ti.package);
  202. bytes= 0;
  203. for (i=0; i<ti.maxpartn; i++) {
  204. for (qq= pq;
  205. qq && !(partmatches(&qq->info,&ti) && qq->info.thispartn == i+1);
  206. qq= qq->nextinqueue);
  207. if (qq) {
  208. printf("%d ",i+1);
  209. if (lstat(qq->info.filename,&stab))
  210. ohshite(_("unable to stat `%.250s'"),qq->info.filename);
  211. if (!S_ISREG(stab.st_mode))
  212. ohshit(_("part file `%.250s' is not a plain file"),qq->info.filename);
  213. bytes+= stab.st_size;
  214. qq->info.md5sum= NULL; /* don't find this package again */
  215. }
  216. }
  217. printf(_("(total %lu bytes)\n"),bytes);
  218. }
  219. m_output(stdout, _("<standard output>"));
  220. }
  221. enum discardwhich { ds_junk, ds_package, ds_all };
  222. static void discardsome(enum discardwhich which, const char *package) {
  223. struct partqueue *pq;
  224. for (pq= queue; pq; pq= pq->nextinqueue) {
  225. switch (which) {
  226. case ds_junk:
  227. if (pq->info.md5sum) continue;
  228. break;
  229. case ds_package:
  230. if (!pq->info.md5sum || strcasecmp(pq->info.package,package)) continue;
  231. break;
  232. case ds_all:
  233. break;
  234. default:
  235. internerr("unknown discardwhich '%d'", which);
  236. }
  237. if (unlink(pq->info.filename))
  238. ohshite(_("unable to discard `%.250s'"),pq->info.filename);
  239. printf(_("Deleted %s.\n"),pq->info.filename);
  240. }
  241. }
  242. void do_discard(const char *const *argv) {
  243. const char *thisarg;
  244. struct partqueue *pq;
  245. scandepot();
  246. if (*argv) {
  247. for (pq= queue; pq; pq= pq->nextinqueue)
  248. if (pq->info.md5sum)
  249. mustgetpartinfo(pq->info.filename,&pq->info);
  250. discardsome(ds_junk,NULL);
  251. while ((thisarg= *argv++)) discardsome(ds_package,thisarg);
  252. } else {
  253. discardsome(ds_all,NULL);
  254. }
  255. }