X-Git-Url: https://git.dogcows.com/gitweb?a=blobdiff_plain;f=lib%2FFile%2FKDBX.pm;h=255958afb60f92123b73089d5dfcbce71bbdcf3a;hb=84a35b3fe4421abbe930586dd3a214cbb15da9b7;hp=e7d11b3e3848d7ec8ee69dd4b1d5221a062622c1;hpb=2e2a003e118803b164b17bed666c10c829480564;p=chaz%2Fp5-File-KDBX diff --git a/lib/File/KDBX.pm b/lib/File/KDBX.pm index e7d11b3..255958a 100644 --- a/lib/File/KDBX.pm +++ b/lib/File/KDBX.pm @@ -264,7 +264,7 @@ has 'meta.database_description' => '', coer has 'meta.database_description_changed' => sub { gmtime }, coerce => \&to_time; has 'meta.default_username' => '', coerce => \&to_string; has 'meta.default_username_changed' => sub { gmtime }, coerce => \&to_time; -has 'meta.maintenance_history_days' => 0, coerce => \&to_number; +has 'meta.maintenance_history_days' => HISTORY_DEFAULT_MAX_AGE, coerce => \&to_number; has 'meta.color' => '', coerce => \&to_string; has 'meta.master_key_changed' => sub { gmtime }, coerce => \&to_time; has 'meta.master_key_change_rec' => -1, coerce => \&to_number; @@ -398,8 +398,9 @@ because it autovivifies when adding entries and groups to the database. Every database has only a single root group at a time. Some old KDB files might have multiple root groups. When reading such files, a single implicit root group is created to contain the actual root groups. When writing to such a format, if the root group looks like it was implicitly created then it won't be written and -the resulting file might have multiple root groups. This allows working with older files without changing -their written internal structure while still adhering to modern semantics while the database is opened. +the resulting file might have multiple root groups, as it was before loading. This allows working with older +files without changing their written internal structure while still adhering to modern semantics while the +database is opened. The root group of a KDBX database contains all of the database's entries and other groups. If you replace the root group, you are essentially replacing the entire database contents with something else. @@ -592,7 +593,7 @@ Add a group to a database. This is equivalent to identifying a parent group and L on the parent group, forwarding the arguments. Available options: =for :list -* C (aka C) - Group object or group UUID to add the group to (default: root group) +* C - Group object or group UUID to add the group to (default: root group) =cut @@ -602,7 +603,7 @@ sub add_group { my %args = @_; # find the right group to add the group to - my $parent = delete $args{group} // delete $args{parent} // $self->root; + my $parent = delete $args{group} // $self->root; $parent = $self->groups->grep({uuid => $parent})->next if !ref $parent; $parent or throw 'Invalid group'; @@ -649,7 +650,7 @@ Add a entry to a database. This is equivalent to identifying a parent group and L on the parent group, forwarding the arguments. Available options: =for :list -* C (aka C) - Group object or group UUID to add the entry to (default: root group) +* C - Group object or group UUID to add the entry to (default: root group) =cut @@ -659,7 +660,7 @@ sub add_entry { my %args = @_; # find the right group to add the entry to - my $parent = delete $args{group} // delete $args{parent} // $self->root; + my $parent = delete $args{group} // $self->root; $parent = $self->groups->grep({uuid => $parent})->next if !ref $parent; $parent or throw 'Invalid group'; @@ -1154,11 +1155,11 @@ our %PLACEHOLDERS = ( $kdbx->lock; -Encrypt all protected binaries strings in a database. The encrypted strings are stored in -a L associated with the database and the actual strings will be replaced with C to +Encrypt all protected strings and binaries in a database. The encrypted data is stored in +a L associated with the database and the actual values will be replaced with C to indicate their protected state. Returns itself to allow method chaining. -You can call C on an already-locked database to memory-protect any unprotected strings and binaries +You can call C on an already-locked database to memory-protect any unprotected strings and binaries added after the last time the database was locked. =cut @@ -1191,8 +1192,8 @@ sub lock { $kdbx->unlock; -Decrypt all protected strings in a database, replacing C placeholders with unprotected values. Returns -itself to allow method chaining. +Decrypt all protected strings and binaries in a database, replacing C value placeholders with their +actual, unprotected values. Returns itself to allow method chaining. =cut @@ -1215,6 +1216,14 @@ C if the database is already unlocked. See L and L. +Example: + + { + my $guard = $kdbx->unlock_scoped; + ...; + } + # $kdbx is now memory-locked + =cut sub unlock_scoped { @@ -1248,13 +1257,13 @@ sub peek { $bool = $kdbx->is_locked; -Get whether or not a database's strings are memory-protected. If this is true, then some or all of the -protected strings within the database will be unavailable (literally have C values) until L is -called. +Get whether or not a database's contents are in a locked (i.e. memory-protected) state. If this is true, then +some or all of the protected strings and binaries within the database will be unavailable (literally have +C values) until L is called. =cut -sub is_locked { $_[0]->_safe ? 1 : 0 } +sub is_locked { !!$_[0]->_safe } ############################################################################## @@ -1368,7 +1377,7 @@ sub prune_history { my $max_items = $args{max_items} // $self->history_max_items // HISTORY_DEFAULT_MAX_ITEMS; my $max_size = $args{max_size} // $self->history_max_size // HISTORY_DEFAULT_MAX_SIZE; - my $max_age = $args{max_age} // HISTORY_DEFAULT_MAX_AGE; + my $max_age = $args{max_age} // $self->maintenance_history_days // HISTORY_DEFAULT_MAX_AGE; my @removed; $self->entries->each(sub { @@ -1418,7 +1427,8 @@ sub randomize_seeds { $key = $kdbx->key($primitive); Get or set a L. This is the master key (e.g. a password or a key file that can decrypt -a database). See L for an explanation of what the primitive can be. +a database). You can also pass a primitive that can be cast to a B. See L for an +explanation of what the primitive can be. You generally don't need to call this directly because you can provide the key directly to the loader or dumper when loading or dumping a KDBX file. @@ -1436,10 +1446,11 @@ sub key { $key = $kdbx->composite_key($key); $key = $kdbx->composite_key($primitive); -Construct a L from a primitive. See L for an explanation of -what the primitive can be. If the primitive does not represent a composite key, it will be wrapped. +Construct a L from a B or primitive. See L for an +explanation of what the primitive can be. If the primitive does not represent a composite key, it will be +wrapped. -You generally don't need to call this directly. The parser and writer use it to transform a master key into +You generally don't need to call this directly. The loader and dumper use it to transform a master key into a raw encryption key. =cut @@ -1522,7 +1533,7 @@ cipher), not a L or primitive. If not passed, the UUID comes from C<< $kdbx->headers->{cipher_id} >> and the encryption IV comes from C<< $kdbx->headers->{encryption_iv} >>. -You generally don't need to call this directly. The parser and writer use it to decrypt and encrypt KDBX +You generally don't need to call this directly. The loader and dumper use it to decrypt and encrypt KDBX files. =cut @@ -1550,7 +1561,7 @@ C<< $kdbx->headers->{inner_random_stream_key} >> (respectively) for KDBX3 files C<< $kdbx->inner_headers->{inner_random_stream_key} >> and C<< $kdbx->inner_headers->{inner_random_stream_id} >> (respectively) for KDBX4 files. -You generally don't need to call this directly. The parser and writer use it to scramble protected strings. +You generally don't need to call this directly. The loader and dumper use it to scramble protected strings. =cut @@ -1792,10 +1803,6 @@ When a new entry is created, the I string will be populated with this Timestamp indicating when the default username was last changed. -=attr maintenance_history_days - -TODO... not really sure what this is. 😀 - =attr color A color associated with the database (in the form C<#ffffff> where "f" is a hexidecimal digit). Some agents @@ -1832,7 +1839,7 @@ The UUID of a group used to store thrown-away groups and entries. =attr recycle_bin_changed -Timestamp indicating when the recycle bin was last changed. +Timestamp indicating when the recycle bin group was last changed. =attr entry_templates_group @@ -1852,11 +1859,15 @@ The UUID of the group visible at the top of the list. =attr history_max_items -The maximum number of historical entries allowed to be saved for each entry. +The maximum number of historical entries that should be kept for each entry. Default is 10. =attr history_max_size -The maximum total size (in bytes) that each individual entry's history is allowed to grow. +The maximum total size (in bytes) that each individual entry's history is allowed to grow. Default is 6 MiB. + +=attr maintenance_history_days + +The maximum age (in days) historical entries should be kept. Default it 365. =attr settings_changed @@ -1921,14 +1932,14 @@ See L for more examples. =head1 DESCRIPTION -B provides everything you need to work with a KDBX database. A KDBX database is a hierarchical +B provides everything you need to work with KDBX databases. A KDBX database is a hierarchical object database which is commonly used to store secret information securely. It was developed for the KeePass password safe. See L for more information about KDBX. -This module lets you query entries, create new entries, delete entries and modify entries. The distribution -also includes various parsers and generators for serializing and persisting databases. +This module lets you query entries, create new entries, delete entries, modify entries and more. The +distribution also includes various parsers and generators for serializing and persisting databases. -This design of this software was influenced by the L +The design of this software was influenced by the L implementation of KeePass as well as the L module. B is an alternative module that works well in most cases but has a small backlog of bugs and security issues and also does not work with newer KDBX version 4 files. If you're coming here from the B world, you might be interested in @@ -1939,15 +1950,13 @@ minor changes up until a 1.0 release. Breaking changes will be noted in the F) * ☑ Unicode character strings * ☑ L Searching * ☑ L and L -* ☑ L +* ☑ L * ☑ L * ☑ L * ☑ Challenge-response key components, like L @@ -1967,7 +1976,7 @@ associated with each entry, group and the database as a whole. You can think of a KDBX database kind of like a file system, where groups are directories, entries are files, and strings and binaries make up a file's contents. -Databases are typically persisted as a encrypted, compressed files. They are usually accessed directly (i.e. +Databases are typically persisted as encrypted, compressed files. They are usually accessed directly (i.e. not over a network). The primary focus of this type of database is data security. It is ideal for storing relatively small amounts of data (strings and binaries) that must remain secret except to such individuals as have the correct I. Even if the database file were to be "leaked" to the public Internet, it @@ -2150,9 +2159,9 @@ unfortunately not portable. To find things in a KDBX database, you should use a filtered iterator. If you have an iterator, such as returned by L, L or even L you can filter it using L. - my $filtered_entries = $kdbx->entries->where($query); + my $filtered_entries = $kdbx->entries->where(\&query); -A C<$query> is just a subroutine that you can either write yourself or have generated for you from either +A C<\&query> is just a subroutine that you can either write yourself or have generated for you from either a L or L. It's easier to have your query generated, so I'll cover that first. @@ -2263,7 +2272,7 @@ operators are: * C<==> - Number equal * C - Number not equal * C<< < >> - Number less than -* C<< > >>> - Number greater than +* C<< > >> - Number greater than * C<< <= >> - Number less than or equal * C<< >= >> - Number less than or equal * C<=~> - String match regular expression @@ -2392,17 +2401,16 @@ If you have a database tree like this: - Group3 - EntryC -IDS order of groups is: Root, Group1, Group2, Group3 -IDS order of entries is: EntryA, EntryB, EntryC -IDS order of objects is: Root, Group1, EntryA, Group2, EntryB, Group3, EntryC - -DFS order of groups is: Group2, Group1, Group3, Root -DFS order of entries is: EntryB, EntryA, EntryC -DFS order of objects is: Group2, EntryB, Group1, EntryA, Group3, EntryC, Root - -BFS order of groups is: Root, Group1, Group3, Group2 -BFS order of entries is: EntryA, EntryC, EntryB -BFS order of objects is: Root, Group1, EntryA, Group3, EntryC, Group2, EntryB +=for :list +* IDS order of groups is: Root, Group1, Group2, Group3 +* IDS order of entries is: EntryA, EntryB, EntryC +* IDS order of objects is: Root, Group1, EntryA, Group2, EntryB, Group3, EntryC +* DFS order of groups is: Group2, Group1, Group3, Root +* DFS order of entries is: EntryB, EntryA, EntryC +* DFS order of objects is: Group2, EntryB, Group1, EntryA, Group3, EntryC, Root +* BFS order of groups is: Root, Group1, Group3, Group2 +* BFS order of entries is: EntryA, EntryC, EntryB +* BFS order of objects is: Root, Group1, EntryA, Group3, EntryC, Group2, EntryB =head1 SYNCHRONIZING @@ -2492,4 +2500,24 @@ when trying to use such features with undersized IVs. * L has overlapping functionality. It's good but has a backlog of some pretty critical bugs and lacks support for newer KDBX features. +=begin :header + +=begin markdown + +[![Linux](https://github.com/chazmcgarvey/File-KDBX/actions/workflows/linux.yml/badge.svg)](https://github.com/chazmcgarvey/File-KDBX/actions/workflows/linux.yml) +[![macOS](https://github.com/chazmcgarvey/File-KDBX/actions/workflows/macos.yml/badge.svg)](https://github.com/chazmcgarvey/File-KDBX/actions/workflows/macos.yml) +[![Windows](https://github.com/chazmcgarvey/File-KDBX/actions/workflows/windows.yml/badge.svg)](https://github.com/chazmcgarvey/File-KDBX/actions/workflows/windows.yml) + +=end markdown + +=begin HTML + + + + + +=end HTML + +=end :header + =cut