nss/makedb.c

   1 /* Create simple DB database from textual input.
   2    Copyright (C) 1996-2013 Free Software Foundation, Inc.
   3    This file is part of the GNU C Library.
   4    Contributed by Ulrich Drepper <drepper@cygnus.com>, 1996.
   5
   6    The GNU C Library is free software; you can redistribute it and/or
   7    modify it under the terms of the GNU Lesser General Public
   8    License as published by the Free Software Foundation; either
   9    version 2.1 of the License, or (at your option) any later version.
  10
  11    The GNU C Library is distributed in the hope that it will be useful,
  12    but WITHOUT ANY WARRANTY; without even the implied warranty of
  13    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  14    Lesser General Public License for more details.
  15
  16    You should have received a copy of the GNU Lesser General Public
  17    License along with the GNU C Library; if not, see
  18    <http://www.gnu.org/licenses/>.  */
  19
  20 #include <argp.h>
  21 #include <assert.h>
  22 #include <ctype.h>
  23 #include <errno.h>
  24 #include <error.h>
  25 #include <fcntl.h>
  26 #include <inttypes.h>
  27 #include <libintl.h>
  28 #include <locale.h>
  29 #include <search.h>
  30 #include <stdbool.h>
  31 #include <stdio.h>
  32 #include <stdlib.h>
  33 #include <string.h>
  34 #include <unistd.h>
  35 #include <sys/mman.h>
  36 #include <sys/param.h>
  37 #include <sys/stat.h>
  38 #include <sys/uio.h>
  39 #include "nss_db/nss_db.h"
  40
  41 /* Get libc version number.  */
  42 #include "../version.h"
  43
  44 /* The hashing function we use.  */
  45 #include "../intl/hash-string.h"
  46
  47 /* SELinux support.  */
  48 #ifdef HAVE_SELINUX
  49 # include <selinux/selinux.h>
  50 #endif
  51
  52 #ifndef MAP_POPULATE
  53 # define MAP_POPULATE 0
  54 #endif
  55
  56 #define PACKAGE _libc_intl_domainname
  57
  58 /* List of data bases.  */
  59 struct database
  60 {
  61   char dbid;
  62   bool extra_string;
  63   struct database *next;
  64   void *entries;
  65   size_t nentries;
  66   size_t nhashentries;
  67   stridx_t *hashtable;
  68   size_t keystrlen;
  69   stridx_t *keyidxtab;
  70   char *keystrtab;
  71 } *databases;
  72 static size_t ndatabases;
  73 static size_t nhashentries_total;
  74 static size_t valstrlen;
  75 static void *valstrtree;
  76 static char *valstrtab;
  77 static size_t extrastrlen;
  78
  79 /* Database entry.  */
  80 struct dbentry
  81 {
  82   stridx_t validx;
  83   uint32_t hashval;
  84   char str[0];
  85 };
  86
  87 /* Stored string entry.  */
  88 struct valstrentry
  89 {
  90   stridx_t idx;
  91   bool extra_string;
  92   char str[0];
  93 };
  94
  95
  96 /* True if any entry has been added.  */
  97 static bool any_dbentry;
  98
  99 /* If non-zero convert key to lower case.  */
 100 static int to_lowercase;
 101
 102 /* If non-zero print content of input file, one entry per line.  */
 103 static int do_undo;
 104
 105 /* If non-zero do not print informational messages.  */
 106 static int be_quiet;
 107
 108 /* Name of output file.  */
 109 static const char *output_name;
 110
 111 /* Name and version of program.  */
 112 static void print_version (FILE *stream, struct argp_state *state);
 113 void (*argp_program_version_hook) (FILE *, struct argp_state *) = print_version;
 114
 115 /* Definitions of arguments for argp functions.  */
 116 static const struct argp_option options[] =
 117 {
 118   { "fold-case", 'f', NULL, 0, N_("Convert key to lower case") },
 119   { "output", 'o', N_("NAME"), 0, N_("Write output to file NAME") },
 120   { "quiet", 'q', NULL, 0,
 121     N_("Do not print messages while building database") },
 122   { "undo", 'u', NULL, 0,
 123     N_("Print content of database file, one entry a line") },
 124   { "generated", 'g', N_("CHAR"), 0,
 125     N_("Generated line not part of iteration") },
 126   { NULL, 0, NULL, 0, NULL }
 127 };
 128
 129 /* Short description of program.  */
 130 static const char doc[] = N_("Create simple database from textual input.");
 131
 132 /* Strings for arguments in help texts.  */
 133 static const char args_doc[] = N_("\
 134 INPUT-FILE OUTPUT-FILE\n-o OUTPUT-FILE INPUT-FILE\n-u INPUT-FILE");
 135
 136 /* Prototype for option handler.  */
 137 static error_t parse_opt (int key, char *arg, struct argp_state *state);
 138
 139 /* Function to print some extra text in the help message.  */
 140 static char *more_help (int key, const char *text, void *input);
 141
 142 /* Data structure to communicate with argp functions.  */
 143 static struct argp argp =
 144 {
 145   options, parse_opt, args_doc, doc, NULL, more_help
 146 };
 147
 148
 149 /* List of databases which are not part of the iteration table.  */
 150 static struct db_option
 151 {
 152   char dbid;
 153   struct db_option *next;
 154 } *db_options;
 155
 156
 157 /* Prototypes for local functions.  */
 158 static int process_input (FILE *input, const char *inname,
 159                           int to_lowercase, int be_quiet);
 160 static int print_database (int fd);
 161 static void compute_tables (void);
 162 static int write_output (int fd);
 163
 164 /* SELinux support.  */
 165 #ifdef HAVE_SELINUX
 166 /* Set the SELinux file creation context for the given file. */
 167 static void set_file_creation_context (const char *outname, mode_t mode);
 168 static void reset_file_creation_context (void);
 169 #else
 170 # define set_file_creation_context(_outname,_mode)
 171 # define reset_file_creation_context()
 172 #endif
 173
 174
 175 /* External functions.  */
 176 extern void *xmalloc (size_t n)
 177   __attribute_malloc__ __attribute_alloc_size (1);
 178 extern void *xcalloc (size_t n, size_t s)
 179   __attribute_malloc__ __attribute_alloc_size (1, 2);
 180
 181
 182 int
 183 main (int argc, char *argv[])
 184 {
 185   const char *input_name;
 186   FILE *input_file;
 187   int remaining;
 188   int mode = 0644;
 189
 190   /* Set locale via LC_ALL.  */
 191   setlocale (LC_ALL, "");
 192
 193   /* Set the text message domain.  */
 194   textdomain (_libc_intl_domainname);
 195
 196   /* Initialize local variables.  */
 197   input_name = NULL;
 198
 199   /* Parse and process arguments.  */
 200   argp_parse (&argp, argc, argv, 0, &remaining, NULL);
 201
 202   /* Determine file names.  */
 203   if (do_undo || output_name != NULL)
 204     {
 205       if (remaining + 1 != argc)
 206         {
 207         wrong_arguments:
 208           error (0, 0, gettext ("wrong number of arguments"));
 209           argp_help (&argp, stdout, ARGP_HELP_SEE,
 210                      program_invocation_short_name);
 211           exit (1);
 212         }
 213       input_name = argv[remaining];
 214     }
 215   else
 216     {
 217       if (remaining + 2 != argc)
 218         goto wrong_arguments;
 219
 220       input_name = argv[remaining++];
 221       output_name = argv[remaining];
 222     }
 223
 224   /* Special handling if we are asked to print the database.  */
 225   if (do_undo)
 226     {
 227       int fd = open (input_name, O_RDONLY);
 228       if (fd == -1)
 229         error (EXIT_FAILURE, errno, gettext ("cannot open database file `%s'"),
 230                input_name);
 231
 232       int status = print_database (fd);
 233
 234       close (fd);
 235
 236       return status;
 237     }
 238
 239   /* Open input file.  */
 240   if (strcmp (input_name, "-") == 0 || strcmp (input_name, "/dev/stdin") == 0)
 241     input_file = stdin;
 242   else
 243     {
 244       struct stat64 st;
 245
 246       input_file = fopen64 (input_name, "r");
 247       if (input_file == NULL)
 248         error (EXIT_FAILURE, errno, gettext ("cannot open input file `%s'"),
 249                input_name);
 250
 251       /* Get the access rights from the source file.  The output file should
 252          have the same.  */
 253       if (fstat64 (fileno (input_file), &st) >= 0)
 254         mode = st.st_mode & ACCESSPERMS;
 255     }
 256
 257   /* Start the real work.  */
 258   int status = process_input (input_file, input_name, to_lowercase, be_quiet);
 259
 260   /* Close files.  */
 261   if (input_file != stdin)
 262     fclose (input_file);
 263
 264   /* No need to continue when we did not read the file successfully.  */
 265   if (status != EXIT_SUCCESS)
 266     return status;
 267
 268   /* Bail out if nothing is to be done.  */
 269   if (!any_dbentry)
 270     {
 271       if (be_quiet)
 272         return EXIT_SUCCESS;
 273       else
 274         error (EXIT_SUCCESS, 0, gettext ("no entries to be processed"));
 275     }
 276
 277   /* Compute hash and string tables.  */
 278   compute_tables ();
 279
 280   /* Open output file.  This must not be standard output so we don't
 281      handle "-" and "/dev/stdout" special.  */
 282   char *tmp_output_name;
 283   if (asprintf (&tmp_output_name, "%s.XXXXXX", output_name) == -1)
 284     error (EXIT_FAILURE, errno, gettext ("cannot create temporary file name"));
 285
 286   set_file_creation_context (output_name, mode);
 287   int fd = mkstemp (tmp_output_name);
 288   reset_file_creation_context ();
 289   if (fd == -1)
 290     error (EXIT_FAILURE, errno, gettext ("cannot create temporary file"));
 291
 292   status = write_output (fd);
 293
 294   if (status == EXIT_SUCCESS)
 295     {
 296       struct stat64 st;
 297
 298       if (fstat64 (fd, &st) == 0)
 299         {
 300           if ((st.st_mode & ACCESSPERMS) != mode)
 301             /* We ignore problems with changing the mode.  */
 302             fchmod (fd, mode);
 303         }
 304       else
 305         {
 306           error (0, errno, gettext ("cannot stat newly created file"));
 307           status = EXIT_FAILURE;
 308         }
 309     }
 310
 311   close (fd);
 312
 313   if (status == EXIT_SUCCESS)
 314     {
 315       if (rename (tmp_output_name, output_name) != 0)
 316         {
 317           error (0, errno, gettext ("cannot rename temporary file"));
 318           status = EXIT_FAILURE;
 319           goto do_unlink;
 320         }
 321     }
 322   else
 323   do_unlink:
 324     unlink (tmp_output_name);
 325
 326   return status;
 327 }
 328
 329
 330 /* Handle program arguments.  */
 331 static error_t
 332 parse_opt (int key, char *arg, struct argp_state *state)
 333 {
 334   struct db_option *newp;
 335
 336   switch (key)
 337     {
 338     case 'f':
 339       to_lowercase = 1;
 340       break;
 341     case 'o':
 342       output_name = arg;
 343       break;
 344     case 'q':
 345       be_quiet = 1;
 346       break;
 347     case 'u':
 348       do_undo = 1;
 349       break;
 350     case 'g':
 351       newp = xmalloc (sizeof (*newp));
 352       newp->dbid = arg[0];
 353       newp->next = db_options;
 354       db_options = newp;
 355       break;
 356     default:
 357       return ARGP_ERR_UNKNOWN;
 358     }
 359   return 0;
 360 }
 361
 362
 363 static char *
 364 more_help (int key, const char *text, void *input)
 365 {
 366   char *tp = NULL;
 367   switch (key)
 368     {
 369     case ARGP_KEY_HELP_EXTRA:
 370       /* We print some extra information.  */
 371       if (asprintf (&tp, gettext ("\
 372 For bug reporting instructions, please see:\n\
 373 %s.\n"), REPORT_BUGS_TO) < 0)
 374         return NULL;
 375       return tp;
 376     default:
 377       break;
 378     }
 379   return (char *) text;
 380 }
 381
 382 /* Print the version information.  */
 383 static void
 384 print_version (FILE *stream, struct argp_state *state)
 385 {
 386   fprintf (stream, "makedb %s%s\n", PKGVERSION, VERSION);
 387   fprintf (stream, gettext ("\
 388 Copyright (C) %s Free Software Foundation, Inc.\n\
 389 This is free software; see the source for copying conditions.  There is NO\n\
 390 warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.\n\
 391 "), "2013");
 392   fprintf (stream, gettext ("Written by %s.\n"), "Ulrich Drepper");
 393 }
 394
 395
 396 static int
 397 dbentry_compare (const void *p1, const void *p2)
 398 {
 399   const struct dbentry *d1 = (const struct dbentry *) p1;
 400   const struct dbentry *d2 = (const struct dbentry *) p2;
 401
 402   if (d1->hashval != d2->hashval)
 403     return d1->hashval < d2->hashval ? -1 : 1;
 404
 405   return strcmp (d1->str, d2->str);
 406 }
 407
 408
 409 static int
 410 valstr_compare (const void *p1, const void *p2)
 411 {
 412   const struct valstrentry *d1 = (const struct valstrentry *) p1;
 413   const struct valstrentry *d2 = (const struct valstrentry *) p2;
 414
 415   return strcmp (d1->str, d2->str);
 416 }
 417
 418
 419 static int
 420 process_input (input, inname, to_lowercase, be_quiet)
 421      FILE *input;
 422      const char *inname;
 423      int to_lowercase;
 424      int be_quiet;
 425 {
 426   char *line;
 427   size_t linelen;
 428   int status;
 429   size_t linenr;
 430
 431   line = NULL;
 432   linelen = 0;
 433   status = EXIT_SUCCESS;
 434   linenr = 0;
 435
 436   struct database *last_database = NULL;
 437
 438   while (!feof_unlocked (input))
 439     {
 440       ssize_t n = getline (&line, &linelen, input);
 441       if (n < 0)
 442         /* This means end of file or some bug.  */
 443         break;
 444       if (n == 0)
 445         /* Short read.  Probably interrupted system call. */
 446         continue;
 447
 448       ++linenr;
 449
 450       if (line[n - 1] == '\n')
 451         /* Remove trailing newline.  */
 452         line[--n] = '\0';
 453
 454       char *cp = line;
 455       while (isspace (*cp))
 456         ++cp;
 457
 458       if (*cp == '#' || *cp == '\0')
 459         /* First non-space character in line '#': it's a comment.
 460            Also go to the next line if it is empty except for whitespaces. */
 461         continue;
 462
 463       /* Skip over the character indicating the database so that it is not
 464          affected by TO_LOWERCASE.  */
 465       char *key = cp++;
 466       while (*cp != '\0' && !isspace (*cp))
 467         {
 468           if (to_lowercase)
 469             *cp = tolower (*cp);
 470           ++cp;
 471         }
 472
 473       if (*cp == '\0')
 474         /* It's a line without a value field.  */
 475         continue;
 476
 477       *cp++ = '\0';
 478       size_t keylen = cp - key;
 479
 480       while (isspace (*cp))
 481         ++cp;
 482
 483       char *data = cp;
 484       size_t datalen = (&line[n] - cp) + 1;
 485
 486       /* Find the database.  */
 487       if (last_database == NULL || last_database->dbid != key[0])
 488         {
 489           last_database = databases;
 490           while (last_database != NULL && last_database->dbid != key[0])
 491             last_database = last_database->next;
 492
 493           if (last_database == NULL)
 494             {
 495               last_database = xmalloc (sizeof (*last_database));
 496               last_database->dbid = key[0];
 497               last_database->extra_string = false;
 498               last_database->next = databases;
 499               last_database->entries = NULL;
 500               last_database->nentries = 0;
 501               last_database->keystrlen = 0;
 502               databases = last_database;
 503
 504               struct db_option *runp = db_options;
 505               while (runp != NULL)
 506                 if (runp->dbid == key[0])
 507                   {
 508                     last_database->extra_string = true;
 509                     break;
 510                   }
 511                 else
 512                   runp = runp->next;
 513             }
 514         }
 515
 516       /* Skip the database selector.  */
 517       ++key;
 518       --keylen;
 519
 520       /* Store the data.  */
 521       struct valstrentry *nentry = xmalloc (sizeof (struct valstrentry)
 522                                             + datalen);
 523       if (last_database->extra_string)
 524         nentry->idx = extrastrlen;
 525       else
 526         nentry->idx = valstrlen;
 527       nentry->extra_string = last_database->extra_string;
 528       memcpy (nentry->str, data, datalen);
 529
 530       struct valstrentry **fdata = tsearch (nentry, &valstrtree,
 531                                             valstr_compare);
 532       if (fdata == NULL)
 533         error (EXIT_FAILURE, errno, gettext ("cannot create search tree"));
 534
 535       if (*fdata != nentry)
 536         {
 537           /* We can reuse a string.  */
 538           free (nentry);
 539           nentry = *fdata;
 540         }
 541       else
 542         if (last_database->extra_string)
 543           extrastrlen += datalen;
 544         else
 545           valstrlen += datalen;
 546
 547       /* Store the key.  */
 548       struct dbentry *newp = xmalloc (sizeof (struct dbentry) + keylen);
 549       newp->validx = nentry->idx;
 550       newp->hashval = __hash_string (key);
 551       memcpy (newp->str, key, keylen);
 552
 553       struct dbentry **found = tsearch (newp, &last_database->entries,
 554                                         dbentry_compare);
 555       if (found == NULL)
 556         error (EXIT_FAILURE, errno, gettext ("cannot create search tree"));
 557
 558       if (*found != newp)
 559         {
 560           free (newp);
 561           if (!be_quiet)
 562             error_at_line (0, 0, inname, linenr, gettext ("duplicate key"));
 563           continue;
 564         }
 565
 566       ++last_database->nentries;
 567       last_database->keystrlen += keylen;
 568
 569       any_dbentry = true;
 570     }
 571
 572   if (ferror_unlocked (input))
 573     {
 574       error (0, 0, gettext ("problems while reading `%s'"), inname);
 575       status = EXIT_FAILURE;
 576     }
 577
 578   return status;
 579 }
 580
 581
 582 static void
 583 copy_valstr (const void *nodep, const VISIT which, const int depth)
 584 {
 585   if (which != leaf && which != postorder)
 586     return;
 587
 588   const struct valstrentry *p = *(const struct valstrentry **) nodep;
 589
 590   strcpy (valstrtab + (p->extra_string ? valstrlen : 0) + p->idx, p->str);
 591 }
 592
 593
 594 /* Determine if the candidate is prime by using a modified trial division
 595    algorithm. The candidate must be both odd and greater than 4.  */
 596 static int
 597 is_prime (size_t candidate)
 598 {
 599   size_t divn = 3;
 600   size_t sq = divn * divn;
 601
 602   assert (candidate > 4 && candidate % 2 != 0);
 603
 604   while (sq < candidate && candidate % divn != 0)
 605     {
 606       ++divn;
 607       sq += 4 * divn;
 608       ++divn;
 609     }
 610
 611   return candidate % divn != 0;
 612 }
 613
 614
 615 static size_t
 616 next_prime (size_t seed)
 617 {
 618   /* Make sure that we're always greater than 4.  */
 619   seed = (seed + 4) | 1;
 620
 621   while (!is_prime (seed))
 622     seed += 2;
 623
 624   return seed;
 625 }
 626
 627
 628 static void
 629 compute_tables (void)
 630 {
 631   valstrtab = xmalloc (roundup (valstrlen + extrastrlen, sizeof (stridx_t)));
 632   while ((valstrlen + extrastrlen) % sizeof (stridx_t) != 0)
 633     valstrtab[valstrlen++] = '\0';
 634   twalk (valstrtree, copy_valstr);
 635
 636   static struct database *db;
 637   for (db = databases; db != NULL; db = db->next)
 638     if (db->nentries != 0)
 639       {
 640         ++ndatabases;
 641
 642         /* We simply use an odd number large than twice the number of
 643            elements to store in the hash table for the size.  This gives
 644            enough efficiency.  */
 645 #define TEST_RANGE 30
 646         size_t nhashentries_min = next_prime (db->nentries < TEST_RANGE
 647                                               ? db->nentries
 648                                               : db->nentries * 2 - TEST_RANGE);
 649         size_t nhashentries_max = MAX (nhashentries_min, db->nentries * 4);
 650         size_t nhashentries_best = nhashentries_min;
 651         size_t chainlength_best = db->nentries;
 652
 653         db->hashtable = xmalloc (2 * nhashentries_max * sizeof (stridx_t)
 654                                  + db->keystrlen);
 655         db->keyidxtab = db->hashtable + nhashentries_max;
 656         db->keystrtab = (char *) (db->keyidxtab + nhashentries_max);
 657
 658         static size_t max_chainlength;
 659         static char *wp;
 660         static size_t nhashentries;
 661         static bool copy_string;
 662
 663         void add_key(const void *nodep, const VISIT which, const int depth)
 664         {
 665           if (which != leaf && which != postorder)
 666             return;
 667
 668           const struct dbentry *dbe = *(const struct dbentry **) nodep;
 669
 670           ptrdiff_t stridx;
 671           if (copy_string)
 672             {
 673               stridx = wp - db->keystrtab;
 674               wp = stpcpy (wp, dbe->str) + 1;
 675             }
 676           else
 677             stridx = 0;
 678
 679           size_t hidx = dbe->hashval % nhashentries;
 680           size_t hval2 = 1 + dbe->hashval % (nhashentries - 2);
 681           size_t chainlength = 0;
 682
 683           while (db->hashtable[hidx] != ~((stridx_t) 0))
 684             {
 685               ++chainlength;
 686               if ((hidx += hval2) >= nhashentries)
 687                 hidx -= nhashentries;
 688             }
 689
 690           db->hashtable[hidx] = ((db->extra_string ? valstrlen : 0)
 691                                  + dbe->validx);
 692           db->keyidxtab[hidx] = stridx;
 693
 694           max_chainlength = MAX (max_chainlength, chainlength);
 695         }
 696
 697         copy_string = false;
 698         nhashentries = nhashentries_min;
 699         for (size_t cnt = 0; cnt < TEST_RANGE; ++cnt)
 700           {
 701             memset (db->hashtable, '\xff', nhashentries * sizeof (stridx_t));
 702
 703             max_chainlength = 0;
 704             wp = db->keystrtab;
 705
 706             twalk (db->entries, add_key);
 707
 708             if (max_chainlength == 0)
 709               {
 710                 /* No need to look further, this is as good as it gets.  */
 711                 nhashentries_best = nhashentries;
 712                 break;
 713               }
 714
 715             if (max_chainlength < chainlength_best)
 716               {
 717                 chainlength_best = max_chainlength;
 718                 nhashentries_best = nhashentries;
 719               }
 720
 721             nhashentries = next_prime (nhashentries + 1);
 722             if (nhashentries > nhashentries_max)
 723               break;
 724           }
 725
 726         /* Recompute the best table again, this time fill in the strings.  */
 727         nhashentries = nhashentries_best;
 728         memset (db->hashtable, '\xff',
 729                 2 * nhashentries_max * sizeof (stridx_t));
 730         copy_string = true;
 731         wp = db->keystrtab;
 732
 733         twalk (db->entries, add_key);
 734
 735         db->nhashentries = nhashentries_best;
 736         nhashentries_total += nhashentries_best;
 737     }
 738 }
 739
 740
 741 static int
 742 write_output (int fd)
 743 {
 744   struct nss_db_header *header;
 745   uint64_t file_offset = (sizeof (struct nss_db_header)
 746                           + (ndatabases * sizeof (header->dbs[0])));
 747   header = alloca (file_offset);
 748
 749   header->magic = NSS_DB_MAGIC;
 750   header->ndbs = ndatabases;
 751   header->valstroffset = file_offset;
 752   header->valstrlen = valstrlen;
 753
 754   size_t filled_dbs = 0;
 755   struct iovec iov[2 + ndatabases * 3];
 756   iov[0].iov_base = header;
 757   iov[0].iov_len = file_offset;
 758
 759   iov[1].iov_base = valstrtab;
 760   iov[1].iov_len = valstrlen + extrastrlen;
 761   file_offset += iov[1].iov_len;
 762
 763   size_t keydataoffset = file_offset + nhashentries_total * sizeof (stridx_t);
 764   for (struct database *db = databases; db != NULL; db = db->next)
 765     if (db->entries != NULL)
 766       {
 767         assert (file_offset % sizeof (stridx_t) == 0);
 768         assert (filled_dbs < ndatabases);
 769
 770         header->dbs[filled_dbs].id = db->dbid;
 771         memset (header->dbs[filled_dbs].pad, '\0',
 772                 sizeof (header->dbs[0].pad));
 773         header->dbs[filled_dbs].hashsize = db->nhashentries;
 774
 775         iov[2 + filled_dbs].iov_base = db->hashtable;
 776         iov[2 + filled_dbs].iov_len = db->nhashentries * sizeof (stridx_t);
 777         header->dbs[filled_dbs].hashoffset = file_offset;
 778         file_offset += iov[2 + filled_dbs].iov_len;
 779
 780         iov[2 + ndatabases + filled_dbs * 2].iov_base = db->keyidxtab;
 781         iov[2 + ndatabases + filled_dbs * 2].iov_len
 782           = db->nhashentries * sizeof (stridx_t);
 783         header->dbs[filled_dbs].keyidxoffset = keydataoffset;
 784         keydataoffset += iov[2 + ndatabases + filled_dbs * 2].iov_len;
 785
 786         iov[3 + ndatabases + filled_dbs * 2].iov_base = db->keystrtab;
 787         iov[3 + ndatabases + filled_dbs * 2].iov_len = db->keystrlen;
 788         header->dbs[filled_dbs].keystroffset = keydataoffset;
 789         keydataoffset += iov[3 + ndatabases + filled_dbs * 2].iov_len;
 790
 791         ++filled_dbs;
 792       }
 793
 794   assert (filled_dbs == ndatabases);
 795   assert (file_offset == (iov[0].iov_len + iov[1].iov_len
 796                           + nhashentries_total * sizeof (stridx_t)));
 797   header->allocate = file_offset;
 798
 799   if (writev (fd, iov, 2 + ndatabases * 3) != keydataoffset)
 800     {
 801       error (0, errno, gettext ("failed to write new database file"));
 802       return EXIT_FAILURE;
 803     }
 804
 805   return EXIT_SUCCESS;
 806 }
 807
 808
 809 static int
 810 print_database (int fd)
 811 {
 812   struct stat64 st;
 813   if (fstat64 (fd, &st) != 0)
 814     error (EXIT_FAILURE, errno, gettext ("cannot stat database file"));
 815
 816   const struct nss_db_header *header = mmap (NULL, st.st_size, PROT_READ,
 817                                              MAP_PRIVATE|MAP_POPULATE, fd, 0);
 818   if (header == MAP_FAILED)
 819     error (EXIT_FAILURE, errno, gettext ("cannot map database file"));
 820
 821   if (header->magic != NSS_DB_MAGIC)
 822     error (EXIT_FAILURE, 0, gettext ("file not a database file"));
 823
 824   const char *valstrtab = (const char *) header + header->valstroffset;
 825
 826   for (unsigned int dbidx = 0; dbidx < header->ndbs; ++dbidx)
 827     {
 828       const stridx_t *stridxtab
 829         = ((const stridx_t *) ((const char *) header
 830                                + header->dbs[dbidx].keyidxoffset));
 831       const char *keystrtab
 832         = (const char *) header + header->dbs[dbidx].keystroffset;
 833       const stridx_t *hashtab
 834         = (const stridx_t *) ((const char *) header
 835                               + header->dbs[dbidx].hashoffset);
 836
 837       for (uint32_t hidx = 0; hidx < header->dbs[dbidx].hashsize; ++hidx)
 838         if (hashtab[hidx] != ~((stridx_t) 0))
 839           printf ("%c%s %s\n",
 840                   header->dbs[dbidx].id,
 841                   keystrtab + stridxtab[hidx],
 842                   valstrtab + hashtab[hidx]);
 843     }
 844
 845   return EXIT_SUCCESS;
 846 }
 847
 848
 849 #ifdef HAVE_SELINUX
 850 static void
 851 set_file_creation_context (const char *outname, mode_t mode)
 852 {
 853   static int enabled;
 854   static int enforcing;
 855   security_context_t ctx;
 856
 857   /* Check if SELinux is enabled, and remember. */
 858   if (enabled == 0)
 859     enabled = is_selinux_enabled () ? 1 : -1;
 860   if (enabled < 0)
 861     return;
 862
 863   /* Check if SELinux is enforcing, and remember. */
 864   if (enforcing == 0)
 865     enforcing = security_getenforce () ? 1 : -1;
 866
 867   /* Determine the context which the file should have. */
 868   ctx = NULL;
 869   if (matchpathcon (outname, S_IFREG | mode, &ctx) == 0 && ctx != NULL)
 870     {
 871       if (setfscreatecon (ctx) != 0)
 872         error (enforcing > 0 ? EXIT_FAILURE : 0, 0,
 873                gettext ("cannot set file creation context for `%s'"),
 874                outname);
 875
 876       freecon (ctx);
 877     }
 878 }
 879
 880 static void
 881 reset_file_creation_context (void)
 882 {
 883   setfscreatecon (NULL);
 884 }
 885 #endif