1 |
/* wptKeylist.cpp - Keylist element |
/* wptKeylist.cpp - Keylist element |
2 |
* Copyright (C) 2001-2005 Timo Schulz |
* Copyright (C) 2001-2006 Timo Schulz |
3 |
* Copyright (C) 2004 Andreas Jobs |
* Copyright (C) 2004 Andreas Jobs |
4 |
* |
* |
5 |
* This file is part of WinPT. |
* This file is part of WinPT. |
38 |
#include "wptUTF8.h" |
#include "wptUTF8.h" |
39 |
#include "wptRegistry.h" |
#include "wptRegistry.h" |
40 |
#include "wptContext.h" |
#include "wptContext.h" |
41 |
|
#include "wptVersion.h" |
42 |
|
#include "resource.h" |
43 |
|
|
44 |
#define key_is_useable(key) (!(key)->revoked && !(key)->expired && !(key)->disabled) |
#define key_is_useable(key) (!(key)->revoked && !(key)->expired && !(key)->disabled) |
45 |
|
|
52 |
|
|
53 |
|
|
54 |
static key_array_s* |
static key_array_s* |
55 |
key_array_new( size_t items ) |
key_array_new (int items) |
56 |
{ |
{ |
57 |
key_array_s *ka; |
key_array_s *ka; |
58 |
size_t j; |
int j; |
59 |
|
|
60 |
if( items == 0 ) |
if (items == 0) |
61 |
return NULL; |
return NULL; |
62 |
ka = new key_array_s[items + 1]; |
ka = new key_array_s[items + 1]; |
63 |
if( ka == NULL ) |
if (!ka) |
64 |
return NULL; |
BUG (NULL); |
65 |
for ( j = 0; j < items; j++ ) |
for (j = 0; j < items; j++) |
66 |
ka[j].checked = 0; |
ka[j].checked = 0; |
67 |
return ka; |
return ka; |
68 |
} /* key_array_new */ |
} |
69 |
|
|
70 |
|
|
71 |
static void |
static void |
72 |
key_array_release( key_array_s *ka ) |
key_array_release (key_array_s *ka) |
73 |
{ |
{ |
74 |
free_if_alloc( ka ); |
free_if_alloc (ka); |
75 |
} /* key_array_release */ |
} |
76 |
|
|
77 |
|
|
78 |
|
/* Check if the keyid @keyid is in the key array @ka. |
79 |
|
Return value: 1 if it exists, 0 otherwise. */ |
80 |
static int |
static int |
81 |
key_array_search( key_array_s *ka, size_t items, const char *keyid ) |
key_array_search (key_array_s *ka, int items, const char *keyid) |
82 |
{ |
{ |
83 |
size_t j; |
int j; |
84 |
|
|
85 |
/* fixme: we need a faster search method */ |
for (j = 0; j < items; j++) { |
86 |
for( j = 0; j < items; j++ ) { |
if (!strcmp (keyid, ka[j].keyid)) |
|
if( !strcmp( keyid, ka[j].keyid ) ) |
|
87 |
return 1; |
return 1; |
88 |
} |
} |
|
|
|
89 |
return 0; |
return 0; |
90 |
} /* key_array_search */ |
} |
91 |
|
|
92 |
|
|
93 |
gpgme_user_id_t |
gpgme_user_id_t |
152 |
} |
} |
153 |
|
|
154 |
|
|
155 |
|
/* Return the self signature of the key @keyid. |
156 |
|
If first is set, the first self sig will be returned. */ |
157 |
gpgme_key_sig_t |
gpgme_key_sig_t |
158 |
get_selfsig (gpgme_user_id_t uid, const char *keyid, int first) |
get_selfsig (gpgme_key_sig_t sigs, const char *keyid, int first) |
159 |
{ |
{ |
160 |
gpgme_key_sig_t s, self_sig=NULL; |
gpgme_key_sig_t s, self_sig=NULL; |
161 |
long timestamp=0; |
long timestamp=0; |
162 |
|
int off = 0; |
163 |
|
|
164 |
|
if (strlen (keyid) == 8) |
165 |
|
off = 8; |
166 |
|
|
167 |
for (s = uid->signatures; s; s = s->next) { |
for (s = sigs; s; s = s->next) { |
168 |
if (!strcmp (s->keyid+8, keyid) && s->timestamp > timestamp) { |
if (!strcmp (s->keyid+off, keyid) && s->timestamp > timestamp) { |
169 |
self_sig = s; |
self_sig = s; |
170 |
timestamp = s->timestamp; |
timestamp = s->timestamp; |
171 |
if (first) |
if (first) |
177 |
|
|
178 |
|
|
179 |
const char* |
const char* |
|
get_key_pubalgo2 (gpgme_pubkey_algo_t alg) |
|
|
{ |
|
|
switch (alg) { |
|
|
case GPGME_PK_DSA: return "D"; |
|
|
case GPGME_PK_RSA: return "R"; |
|
|
case GPGME_PK_ELG: return "G"; |
|
|
default: return "?"; |
|
|
} |
|
|
return "?"; |
|
|
} |
|
|
|
|
|
const char* |
|
180 |
get_key_algo (gpgme_key_t key, int keyidx) |
get_key_algo (gpgme_key_t key, int keyidx) |
181 |
{ |
{ |
182 |
static char algo_id[128]; |
static char algo_id[128]; |
188 |
if (keyidx > 0) { |
if (keyidx > 0) { |
189 |
k = get_nth_key (key, keyidx-1); |
k = get_nth_key (key, keyidx-1); |
190 |
subalg = get_key_pubalgo (k->pubkey_algo); |
subalg = get_key_pubalgo (k->pubkey_algo); |
191 |
_snprintf( algo_id, DIM (algo_id)-1, "%s", subalg); |
_snprintf (algo_id, DIM (algo_id)-1, "%s", subalg); |
192 |
return algo_id; |
return algo_id; |
193 |
} |
} |
194 |
strcpy (alg, get_key_pubalgo (key->subkeys->pubkey_algo)); |
strcpy (alg, get_key_pubalgo (key->subkeys->pubkey_algo)); |
195 |
n = count_subkeys (key); |
n = count_subkeys (key); |
196 |
if (n > 1) { |
if (n > 1) { |
197 |
k = get_nth_key (key, n-1); |
do { |
198 |
|
k = get_nth_key (key, --n); |
199 |
|
if (k->revoked || k->expired) |
200 |
|
continue; |
201 |
|
else |
202 |
|
break; |
203 |
|
} while (n > 0); |
204 |
subalg = get_key_pubalgo (k->pubkey_algo); |
subalg = get_key_pubalgo (k->pubkey_algo); |
205 |
_snprintf (algo_id, DIM (algo_id)-1, "%s/%s", alg, subalg); |
if (k == key->subkeys) |
206 |
|
_snprintf (algo_id, DIM (algo_id)-1, "%s", subalg); |
207 |
|
else |
208 |
|
_snprintf (algo_id, DIM (algo_id)-1, "%s/%s", alg, subalg); |
209 |
return algo_id; |
return algo_id; |
210 |
} |
} |
211 |
return get_key_pubalgo (key->subkeys->pubkey_algo); |
return get_key_pubalgo (key->subkeys->pubkey_algo); |
212 |
} /* get_key_algo */ |
} |
213 |
|
|
214 |
|
|
215 |
const char* |
const char* |
217 |
{ |
{ |
218 |
static char timebuf[128]; |
static char timebuf[128]; |
219 |
struct tm *warp; |
struct tm *warp; |
220 |
|
const char *dat; |
221 |
|
|
222 |
if (timestamp == 0 || timestamp == -1) |
if (timestamp < 1) |
223 |
return "????" "-??" "-??"; |
return "????" "-??" "-??"; |
224 |
warp = localtime( ×tamp ); |
dat = get_locale_date (timestamp, timebuf, DIM (timebuf)-1); |
225 |
_snprintf( timebuf, sizeof timebuf - 1, "%04d-%02d-%02d", |
if (dat) |
226 |
warp->tm_year + 1900, warp->tm_mon + 1, warp->tm_mday ); |
return dat; |
227 |
|
/* Fallback if locate date conversion failed. */ |
228 |
|
warp = localtime (×tamp); |
229 |
|
_snprintf (timebuf, DIM (timebuf) - 1, "%04d-%02d-%02d", |
230 |
|
warp->tm_year + 1900, warp->tm_mon + 1, warp->tm_mday); |
231 |
return timebuf; |
return timebuf; |
232 |
} /* get_key_created */ |
} |
233 |
|
|
234 |
|
|
235 |
/* Return a string presentation of the time @timestamp. */ |
/* Return a string presentation of the time @timestamp. */ |
238 |
{ |
{ |
239 |
static char timebuf[64]; |
static char timebuf[64]; |
240 |
struct tm *warp; |
struct tm *warp; |
241 |
|
const char *dat; |
242 |
|
|
243 |
if( !timestamp ) |
if (timestamp == 0) |
244 |
return _("Never"); |
return _("Never"); |
245 |
warp = localtime( ×tamp ); |
dat = get_locale_date (timestamp, timebuf, DIM (timebuf)-1); |
246 |
_snprintf (timebuf, sizeof timebuf -1, "%04d-%02d-%02d", |
if (dat) |
247 |
|
return dat; |
248 |
|
warp = localtime (×tamp); |
249 |
|
_snprintf (timebuf, DIM (timebuf) -1, "%04d-%02d-%02d", |
250 |
warp->tm_year + 1900, warp->tm_mon + 1, warp->tm_mday); |
warp->tm_year + 1900, warp->tm_mon + 1, warp->tm_mday); |
251 |
return timebuf; |
return timebuf; |
252 |
} |
} |
262 |
else if (type == 2) |
else if (type == 2) |
263 |
return _("Key Pair (Card)"); |
return _("Key Pair (Card)"); |
264 |
return _("Public Key"); |
return _("Public Key"); |
265 |
} /* get_key_type */ |
} |
266 |
|
|
267 |
|
|
268 |
const char* |
const char* |
283 |
if (n > 1) { |
if (n > 1) { |
284 |
k = get_nth_key (key, n-1); |
k = get_nth_key (key, n-1); |
285 |
size_sub = k->length; |
size_sub = k->length; |
286 |
_snprintf( size_id, sizeof (size_id) - 1, "%d/%d", size_main, size_sub ); |
_snprintf (size_id, DIM (size_id) - 1, "%d/%d", |
287 |
|
size_main, size_sub); |
288 |
return size_id; |
return size_id; |
289 |
} |
} |
290 |
_snprintf( size_id, sizeof (size_id) - 1, "%d", size_main ); |
_snprintf (size_id, DIM (size_id) - 1, "%d", size_main); |
291 |
return size_id; |
return size_id; |
292 |
} /* get_key_size */ |
} |
293 |
|
|
294 |
|
|
295 |
|
const char* |
296 |
|
get_key_pubalgo2 (gpgme_pubkey_algo_t alg) |
297 |
|
{ |
298 |
|
switch (alg) { |
299 |
|
case GPGME_PK_DSA: return "D"; |
300 |
|
case GPGME_PK_RSA: return "R"; |
301 |
|
case GPGME_PK_ELG: return "G"; |
302 |
|
default: return "?"; |
303 |
|
} |
304 |
|
return "?"; |
305 |
|
} |
306 |
|
|
307 |
|
|
308 |
const char* |
const char* |
312 |
case GPGME_PK_DSA: return "DSA"; |
case GPGME_PK_DSA: return "DSA"; |
313 |
case GPGME_PK_ELG: |
case GPGME_PK_ELG: |
314 |
case GPGME_PK_ELG_E: return "ELG"; |
case GPGME_PK_ELG_E: return "ELG"; |
315 |
case GPGME_PK_RSA: return "RSA"; |
case 0: /* XXX: do we still need this?? */ |
316 |
|
case GPGME_PK_RSA: |
317 |
|
case GPGME_PK_RSA_S: |
318 |
|
case GPGME_PK_RSA_E: return "RSA"; |
319 |
default: return "???"; |
default: return "???"; |
320 |
} |
} |
321 |
return "???"; |
return "???"; |
322 |
} |
} |
323 |
|
|
324 |
const char * |
const char* |
325 |
get_key_fpr (gpgme_key_t key) |
get_key_fpr (gpgme_key_t key) |
326 |
{ |
{ |
327 |
static char fpr_md[64]; |
static char fpr_md[64]; |
350 |
} |
} |
351 |
} |
} |
352 |
return fpr_md; |
return fpr_md; |
353 |
} /* get_key_fpr */ |
} |
354 |
|
|
355 |
|
|
356 |
|
/* Extract the key ID from the fingerprint. |
357 |
|
A long ID will be converted into a short ID. */ |
358 |
|
const char* |
359 |
|
get_keyid_from_fpr (const char *fpr) |
360 |
|
{ |
361 |
|
if (!fpr) |
362 |
|
return "????????"; |
363 |
|
if (strlen (fpr) == 40) |
364 |
|
fpr += 32; |
365 |
|
else if (strlen (fpr) == 32) |
366 |
|
fpr += 24; |
367 |
|
else if (strlen (fpr) == 16) |
368 |
|
fpr += 8; |
369 |
|
else |
370 |
|
return "????????"; |
371 |
|
return fpr; |
372 |
|
} |
373 |
|
|
374 |
const char * |
|
375 |
|
const char* |
376 |
get_key_trust2 (gpgme_key_t key, int val, int uididx, int listmode) |
get_key_trust2 (gpgme_key_t key, int val, int uididx, int listmode) |
377 |
{ |
{ |
378 |
if (key) |
if (key) |
386 |
case GPGME_VALIDITY_MARGINAL: |
case GPGME_VALIDITY_MARGINAL: |
387 |
return _("Marginal"); |
return _("Marginal"); |
388 |
case GPGME_VALIDITY_FULL: |
case GPGME_VALIDITY_FULL: |
|
case GPGME_VALIDITY_ULTIMATE: |
|
389 |
return _("Full"); |
return _("Full"); |
390 |
|
case GPGME_VALIDITY_ULTIMATE: |
391 |
|
return _("Ultimate"); |
392 |
} |
} |
393 |
return ""; |
return ""; |
394 |
} |
} |
395 |
|
|
396 |
|
|
397 |
const char * |
const char* |
398 |
get_key_trust (gpgme_key_t key, int uididx, int listmode) |
get_key_trust (gpgme_key_t key, int uididx, int listmode) |
399 |
{ |
{ |
400 |
return get_key_trust2 (key, 0, uididx, listmode); |
return get_key_trust2 (key, 0, uididx, listmode); |
401 |
} |
} |
402 |
|
|
403 |
|
|
404 |
const char * |
const char* |
405 |
get_key_trust_str (int val) |
get_key_trust_str (int val) |
406 |
{ |
{ |
407 |
return get_key_trust2 (NULL, val, 0, 0); |
return get_key_trust2 (NULL, val, 0, 0); |
429 |
else |
else |
430 |
s = ""; |
s = ""; |
431 |
/* if the key has a special status, we don't continue to figure out |
/* if the key has a special status, we don't continue to figure out |
432 |
what any user-id validities. */ |
the user-id validities. */ |
433 |
if (*s) |
if (*s) |
434 |
return m_strdup (s); |
return m_strdup (s); |
435 |
} |
} |
440 |
} |
} |
441 |
|
|
442 |
|
|
443 |
|
/* Return human readable description of the key @key. */ |
444 |
|
char* |
445 |
|
get_key_desc (gpgme_key_t key) |
446 |
|
{ |
447 |
|
gpgme_key_t sk; |
448 |
|
const char *state, *alg, *type; |
449 |
|
char *p; |
450 |
|
|
451 |
|
/* XXX: problems with the German translation. */ |
452 |
|
state = ""; |
453 |
|
if (key->disabled) |
454 |
|
state = _("Disabled"); |
455 |
|
if (key->expired) |
456 |
|
state = _("Expired"); |
457 |
|
if (key->revoked) |
458 |
|
state = _("Revoked"); |
459 |
|
alg = "OpenPGP"; |
460 |
|
if (strlen (key->subkeys->fpr) == 32) |
461 |
|
alg = "RSA Legacy"; |
462 |
|
type = _("public key"); |
463 |
|
if (!get_seckey (key->subkeys->keyid+8, &sk)) |
464 |
|
type = _("key pair"); |
465 |
|
p = new char[strlen (state) + strlen (alg) + strlen (type) + 4 + 1]; |
466 |
|
if (!p) |
467 |
|
BUG (0); |
468 |
|
sprintf (p, "%s %s %s", state, alg, type); |
469 |
|
return p; |
470 |
|
} |
471 |
|
|
472 |
|
|
473 |
/* Integer comparsion of @a and @b. |
/* Integer comparsion of @a and @b. |
474 |
Return values: same as in strcmp. */ |
Return values: same as in strcmp. */ |
475 |
static inline int |
static inline int |
491 |
return GPGME_VALIDITY_ULTIMATE+1; |
return GPGME_VALIDITY_ULTIMATE+1; |
492 |
else if (k->expired) |
else if (k->expired) |
493 |
return GPGME_VALIDITY_ULTIMATE+2; |
return GPGME_VALIDITY_ULTIMATE+2; |
494 |
|
else if (k->disabled) |
495 |
|
return GPGME_VALIDITY_ULTIMATE+3; |
496 |
return k->uids->validity; |
return k->uids->validity; |
497 |
} |
} |
498 |
|
|
501 |
static int CALLBACK |
static int CALLBACK |
502 |
keylist_cmp_cb (LPARAM first, LPARAM second, LPARAM sortby) |
keylist_cmp_cb (LPARAM first, LPARAM second, LPARAM sortby) |
503 |
{ |
{ |
504 |
|
struct keycache_s *aa, *bb; |
505 |
gpgme_key_t a, b; |
gpgme_key_t a, b; |
506 |
int cmpresult = 0; |
int cmpresult = 0; |
507 |
|
|
508 |
a = (gpgme_key_t)first; |
aa = (struct keycache_s *)first; |
509 |
b = (gpgme_key_t)second; |
bb = (struct keycache_s *)second; |
510 |
if (!a || !b) |
if (!aa || !bb) |
511 |
BUG (NULL); |
BUG (NULL); |
512 |
|
a = aa->key; |
513 |
|
b = bb->key; |
514 |
|
|
515 |
switch (sortby & ~KEYLIST_SORT_DESC) { |
switch (sortby & ~KEYLIST_SORT_DESC) { |
516 |
case KEY_SORT_USERID: |
case KEY_SORT_USERID: |
563 |
} |
} |
564 |
|
|
565 |
|
|
|
/* Return the validity of the group @grp. */ |
|
|
static const char* |
|
|
calc_validity (gpg_group_t grp) |
|
|
{ |
|
|
int valid = 0; |
|
|
gpg_member_t mbr; |
|
|
gpgme_key_t key; |
|
|
|
|
|
for (mbr = grp->list; mbr; mbr = mbr->next) { |
|
|
if (get_pubkey (mbr->name, &key)) |
|
|
continue; |
|
|
valid = key->uids->validity; |
|
|
switch (valid) { |
|
|
case GPGME_VALIDITY_MARGINAL: |
|
|
case GPGME_VALIDITY_NEVER: |
|
|
case GPGME_VALIDITY_UNDEFINED: |
|
|
return get_key_trust2 (NULL, valid, 0, 0); |
|
|
} |
|
|
} |
|
|
return _("Full"); |
|
|
} |
|
|
|
|
|
|
|
566 |
int |
int |
567 |
keylist_add_groups( listview_ctrl_t lv ) |
keylist_add_groups (listview_ctrl_t lv) |
568 |
{ |
{ |
|
#if 0 |
|
|
gpg_optfile_t gh; |
|
|
gpg_group_t grp; |
|
|
const char *valid; |
|
|
|
|
|
gh = km_groupdb_open( ); |
|
|
if( !gh ) |
|
|
return WPTERR_FILE_OPEN; |
|
|
|
|
|
for( grp = gh->grp; grp; grp = grp->next ) { |
|
|
valid = calc_validity( grp ); |
|
|
listview_add_item( lv, " " ); |
|
|
listview_add_sub_item( lv, 0, 0, grp->name ); |
|
|
listview_add_sub_item( lv, 0, 1, "gpg_group_t" ); |
|
|
listview_add_sub_item( lv, 0, 2, "" ); |
|
|
listview_add_sub_item( lv, 0, 3, "Unknown" ); |
|
|
listview_add_sub_item( lv, 0, 4, valid?valid : "Unknown" ); |
|
|
} |
|
|
#endif |
|
569 |
return 0; |
return 0; |
570 |
} /* keylist_add_groups */ |
} |
571 |
|
|
572 |
|
|
573 |
/* Create a listview for listing keys. Use the mode given in @mode |
/* Create a listview for listing keys. Use the mode given in @mode |
583 |
{5, 70, (char *)_("Validity")}, |
{5, 70, (char *)_("Validity")}, |
584 |
{0, 0, NULL} |
{0, 0, NULL} |
585 |
}; |
}; |
|
|
|
586 |
struct listview_column_s klist[] = { |
struct listview_column_s klist[] = { |
587 |
{0, 242, (char *)_("User ID")}, |
{0, 240, (char *)_("User ID")}, |
588 |
{1, 78, (char *)_("Key ID")}, |
{1, 78, (char *)_("Key ID")}, |
589 |
{2, 52, (char *)_("Type")}, |
{2, 52, (char *)_("Type")}, |
590 |
{3, 68, (char *)_("Size")}, |
{3, 66, (char *)_("Size")}, |
591 |
{4, 66, (char *)_("Cipher")}, |
{4, 60, (char *)_("Cipher")}, |
592 |
{5, 70, (char *)_("Validity")}, |
{5, 66, (char *)_("Validity")}, |
593 |
{6, 40, (char *)_("Trust")}, |
{6, 58, (char *)_("Trust")}, |
594 |
{7, 72, (char *)_("Creation")}, |
{7, 72, (char *)_("Creation")}, |
595 |
{0, 0, NULL} |
{0, 0, NULL} |
596 |
}; |
}; |
597 |
|
HICON ico[4]; |
598 |
listview_ctrl_t lv; |
listview_ctrl_t lv; |
599 |
listview_column_t col; |
listview_column_t col; |
600 |
int j, n = 0; |
int j, n = 0, ext_chk = 0; |
|
int rc = 0; |
|
|
|
|
|
rc = listview_new (&lv); |
|
|
if (rc) |
|
|
return rc; |
|
601 |
|
|
602 |
lv->ctrl = ctrl; |
listview_new (&lv, ctrl); |
603 |
if ((mode & KEYLIST_ENCRYPT) || (mode & KEYLIST_ENCRYPT_MIN)) { |
if (mode & KEYLIST_ENCRYPT_MIN) { |
604 |
col = klist_enc; |
col = klist_enc; |
605 |
n = (DIM(klist_enc) -1); |
n = (DIM (klist_enc) -1); |
606 |
|
ext_chk = 1; |
607 |
} |
} |
608 |
else if ((mode & KEYLIST_SIGN)) { |
else if ((mode & KEYLIST_SIGN)) { |
609 |
col = klist_enc; |
col = klist_enc; |
610 |
n = (DIM(klist_enc) - 1) - 1; |
n = (DIM (klist_enc) - 1) - 1; |
611 |
|
ext_chk = 1; |
612 |
} |
} |
613 |
else { |
else { |
614 |
col = klist; |
col = klist; |
615 |
n = (DIM(klist) - 1); |
n = (DIM (klist) - 1); |
616 |
} |
} |
617 |
|
|
618 |
for( j = 0; j < n; j++ ) |
for (j = 0; j < n; j++) |
619 |
listview_add_column( lv, &col[j] ); |
listview_add_column (lv, &col[j]); |
620 |
listview_set_ext_style( lv ); |
listview_set_ext_style (lv); |
621 |
|
if (ext_chk) |
622 |
|
listview_set_chkbox_style (lv); |
623 |
|
ico[0] = LoadIcon (glob_hinst, (LPCTSTR)IDI_PUBKEY); |
624 |
|
ico[1] = LoadIcon (glob_hinst, (LPCTSTR)IDI_KEYPAIR); |
625 |
|
ico[2] = LoadIcon (glob_hinst, (LPCTSTR)IDI_SORT_DOWNARROW); |
626 |
|
ico[3] = LoadIcon (glob_hinst, (LPCTSTR)IDI_SORT_UPARROW); |
627 |
|
listview_set_image_list (lv, 22, 14, ico, 4); |
628 |
|
listview_del_all_items (lv); |
629 |
|
|
630 |
*r_lv = lv; |
*r_lv = lv; |
|
|
|
631 |
return 0; |
return 0; |
632 |
} |
} |
633 |
|
|
638 |
{ |
{ |
639 |
gpgme_error_t err = gpg_error (GPG_ERR_NO_ERROR); |
gpgme_error_t err = gpg_error (GPG_ERR_NO_ERROR); |
640 |
gpgme_key_t key, skey; |
gpgme_key_t key, skey; |
641 |
const char * keyid; |
struct keycache_s *c; |
642 |
|
const char *keyid; |
643 |
|
|
644 |
if (pubkc && seckc) { |
if (pubkc && seckc) { |
645 |
gpg_keycache_rewind (pubkc); |
gpg_keycache_rewind (pubkc); |
646 |
while (!gpg_keycache_next_key (pubkc, 0, &key)) { |
while (!gpg_keycache_next_key2 (pubkc, 0, &c, &key)) { |
647 |
keyid = key->subkeys->keyid; |
keyid = key->subkeys->keyid; |
648 |
if (keyid && !gpg_keycache_find_key (seckc, keyid, 0, &skey)) |
if (keyid && !gpg_keycache_find_key (seckc, keyid, 0, &skey)) |
649 |
keylist_add_key (lv, mode, key); |
keylist_add_key (lv, mode, c, key); |
650 |
} |
} |
651 |
} |
} |
652 |
else if (pubkc) { |
else if (pubkc) { |
653 |
gpg_keycache_rewind (pubkc); |
gpg_keycache_rewind (pubkc); |
654 |
while (!err) { |
while (!err) { |
655 |
err = gpg_keycache_next_key (pubkc, 0, &key); |
err = gpg_keycache_next_key2 (pubkc, 0, &c, &key); |
656 |
if (!err) |
if (!err) |
657 |
keylist_add_key (lv, mode, key); |
keylist_add_key (lv, mode, c, key); |
658 |
} |
} |
659 |
} |
} |
660 |
} |
} |
674 |
return NULL; |
return NULL; |
675 |
keylist_load_keycache (lv, mode, pubkc, seckc); |
keylist_load_keycache (lv, mode, pubkc, seckc); |
676 |
keylist_sort (lv, sortby); |
keylist_sort (lv, sortby); |
677 |
if ((mode & KEYLIST_ENCRYPT) || (mode & KEYLIST_ENCRYPT_MIN)) |
if (mode & KEYLIST_ENCRYPT_MIN) |
678 |
keylist_add_groups (lv); |
keylist_add_groups (lv); |
679 |
return lv; |
return lv; |
680 |
} |
} |
684 |
int |
int |
685 |
keylist_reload (listview_ctrl_t lv, gpg_keycache_t pubkc, int mode, int sortby) |
keylist_reload (listview_ctrl_t lv, gpg_keycache_t pubkc, int mode, int sortby) |
686 |
{ |
{ |
687 |
listview_del_all (lv); |
listview_del_all_items (lv); |
688 |
keylist_load_keycache( lv, mode, pubkc, NULL ); |
keylist_load_keycache (lv, mode, pubkc, NULL); |
689 |
keylist_sort (lv, sortby); |
keylist_sort (lv, sortby); |
690 |
return 0; |
return 0; |
691 |
} |
} |
720 |
|
|
721 |
|
|
722 |
static int |
static int |
723 |
do_addkey (listview_ctrl_t lv, gpgme_key_t key, int uididx, int keyidx, int list) |
do_addkey (listview_ctrl_t lv, struct keycache_s *ctx, gpgme_key_t key, |
724 |
|
int uididx, int keyidx, int list) |
725 |
{ |
{ |
726 |
LV_ITEM lvi; |
LV_ITEM lvi; |
727 |
gpgme_user_id_t u; |
gpgme_user_id_t u; |
739 |
return 0; |
return 0; |
740 |
} |
} |
741 |
|
|
742 |
|
if (listview_add_item2 (lv, " ", (void *)ctx)) |
|
if (listview_add_item2 (lv, " ", (void *)key)) |
|
743 |
return WPTERR_GENERAL; |
return WPTERR_GENERAL; |
744 |
|
|
745 |
attr = key->uids->uid; |
attr = ctx->uids->uid; |
746 |
memset (&lvi, 0, sizeof lvi); |
memset (&lvi, 0, sizeof lvi); |
747 |
lvi.mask = LVIF_TEXT | LVIF_PARAM; |
lvi.mask = LVIF_TEXT | LVIF_PARAM | LVIF_IMAGE; |
748 |
lvi.pszText = (char *)attr; |
lvi.pszText = (char *)attr; |
749 |
lvi.lParam = (LPARAM )key; |
lvi.iImage = find_secret_key (key)? 1 : 0; |
750 |
|
lvi.lParam = (LPARAM )ctx; |
751 |
if (ListView_SetItem (lv->ctrl, &lvi) == FALSE) |
if (ListView_SetItem (lv->ctrl, &lvi) == FALSE) |
752 |
return WPTERR_GENERAL; |
return WPTERR_GENERAL; |
753 |
|
|
754 |
if (uididx == -1) { /* request the primary user-id of the key. */ |
if (uididx == -1) { /* request the primary user-id of the key. */ |
755 |
attr = key->uids->uid; |
attr = ctx->uids->uid; |
756 |
uididx = 0; |
uididx = 0; |
757 |
} |
} |
758 |
else { |
else { |
759 |
u = get_nth_userid (key, uididx); |
u = get_nth_userid (key, uididx); |
760 |
if (!u || u->revoked || uididx < 0) |
if (!u || u->revoked || uididx < 0) |
761 |
uididx = 0; /* fixme: this happen sometimes but it's illegal! (<0) */ |
uididx = 0; |
762 |
u = get_nth_userid (key, uididx); |
u = get_nth_userid (key, uididx); |
763 |
attr = u->uid; |
attr = u->uid; |
764 |
} |
} |
765 |
if (attr == NULL || strlen (attr) < 5) { /* normal userids are >= 5 chars */ |
if (attr == NULL || strlen (attr) < 5) { /* normal userids are > 5 chars */ |
766 |
attr = _("Invalid User ID"); |
attr = _("Invalid User ID"); |
767 |
listview_add_sub_item (lv, 0, idx++, attr); |
listview_add_sub_item (lv, 0, idx++, attr); |
768 |
} |
} |
769 |
else { |
else |
770 |
char *uid = utf8_to_wincp (attr, strlen (attr)); |
listview_add_sub_item (lv, 0, idx++, attr); |
|
if (uid) { |
|
|
listview_add_sub_item (lv, 0, idx++, uid); |
|
|
free (uid); |
|
|
} |
|
|
} |
|
771 |
k = get_nth_key (key, keyidx); |
k = get_nth_key (key, keyidx); |
772 |
if (k && k->keyid) { |
if (k && k->keyid) { |
773 |
_snprintf (fmt, sizeof fmt -1, "0x%s", k->keyid + 8); |
_snprintf (fmt, DIM (fmt) -1, "0x%s", k->keyid + 8); |
774 |
listview_add_sub_item( lv, 0, idx++, fmt ); |
listview_add_sub_item (lv, 0, idx++, fmt); |
775 |
} |
} |
776 |
if (list > 0) { |
if (list > 0) { |
777 |
key_attr = find_secret_key (key); |
key_attr = find_secret_key (key); |
791 |
if (attr) |
if (attr) |
792 |
listview_add_sub_item( lv, 0, idx++, attr); |
listview_add_sub_item( lv, 0, idx++, attr); |
793 |
} |
} |
794 |
if( lv->cols >= 4 ) { |
if (lv->cols >= 4) { |
795 |
p = get_key_status( key, uididx, list > 0? 1 : 0 ); |
p = get_key_status( key, uididx, list > 0? 1 : 0 ); |
796 |
if (!p) |
if (!p) |
797 |
return WPTERR_GENERAL; |
return WPTERR_GENERAL; |
815 |
} |
} |
816 |
|
|
817 |
|
|
818 |
|
/* Update a single column @col but for each element in the |
819 |
|
listview @lv. */ |
820 |
void |
void |
821 |
keylist_upd_key (listview_ctrl_t lv, int pos, gpgme_key_t key) |
keylist_upd_col (listview_ctrl_t lv, int col) |
822 |
{ |
{ |
823 |
|
gpgme_key_t key; |
824 |
const char *s; |
const char *s; |
825 |
|
char buf[32], *p; |
826 |
|
int i; |
827 |
|
|
828 |
|
for (i=0; i < listview_count_items (lv, 0); i++) { |
829 |
|
key = km_get_key_ptr (lv, i, NULL); |
830 |
|
if (!key) |
831 |
|
continue; |
832 |
|
switch (col) { |
833 |
|
case KM_COL_KEYID: |
834 |
|
_snprintf (buf, DIM (buf)-1, "0x%s", key->subkeys->keyid+8); |
835 |
|
listview_add_sub_item (lv, i, col, buf); |
836 |
|
break; |
837 |
|
|
838 |
|
case KM_COL_CIPHER: |
839 |
|
s = get_key_algo (key, 0); |
840 |
|
listview_add_sub_item (lv, i, col, s); |
841 |
|
break; |
842 |
|
|
843 |
|
case KM_COL_TYPE: |
844 |
|
s = find_secret_key (key)? "pub/sec" : "pub"; |
845 |
|
listview_add_sub_item (lv, i, col, s); |
846 |
|
break; |
847 |
|
|
848 |
|
case KM_COL_CREAT: |
849 |
|
s = get_key_created (key->subkeys->timestamp); |
850 |
|
listview_add_sub_item (lv, i, col, s); |
851 |
|
break; |
852 |
|
|
853 |
|
case KM_COL_DESC: |
854 |
|
p = get_key_desc (key); |
855 |
|
listview_add_sub_item (lv, i, col, p); |
856 |
|
free_if_alloc (p); |
857 |
|
break; |
858 |
|
} |
859 |
|
} |
860 |
|
} |
861 |
|
|
862 |
|
|
863 |
|
/* Update the listview item at position @pos with the data from |
864 |
|
the key @key. */ |
865 |
|
void |
866 |
|
keylist_upd_key (listview_ctrl_t lv, int pos, |
867 |
|
struct keycache_s *ctx, gpgme_key_t key) |
868 |
|
{ |
869 |
|
const char *s; |
870 |
|
char *p; |
871 |
char tmp[32]; |
char tmp[32]; |
872 |
|
|
873 |
listview_set_item2 (lv, pos, (void *)key); |
listview_set_item2 (lv, pos, (void *)ctx); |
874 |
/* the only mode we support is KYLIST_LIST in the Key Manager */ |
/* the only mode we support is KEYLIST_LIST in the Key Manager */ |
875 |
|
|
876 |
s = key->uids->uid; |
s = ctx->uids->uid; |
877 |
if (s) |
if (s) |
878 |
listview_add_sub_item (lv, pos, 0, s); |
listview_add_sub_item (lv, pos, KM_COL_UID, s); |
879 |
|
|
880 |
s = key->subkeys->keyid; |
s = key->subkeys->keyid; |
881 |
if (s) { |
if (s) { |
882 |
sprintf (tmp, "0x%s", s+8); |
sprintf (tmp, "0x%s", s+8); |
883 |
listview_add_sub_item (lv, pos, 1, tmp); |
listview_add_sub_item (lv, pos, KM_COL_KEYID, tmp); |
884 |
} |
} |
885 |
|
|
886 |
s = find_secret_key (key)? "pub/sec" : "pub"; |
s = find_secret_key (key)? "pub/sec" : "pub"; |
887 |
listview_add_sub_item (lv, pos, 2, s); |
listview_add_sub_item (lv, pos, KM_COL_TYPE, s); |
888 |
|
|
889 |
s = get_key_size (key, 0); |
s = get_key_size (key, 0); |
890 |
if (s) |
if (s) |
891 |
listview_add_sub_item (lv, pos, 3, s); |
listview_add_sub_item (lv, pos, KM_COL_SIZE, s); |
892 |
|
|
893 |
s = get_key_algo (key, 0); |
s = get_key_algo (key, 0); |
894 |
if (s) |
if (s) |
895 |
listview_add_sub_item (lv, pos, 4, s); |
listview_add_sub_item (lv, pos, KM_COL_CIPHER, s); |
896 |
|
|
897 |
s = get_key_status (key, 0, 1); |
p = get_key_status (key, 0, 1); |
898 |
if (s) |
if (p) { |
899 |
listview_add_sub_item (lv, pos, 5, s); |
listview_add_sub_item (lv, pos, KM_COL_VALID, p); |
900 |
|
free_if_alloc (p); |
901 |
|
} |
902 |
|
|
903 |
s = get_key_trust (key, 0, 1); |
s = get_key_trust (key, 0, 1); |
904 |
if (s) |
if (s) |
905 |
listview_add_sub_item (lv, pos, 6, s); |
listview_add_sub_item (lv, pos, KM_COL_TRUST, s); |
906 |
|
|
907 |
long t = key->subkeys->timestamp; |
long t = key->subkeys->timestamp; |
908 |
s = get_key_created (t); |
s = get_key_created (t); |
909 |
if (s) |
if (s) |
910 |
listview_add_sub_item (lv, pos, 7, s); |
listview_add_sub_item (lv, pos, KM_COL_CREAT, s); |
911 |
} |
} |
912 |
|
|
913 |
|
|
914 |
int |
int |
915 |
keylist_add_key (listview_ctrl_t lv, int mode, gpgme_key_t key) |
keylist_add_key (listview_ctrl_t lv, int mode, |
916 |
|
struct keycache_s *ctx, gpgme_key_t key) |
917 |
{ |
{ |
918 |
int uids, rc = 0, i; |
int uids, rc = 0, i; |
919 |
gpgme_subkey_t k; |
gpgme_subkey_t k; |
930 |
|
|
931 |
if (mode & KEYLIST_ALL) { |
if (mode & KEYLIST_ALL) { |
932 |
uids = count_userids (key); |
uids = count_userids (key); |
933 |
rc = do_addkey (lv, key, uids, i, 0); |
rc = do_addkey (lv, ctx, key, uids, i, 0); |
934 |
if (rc) |
if (rc) |
935 |
return rc; |
return rc; |
936 |
} |
} |
937 |
else if (mode & KEYLIST_LIST) |
else if (mode & KEYLIST_LIST) |
938 |
return do_addkey (lv, key, -1, i, 1); |
return do_addkey (lv, ctx, key, -1, i, 1); |
939 |
else if (mode & KEYLIST_ENCRYPT) { |
else if (mode & KEYLIST_ENCRYPT) { |
940 |
if (k->can_encrypt && key_is_useable (k)) { |
if (k->can_encrypt && key_is_useable (k)) { |
941 |
if (mode & KEYLIST_FLAG_FILE) { |
if (mode & KEYLIST_FLAG_FILE) { |
942 |
rc = do_addkey (lv, key, -1, i, -1); |
rc = do_addkey (lv, ctx, key, -1, i, -1); |
943 |
if (rc) |
if (rc) |
944 |
return rc; |
return rc; |
945 |
} |
} |
946 |
else { |
else { |
947 |
for (uids = 0; uids < count_userids (key); uids++) { |
for (uids = 0; uids < count_userids (key); uids++) { |
948 |
rc = do_addkey (lv, key, uids, i, -1); |
rc = do_addkey (lv, ctx, key, uids, i, -1); |
949 |
if (rc) |
if (rc) |
950 |
return rc; |
return rc; |
951 |
} |
} |
955 |
else if (mode & KEYLIST_ENCRYPT_MIN) { |
else if (mode & KEYLIST_ENCRYPT_MIN) { |
956 |
if( k->can_encrypt && key_is_useable (k)) |
if( k->can_encrypt && key_is_useable (k)) |
957 |
{ |
{ |
958 |
rc = do_addkey (lv, key, -1, i, -1); |
rc = do_addkey (lv, ctx, key, -1, i, -1); |
959 |
return rc; |
return rc; |
960 |
} |
} |
961 |
} |
} |
963 |
if (k->can_sign |
if (k->can_sign |
964 |
&& find_secret_key (key) |
&& find_secret_key (key) |
965 |
&& key_is_useable (k)) { |
&& key_is_useable (k)) { |
966 |
rc = do_addkey (lv, key, -1, i, -1); |
rc = do_addkey (lv, ctx, key, -1, i, -1); |
967 |
if (rc) |
if (rc) |
968 |
return rc; |
return rc; |
969 |
} |
} |
971 |
} |
} |
972 |
|
|
973 |
return rc; |
return rc; |
974 |
} /* keylist_add_key */ |
} |
975 |
|
|
976 |
|
|
977 |
int |
int |
978 |
keylist_sort (listview_ctrl_t lv, int sortby) |
keylist_sort (listview_ctrl_t lv, int sortby) |
979 |
{ |
{ |
980 |
return listview_sort_items (lv, sortby, keylist_cmp_cb); |
return listview_sort_items (lv, sortby, keylist_cmp_cb); |
981 |
} |
} |
982 |
|
|
983 |
|
|
984 |
/* Check that the validity @validity is at least >= marginal. */ |
/* Check that the validity @validity is at least >= marginal. */ |
985 |
static int |
static int |
986 |
key_check_validity (const char *validity) |
key_check_validity (gpgme_key_t key) |
987 |
{ |
{ |
988 |
if (strstr (validity, _("Unknown")) || |
gpgme_user_id_t u; |
989 |
strstr (validity, _("Undefined")) || |
|
990 |
strstr (validity, _("Never")) || |
for (u=key->uids; u; u =u->next) { |
991 |
strstr (validity, _("None"))) |
if (u->validity >= GPGME_VALIDITY_MARGINAL) |
992 |
return 0; |
return -1; |
993 |
return 1; |
} |
994 |
|
|
995 |
|
return 0; |
996 |
} |
} |
997 |
|
|
998 |
|
|
1001 |
fully trusted. @r_count returns the number of selected keys. |
fully trusted. @r_count returns the number of selected keys. |
1002 |
Return value: the key list on success, NULL otherwise. */ |
Return value: the key list on success, NULL otherwise. */ |
1003 |
gpgme_key_t* |
gpgme_key_t* |
1004 |
keylist_get_recipients (listview_ctrl_t lv, int *r_force_trust, int *r_count) |
keylist_get_recipients (listview_ctrl_t lv, int *r_force_trust, size_t *r_count) |
1005 |
{ |
{ |
1006 |
int count = 0, force_trust = 0; |
key_array_s *ka = NULL; |
1007 |
|
keycache_s *c; |
1008 |
|
gpgme_key_t *keybuf, key; |
1009 |
|
size_t count = 0; |
1010 |
|
int force_trust = 0; |
1011 |
int n, j, ka_pos = 0, rc = 0; |
int n, j, ka_pos = 0, rc = 0; |
1012 |
int k_pos=0; |
int k_pos=0; |
|
char keyid[32], valid[32], id[100]; |
|
|
key_array_s *ka = NULL; |
|
|
gpgme_key_t *keybuf; |
|
1013 |
|
|
1014 |
n = listview_count_items( lv, 0 ); |
n = listview_count_items (lv, 0); |
1015 |
|
|
1016 |
ka = key_array_new( n ); |
ka = key_array_new (n); |
1017 |
if (!ka) |
if (!ka) |
1018 |
BUG (NULL); |
BUG (NULL); |
1019 |
|
|
1020 |
keybuf = (gpgme_key_t*)calloc (n, sizeof (gpgme_key_t)); |
keybuf = (gpgme_key_t*)calloc (n+1, sizeof (gpgme_key_t)); |
1021 |
if (!keybuf) |
if (!keybuf) |
1022 |
BUG (NULL); |
BUG (NULL); |
1023 |
|
|
1024 |
for( j = 0; j < n; j++ ) { |
for (j = 0; j < n; j++) { |
1025 |
if( listview_get_item_state (lv, j) || n == 1) { |
if (listview_get_item_state (lv, j) || n == 1) { |
1026 |
listview_get_item_text (lv, j, 0, id, sizeof id-1); |
key = km_get_key_ptr (lv, j, &c); |
1027 |
listview_get_item_text (lv, j, 1, keyid, sizeof keyid - 1); |
if (!key) |
1028 |
listview_get_item_text (lv, j, 4, valid, sizeof valid -1); |
BUG (0); |
1029 |
if( !key_check_validity (valid) |
if (!key_check_validity (key) && |
1030 |
&& !key_array_search( ka, ka_pos, keyid )) { |
!key_array_search (ka, ka_pos, key->subkeys->keyid)) { |
1031 |
char *warn = new char[512+strlen (id) + 1]; |
char *warn = new char[512+strlen (c->uids->uid) + 1]; |
1032 |
if (!warn) |
if (!warn) |
1033 |
BUG (0); |
BUG (0); |
1034 |
sprintf (warn, |
sprintf (warn, |
1036 |
"named in the user ID. If you *really* know what you are\n" |
"named in the user ID. If you *really* know what you are\n" |
1037 |
"doing, you may answer the next question with yes\n" |
"doing, you may answer the next question with yes\n" |
1038 |
"\n" |
"\n" |
1039 |
"Use \"%s\" anyway?"), id); |
"Use \"%s\" anyway?"), c->uids->uid); |
1040 |
if (reg_prefs.always_trust) |
if (reg_prefs.always_trust) |
1041 |
rc = IDYES; |
rc = IDYES; |
1042 |
else |
else |
1043 |
rc = msg_box (NULL, warn, _("Recipients"), MB_ERR_ASK); |
rc = msg_box (NULL, warn, _("Recipients"), MB_ERR_ASK); |
1044 |
if (rc == IDYES) { |
if (rc == IDYES) { |
1045 |
gpgme_key_t k; |
keybuf[k_pos++] = key; |
|
get_pubkey (keyid, &k); |
|
|
keybuf[k_pos++] = k; |
|
1046 |
force_trust++; |
force_trust++; |
1047 |
ka[ka_pos].checked = 1; |
ka[ka_pos].checked = 1; |
1048 |
strcpy (ka[ka_pos++].keyid, keyid); |
strcpy (ka[ka_pos++].keyid, key->subkeys->keyid); |
1049 |
count++; |
count++; |
1050 |
} |
} |
1051 |
free_if_alloc (warn); |
free_if_alloc (warn); |
1052 |
} |
} |
1053 |
else { |
else { |
1054 |
gpgme_key_t k; |
keybuf[k_pos++] = key; |
|
listview_get_item_text( lv, j, 1, keyid, sizeof keyid -1 ); |
|
|
get_pubkey (keyid, &k); |
|
|
keybuf[k_pos++] = k; |
|
1055 |
count++; |
count++; |
1056 |
} |
} |
1057 |
} |
} |
1066 |
|
|
1067 |
|
|
1068 |
static int |
static int |
1069 |
keylist_get_keyflags (const char *buf, size_t buflen) |
keylist_get_keyflags (gpgme_key_t key) |
1070 |
{ |
{ |
1071 |
int c = 0, flags = 0; |
int flags = KEYFLAG_NONE; |
1072 |
|
|
1073 |
if( *buf != '[' ) |
if (key->revoked) |
1074 |
return KEYFLAG_NONE; |
flags |= KEYFLAG_REVOKED; |
1075 |
while (buf && c != ']') |
if (key->expired) |
1076 |
{ |
flags |= KEYFLAG_EXPIRED; |
1077 |
c = *buf++; |
if (key->disabled) |
1078 |
if (c == 'R') |
flags |= KEYFLAG_DISABLED; |
|
flags |= KEYFLAG_REVOKED; |
|
|
if (c == 'E') |
|
|
flags |= KEYFLAG_EXPIRED; |
|
|
if (c == 'D') |
|
|
flags |= KEYFLAG_DISABLED; |
|
|
} |
|
1079 |
|
|
1080 |
return flags; |
return flags; |
1081 |
} /* keylist_get_keyflags */ |
} |
1082 |
|
|
1083 |
|
|
1084 |
gpgme_key_t* |
gpgme_key_t* |
1085 |
keylist_enum_recipients (listview_ctrl_t lv, int listype, int *r_count) |
keylist_enum_recipients (listview_ctrl_t lv, int listype, size_t *r_count) |
1086 |
{ |
{ |
1087 |
gpgme_key_t* rset; |
struct keycache_s *c; |
1088 |
gpgme_key_t k; |
gpgme_key_t *rset; |
1089 |
int i, n, id, k_pos=0; |
gpgme_key_t key; |
1090 |
char keyid[32], t[128], t2[128]; |
size_t k_pos = 0; |
1091 |
|
int i, n, id; |
1092 |
|
|
1093 |
n = listview_count_items (lv, 0); |
n = listview_count_items (lv, 0); |
1094 |
if (!n) |
if (!n) |
1095 |
return 0; |
return 0; |
1096 |
rset = (gpgme_key_t*)calloc (n, sizeof (gpgme_key_t)); |
rset = (gpgme_key_t*)calloc (n+1, sizeof (gpgme_key_t)); |
1097 |
if (!rset) |
if (!rset) |
1098 |
BUG (NULL); |
BUG (NULL); |
1099 |
for( i = 0; i < n; i++ ) { |
for (i = 0; i < n; i++) { |
1100 |
if( !listview_get_item_state( lv, i ) ) |
if (!listview_get_item_state (lv, i)) |
1101 |
continue; |
continue; |
1102 |
listview_get_item_text( lv, i, 1, keyid, sizeof keyid - 1 ); |
key = km_get_key_ptr (lv, i, &c); |
1103 |
switch( listype ) { |
switch (listype) { |
1104 |
case KEYLIST_LIST: |
case KEYLIST_LIST: |
1105 |
listview_get_item_text( lv, i, 5, t, sizeof t - 1 ); |
if (keylist_get_keyflags (key) & KEYFLAG_REVOKED) { |
1106 |
if( keylist_get_keyflags( t, strlen( t ) ) & KEYFLAG_REVOKED ) { |
id = printf_box (_("Recipients"), MB_INFO|MB_YESNO, |
1107 |
_snprintf( t2, sizeof t2 -1, |
_("KeyID %s.\nDo you really want to export a revoked key?"), |
1108 |
_("KeyID %s.\nDo you really want to export a revoked key?"), keyid ); |
c->uids->uid); |
1109 |
id = msg_box( lv->ctrl, t2, _("Recipients"), MB_INFO|MB_YESNO ); |
if (id == IDNO) |
1110 |
if( id == IDNO ) |
continue; |
|
continue; |
|
1111 |
} |
} |
1112 |
break; |
break; |
1113 |
} |
} |
1114 |
get_pubkey (keyid, &k); |
rset[k_pos++] = key; |
|
rset[k_pos++] = k; |
|
1115 |
} |
} |
1116 |
if (r_count) |
if (r_count) |
1117 |
*r_count = k_pos; |
*r_count = k_pos; |
1118 |
return rset; |
return rset; |
1119 |
} /* keylist_enum_recipients */ |
} |
1120 |
|
|
1121 |
|
|
1122 |
void |
void |
1123 |
seclist_destroy (keylist_t * list) |
seclist_destroy (keylist_t *list) |
1124 |
{ |
{ |
1125 |
keylist_t l2; |
keylist_t l2; |
1126 |
while (*list) { |
while (*list) { |
1129 |
*list = l2; |
*list = l2; |
1130 |
} |
} |
1131 |
list = NULL; |
list = NULL; |
1132 |
} /* seclist_destroy */ |
} |
1133 |
|
|
1134 |
|
|
1135 |
void |
void |
1166 |
if (key->disabled || !key_is_useable (key->subkeys)) |
if (key->disabled || !key_is_useable (key->subkeys)) |
1167 |
continue; |
continue; |
1168 |
|
|
1169 |
uid = utf8_to_wincp (id, strlen (id)); |
uid = utf8_to_native (id); |
1170 |
size = strlen( uid ) + strlen( keyid ) + 32; |
size = strlen (uid) + strlen (keyid) + 32; |
1171 |
inf = new char[size+1]; |
inf = new char[size+1]; |
1172 |
if( !inf ) |
if (!inf) |
1173 |
BUG( NULL ); |
BUG (NULL); |
1174 |
_snprintf (inf, size, "%s (%s/0x%s)", uid, |
_snprintf (inf, size, "%s (%s/0x%s)", uid, |
1175 |
get_key_pubalgo (key->subkeys->pubkey_algo), keyid + 8); |
get_key_pubalgo (key->subkeys->pubkey_algo), keyid + 8); |
1176 |
combox_add_string (kb, inf); |
combox_add_string (kb, inf); |
1177 |
free_if_alloc (inf); |
free_if_alloc (inf); |
1188 |
l2->next = l; |
l2->next = l; |
1189 |
} |
} |
1190 |
} |
} |
1191 |
for( pos = 0, l2=list; pos < SendMessage( kb, CB_GETCOUNT, 0, 0 ); pos++, l2=l2->next ) |
for (pos = 0, l2=list; pos < SendMessage (kb, CB_GETCOUNT, 0, 0); |
1192 |
SendMessage( kb, CB_SETITEMDATA, pos, (LPARAM)(DWORD)l2->key ); |
pos++, l2=l2->next) |
1193 |
SendMessage( kb, CB_SETCURSEL, 0, 0 ); |
SendMessage (kb, CB_SETITEMDATA, pos, (LPARAM)(DWORD)l2->key); |
1194 |
|
SendMessage (kb, CB_SETCURSEL, 0, 0); |
1195 |
*ret_list = list; |
*ret_list = list; |
1196 |
} |
} |
1197 |
|
|