| Commit message (Collapse) | Author | Files | Lines |
|---|
|
|
|
This formats all copyright comments according to SPDX formatting guidelines.
Additionally, this resolves the remaining GPLv2 only licensed files by relicensing them to GPLv2.0-or-later.
|
|
|
|
|
|
Recent changes to the build system that made more warnings be flagged as
errors caused building via clang to break.
Fixes #4795
|
|
Same behavior, minus unnecessary inclusions where not necessary.
|
|
Fills in some hashes that were previously unhandled.
|
|
Previously the constructor for all of these would run at program
startup, consuming time before the application can enter main().
This is also particularly dangerous, given the logging system wouldn't
have been initialized properly yet, yet the program would use the logs
to signify an error.
To rectify this, we can replace the literals with constexpr functions
that perform the conversion at compile-time, completely eliminating the
runtime cost of initializing these arrays.
|
|
We can use sizeof to make it obvious at the call site where the value is
coming from.
|
|
In a few places, the data to be set as the IV is already within an array.
We shouldn't require this data to be heap-allocated if it doesn't need
to be. This allows certain callers to reduce heap churn.
|
|
|
|
These functions are marked for deprecation and it's recommended that the
*_ret variants be used instead.
|
|
|
|
|
|
Previously, this TU contained the necessary headers to parse KIP/INI but now it should just use the FileSys class.
|
|
Fixes a fatal crash on start when deriving keys.
|
|
|
|
We can just reserve the memory then perform successive insertions
instead of needing to use memcpy. This also avoids the need to zero out
the output vector's memory before performing the insertions.
We can also std::move the output std::vector into the destination so
that we don't need to make a completely new copy of the vector, getting
rid of an unnecessary allocation.
Additionally, we can use iterators to determine the beginning and end
ranges of the std::vector instances that comprise the output vector, as
the end of one range just becomes the beginning for the next successive
range, and since std::vector's iterator constructor copies data within
the range [begin, end), this is more straightforward and gets rid of the
need to have an offset variable that keeps getting incremented to
determine where to do the next std::memcpy.
|
|
Aside from emplacing elements into the map, the map itself is never
actually queried for contained data.
|
|
These are only ever read from, so we don't need to make a copy of all
the keys here.
|
|
Given it's only used in one spot and has a fairly generic name, we can
just specify it directly in the function call. This also the benefit of
automatically moving it.
|
|
Commented out code shouldn't be left in without a reason indicating why
in a comment.
|
|
|
|
Instead, we can make it part of the type and make named variables for
them, so they only require one definition (and if they ever change for
whatever reason, they only need to be changed in one spot).
|
|
Given the VirtualFile instance isn't stored into the class as a data
member, or written to, this can just be turned into a const reference,
as the constructor doesn't need to make a copy of it.
|
|
Orders the members in the exact order they would be initialized. This
also prevents compiler warnings about this sort of thing.
|
|
Gets unused includes out of the headers and moves them into the cpp file
if they're used there instead.
|
|
x
|
|
Keeps track of system files for key derivation
|
