2016-06-23 11:55:46 +02:00
|
|
|
|
/* name-value.c - Parser and writer for a name-value format.
|
2016-04-08 19:21:12 +02:00
|
|
|
|
* Copyright (C) 2016 g10 Code GmbH
|
|
|
|
|
*
|
|
|
|
|
* This file is part of GnuPG.
|
|
|
|
|
*
|
|
|
|
|
* This file is free software; you can redistribute it and/or modify
|
|
|
|
|
* it under the terms of either
|
|
|
|
|
*
|
|
|
|
|
* - the GNU Lesser General Public License as published by the Free
|
|
|
|
|
* Software Foundation; either version 3 of the License, or (at
|
|
|
|
|
* your option) any later version.
|
|
|
|
|
*
|
|
|
|
|
* or
|
|
|
|
|
*
|
|
|
|
|
* - the GNU General Public License as published by the Free
|
|
|
|
|
* Software Foundation; either version 2 of the License, or (at
|
|
|
|
|
* your option) any later version.
|
|
|
|
|
*
|
|
|
|
|
* or both in parallel, as here.
|
|
|
|
|
*
|
|
|
|
|
* GnuPG is distributed in the hope that it will be useful,
|
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
|
*
|
|
|
|
|
* You should have received a copy of the GNU General Public License
|
2016-11-05 12:02:19 +01:00
|
|
|
|
* along with this program; if not, see <https://www.gnu.org/licenses/>.
|
2016-04-08 19:21:12 +02:00
|
|
|
|
*/
|
|
|
|
|
|
2016-06-23 11:55:46 +02:00
|
|
|
|
/*
|
|
|
|
|
* This module aso provides features for the extended private key
|
|
|
|
|
* format of gpg-agent.
|
|
|
|
|
*/
|
|
|
|
|
|
2016-04-08 19:21:12 +02:00
|
|
|
|
#include <config.h>
|
|
|
|
|
#include <assert.h>
|
|
|
|
|
#include <gcrypt.h>
|
|
|
|
|
#include <gpg-error.h>
|
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
|
|
#include "mischelp.h"
|
|
|
|
|
#include "strlist.h"
|
|
|
|
|
#include "util.h"
|
2016-06-23 11:55:46 +02:00
|
|
|
|
#include "name-value.h"
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
2016-06-23 12:12:50 +02:00
|
|
|
|
struct name_value_container
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
2016-06-23 12:12:50 +02:00
|
|
|
|
struct name_value_entry *first;
|
|
|
|
|
struct name_value_entry *last;
|
2016-06-23 13:17:25 +02:00
|
|
|
|
unsigned int private_key_mode:1;
|
2023-11-21 08:34:04 +01:00
|
|
|
|
unsigned int modified:1;
|
2016-04-08 19:21:12 +02:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
2016-06-23 12:12:50 +02:00
|
|
|
|
struct name_value_entry
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
2016-06-23 12:12:50 +02:00
|
|
|
|
struct name_value_entry *prev;
|
|
|
|
|
struct name_value_entry *next;
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
/* The name. Comments and blank lines have NAME set to NULL. */
|
|
|
|
|
char *name;
|
|
|
|
|
|
2017-02-20 16:19:50 -05:00
|
|
|
|
/* The value as stored in the file. We store it when we parse
|
2016-04-08 19:21:12 +02:00
|
|
|
|
a file so that we can reproduce it. */
|
|
|
|
|
strlist_t raw_value;
|
|
|
|
|
|
|
|
|
|
/* The decoded value. */
|
|
|
|
|
char *value;
|
|
|
|
|
};
|
|
|
|
|
|
2016-04-25 18:14:12 +02:00
|
|
|
|
|
|
|
|
|
/* Helper */
|
|
|
|
|
static inline gpg_error_t
|
|
|
|
|
my_error_from_syserror (void)
|
|
|
|
|
{
|
|
|
|
|
return gpg_err_make (default_errsource, gpg_err_code_from_syserror ());
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-06-23 13:17:25 +02:00
|
|
|
|
static inline gpg_error_t
|
|
|
|
|
my_error (gpg_err_code_t ec)
|
|
|
|
|
{
|
|
|
|
|
return gpg_err_make (default_errsource, ec);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Allocation and deallocation. */
|
|
|
|
|
|
2023-11-21 08:34:04 +01:00
|
|
|
|
/* Allocate a name value container structure. */
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nvc_t
|
|
|
|
|
nvc_new (void)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
2023-11-21 08:34:04 +01:00
|
|
|
|
nvc_t nvc;
|
|
|
|
|
nvc = xtrycalloc (1, sizeof (struct name_value_container));
|
|
|
|
|
if (nvc)
|
|
|
|
|
nvc->modified = 1;
|
|
|
|
|
return nvc;
|
2016-04-08 19:21:12 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-06-23 13:17:25 +02:00
|
|
|
|
/* Allocate a private key container structure for use with private keys. */
|
|
|
|
|
nvc_t
|
|
|
|
|
nvc_new_private_key (void)
|
|
|
|
|
{
|
|
|
|
|
nvc_t nvc = nvc_new ();
|
|
|
|
|
if (nvc)
|
|
|
|
|
nvc->private_key_mode = 1;
|
|
|
|
|
return nvc;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-04-08 19:21:12 +02:00
|
|
|
|
static void
|
2016-06-23 13:17:25 +02:00
|
|
|
|
nve_release (nve_t entry, int private_key_mode)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
|
|
|
|
if (entry == NULL)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
xfree (entry->name);
|
2016-06-23 13:17:25 +02:00
|
|
|
|
if (entry->value && private_key_mode)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
wipememory (entry->value, strlen (entry->value));
|
|
|
|
|
xfree (entry->value);
|
2016-06-23 13:17:25 +02:00
|
|
|
|
if (private_key_mode)
|
|
|
|
|
free_strlist_wipe (entry->raw_value);
|
|
|
|
|
else
|
|
|
|
|
free_strlist (entry->raw_value);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
xfree (entry);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Release a private key container structure. */
|
|
|
|
|
void
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nvc_release (nvc_t pk)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nve_t e, next;
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
if (pk == NULL)
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
for (e = pk->first; e; e = next)
|
|
|
|
|
{
|
|
|
|
|
next = e->next;
|
2016-06-23 13:17:25 +02:00
|
|
|
|
nve_release (e, pk->private_key_mode);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
xfree (pk);
|
|
|
|
|
}
|
|
|
|
|
|
2023-11-21 08:34:04 +01:00
|
|
|
|
|
|
|
|
|
/* Return the modified-flag of the container and clear it if CLEAR is
|
|
|
|
|
* set. That flag is set for a new container and set with each
|
|
|
|
|
* update. */
|
|
|
|
|
int
|
|
|
|
|
nvc_modified (nvc_t pk, int clear)
|
|
|
|
|
{
|
|
|
|
|
int modified;
|
|
|
|
|
|
|
|
|
|
if (!pk)
|
|
|
|
|
return 0;
|
|
|
|
|
modified = pk->modified;
|
|
|
|
|
if (clear)
|
|
|
|
|
pk->modified = 0;
|
|
|
|
|
return modified;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Dealing with names and values. */
|
|
|
|
|
|
|
|
|
|
/* Check whether the given name is valid. Valid names start with a
|
|
|
|
|
letter, end with a colon, and contain only alphanumeric characters
|
|
|
|
|
and the hyphen. */
|
|
|
|
|
static int
|
|
|
|
|
valid_name (const char *name)
|
|
|
|
|
{
|
|
|
|
|
size_t i, len = strlen (name);
|
|
|
|
|
|
|
|
|
|
if (! alphap (name) || len == 0 || name[len - 1] != ':')
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
for (i = 1; i < len - 1; i++)
|
|
|
|
|
if (! alnump (&name[i]) && name[i] != '-')
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Makes sure that ENTRY has a RAW_VALUE. */
|
|
|
|
|
static gpg_error_t
|
2016-06-23 12:12:50 +02:00
|
|
|
|
assert_raw_value (nve_t entry)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
|
|
|
|
gpg_error_t err = 0;
|
|
|
|
|
size_t len, offset;
|
|
|
|
|
#define LINELEN 70
|
|
|
|
|
char buf[LINELEN+3];
|
|
|
|
|
|
|
|
|
|
if (entry->raw_value)
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
len = strlen (entry->value);
|
|
|
|
|
offset = 0;
|
|
|
|
|
while (len)
|
|
|
|
|
{
|
|
|
|
|
size_t amount, linelen = LINELEN;
|
|
|
|
|
|
|
|
|
|
/* On the first line we need to subtract space for the name. */
|
|
|
|
|
if (entry->raw_value == NULL && strlen (entry->name) < linelen)
|
|
|
|
|
linelen -= strlen (entry->name);
|
|
|
|
|
|
|
|
|
|
/* See if the rest of the value fits in this line. */
|
|
|
|
|
if (len <= linelen)
|
|
|
|
|
amount = len;
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
size_t i;
|
|
|
|
|
|
|
|
|
|
/* Find a suitable space to break on. */
|
2019-08-06 13:14:58 +09:00
|
|
|
|
for (i = linelen - 1; linelen - i < 30; i--)
|
|
|
|
|
if (ascii_isspace (entry->value[offset+i]))
|
2016-04-08 19:21:12 +02:00
|
|
|
|
break;
|
|
|
|
|
|
2019-08-06 13:14:58 +09:00
|
|
|
|
if (ascii_isspace (entry->value[offset+i]))
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
|
|
|
|
/* Found one. */
|
|
|
|
|
amount = i;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* Just induce a hard break. */
|
|
|
|
|
amount = linelen;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
snprintf (buf, sizeof buf, " %.*s\n", (int) amount,
|
|
|
|
|
&entry->value[offset]);
|
|
|
|
|
if (append_to_strlist_try (&entry->raw_value, buf) == NULL)
|
|
|
|
|
{
|
2016-04-25 18:14:12 +02:00
|
|
|
|
err = my_error_from_syserror ();
|
2016-04-08 19:21:12 +02:00
|
|
|
|
goto leave;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
offset += amount;
|
|
|
|
|
len -= amount;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
leave:
|
|
|
|
|
if (err)
|
|
|
|
|
{
|
|
|
|
|
free_strlist_wipe (entry->raw_value);
|
|
|
|
|
entry->raw_value = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return err;
|
|
|
|
|
#undef LINELEN
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Computes the length of the value encoded as continuation. If
|
|
|
|
|
*SWALLOW_WS is set, all whitespace at the beginning of S is
|
|
|
|
|
swallowed. If START is given, a pointer to the beginning of the
|
|
|
|
|
value is stored there. */
|
|
|
|
|
static size_t
|
|
|
|
|
continuation_length (const char *s, int *swallow_ws, const char **start)
|
|
|
|
|
{
|
|
|
|
|
size_t len;
|
|
|
|
|
|
|
|
|
|
if (*swallow_ws)
|
|
|
|
|
{
|
|
|
|
|
/* The previous line was a blank line and we inserted a newline.
|
|
|
|
|
Swallow all whitespace at the beginning of this line. */
|
|
|
|
|
while (ascii_isspace (*s))
|
|
|
|
|
s++;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* Iff a continuation starts with more than one space, it
|
|
|
|
|
encodes a space. */
|
|
|
|
|
if (ascii_isspace (*s))
|
|
|
|
|
s++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Strip whitespace at the end. */
|
|
|
|
|
len = strlen (s);
|
|
|
|
|
while (len > 0 && ascii_isspace (s[len-1]))
|
|
|
|
|
len--;
|
|
|
|
|
|
|
|
|
|
if (len == 0)
|
|
|
|
|
{
|
|
|
|
|
/* Blank lines encode newlines. */
|
|
|
|
|
len = 1;
|
|
|
|
|
s = "\n";
|
|
|
|
|
*swallow_ws = 1;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
*swallow_ws = 0;
|
|
|
|
|
|
|
|
|
|
if (start)
|
|
|
|
|
*start = s;
|
|
|
|
|
|
|
|
|
|
return len;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Makes sure that ENTRY has a VALUE. */
|
|
|
|
|
static gpg_error_t
|
2016-06-23 12:12:50 +02:00
|
|
|
|
assert_value (nve_t entry)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
|
|
|
|
size_t len;
|
|
|
|
|
int swallow_ws;
|
|
|
|
|
strlist_t s;
|
|
|
|
|
char *p;
|
|
|
|
|
|
|
|
|
|
if (entry->value)
|
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
|
|
len = 0;
|
|
|
|
|
swallow_ws = 0;
|
|
|
|
|
for (s = entry->raw_value; s; s = s->next)
|
|
|
|
|
len += continuation_length (s->d, &swallow_ws, NULL);
|
|
|
|
|
|
|
|
|
|
/* Add one for the terminating zero. */
|
|
|
|
|
len += 1;
|
|
|
|
|
|
|
|
|
|
entry->value = p = xtrymalloc (len);
|
|
|
|
|
if (entry->value == NULL)
|
2016-04-25 18:14:12 +02:00
|
|
|
|
return my_error_from_syserror ();
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
swallow_ws = 0;
|
|
|
|
|
for (s = entry->raw_value; s; s = s->next)
|
|
|
|
|
{
|
|
|
|
|
const char *start;
|
|
|
|
|
size_t l = continuation_length (s->d, &swallow_ws, &start);
|
|
|
|
|
|
|
|
|
|
memcpy (p, start, l);
|
|
|
|
|
p += l;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
*p++ = 0;
|
|
|
|
|
assert (p - entry->value == len);
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Get the name. */
|
|
|
|
|
char *
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nve_name (nve_t pke)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
|
|
|
|
return pke->name;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Get the value. */
|
|
|
|
|
char *
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nve_value (nve_t pke)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
|
|
|
|
if (assert_value (pke))
|
|
|
|
|
return NULL;
|
|
|
|
|
return pke->value;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Adding and modifying values. */
|
|
|
|
|
|
|
|
|
|
/* Add (NAME, VALUE, RAW_VALUE) to PK. NAME may be NULL for comments
|
|
|
|
|
and blank lines. At least one of VALUE and RAW_VALUE must be
|
|
|
|
|
given. If PRESERVE_ORDER is not given, entries with the same name
|
|
|
|
|
are grouped. NAME, VALUE and RAW_VALUE is consumed. */
|
|
|
|
|
static gpg_error_t
|
2016-06-23 12:12:50 +02:00
|
|
|
|
_nvc_add (nvc_t pk, char *name, char *value, strlist_t raw_value,
|
2016-04-08 19:21:12 +02:00
|
|
|
|
int preserve_order)
|
|
|
|
|
{
|
|
|
|
|
gpg_error_t err = 0;
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nve_t e;
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
assert (value || raw_value);
|
|
|
|
|
|
|
|
|
|
if (name && ! valid_name (name))
|
|
|
|
|
{
|
2016-06-23 13:17:25 +02:00
|
|
|
|
err = my_error (GPG_ERR_INV_NAME);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
goto leave;
|
|
|
|
|
}
|
|
|
|
|
|
2016-06-23 13:17:25 +02:00
|
|
|
|
if (name
|
|
|
|
|
&& pk->private_key_mode
|
|
|
|
|
&& !ascii_strcasecmp (name, "Key:")
|
|
|
|
|
&& nvc_lookup (pk, "Key:"))
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
2016-06-23 13:17:25 +02:00
|
|
|
|
err = my_error (GPG_ERR_INV_NAME);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
goto leave;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
e = xtrycalloc (1, sizeof *e);
|
|
|
|
|
if (e == NULL)
|
|
|
|
|
{
|
2016-04-25 18:14:12 +02:00
|
|
|
|
err = my_error_from_syserror ();
|
2016-04-08 19:21:12 +02:00
|
|
|
|
goto leave;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
e->name = name;
|
|
|
|
|
e->value = value;
|
|
|
|
|
e->raw_value = raw_value;
|
|
|
|
|
|
|
|
|
|
if (pk->first)
|
|
|
|
|
{
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nve_t last;
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
2016-04-21 15:23:04 +02:00
|
|
|
|
if (preserve_order || name == NULL)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
last = pk->last;
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
/* See if there is already an entry with NAME. */
|
2016-06-23 12:12:50 +02:00
|
|
|
|
last = nvc_lookup (pk, name);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
/* If so, find the last in that block. */
|
|
|
|
|
if (last)
|
2016-04-25 18:14:12 +02:00
|
|
|
|
{
|
|
|
|
|
while (last->next)
|
|
|
|
|
{
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nve_t next = last->next;
|
2016-04-25 18:14:12 +02:00
|
|
|
|
|
|
|
|
|
if (next->name && ascii_strcasecmp (next->name, name) == 0)
|
|
|
|
|
last = next;
|
|
|
|
|
else
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else /* Otherwise, just find the last entry. */
|
2016-04-08 19:21:12 +02:00
|
|
|
|
last = pk->last;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (last->next)
|
|
|
|
|
{
|
|
|
|
|
e->prev = last;
|
|
|
|
|
e->next = last->next;
|
|
|
|
|
last->next = e;
|
|
|
|
|
e->next->prev = e;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
e->prev = last;
|
|
|
|
|
last->next = e;
|
|
|
|
|
pk->last = e;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
pk->first = pk->last = e;
|
|
|
|
|
|
2023-11-21 08:34:04 +01:00
|
|
|
|
pk->modified = 1;
|
|
|
|
|
|
2016-04-08 19:21:12 +02:00
|
|
|
|
leave:
|
|
|
|
|
if (err)
|
|
|
|
|
{
|
|
|
|
|
xfree (name);
|
|
|
|
|
if (value)
|
|
|
|
|
wipememory (value, strlen (value));
|
|
|
|
|
xfree (value);
|
|
|
|
|
free_strlist_wipe (raw_value);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return err;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Add (NAME, VALUE) to PK. If an entry with NAME already exists, it
|
|
|
|
|
is not updated but the new entry is appended. */
|
|
|
|
|
gpg_error_t
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nvc_add (nvc_t pk, const char *name, const char *value)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
|
|
|
|
char *k, *v;
|
|
|
|
|
|
|
|
|
|
k = xtrystrdup (name);
|
|
|
|
|
if (k == NULL)
|
2016-04-25 18:14:12 +02:00
|
|
|
|
return my_error_from_syserror ();
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
v = xtrystrdup (value);
|
|
|
|
|
if (v == NULL)
|
|
|
|
|
{
|
|
|
|
|
xfree (k);
|
2016-04-25 18:14:12 +02:00
|
|
|
|
return my_error_from_syserror ();
|
2016-04-08 19:21:12 +02:00
|
|
|
|
}
|
|
|
|
|
|
2016-06-23 12:12:50 +02:00
|
|
|
|
return _nvc_add (pk, k, v, NULL, 0);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Add (NAME, VALUE) to PK. If an entry with NAME already exists, it
|
|
|
|
|
is updated with VALUE. If multiple entries with NAME exist, the
|
|
|
|
|
first entry is updated. */
|
|
|
|
|
gpg_error_t
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nvc_set (nvc_t pk, const char *name, const char *value)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nve_t e;
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
if (! valid_name (name))
|
|
|
|
|
return GPG_ERR_INV_NAME;
|
|
|
|
|
|
2016-06-23 12:12:50 +02:00
|
|
|
|
e = nvc_lookup (pk, name);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
if (e)
|
2023-11-21 08:55:56 +01:00
|
|
|
|
return nve_set (pk, e, value);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
else
|
2016-06-23 12:12:50 +02:00
|
|
|
|
return nvc_add (pk, name, value);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2023-11-21 08:34:04 +01:00
|
|
|
|
/* Update entry E to VALUE. PK is optional; if given its modified
|
|
|
|
|
* flag will be updated. */
|
2023-05-26 11:56:36 +02:00
|
|
|
|
gpg_error_t
|
2023-11-21 08:34:04 +01:00
|
|
|
|
nve_set (nvc_t pk, nve_t e, const char *value)
|
2023-05-26 11:56:36 +02:00
|
|
|
|
{
|
|
|
|
|
char *v;
|
|
|
|
|
|
|
|
|
|
if (!e)
|
|
|
|
|
return GPG_ERR_INV_ARG;
|
|
|
|
|
|
2023-11-21 08:55:56 +01:00
|
|
|
|
if (e->value && value && !strcmp (e->value, value))
|
|
|
|
|
{
|
|
|
|
|
/* Setting same value - ignore this call and don't set the
|
|
|
|
|
* modified flag (if PK is given). */
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
2023-05-26 11:56:36 +02:00
|
|
|
|
v = xtrystrdup (value? value:"");
|
|
|
|
|
if (!v)
|
|
|
|
|
return my_error_from_syserror ();
|
|
|
|
|
|
|
|
|
|
free_strlist_wipe (e->raw_value);
|
|
|
|
|
e->raw_value = NULL;
|
|
|
|
|
if (e->value)
|
|
|
|
|
wipememory (e->value, strlen (e->value));
|
|
|
|
|
xfree (e->value);
|
|
|
|
|
e->value = v;
|
2023-11-21 08:34:04 +01:00
|
|
|
|
if (pk)
|
|
|
|
|
pk->modified = 1;
|
2023-05-26 11:56:36 +02:00
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-04-08 19:21:12 +02:00
|
|
|
|
/* Delete the given entry from PK. */
|
|
|
|
|
void
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nvc_delete (nvc_t pk, nve_t entry)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
|
|
|
|
if (entry->prev)
|
|
|
|
|
entry->prev->next = entry->next;
|
|
|
|
|
else
|
|
|
|
|
pk->first = entry->next;
|
|
|
|
|
|
|
|
|
|
if (entry->next)
|
|
|
|
|
entry->next->prev = entry->prev;
|
|
|
|
|
else
|
|
|
|
|
pk->last = entry->prev;
|
|
|
|
|
|
2016-06-23 13:17:25 +02:00
|
|
|
|
nve_release (entry, pk->private_key_mode);
|
2023-11-21 08:34:04 +01:00
|
|
|
|
pk->modified = 1;
|
2016-04-08 19:21:12 +02:00
|
|
|
|
}
|
|
|
|
|
|
2019-05-07 11:01:15 +02:00
|
|
|
|
|
|
|
|
|
/* Delete the entries with NAME from PK. */
|
|
|
|
|
void
|
|
|
|
|
nvc_delete_named (nvc_t pk, const char *name)
|
|
|
|
|
{
|
|
|
|
|
nve_t e;
|
|
|
|
|
|
|
|
|
|
if (!valid_name (name))
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
|
|
while ((e = nvc_lookup (pk, name)))
|
|
|
|
|
nvc_delete (pk, e);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Lookup and iteration. */
|
|
|
|
|
|
|
|
|
|
/* Get the first non-comment entry. */
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nve_t
|
|
|
|
|
nvc_first (nvc_t pk)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nve_t entry;
|
2022-09-01 17:35:41 +02:00
|
|
|
|
|
|
|
|
|
if (!pk)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
2016-04-08 19:21:12 +02:00
|
|
|
|
for (entry = pk->first; entry; entry = entry->next)
|
|
|
|
|
if (entry->name)
|
|
|
|
|
return entry;
|
2022-09-01 17:35:41 +02:00
|
|
|
|
|
2016-04-08 19:21:12 +02:00
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2022-09-01 17:35:41 +02:00
|
|
|
|
/* Get the first entry with the given name. Return NULL if it does
|
|
|
|
|
* not exist. */
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nve_t
|
|
|
|
|
nvc_lookup (nvc_t pk, const char *name)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nve_t entry;
|
2022-09-01 17:35:41 +02:00
|
|
|
|
|
|
|
|
|
if (!pk)
|
|
|
|
|
return NULL;
|
|
|
|
|
|
2016-04-08 19:21:12 +02:00
|
|
|
|
for (entry = pk->first; entry; entry = entry->next)
|
2016-04-25 18:14:12 +02:00
|
|
|
|
if (entry->name && ascii_strcasecmp (entry->name, name) == 0)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
return entry;
|
2022-09-01 17:35:41 +02:00
|
|
|
|
|
2016-04-08 19:21:12 +02:00
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Get the next non-comment entry. */
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nve_t
|
|
|
|
|
nve_next (nve_t entry)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
|
|
|
|
for (entry = entry->next; entry; entry = entry->next)
|
|
|
|
|
if (entry->name)
|
|
|
|
|
return entry;
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Get the next entry with the given name. */
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nve_t
|
|
|
|
|
nve_next_value (nve_t entry, const char *name)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
|
|
|
|
for (entry = entry->next; entry; entry = entry->next)
|
2016-04-25 18:14:12 +02:00
|
|
|
|
if (entry->name && ascii_strcasecmp (entry->name, name) == 0)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
return entry;
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
2019-05-07 11:01:15 +02:00
|
|
|
|
|
|
|
|
|
/* Return the string for the first entry in NVC with NAME. If an
|
|
|
|
|
* entry with NAME is missing in NVC or its value is the empty string
|
2023-06-07 10:03:48 +02:00
|
|
|
|
* NULL is returned. Note that the the returned string is a pointer
|
2019-05-07 11:01:15 +02:00
|
|
|
|
* into NVC. */
|
|
|
|
|
const char *
|
|
|
|
|
nvc_get_string (nvc_t nvc, const char *name)
|
|
|
|
|
{
|
|
|
|
|
nve_t item;
|
|
|
|
|
|
|
|
|
|
if (!nvc)
|
|
|
|
|
return NULL;
|
|
|
|
|
item = nvc_lookup (nvc, name);
|
|
|
|
|
if (!item)
|
|
|
|
|
return NULL;
|
|
|
|
|
return nve_value (item);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2023-01-24 09:29:04 +01:00
|
|
|
|
/* Return true (ie. a non-zero value) if NAME exists and its value is
|
|
|
|
|
* true; that is either "yes", "true", or a decimal value unequal to 0. */
|
2022-08-11 10:55:00 +02:00
|
|
|
|
int
|
|
|
|
|
nvc_get_boolean (nvc_t nvc, const char *name)
|
|
|
|
|
{
|
|
|
|
|
nve_t item;
|
|
|
|
|
const char *s;
|
2023-01-24 09:29:04 +01:00
|
|
|
|
int n;
|
2022-08-11 10:55:00 +02:00
|
|
|
|
|
|
|
|
|
if (!nvc)
|
|
|
|
|
return 0;
|
|
|
|
|
item = nvc_lookup (nvc, name);
|
|
|
|
|
if (!item)
|
|
|
|
|
return 0;
|
|
|
|
|
s = nve_value (item);
|
2023-01-24 09:29:04 +01:00
|
|
|
|
if (!s)
|
|
|
|
|
return 0;
|
|
|
|
|
n = atoi (s);
|
|
|
|
|
if (n)
|
|
|
|
|
return n;
|
|
|
|
|
if (!ascii_strcasecmp (s, "yes") || !ascii_strcasecmp (s, "true"))
|
2022-08-11 10:55:00 +02:00
|
|
|
|
return 1;
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Private key handling. */
|
|
|
|
|
|
|
|
|
|
/* Get the private key. */
|
|
|
|
|
gpg_error_t
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nvc_get_private_key (nvc_t pk, gcry_sexp_t *retsexp)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
|
|
|
|
gpg_error_t err;
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nve_t e;
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
2016-06-23 13:17:25 +02:00
|
|
|
|
e = pk->private_key_mode? nvc_lookup (pk, "Key:") : NULL;
|
2016-04-08 19:21:12 +02:00
|
|
|
|
if (e == NULL)
|
2016-06-23 13:17:25 +02:00
|
|
|
|
return my_error (GPG_ERR_MISSING_KEY);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
err = assert_value (e);
|
|
|
|
|
if (err)
|
|
|
|
|
return err;
|
|
|
|
|
|
|
|
|
|
return gcry_sexp_sscan (retsexp, NULL, e->value, strlen (e->value));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Set the private key. */
|
|
|
|
|
gpg_error_t
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nvc_set_private_key (nvc_t pk, gcry_sexp_t sexp)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
|
|
|
|
gpg_error_t err;
|
|
|
|
|
char *raw, *clean, *p;
|
|
|
|
|
size_t len, i;
|
|
|
|
|
|
2016-06-23 13:17:25 +02:00
|
|
|
|
if (!pk->private_key_mode)
|
|
|
|
|
return my_error (GPG_ERR_MISSING_KEY);
|
|
|
|
|
|
2016-04-08 19:21:12 +02:00
|
|
|
|
len = gcry_sexp_sprint (sexp, GCRYSEXP_FMT_ADVANCED, NULL, 0);
|
|
|
|
|
|
|
|
|
|
raw = xtrymalloc (len);
|
|
|
|
|
if (raw == NULL)
|
2016-04-25 18:14:12 +02:00
|
|
|
|
return my_error_from_syserror ();
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
clean = xtrymalloc (len);
|
|
|
|
|
if (clean == NULL)
|
|
|
|
|
{
|
|
|
|
|
xfree (raw);
|
2016-04-25 18:14:12 +02:00
|
|
|
|
return my_error_from_syserror ();
|
2016-04-08 19:21:12 +02:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
gcry_sexp_sprint (sexp, GCRYSEXP_FMT_ADVANCED, raw, len);
|
|
|
|
|
|
|
|
|
|
/* Strip any whitespace at the end. */
|
|
|
|
|
i = strlen (raw) - 1;
|
|
|
|
|
while (i && ascii_isspace (raw[i]))
|
|
|
|
|
{
|
|
|
|
|
raw[i] = 0;
|
|
|
|
|
i--;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Replace any newlines with spaces, remove superfluous whitespace. */
|
|
|
|
|
len = strlen (raw);
|
|
|
|
|
for (p = clean, i = 0; i < len; i++)
|
|
|
|
|
{
|
|
|
|
|
char c = raw[i];
|
|
|
|
|
|
|
|
|
|
/* Collapse contiguous and superfluous spaces. */
|
|
|
|
|
if (ascii_isspace (c) && i > 0
|
|
|
|
|
&& (ascii_isspace (raw[i-1]) || raw[i-1] == '(' || raw[i-1] == ')'))
|
|
|
|
|
continue;
|
|
|
|
|
|
|
|
|
|
if (c == '\n')
|
|
|
|
|
c = ' ';
|
|
|
|
|
|
|
|
|
|
*p++ = c;
|
|
|
|
|
}
|
|
|
|
|
*p = 0;
|
|
|
|
|
|
2016-06-23 12:12:50 +02:00
|
|
|
|
err = nvc_set (pk, "Key:", clean);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
xfree (raw);
|
|
|
|
|
xfree (clean);
|
|
|
|
|
return err;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Parsing and serialization. */
|
|
|
|
|
|
2016-06-23 13:17:25 +02:00
|
|
|
|
static gpg_error_t
|
|
|
|
|
do_nvc_parse (nvc_t *result, int *errlinep, estream_t stream,
|
|
|
|
|
int for_private_key)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
|
|
|
|
gpg_error_t err = 0;
|
|
|
|
|
gpgrt_ssize_t len;
|
|
|
|
|
char *buf = NULL;
|
|
|
|
|
size_t buf_len = 0;
|
|
|
|
|
char *name = NULL;
|
|
|
|
|
strlist_t raw_value = NULL;
|
|
|
|
|
|
2016-06-23 13:17:25 +02:00
|
|
|
|
*result = for_private_key? nvc_new_private_key () : nvc_new ();
|
2016-04-08 19:21:12 +02:00
|
|
|
|
if (*result == NULL)
|
2016-04-25 18:14:12 +02:00
|
|
|
|
return my_error_from_syserror ();
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
if (errlinep)
|
|
|
|
|
*errlinep = 0;
|
2016-09-02 15:33:34 +02:00
|
|
|
|
while ((len = es_read_line (stream, &buf, &buf_len, NULL)) > 0)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
|
|
|
|
char *p;
|
|
|
|
|
if (errlinep)
|
|
|
|
|
*errlinep += 1;
|
|
|
|
|
|
|
|
|
|
/* Skip any whitespace. */
|
|
|
|
|
for (p = buf; *p && ascii_isspace (*p); p++)
|
|
|
|
|
/* Do nothing. */;
|
|
|
|
|
|
|
|
|
|
if (name && (spacep (buf) || *p == 0))
|
|
|
|
|
{
|
|
|
|
|
/* A continuation. */
|
|
|
|
|
if (append_to_strlist_try (&raw_value, buf) == NULL)
|
|
|
|
|
{
|
2016-04-25 18:14:12 +02:00
|
|
|
|
err = my_error_from_syserror ();
|
2016-04-08 19:21:12 +02:00
|
|
|
|
goto leave;
|
|
|
|
|
}
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* No continuation. Add the current entry if any. */
|
|
|
|
|
if (raw_value)
|
|
|
|
|
{
|
2016-06-23 12:12:50 +02:00
|
|
|
|
err = _nvc_add (*result, name, NULL, raw_value, 1);
|
2021-04-12 19:29:21 +02:00
|
|
|
|
name = NULL;
|
2016-04-08 19:21:12 +02:00
|
|
|
|
if (err)
|
|
|
|
|
goto leave;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* And prepare for the next one. */
|
|
|
|
|
name = NULL;
|
|
|
|
|
raw_value = NULL;
|
|
|
|
|
|
|
|
|
|
if (*p != 0 && *p != '#')
|
|
|
|
|
{
|
|
|
|
|
char *colon, *value, tmp;
|
|
|
|
|
|
|
|
|
|
colon = strchr (buf, ':');
|
|
|
|
|
if (colon == NULL)
|
|
|
|
|
{
|
2016-06-23 13:17:25 +02:00
|
|
|
|
err = my_error (GPG_ERR_INV_VALUE);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
goto leave;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
value = colon + 1;
|
|
|
|
|
tmp = *value;
|
|
|
|
|
*value = 0;
|
2016-04-25 18:14:12 +02:00
|
|
|
|
name = xtrystrdup (p);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
*value = tmp;
|
|
|
|
|
|
|
|
|
|
if (name == NULL)
|
|
|
|
|
{
|
2016-04-25 18:14:12 +02:00
|
|
|
|
err = my_error_from_syserror ();
|
2016-04-08 19:21:12 +02:00
|
|
|
|
goto leave;
|
|
|
|
|
}
|
|
|
|
|
|
2016-04-25 18:14:12 +02:00
|
|
|
|
if (append_to_strlist_try (&raw_value, value) == NULL)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
2016-04-25 18:14:12 +02:00
|
|
|
|
err = my_error_from_syserror ();
|
2016-04-08 19:21:12 +02:00
|
|
|
|
goto leave;
|
|
|
|
|
}
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
2016-04-25 18:14:12 +02:00
|
|
|
|
if (append_to_strlist_try (&raw_value, buf) == NULL)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
2016-04-25 18:14:12 +02:00
|
|
|
|
err = my_error_from_syserror ();
|
2016-04-08 19:21:12 +02:00
|
|
|
|
goto leave;
|
|
|
|
|
}
|
|
|
|
|
}
|
2016-09-02 15:33:34 +02:00
|
|
|
|
if (len < 0)
|
|
|
|
|
{
|
|
|
|
|
err = gpg_error_from_syserror ();
|
|
|
|
|
goto leave;
|
|
|
|
|
}
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
/* Add the final entry. */
|
|
|
|
|
if (raw_value)
|
2021-04-13 14:54:53 +09:00
|
|
|
|
{
|
|
|
|
|
err = _nvc_add (*result, name, NULL, raw_value, 1);
|
|
|
|
|
name = NULL;
|
|
|
|
|
}
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
leave:
|
2021-04-13 14:54:53 +09:00
|
|
|
|
xfree (name);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
gpgrt_free (buf);
|
|
|
|
|
if (err)
|
|
|
|
|
{
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nvc_release (*result);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
*result = NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return err;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-06-23 13:17:25 +02:00
|
|
|
|
/* Parse STREAM and return a newly allocated name value container
|
|
|
|
|
structure in RESULT. If ERRLINEP is given, the line number the
|
|
|
|
|
parser was last considering is stored there. */
|
|
|
|
|
gpg_error_t
|
|
|
|
|
nvc_parse (nvc_t *result, int *errlinep, estream_t stream)
|
|
|
|
|
{
|
|
|
|
|
return do_nvc_parse (result, errlinep, stream, 0);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Parse STREAM and return a newly allocated name value container
|
|
|
|
|
structure in RESULT - assuming the extended private key format. If
|
|
|
|
|
ERRLINEP is given, the line number the parser was last considering
|
|
|
|
|
is stored there. */
|
|
|
|
|
gpg_error_t
|
|
|
|
|
nvc_parse_private_key (nvc_t *result, int *errlinep, estream_t stream)
|
|
|
|
|
{
|
|
|
|
|
return do_nvc_parse (result, errlinep, stream, 1);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2019-05-03 14:24:07 +02:00
|
|
|
|
/* Helper fpr nvc_write. */
|
|
|
|
|
static gpg_error_t
|
|
|
|
|
write_one_entry (nve_t entry, estream_t stream)
|
|
|
|
|
{
|
|
|
|
|
gpg_error_t err;
|
|
|
|
|
strlist_t sl;
|
|
|
|
|
|
|
|
|
|
if (entry->name)
|
|
|
|
|
es_fputs (entry->name, stream);
|
|
|
|
|
|
|
|
|
|
err = assert_raw_value (entry);
|
|
|
|
|
if (err)
|
|
|
|
|
return err;
|
|
|
|
|
|
|
|
|
|
for (sl = entry->raw_value; sl; sl = sl->next)
|
|
|
|
|
es_fputs (sl->d, stream);
|
|
|
|
|
|
|
|
|
|
if (es_ferror (stream))
|
|
|
|
|
return my_error_from_syserror ();
|
|
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2016-04-08 19:21:12 +02:00
|
|
|
|
/* Write a representation of PK to STREAM. */
|
|
|
|
|
gpg_error_t
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nvc_write (nvc_t pk, estream_t stream)
|
2016-04-08 19:21:12 +02:00
|
|
|
|
{
|
2019-05-03 14:24:07 +02:00
|
|
|
|
gpg_error_t err = 0;
|
2016-06-23 12:12:50 +02:00
|
|
|
|
nve_t entry;
|
2019-05-03 14:24:07 +02:00
|
|
|
|
nve_t keyentry = NULL;
|
2016-04-08 19:21:12 +02:00
|
|
|
|
|
|
|
|
|
for (entry = pk->first; entry; entry = entry->next)
|
|
|
|
|
{
|
2019-05-03 14:24:07 +02:00
|
|
|
|
if (pk->private_key_mode
|
|
|
|
|
&& entry->name && !ascii_strcasecmp (entry->name, "Key:"))
|
|
|
|
|
{
|
|
|
|
|
if (!keyentry)
|
|
|
|
|
keyentry = entry;
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
err = write_one_entry (entry, stream);
|
2016-04-08 19:21:12 +02:00
|
|
|
|
if (err)
|
|
|
|
|
return err;
|
|
|
|
|
}
|
|
|
|
|
|
2019-05-03 14:24:07 +02:00
|
|
|
|
/* In private key mode we write the Key always last. */
|
|
|
|
|
if (keyentry)
|
|
|
|
|
err = write_one_entry (keyentry, stream);
|
|
|
|
|
|
|
|
|
|
return err;
|
2016-04-08 19:21:12 +02:00
|
|
|
|
}
|