mdw@git.distorted.org.uk Git - tripe/blob - server/keymgmt.c

   1 /* -*-c-*-
   2  *
   3  * Key loading and storing
   4  *
   5  * (c) 2001 Straylight/Edgeware
   6  */
   7
   8 /*----- Licensing notice --------------------------------------------------*
   9  *
  10  * This file is part of Trivial IP Encryption (TrIPE).
  11  *
  12  * TrIPE is free software: you can redistribute it and/or modify it under
  13  * the terms of the GNU General Public License as published by the Free
  14  * Software Foundation; either version 3 of the License, or (at your
  15  * option) any later version.
  16  *
  17  * TrIPE is distributed in the hope that it will be useful, but WITHOUT
  18  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  19  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  20  * for more details.
  21  *
  22  * You should have received a copy of the GNU General Public License
  23  * along with TrIPE.  If not, see <https://www.gnu.org/licenses/>.
  24  */
  25
  26 /*----- Header files ------------------------------------------------------*/
  27
  28 #include "tripe.h"
  29
  30 /*----- Algswitch stuff ---------------------------------------------------*/
  31
  32 /* --- @algs_get@ --- *
  33  *
  34  * Arguments:   @algswitch *a@ = where to put the algorithms
  35  *              @dstr *e@ = where to write error tokens
  36  *              @key_file *kf@ = key file
  37  *              @key *k@ = key to inspect
  38  *
  39  * Returns:     Zero if OK; nonzero on error.
  40  *
  41  * Use:         Extracts an algorithm choice from a key.
  42  */
  43
  44 static int algs_get(algswitch *a, dstr *e, key_file *kf, key *k)
  45 {
  46   const char *p;
  47   const bulkops *bops;
  48   dstr d = DSTR_INIT, dd = DSTR_INIT;
  49   int rc = -1;
  50
  51   /* --- Hash function --- */
  52
  53   if ((p = key_getattr(kf, k, "hash")) == 0) p = "rmd160";
  54   if ((a->h = ghash_byname(p)) == 0) {
  55     a_format(e, "unknown-hash", "%s", p, A_END);
  56     goto done;
  57   }
  58
  59   /* --- Symmetric encryption for key derivation --- */
  60
  61   if ((p = key_getattr(kf, k, "mgf")) == 0) {
  62     dstr_reset(&d);
  63     dstr_putf(&d, "%s-mgf", a->h->name);
  64     p = d.buf;
  65   }
  66   if ((a->mgf = gcipher_byname(p)) == 0) {
  67     a_format(e, "unknown-mgf-cipher", "%s", p, A_END);
  68     goto done;
  69   }
  70
  71   /* --- Bulk crypto transform --- */
  72
  73   if ((p = key_getattr(kf, k, "bulk")) == 0) p = "v0";
  74   for (bops = bulktab; bops->name && strcmp(p, bops->name) != 0; bops++);
  75   if (!bops->name) {
  76     a_format(e, "unknown-bulk-transform", "%s", p, A_END);
  77     goto done;
  78   }
  79   if ((a->bulk = bops->getalgs(a, e, kf, k)) == 0) goto done;
  80   a->bulk->ops = bops;
  81
  82   /* --- All done --- */
  83
  84   rc = 0;
  85 done:
  86   dstr_destroy(&d);
  87   dstr_destroy(&dd);
  88   return (rc);
  89 }
  90
  91 /* --- @algs_check@ --- *
  92  *
  93  * Arguments:   @algswitch *a@ = a choice of algorithms
  94  *              @dstr *e@ = where to write error tokens
  95  *              @const dhgrp *grp@ = the group we're working in
  96  *
  97  * Returns:     Zero if OK; nonzero on error.
  98  *
  99  * Use:         Checks an algorithm choice for sensibleness.  This also
 100  *              derives some useful information from the choices, and you
 101  *              must call this before committing the algorithm selection
 102  *              for use by @keyset@ functions.
 103  */
 104
 105 static int algs_check(algswitch *a, dstr *e, const dhgrp *grp)
 106 {
 107   a->hashsz = a->h->hashsz;
 108
 109   if (keysz(a->hashsz, a->mgf->keysz) != a->hashsz) {
 110     a_format(e, "mgf", "%s", a->mgf->name,
 111              "restrictive-key-schedule",
 112              A_END);
 113     return (-1);
 114   }
 115
 116   if (a->bulk->ops->checkalgs(a->bulk, a, e)) return (-1);
 117
 118   return (0);
 119 }
 120
 121 /* --- @km_samealgsp@ --- *
 122  *
 123  * Arguments:   @const kdata *kdx, *kdy@ = two key data objects
 124  *
 125  * Returns:     Nonzero if their two algorithm selections are the same.
 126  *
 127  * Use:         Checks sameness of algorithm selections: used to ensure that
 128  *              peers are using sensible algorithms.
 129  */
 130
 131 int km_samealgsp(const kdata *kdx, const kdata *kdy)
 132 {
 133   const algswitch *a = &kdx->algs, *aa = &kdy->algs;
 134
 135   return (kdx->grp->ops == kdy->grp->ops &&
 136           kdx->grp->ops->samegrpp(kdx->grp, kdy->grp) &&
 137           a->mgf == aa->mgf && a->h == aa->h &&
 138           a->bulk->ops == aa->bulk->ops &&
 139           a->bulk->ops->samealgsp(a->bulk, aa->bulk));
 140 }
 141
 142 /*----- Key data and key nodes --------------------------------------------*/
 143
 144 typedef struct keyhalf {
 145   const char *kind;
 146   int (*load)(key_file *, key *, key_data *,
 147               const dhops *, kdata *, dstr *, dstr *);
 148   char *kr;
 149   key_file *kf;
 150   fwatch w;
 151   sym_table tab;
 152 } keyhalf;
 153
 154 /* --- @kh_loadpub@, @kh_loadpriv@ --- *
 155  *
 156  * Arguments:   @const dhops *dh@ = Diffie--Hellman operations for key type
 157  *              @key_file *kf@ = key file from which the key was loaded
 158  *              @key *k@ = the key object we're loading
 159  *              @key_data *d@ = the key data to load
 160  *              @kdata *kd@ = our key-data object to fill in
 161  *              @dstr *t@ = the key tag name
 162  *              @dstr *e@ = a string to write error tokens to
 163  *
 164  * Returns:     Zero on success, @-1@ on error.
 165  *
 166  * Use:         These functions handle the main difference between public and
 167  *              private key halves.  They are responsible for setting @grp@,
 168  *              @k@ and @K@ appropriately in all keys, handling the mismatch
 169  *              between the largely half-indifferent calling code and the
 170  *              group-specific loading functions.
 171  *
 172  *              The function @kh_loadpriv@ is also responsible for checking
 173  *              the group for goodness.  We don't bother checking public
 174  *              keys, because each public key we actually end up using must
 175  *              share a group with a private key which we'll already have
 176  *              checked.
 177  */
 178
 179 static int kh_loadpub(key_file *kf, key *k, key_data *d,
 180                       const dhops *dh, kdata *kd, dstr *t, dstr *e)
 181 {
 182   int rc;
 183
 184   if ((rc = dh->ldpub(kf, k, d, kd, t, e)) != 0)
 185     goto fail_0;
 186   kd->grp->ops = dh;
 187   if (kd->grp->ops->checkge(kd->grp, kd->K)) {
 188     a_format(e, "bad-public-group-element", A_END);
 189     goto fail_1;
 190   }
 191   return (0);
 192
 193 fail_1:
 194   kd->grp->ops->freege(kd->grp, kd->K);
 195   kd->grp->ops->freegrp(kd->grp);
 196 fail_0:
 197   return (-1);
 198 }
 199
 200 static int kh_loadpriv(key_file *kf, key *k, key_data *d,
 201                        const dhops *dh, kdata *kd, dstr *t, dstr *e)
 202 {
 203   int rc;
 204   const char *err;
 205   dhge *K;
 206   int ok;
 207
 208   if ((rc = dh->ldpriv(kf, k, d, kd, t, e)) != 0)
 209     goto fail_0;
 210   kd->grp->ops = dh;
 211   if ((err = kd->grp->ops->checkgrp(kd->grp)) != 0) {
 212     a_format(e, "bad-group", "%s", err, A_END);
 213     goto fail_1;
 214   }
 215   K = kd->grp->ops->mul(kd->grp, kd->k, 0);
 216   ok = kd->grp->ops->eq(kd->grp, kd->K, K);
 217   kd->grp->ops->freege(kd->grp, K);
 218   if (!ok) {
 219     a_format(e, "incorrect-public-key", A_END);
 220     goto fail_1;
 221   }
 222   return (0);
 223
 224 fail_1:
 225   kd->grp->ops->freesc(kd->grp, kd->k);
 226   kd->grp->ops->freege(kd->grp, kd->K);
 227   kd->grp->ops->freegrp(kd->grp);
 228 fail_0:
 229   return (-1);
 230 }
 231
 232 static struct keyhalf
 233   priv = { "private", kh_loadpriv },
 234   pub = { "public", kh_loadpub };
 235
 236 /* --- @keymoan@ --- *
 237  *
 238  * Arguments:   @const char *file@ = name of the file
 239  *              @int line@ = line number in file
 240  *              @const char *msg@ = error message
 241  *              @void *p@ = argument pointer (indicates which keyring)
 242  *
 243  * Returns:     ---
 244  *
 245  * Use:         Reports an error message about loading a key file.
 246  */
 247
 248 static void keymoan(const char *file, int line, const char *msg, void *p)
 249 {
 250   keyhalf *kh = p;
 251
 252   if (!line) {
 253     a_warn("KEYMGMT", "%s-keyring", kh->kind, "%s", file,
 254            "io-error", "?ERRNO", A_END);
 255   } else {
 256     a_warn("KEYMGMT", "%s-keyring", kh->kind, "%s", file, "line", "%d", line,
 257            "%s", msg, A_END);
 258   }
 259 }
 260
 261 /* --- @kh_reopen@ --- *
 262  *
 263  * Arguments:   @keyhalf *kh@ = pointer to keyhalf structure
 264  *
 265  * Returns:     Zero on success, @-1@ on error.
 266  *
 267  * Use:         Reopens the key file for the appropriate key half.  If this
 268  *              fails, everything is left as it was; if it succeeds, then the
 269  *              old file is closed (if it was non-null) and the new one put
 270  *              in its place.
 271  */
 272
 273 static int kh_reopen(keyhalf *kh)
 274 {
 275   key_file *kf = CREATE(key_file);
 276
 277   if (key_open(kf, kh->kr, KOPEN_READ, keymoan, kh)) {
 278     DESTROY(kf);
 279     return (-1);
 280   }
 281   if (kh->kf) {
 282     key_close(kh->kf);
 283     DESTROY(kh->kf);
 284   }
 285   kh->kf = kf;
 286   return (0);
 287 }
 288
 289 /* --- @kh_init@ --- *
 290  *
 291  * Arguments:   @keyhalf *kh@ = pointer to keyhalf structure to set up
 292  *              @const char *kr@ = name of the keyring file
 293  *
 294  * Returns:     ---
 295  *
 296  * Use:         Initialize a keyhalf structure, maintaining the private or
 297  *              public keys.  Intended to be called during initialization:
 298  *              exits if there's some kind of problem.
 299  */
 300
 301 static void kh_init(keyhalf *kh, const char *kr)
 302 {
 303   kh->kr = xstrdup(kr);
 304   fwatch_init(&kh->w, kr);
 305   sym_create(&kh->tab);
 306   if (kh_reopen(kh)) exit(EXIT_FAILURE);
 307 }
 308
 309 /* --- @kh_load@ --- *
 310  *
 311  * Arguments:   @keyhalf *kh@ = pointer to keyhalf
 312  *              @const char *tag@ = key tag to be loaded
 313  *              @int complainp@ = whether to complain about missing keys
 314  *
 315  * Returns:     Pointer to a @kdata@ structure if successful, or null on
 316  *              failure.
 317  *
 318  * Use:         Attempts to load a key from the current key file.  This
 319  *              function always reads data from the file: it's used when
 320  *              there's a cache miss from @kh_find@, and when refreshing the
 321  *              known keys in @kh_refresh@.  The returned kdata has a
 322  *              reference count of exactly 1, and has no home knode.
 323  */
 324
 325 static kdata *kh_load(keyhalf *kh, const char *tag, int complainp)
 326 {
 327   dstr t = DSTR_INIT;
 328   dstr e = DSTR_INIT;
 329   key *k;
 330   key_data **d;
 331   kdata *kd;
 332   const char *ty;
 333   const dhops *dh;
 334   T( const dhgrp *g; )
 335
 336   /* --- Find the key and grab its tag --- */
 337
 338   if (key_qtag(kh->kf, tag, &t, &k, &d)) {
 339     if (complainp) {
 340       a_warn("KEYMGMT", "%s-keyring", kh->kind, "%s", kh->kr,
 341              "key-not-found", "%s", tag, A_END);
 342     }
 343     goto fail_0;
 344   }
 345
 346   /* --- Find the key's group type and the appropriate operations --- *
 347    *
 348    * There are several places to look for the key type.  The most obvious is
 349    * the `kx-group' key attribute.  But there's also the key type itself, for
 350    * compatibility reasons.
 351    */
 352
 353   ty = key_getattr(kh->kf, k, "kx-group");
 354   if (!ty && strncmp(k->type, "tripe-", 6) == 0) ty = k->type + 6;
 355   if (!ty) ty = "dh";
 356
 357   for (dh = dhtab; dh->name; dh++)
 358     if (strcmp(dh->name, ty) == 0) goto founddh;
 359   a_warn("KEYMGMT", "%s-keyring", kh->kind,
 360          "%s", kh->kr, "key", "%s", t.buf,
 361          "unknown-group-type", "%s", ty, A_END);
 362   goto fail_0;
 363
 364 founddh:
 365   kd = CREATE(kdata);
 366   if (kh->load(kh->kf, k, *d, dh, kd, &t, &e)) {
 367     a_warn("KEYMGMT", "%s-keyring", kh->kind,
 368            "%s", kh->kr, "key", "%s", t.buf,
 369            "*%s", e.buf, A_END);
 370     goto fail_1;
 371   }
 372
 373   if (algs_get(&kd->algs, &e, kh->kf, k) ||
 374       algs_check(&kd->algs, &e, kd->grp)) {
 375     a_warn("KEYMGMT", "%s-keyring", kh->kind,
 376            "%s", kh->kr, "key", "%s", t.buf,
 377            "*%s", e.buf, A_END);
 378     goto fail_2;
 379   }
 380
 381   kd->tag = xstrdup(t.buf);
 382   kd->ref = 1;
 383   kd->kn = 0;
 384   kd->id = k->id;
 385   kd->t_exp = k->exp;
 386
 387   IF_TRACING(T_KEYMGMT, {
 388     trace(T_KEYMGMT, "keymgmt: loaded %s key `%s'", kh->kind, t.buf);
 389     IF_TRACING(T_CRYPTO, {
 390       g = kd->grp;
 391       g->ops->tracegrp(g);
 392       if (kd->k)
 393         trace(T_CRYPTO, "crypto: k = %s", g->ops->scstr(g, kd->k));
 394       trace(T_CRYPTO, "crypto: K = %s", g->ops->gestr(g, kd->K));
 395       kd->algs.bulk->ops->tracealgs(kd->algs.bulk);
 396     })
 397   })
 398
 399   goto done;
 400
 401 fail_2:
 402   if (kd->k) kd->grp->ops->freesc(kd->grp, kd->k);
 403   kd->grp->ops->freege(kd->grp, kd->K);
 404   kd->grp->ops->freegrp(kd->grp);
 405 fail_1:
 406   DESTROY(kd);
 407 fail_0:
 408   kd = 0;
 409 done:
 410   dstr_destroy(&t);
 411   dstr_destroy(&e);
 412   return (kd);
 413 }
 414
 415 /* --- @kh_find@ --- *
 416  *
 417  * Arguments:   @keyhalf *kh@ = pointer to the keyhalf
 418  *              @const char *tag@ = key to be obtained
 419  *              @int complainp@ = whether to complain about missing keys
 420  *
 421  * Returns:     A pointer to the kdata, or null on error.
 422  *
 423  * Use:         Obtains kdata, maybe from the cache.  This won't update a
 424  *              stale cache entry, though @kh_refresh@ ought to have done
 425  *              that already.  The returned kdata object may be shared with
 426  *              other users.  (One of this function's responsibilities, over
 427  *              @kh_load@, is to set the home knode of a freshly loaded
 428  *              kdata.)
 429  */
 430
 431 static kdata *kh_find(keyhalf *kh, const char *tag, int complainp)
 432 {
 433   knode *kn;
 434   kdata *kd;
 435   unsigned f;
 436
 437   kn = sym_find(&kh->tab, tag, -1, sizeof(knode), &f);
 438
 439   if (f) {
 440     if (kn->f & KNF_BROKEN) {
 441       T( if (complainp)
 442            trace(T_KEYMGMT, "keymgmt: key `%s' marked as broken", tag); )
 443       return (0);
 444     }
 445
 446     kd = kn->kd;
 447     if (kd) kd->ref++;
 448     T( trace(T_KEYMGMT, "keymgmt: %scache hit for key `%s'",
 449              kd ? "" : "negative ", tag); )
 450     return (kd);
 451   } else {
 452     kd = kh_load(kh, tag, complainp);
 453     kn->kd = kd;
 454     kn->kh = kh;
 455     kn->f = 0;
 456     if (!kd)
 457       kn->f |= KNF_BROKEN;
 458     else {
 459       kd->kn = kn;
 460       kd->ref++;
 461     }
 462     return (kd);
 463   }
 464 }
 465
 466 /* --- @kh_refresh@ --- *
 467  *
 468  * Arguments:   @keyhalf *kh@ = pointer to the keyhalf
 469  *
 470  * Returns:     Zero if nothing needs to be done; nonzero if peers should
 471  *              refresh their keys.
 472  *
 473  * Use:         Refreshes cached keys from files.
 474  *
 475  *              Each active knode is examined to see if a new key is
 476  *              available: the return value is nonzero if any new keys are.
 477  *              A key is considered new if its algorithms, public key, or
 478  *              expiry time are/is different.
 479  *
 480  *              Stub knodes (with no kdata attached) are removed, so that a
 481  *              later retry can succeed if the file has been fixed.  (This
 482  *              doesn't count as a change, since no peers should be relying
 483  *              on a nonexistent key.)
 484  */
 485
 486 static int kh_refresh(keyhalf *kh)
 487 {
 488   knode *kn;
 489   kdata *kd;
 490   sym_iter i;
 491   int changep = 0;
 492
 493   if (!fwatch_update(&kh->w, kh->kr) || kh_reopen(kh))
 494     return (0);
 495
 496   T( trace(T_KEYMGMT, "keymgmt: rescan %s keyring `%s'", kh->kind, kh->kr); )
 497   for (sym_mkiter(&i, &kh->tab); (kn = sym_next(&i)) != 0; ) {
 498     if (!kn->kd) {
 499       T( trace(T_KEYMGMT, "keymgmt: discard stub entry for key `%s'",
 500                SYM_NAME(kn)); )
 501       sym_remove(&kh->tab, kn);
 502       continue;
 503     }
 504     if ((kd = kh_load(kh, SYM_NAME(kn), 1)) == 0) {
 505       if (!(kn->f & KNF_BROKEN)) {
 506         T( trace(T_KEYMGMT, "keymgmt: failed to load new key `%s': "
 507                  "marking it as broken",
 508                  SYM_NAME(kn)); )
 509         kn->f |= KNF_BROKEN;
 510       }
 511       continue;
 512     }
 513     kn->f &= ~KNF_BROKEN;
 514     if (kd->t_exp == kn->kd->t_exp &&
 515         km_samealgsp(kd, kn->kd) &&
 516         kd->grp->ops->eq(kd->grp, kd->K, kn->kd->K)) {
 517       T( trace(T_KEYMGMT, "keymgmt: key `%s' unchanged", SYM_NAME(kn)); )
 518       continue;
 519     }
 520     T( trace(T_KEYMGMT, "keymgmt: loaded new version of key `%s'",
 521              SYM_NAME(kn)); )
 522     km_unref(kn->kd);
 523     kd->kn = kn;
 524     kn->kd = kd;
 525     changep = 1;
 526   }
 527
 528   return (changep);
 529 }
 530
 531 /* --- @kh_clear@ --- *
 532  *
 533  * Arguments:   @keyhalf *kh@ = pointer to keyhalf structure
 534  *
 535  * Returns:     ---
 536  *
 537  * Use:         Clears out the keyhalf's keyring and flushes the cache.
 538  */
 539
 540 static void kh_clear(keyhalf *kh)
 541 {
 542   sym_iter i;
 543   knode *kn;
 544
 545   if (!kh->kf) return;
 546   for (sym_mkiter(&i, &kh->tab); (kn = sym_next(&i)) != 0; )
 547     if (kn->kd) km_unref(kn->kd);
 548   sym_destroy(&kh->tab);
 549   key_close(kh->kf);
 550   xfree(kh->kr);
 551   kh->kf = 0;
 552 }
 553
 554 /*----- Main code ---------------------------------------------------------*/
 555
 556 char *tag_priv = 0;
 557 kdata *master;
 558
 559 /* --- @km_init@ --- *
 560  *
 561  * Arguments:   @const char *privkr@ = private keyring file
 562  *              @const char *pubkr@ = public keyring file
 563  *              @const char *ptag@ = default private-key tag
 564  *
 565  * Returns:     ---
 566  *
 567  * Use:         Initializes the key-management machinery, loading the
 568  *              keyrings and so on.
 569  */
 570
 571 void km_init(const char *privkr, const char *pubkr, const char *ptag)
 572 {
 573   const gchash *const *hh;
 574
 575   for (hh = ghashtab; *hh; hh++) {
 576     if ((*hh)->hashsz > MAXHASHSZ) {
 577       a_warn("ABORT", "hash-size-too-large", "hash",
 578              "%s", (*hh)->name, "size", "%lu", (*hh)->hashsz,
 579              "limit", "%d", MAXHASHSZ, A_END);
 580       abort();
 581     }
 582   }
 583
 584   kh_init(&priv, privkr);
 585   kh_init(&pub, pubkr);
 586
 587   tag_priv = ptag ? xstrdup(ptag) : 0;
 588   if ((master = km_findpriv(ptag)) == 0) exit(EXIT_FAILURE);
 589 }
 590
 591 /* --- @km_reload@ --- *
 592  *
 593  * Arguments:   ---
 594  *
 595  * Returns:     Zero if OK, nonzero to force reloading of keys.
 596  *
 597  * Use:         Checks the keyrings to see if they need reloading.
 598  */
 599
 600 int km_reload(void)
 601 {
 602   int changep = 0;
 603   kdata *kd;
 604
 605   if (kh_refresh(&priv)) {
 606     changep = 1;
 607     kd = master->kn->kd;
 608     if (kd != master) {
 609       km_unref(master);
 610       km_ref(kd);
 611       master = kd;
 612     }
 613   }
 614   if (kh_refresh(&pub))
 615     changep = 1;
 616   return (changep);
 617 }
 618
 619 /* --- @km_clear@ --- *
 620  *
 621  * Arguments:   ---
 622  *
 623  * Returns:     ---
 624  *
 625  * Use:         Forget the currently loaded keyrings.  The @master@ key will
 626  *              be cleared, but other keys already loaded will continue to
 627  *              exist until their reference count drops to zero.  Call
 628  *              @km_init@ to make everything work again.
 629  */
 630
 631 void km_clear(void)
 632 {
 633   kh_clear(&priv);
 634   kh_clear(&pub);
 635   if (master) { km_unref(master); master = 0; }
 636   if (tag_priv) { xfree(tag_priv); tag_priv = 0; }
 637 }
 638
 639 /* --- @km_findpub@, @km_findpriv@ --- *
 640  *
 641  * Arguments:   @const char *tag@ = key tag to load
 642  *
 643  * Returns:     Pointer to the kdata object if successful, or null on error.
 644  *
 645  * Use:         Fetches a public or private key from the keyring.
 646  */
 647
 648 kdata *km_findpub(const char *tag) { return (kh_find(&pub, tag, 1)); }
 649
 650 kdata *km_findpriv(const char *tag)
 651 {
 652   kdata *kd;
 653
 654   /* Unpleasantness for the sake of compatibility. */
 655   if (!tag && (kd = kh_find(&priv, "tripe", 0)) != 0) return (kd);
 656   else return (kh_find(&priv, tag ? tag : "tripe-dh", 1));
 657 }
 658
 659 /* --- @km_findpubbyid@, @km_findprivbyid@ --- *
 660  *
 661  * Arguments:   @uint32 id@ = key id to load
 662  *
 663  * Returns:     Pointer to the kdata object if successful, or null on error.
 664  *
 665  * Use:         Fetches a public or private key from the keyring given its
 666  *              numeric id.
 667  */
 668
 669 static kdata *findbyid(keyhalf *kh, uint32 id)
 670 {
 671   key *k;
 672   kdata *kd;
 673
 674   k = key_byid(kh->kf, id); if (!k) goto notfound;
 675   kd = kh_find(kh, k->tag, 1); if (!kd) goto notfound;
 676   if (kd->id != id) { km_unref(kd); goto notfound; }
 677   return (kd);
 678
 679 notfound:
 680   a_warn("KX", "%s-keyring", kh->kind, "%s", kh->kr,
 681          "unknown-key-id", "0x%08lx", (unsigned long)id,
 682          A_END);
 683   return (0);
 684 }
 685
 686 kdata *km_findpubbyid(uint32 id) { return (findbyid(&pub, id)); }
 687
 688 kdata *km_findprivbyid(uint32 id)
 689 {
 690   if (id == master->id) { km_ref(master); return (master); }
 691   else return findbyid(&priv, id);
 692 }
 693
 694 /* --- @km_tag@ --- *
 695  *
 696  * Arguments:   @kdata *kd@ - pointer to the kdata object
 697  *
 698  * Returns:     A pointer to the short tag by which the kdata was loaded.
 699  */
 700
 701 const char *km_tag(kdata *kd) { return (SYM_NAME(kd->kn)); }
 702
 703 /* --- @km_ref@ --- *
 704  *
 705  * Arguments:   @kdata *kd@ = pointer to the kdata object
 706  *
 707  * Returns:     ---
 708  *
 709  * Use:         Claim a new reference to a kdata object.
 710  */
 711
 712 void km_ref(kdata *kd) { kd->ref++; }
 713
 714 /* --- @km_unref@ --- *
 715  *
 716  * Arguments:   @kdata *kd@ = pointer to the kdata object
 717  *
 718  * Returns:     ---
 719  *
 720  * Use:         Releases a reference to a kdata object.
 721  */
 722
 723 void km_unref(kdata *kd)
 724 {
 725   if (--kd->ref) return;
 726   if (kd->k) kd->grp->ops->freesc(kd->grp, kd->k);
 727   kd->grp->ops->freege(kd->grp, kd->K);
 728   kd->grp->ops->freegrp(kd->grp);
 729   xfree(kd->tag);
 730   DESTROY(kd);
 731 }
 732
 733 /*----- That's all, folks -------------------------------------------------*/