join.c 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147
  1. /*
  2. * dpkg-split - splitting and joining of multipart *.deb archives
  3. * join.c - joining
  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. #include <config.h>
  21. #include <compat.h>
  22. #include <assert.h>
  23. #include <limits.h>
  24. #include <string.h>
  25. #include <unistd.h>
  26. #include <stdlib.h>
  27. #include <stdio.h>
  28. #include <dpkg/i18n.h>
  29. #include <dpkg/dpkg.h>
  30. #include <dpkg/dpkg-db.h>
  31. #include <dpkg/myopt.h>
  32. #include "dpkg-split.h"
  33. void reassemble(struct partinfo **partlist, const char *outputfile) {
  34. FILE *output, *input;
  35. void *buffer;
  36. struct partinfo *pi;
  37. unsigned int i;
  38. size_t nr,buffersize;
  39. printf(_("Putting package %s together from %d parts: "),
  40. partlist[0]->package,partlist[0]->maxpartn);
  41. buffersize= partlist[0]->maxpartlen;
  42. for (i=0; i<partlist[0]->maxpartn; i++)
  43. if (partlist[0]->headerlen > buffersize) buffersize= partlist[0]->headerlen;
  44. buffer= m_malloc(partlist[0]->maxpartlen);
  45. output= fopen(outputfile,"w");
  46. if (!output) ohshite(_("unable to open output file `%.250s'"),outputfile);
  47. for (i=0; i<partlist[0]->maxpartn; i++) {
  48. pi= partlist[i];
  49. input= fopen(pi->filename,"r");
  50. if (!input) ohshite(_("unable to (re)open input part file `%.250s'"),pi->filename);
  51. assert(pi->headerlen <= buffersize);
  52. nr= fread(buffer,1,pi->headerlen,input);
  53. if (nr != pi->headerlen) rerreof(input,pi->filename);
  54. assert(pi->thispartlen <= buffersize);
  55. printf("%d ",i+1);
  56. nr= fread(buffer,1,pi->thispartlen,input);
  57. if (nr != pi->thispartlen) rerreof(input,pi->filename);
  58. if (pi->thispartlen & 1)
  59. if (getc(input) == EOF) rerreof(input,pi->filename);
  60. if (ferror(input)) rerr(pi->filename);
  61. fclose(input);
  62. nr= fwrite(buffer,1,pi->thispartlen,output);
  63. if (nr != pi->thispartlen) werr(outputfile);
  64. }
  65. if (fflush(output))
  66. ohshite(_("unable to flush file '%s'"), outputfile);
  67. if (fsync(fileno(output)))
  68. ohshite(_("unable to sync file '%s'"), outputfile);
  69. if (fclose(output)) werr(outputfile);
  70. printf(_("done\n"));
  71. }
  72. void addtopartlist(struct partinfo **partlist,
  73. struct partinfo *pi, struct partinfo *refi) {
  74. int i;
  75. if (strcmp(pi->package,refi->package) ||
  76. strcmp(pi->version,refi->version) ||
  77. strcmp(pi->md5sum,refi->md5sum) ||
  78. pi->orglength != refi->orglength ||
  79. pi->maxpartn != refi->maxpartn ||
  80. pi->maxpartlen != refi->maxpartlen) {
  81. print_info(pi);
  82. print_info(refi);
  83. ohshit(_("files `%.250s' and `%.250s' are not parts of the same file"),
  84. pi->filename,refi->filename);
  85. }
  86. i= pi->thispartn-1;
  87. if (partlist[i])
  88. ohshit(_("there are several versions of part %d - at least `%.250s' and `%.250s'"),
  89. pi->thispartn, pi->filename, partlist[i]->filename);
  90. partlist[i]= pi;
  91. }
  92. void do_join(const char *const *argv) {
  93. char *p;
  94. const char *thisarg;
  95. struct partqueue *pq;
  96. struct partinfo *refi, *pi, **partlist;
  97. unsigned int i;
  98. assert(!queue);
  99. if (!*argv)
  100. badusage(_("--%s requires one or more part file arguments"),
  101. cipaction->olong);
  102. while ((thisarg= *argv++)) {
  103. pq= nfmalloc(sizeof(struct partqueue));
  104. mustgetpartinfo(thisarg,&pq->info);
  105. pq->nextinqueue= queue;
  106. queue= pq;
  107. }
  108. refi= NULL;
  109. for (pq= queue; pq; pq= pq->nextinqueue)
  110. if (!refi || pq->info.thispartn < refi->thispartn) refi= &pq->info;
  111. assert(refi);
  112. partlist= nfmalloc(sizeof(struct partinfo*)*refi->maxpartn);
  113. for (i = 0; i < refi->maxpartn; i++)
  114. partlist[i] = NULL;
  115. for (pq= queue; pq; pq= pq->nextinqueue) {
  116. pi= &pq->info;
  117. addtopartlist(partlist,pi,refi);
  118. }
  119. for (i=0; i<refi->maxpartn; i++) {
  120. if (!partlist[i]) ohshit(_("part %d is missing"),i+1);
  121. }
  122. if (!outputfile) {
  123. p= nfmalloc(strlen(refi->package)+1+strlen(refi->version)+sizeof(DEBEXT));
  124. strcpy(p,refi->package);
  125. strcat(p,"-");
  126. strcat(p,refi->version);
  127. strcat(p,DEBEXT);
  128. outputfile= p;
  129. }
  130. reassemble(partlist,outputfile);
  131. }