filesdb.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685
  1. /*
  2. * dpkg - main program for package management
  3. * filesdb.c - management of database of files installed on system
  4. *
  5. * Copyright © 1995 Ian Jackson <ian@chiark.greenend.org.uk>
  6. * Copyright © 2000,2001 Wichert Akkerman <wakkerma@debian.org>
  7. *
  8. * This is free software; you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License as published by
  10. * the Free Software Foundation; either version 2 of the License, or
  11. * (at your option) any later version.
  12. *
  13. * This is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License
  19. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  20. */
  21. #include <config.h>
  22. #include <compat.h>
  23. #ifdef HAVE_LINUX_FIEMAP_H
  24. #include <linux/fiemap.h>
  25. #include <linux/fs.h>
  26. #include <sys/ioctl.h>
  27. #endif
  28. #include <sys/types.h>
  29. #include <sys/stat.h>
  30. #include <assert.h>
  31. #include <errno.h>
  32. #include <string.h>
  33. #include <pwd.h>
  34. #include <grp.h>
  35. #include <fcntl.h>
  36. #include <unistd.h>
  37. #include <stdlib.h>
  38. #include <dpkg/i18n.h>
  39. #include <dpkg/dpkg.h>
  40. #include <dpkg/dpkg-db.h>
  41. #include <dpkg/path.h>
  42. #include <dpkg/dir.h>
  43. #include <dpkg/fdio.h>
  44. #include <dpkg/pkg-array.h>
  45. #include <dpkg/progress.h>
  46. #include "filesdb.h"
  47. #include "main.h"
  48. /*** Package control information database directory routines. ***/
  49. /*
  50. * XXX: Strictly speaking these functions do not exactly belong here, and
  51. * they should be eventually moved back to a unified on-disk database
  52. * handling module in libdpkg. For now this is good enough, as it avoids
  53. * pulling unneeded code into the resulting binaries, because all its
  54. * users require filesdb anyway.
  55. */
  56. static char *infodir;
  57. static void
  58. pkgadmindir_init(void)
  59. {
  60. infodir = dpkg_db_get_path(INFODIR);
  61. }
  62. const char *
  63. pkgadmindir(void)
  64. {
  65. return infodir;
  66. }
  67. const char *
  68. pkgadminfile(struct pkginfo *pkg, const char *filetype)
  69. {
  70. static struct varbuf vb;
  71. varbuf_reset(&vb);
  72. varbuf_add_str(&vb, infodir);
  73. varbuf_add_char(&vb, '/');
  74. varbuf_add_str(&vb, pkg->name);
  75. varbuf_add_char(&vb, '.');
  76. varbuf_add_str(&vb, filetype);
  77. varbuf_end_str(&vb);
  78. return vb.buf;
  79. }
  80. /*** filepackages support for tracking packages owning a file. ***/
  81. #define PERFILEPACKAGESLUMP 10
  82. struct filepackages {
  83. struct filepackages *more;
  84. /* pkgs is a NULL-pointer-terminated list; anything after the first NULL
  85. * is garbage. */
  86. struct pkginfo *pkgs[PERFILEPACKAGESLUMP];
  87. };
  88. struct filepackages_iterator {
  89. struct filepackages *pkg_lump;
  90. int pkg_idx;
  91. };
  92. struct filepackages_iterator *
  93. filepackages_iter_new(struct filenamenode *fnn)
  94. {
  95. struct filepackages_iterator *iter;
  96. iter = m_malloc(sizeof(*iter));
  97. iter->pkg_lump = fnn->packages;
  98. iter->pkg_idx = 0;
  99. return iter;
  100. }
  101. struct pkginfo *
  102. filepackages_iter_next(struct filepackages_iterator *iter)
  103. {
  104. struct pkginfo *pkg;
  105. while (iter->pkg_lump) {
  106. pkg = iter->pkg_lump->pkgs[iter->pkg_idx];
  107. if (iter->pkg_idx < PERFILEPACKAGESLUMP && pkg) {
  108. iter->pkg_idx++;
  109. return pkg;
  110. } else {
  111. iter->pkg_lump = iter->pkg_lump->more;
  112. iter->pkg_idx = 0;
  113. }
  114. }
  115. return NULL;
  116. }
  117. void
  118. filepackages_iter_free(struct filepackages_iterator *iter)
  119. {
  120. free(iter);
  121. }
  122. /*** Generic data structures and routines. ***/
  123. static bool allpackagesdone = false;
  124. static int nfiles= 0;
  125. void
  126. ensure_package_clientdata(struct pkginfo *pkg)
  127. {
  128. if (pkg->clientdata)
  129. return;
  130. pkg->clientdata = nfmalloc(sizeof(struct perpackagestate));
  131. pkg->clientdata->istobe = itb_normal;
  132. pkg->clientdata->color = white;
  133. pkg->clientdata->fileslistvalid = false;
  134. pkg->clientdata->files = NULL;
  135. pkg->clientdata->listfile_phys_offs = 0;
  136. pkg->clientdata->trigprocdeferred = NULL;
  137. }
  138. void note_must_reread_files_inpackage(struct pkginfo *pkg) {
  139. allpackagesdone = false;
  140. ensure_package_clientdata(pkg);
  141. pkg->clientdata->fileslistvalid = false;
  142. }
  143. static int saidread=0;
  144. /**
  145. * Erase the files saved in pkg.
  146. */
  147. static void
  148. pkg_files_blank(struct pkginfo *pkg)
  149. {
  150. struct fileinlist *current;
  151. struct filepackages *packageslump;
  152. int search, findlast;
  153. /* Anything to empty? */
  154. if (!pkg->clientdata)
  155. return;
  156. for (current= pkg->clientdata->files;
  157. current;
  158. current= current->next) {
  159. /* For each file that used to be in the package,
  160. * go through looking for this package's entry in the list
  161. * of packages containing this file, and blank it out. */
  162. for (packageslump= current->namenode->packages;
  163. packageslump;
  164. packageslump= packageslump->more)
  165. for (search= 0;
  166. search < PERFILEPACKAGESLUMP && packageslump->pkgs[search];
  167. search++)
  168. if (packageslump->pkgs[search] == pkg) {
  169. /* Hah! Found it. */
  170. for (findlast= search+1;
  171. findlast < PERFILEPACKAGESLUMP && packageslump->pkgs[findlast];
  172. findlast++);
  173. findlast--;
  174. /* findlast is now the last occupied entry, which may be the same as
  175. * search. We blank out the entry for this package. We also
  176. * have to copy the last entry into the empty slot, because
  177. * the list is NULL-pointer-terminated. */
  178. packageslump->pkgs[search]= packageslump->pkgs[findlast];
  179. packageslump->pkgs[findlast] = NULL;
  180. /* This may result in an empty link in the list. This is OK. */
  181. goto xit_search_to_delete_from_perfilenodelist;
  182. }
  183. xit_search_to_delete_from_perfilenodelist:
  184. ;
  185. /* The actual filelist links were allocated using nfmalloc, so
  186. * we shouldn't free them. */
  187. }
  188. pkg->clientdata->files = NULL;
  189. }
  190. static struct fileinlist **
  191. pkg_files_add_file(struct pkginfo *pkg, const char *filename,
  192. enum fnnflags flags, struct fileinlist **file_tail)
  193. {
  194. struct fileinlist *newent;
  195. struct filepackages *packageslump;
  196. int putat = 0;
  197. ensure_package_clientdata(pkg);
  198. if (file_tail == NULL)
  199. file_tail = &pkg->clientdata->files;
  200. /* Make sure we're at the end. */
  201. while ((*file_tail) != NULL) {
  202. file_tail = &((*file_tail)->next);
  203. }
  204. /* Create a new node. */
  205. newent = nfmalloc(sizeof(struct fileinlist));
  206. newent->namenode = findnamenode(filename, flags);
  207. newent->next = NULL;
  208. *file_tail = newent;
  209. file_tail = &newent->next;
  210. /* Add pkg to newent's package list. */
  211. packageslump = newent->namenode->packages;
  212. putat = 0;
  213. if (packageslump) {
  214. while (putat < PERFILEPACKAGESLUMP && packageslump->pkgs[putat])
  215. putat++;
  216. if (putat >= PERFILEPACKAGESLUMP)
  217. packageslump = NULL;
  218. }
  219. if (!packageslump) {
  220. packageslump = nfmalloc(sizeof(struct filepackages));
  221. packageslump->more = newent->namenode->packages;
  222. newent->namenode->packages = packageslump;
  223. putat = 0;
  224. }
  225. packageslump->pkgs[putat]= pkg;
  226. if (++putat < PERFILEPACKAGESLUMP)
  227. packageslump->pkgs[putat] = NULL;
  228. /* Return the position for the next guy. */
  229. return file_tail;
  230. }
  231. /**
  232. * Load the list of files in this package into memory, or update the
  233. * list if it is there but stale.
  234. */
  235. void
  236. ensure_packagefiles_available(struct pkginfo *pkg)
  237. {
  238. static int fd;
  239. const char *filelistfile;
  240. struct fileinlist **lendp;
  241. struct stat stat_buf;
  242. char *loaded_list, *loaded_list_end, *thisline, *nextline, *ptr;
  243. if (pkg->clientdata && pkg->clientdata->fileslistvalid)
  244. return;
  245. ensure_package_clientdata(pkg);
  246. /* Throw away any stale data, if there was any. */
  247. pkg_files_blank(pkg);
  248. /* Packages which aren't installed don't have a files list. */
  249. if (pkg->status == stat_notinstalled) {
  250. pkg->clientdata->fileslistvalid = true;
  251. return;
  252. }
  253. filelistfile= pkgadminfile(pkg,LISTFILE);
  254. onerr_abort++;
  255. fd= open(filelistfile,O_RDONLY);
  256. if (fd==-1) {
  257. if (errno != ENOENT)
  258. ohshite(_("unable to open files list file for package `%.250s'"),pkg->name);
  259. onerr_abort--;
  260. if (pkg->status != stat_configfiles) {
  261. if (saidread == 1) putc('\n',stderr);
  262. warning(_("files list file for package `%.250s' missing, assuming "
  263. "package has no files currently installed."), pkg->name);
  264. }
  265. pkg->clientdata->files = NULL;
  266. pkg->clientdata->fileslistvalid = true;
  267. return;
  268. }
  269. push_cleanup(cu_closefd, ehflag_bombout, NULL, 0, 1, &fd);
  270. if(fstat(fd, &stat_buf))
  271. ohshite(_("unable to stat files list file for package '%.250s'"),
  272. pkg->name);
  273. if (stat_buf.st_size) {
  274. loaded_list = nfmalloc(stat_buf.st_size);
  275. loaded_list_end = loaded_list + stat_buf.st_size;
  276. if (fd_read(fd, loaded_list, stat_buf.st_size) < 0)
  277. ohshite(_("reading files list for package '%.250s'"), pkg->name);
  278. lendp= &pkg->clientdata->files;
  279. thisline = loaded_list;
  280. while (thisline < loaded_list_end) {
  281. if (!(ptr = memchr(thisline, '\n', loaded_list_end - thisline)))
  282. ohshit(_("files list file for package '%.250s' is missing final newline"),
  283. pkg->name);
  284. /* Where to start next time around. */
  285. nextline = ptr + 1;
  286. /* Strip trailing ‘/’. */
  287. if (ptr > thisline && ptr[-1] == '/') ptr--;
  288. /* Add the file to the list. */
  289. if (ptr == thisline)
  290. ohshit(_("files list file for package `%.250s' contains empty filename"),pkg->name);
  291. *ptr = '\0';
  292. lendp = pkg_files_add_file(pkg, thisline, fnn_nocopy, lendp);
  293. thisline = nextline;
  294. }
  295. }
  296. pop_cleanup(ehflag_normaltidy); /* fd = open() */
  297. if (close(fd))
  298. ohshite(_("error closing files list file for package `%.250s'"),pkg->name);
  299. onerr_abort--;
  300. pkg->clientdata->fileslistvalid = true;
  301. }
  302. #if defined(HAVE_LINUX_FIEMAP_H)
  303. static int
  304. pkg_sorter_by_listfile_phys_offs(const void *a, const void *b)
  305. {
  306. const struct pkginfo *pa = *(const struct pkginfo **)a;
  307. const struct pkginfo *pb = *(const struct pkginfo **)b;
  308. /* We can't simply subtract, because the difference may be greater than
  309. * INT_MAX. */
  310. if (pa->clientdata->listfile_phys_offs < pb->clientdata->listfile_phys_offs)
  311. return -1;
  312. else
  313. return 1;
  314. }
  315. static void
  316. pkg_files_optimize_load(struct pkg_array *array)
  317. {
  318. int i;
  319. int blocksize = 0;
  320. /* Sort packages by the physical location of their list files, so that
  321. * scanning them later will minimize disk drive head movements. */
  322. for (i = 0; i < array->n_pkgs; i++) {
  323. struct pkginfo *pkg = array->pkgs[i];
  324. struct {
  325. struct fiemap fiemap;
  326. struct fiemap_extent extent;
  327. } fm;
  328. const char *listfile;
  329. int fd;
  330. ensure_package_clientdata(pkg);
  331. if (pkg->status == stat_notinstalled ||
  332. pkg->clientdata->listfile_phys_offs != 0)
  333. continue;
  334. pkg->clientdata->listfile_phys_offs = -1;
  335. listfile = pkgadminfile(pkg, LISTFILE);
  336. fd = open(listfile, O_RDONLY);
  337. if (fd < 0)
  338. continue;
  339. if (!blocksize && ioctl(fd, FIGETBSZ, &blocksize) < 0)
  340. break;
  341. memset(&fm, 0, sizeof(fm));
  342. fm.fiemap.fm_start = 0;
  343. fm.fiemap.fm_length = blocksize;
  344. fm.fiemap.fm_flags = 0;
  345. fm.fiemap.fm_extent_count = 1;
  346. if (ioctl(fd, FS_IOC_FIEMAP, (unsigned long)&fm) == 0)
  347. pkg->clientdata->listfile_phys_offs = fm.fiemap.fm_extents[0].fe_physical;
  348. close(fd);
  349. }
  350. pkg_array_sort(array, pkg_sorter_by_listfile_phys_offs);
  351. }
  352. #elif defined(HAVE_POSIX_FADVISE)
  353. static void
  354. pkg_files_optimize_load(struct pkg_array *array)
  355. {
  356. int i;
  357. /* Ask the kernel to start preloading the list files, so as to get a
  358. * boost when later we actually load them. */
  359. for (i = 0; i < array->n_pkgs; i++) {
  360. struct pkginfo *pkg = array->pkgs[i];
  361. const char *listfile;
  362. int fd;
  363. listfile = pkgadminfile(pkg, LISTFILE);
  364. fd = open(listfile, O_RDONLY | O_NONBLOCK);
  365. if (fd != -1) {
  366. posix_fadvise(fd, 0, 0, POSIX_FADV_WILLNEED);
  367. close(fd);
  368. }
  369. }
  370. }
  371. #else
  372. static void
  373. pkg_files_optimize_load(struct pkg_array *array)
  374. {
  375. }
  376. #endif
  377. void ensure_allinstfiles_available(void) {
  378. struct pkg_array array;
  379. struct pkginfo *pkg;
  380. struct progress progress;
  381. int i;
  382. if (allpackagesdone) return;
  383. if (saidread<2) {
  384. int max = pkg_db_count();
  385. saidread=1;
  386. progress_init(&progress, _("(Reading database ... "), max);
  387. }
  388. pkg_array_init_from_db(&array);
  389. pkg_files_optimize_load(&array);
  390. for (i = 0; i < array.n_pkgs; i++) {
  391. pkg = array.pkgs[i];
  392. ensure_packagefiles_available(pkg);
  393. if (saidread == 1)
  394. progress_step(&progress);
  395. }
  396. pkg_array_destroy(&array);
  397. allpackagesdone = true;
  398. if (saidread==1) {
  399. progress_done(&progress);
  400. printf(P_("%d file or directory currently installed.)\n",
  401. "%d files and directories currently installed.)\n", nfiles),
  402. nfiles);
  403. saidread=2;
  404. }
  405. }
  406. void ensure_allinstfiles_available_quiet(void) {
  407. saidread=2;
  408. ensure_allinstfiles_available();
  409. }
  410. /*
  411. * If mask is nonzero, will not write any file whose filenamenode
  412. * has any flag bits set in mask.
  413. */
  414. void
  415. write_filelist_except(struct pkginfo *pkg, struct fileinlist *list,
  416. enum fnnflags mask)
  417. {
  418. static struct varbuf newvb;
  419. const char *listfile;
  420. FILE *file;
  421. listfile = pkgadminfile(pkg, LISTFILE);
  422. varbuf_reset(&newvb);
  423. varbuf_add_str(&newvb, listfile);
  424. varbuf_add_str(&newvb, NEWDBEXT);
  425. varbuf_end_str(&newvb);
  426. file= fopen(newvb.buf,"w+");
  427. if (!file)
  428. ohshite(_("unable to create updated files list file for package %s"),pkg->name);
  429. push_cleanup(cu_closestream, ehflag_bombout, NULL, 0, 1, (void *)file);
  430. while (list) {
  431. if (!(mask && (list->namenode->flags & mask))) {
  432. fputs(list->namenode->name,file);
  433. putc('\n',file);
  434. }
  435. list= list->next;
  436. }
  437. if (ferror(file))
  438. ohshite(_("failed to write to updated files list file for package %s"),pkg->name);
  439. if (fflush(file))
  440. ohshite(_("failed to flush updated files list file for package %s"),pkg->name);
  441. if (fsync(fileno(file)))
  442. ohshite(_("failed to sync updated files list file for package %s"),pkg->name);
  443. pop_cleanup(ehflag_normaltidy); /* file = fopen() */
  444. if (fclose(file))
  445. ohshite(_("failed to close updated files list file for package %s"),pkg->name);
  446. if (rename(newvb.buf, listfile))
  447. ohshite(_("failed to install updated files list file for package %s"),pkg->name);
  448. dir_sync_path(pkgadmindir());
  449. note_must_reread_files_inpackage(pkg);
  450. }
  451. /*
  452. * Initializes an iterator that appears to go through the file
  453. * list ‘files’ in reverse order, returning the namenode from
  454. * each. What actually happens is that we walk the list here,
  455. * building up a reverse list, and then peel it apart one
  456. * entry at a time.
  457. */
  458. void reversefilelist_init(struct reversefilelistiter *iterptr,
  459. struct fileinlist *files) {
  460. struct fileinlist *newent;
  461. iterptr->todo = NULL;
  462. while (files) {
  463. newent= m_malloc(sizeof(struct fileinlist));
  464. newent->namenode= files->namenode;
  465. newent->next= iterptr->todo;
  466. iterptr->todo= newent;
  467. files= files->next;
  468. }
  469. }
  470. struct filenamenode *reversefilelist_next(struct reversefilelistiter *iterptr) {
  471. struct filenamenode *ret;
  472. struct fileinlist *todo;
  473. todo= iterptr->todo;
  474. if (!todo)
  475. return NULL;
  476. ret= todo->namenode;
  477. iterptr->todo= todo->next;
  478. free(todo);
  479. return ret;
  480. }
  481. /*
  482. * Clients must call this function to clean up the reversefilelistiter
  483. * if they wish to break out of the iteration before it is all done.
  484. * Calling this function is not necessary if reversefilelist_next has
  485. * been called until it returned 0.
  486. */
  487. void reversefilelist_abort(struct reversefilelistiter *iterptr) {
  488. while (reversefilelist_next(iterptr));
  489. }
  490. struct fileiterator {
  491. struct filenamenode *namenode;
  492. int nbinn;
  493. };
  494. /* This must always be a power of two. If you change it consider changing
  495. * the per-character hashing factor (currently 1785 = 137 * 13) too. */
  496. #define BINS (1 << 17)
  497. static struct filenamenode *bins[BINS];
  498. struct fileiterator *iterfilestart(void) {
  499. struct fileiterator *i;
  500. i= m_malloc(sizeof(struct fileiterator));
  501. i->namenode = NULL;
  502. i->nbinn= 0;
  503. return i;
  504. }
  505. struct filenamenode *iterfilenext(struct fileiterator *i) {
  506. struct filenamenode *r= NULL;
  507. while (!i->namenode) {
  508. if (i->nbinn >= BINS)
  509. return NULL;
  510. i->namenode= bins[i->nbinn++];
  511. }
  512. r= i->namenode;
  513. i->namenode= r->next;
  514. return r;
  515. }
  516. void iterfileend(struct fileiterator *i) {
  517. free(i);
  518. }
  519. void filesdbinit(void) {
  520. struct filenamenode *fnn;
  521. int i;
  522. pkgadmindir_init();
  523. for (i=0; i<BINS; i++)
  524. for (fnn= bins[i]; fnn; fnn= fnn->next) {
  525. fnn->flags= 0;
  526. fnn->oldhash = NULL;
  527. fnn->filestat = NULL;
  528. }
  529. }
  530. static int hash(const char *name) {
  531. int v= 0;
  532. while (*name) { v *= 1787; v += *name; name++; }
  533. return v;
  534. }
  535. struct filenamenode *findnamenode(const char *name, enum fnnflags flags) {
  536. struct filenamenode **pointerp, *newnode;
  537. const char *orig_name = name;
  538. /* We skip initial slashes and ‘./’ pairs, and add our own single
  539. * leading slash. */
  540. name = path_skip_slash_dotslash(name);
  541. pointerp= bins + (hash(name) & (BINS-1));
  542. while (*pointerp) {
  543. /* XXX: Why is the assert needed? It's checking already added entries. */
  544. assert((*pointerp)->name[0] == '/');
  545. if (!strcmp((*pointerp)->name+1,name)) break;
  546. pointerp= &(*pointerp)->next;
  547. }
  548. if (*pointerp) return *pointerp;
  549. if (flags & fnn_nonew)
  550. return NULL;
  551. newnode= nfmalloc(sizeof(struct filenamenode));
  552. newnode->packages = NULL;
  553. if((flags & fnn_nocopy) && name > orig_name && name[-1] == '/')
  554. newnode->name = name - 1;
  555. else {
  556. char *newname= nfmalloc(strlen(name)+2);
  557. newname[0]= '/'; strcpy(newname+1,name);
  558. newnode->name= newname;
  559. }
  560. newnode->flags= 0;
  561. newnode->next = NULL;
  562. newnode->divert = NULL;
  563. newnode->statoverride = NULL;
  564. newnode->filestat = NULL;
  565. newnode->trig_interested = NULL;
  566. *pointerp= newnode;
  567. nfiles++;
  568. return newnode;
  569. }
  570. /* vi: ts=8 sw=2
  571. */