mirror of
git://git.gnupg.org/gnupg.git
synced 2025-07-03 22:56:33 +02:00
* keyedit.c (show_key_with_all_names_colon): Make --with-colons --edit
display match the validity and trust of --with-colons --list-keys. * passphrase.c (agent_send_all_options): Fix compile warning. * keylist.c (list_keyblock_colon): Validity for subkeys should match that of the primary key, and not that of the last user ID.
This commit is contained in:
parent
7178a8056c
commit
5ecf0cbd79
4 changed files with 65 additions and 20 deletions
|
@ -650,7 +650,6 @@ list_keyblock_colon( KBNODE keyblock, int secret, int fpr )
|
|||
sk = NULL;
|
||||
keyid_from_pk( pk, keyid );
|
||||
fputs( "pub:", stdout );
|
||||
trustletter = 0;
|
||||
if ( !pk->is_valid )
|
||||
putchar ('i');
|
||||
else if ( pk->is_revoked )
|
||||
|
@ -711,6 +710,7 @@ list_keyblock_colon( KBNODE keyblock, int secret, int fpr )
|
|||
}
|
||||
else {
|
||||
byte namehash[20];
|
||||
int uid_validity;
|
||||
|
||||
if( pk && !ulti_hack ) {
|
||||
if( node->pkt->pkt.user_id->attrib_data )
|
||||
|
@ -721,11 +721,11 @@ list_keyblock_colon( KBNODE keyblock, int secret, int fpr )
|
|||
rmd160_hash_buffer( namehash,
|
||||
node->pkt->pkt.user_id->name,
|
||||
node->pkt->pkt.user_id->len );
|
||||
trustletter = get_validity_info( pk, namehash );
|
||||
uid_validity = get_validity_info( pk, namehash );
|
||||
}
|
||||
else
|
||||
trustletter = 'u';
|
||||
printf("%s:%c::::::::",str,trustletter);
|
||||
uid_validity = 'u';
|
||||
printf("%s:%c::::::::",str,uid_validity);
|
||||
}
|
||||
}
|
||||
if(node->pkt->pkt.user_id->attrib_data)
|
||||
|
@ -774,7 +774,9 @@ list_keyblock_colon( KBNODE keyblock, int secret, int fpr )
|
|||
else if ( opt.fast_list_mode || opt.no_expensive_trust_checks )
|
||||
;
|
||||
else {
|
||||
printf("%c", trustletter );
|
||||
/* trustletter should always be defined here */
|
||||
if(trustletter)
|
||||
printf("%c", trustletter );
|
||||
}
|
||||
printf(":%u:%d:%08lX%08lX:%s:%s:",
|
||||
nbits_from_pk( pk2 ),
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue