| // Copyright 1995-2016 The OpenSSL Project Authors. All Rights Reserved. | |
| // | |
| // Licensed under the Apache License, Version 2.0 (the "License"); | |
| // you may not use this file except in compliance with the License. | |
| // You may obtain a copy of the License at | |
| // | |
| // https://www.apache.org/licenses/LICENSE-2.0 | |
| // | |
| // Unless required by applicable law or agreed to in writing, software | |
| // distributed under the License is distributed on an "AS IS" BASIS, | |
| // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
| // See the License for the specific language governing permissions and | |
| // limitations under the License. | |
| #ifndef OPENSSL_HEADER_CRYPTO_FIPSMODULE_CIPHER_INTERNAL_H | |
| #define OPENSSL_HEADER_CRYPTO_FIPSMODULE_CIPHER_INTERNAL_H | |
| #include <openssl/base.h> | |
| #include <openssl/aead.h> | |
| #include <openssl/aes.h> | |
| #include <openssl/span.h> | |
| #include "../../internal.h" | |
| #include "../../mem_internal.h" | |
| #include "../aes/internal.h" | |
| #include <algorithm> | |
| #include <functional> | |
| #include <optional> | |
| #include <type_traits> | |
| extern "C" { | |
| // EVP_CIPH_MODE_MASK contains the bits of `flags` that represent the mode. | |
| #define EVP_CIPH_MODE_MASK 0x3f | |
| // EVP_AEAD represents a specific AEAD algorithm. | |
| struct evp_aead_st { | |
| uint8_t key_len; | |
| uint8_t nonce_len; | |
| uint8_t overhead; | |
| uint8_t max_tag_len; | |
| // init initialises an `EVP_AEAD_CTX`. If this call returns zero then | |
| // `cleanup` will not be called for that context. | |
| int (*init)(EVP_AEAD_CTX *, const uint8_t *key, size_t key_len, | |
| size_t tag_len); | |
| int (*init_with_direction)(EVP_AEAD_CTX *, const uint8_t *key, size_t key_len, | |
| size_t tag_len, enum evp_aead_direction_t dir); | |
| void (*cleanup)(EVP_AEAD_CTX *); | |
| // AEADs need to provide one of the following sets of methods: | |
| // | |
| // - openv + sealv: variable tag length AEAD. | |
| // - openv_detached + sealv: fixed tag length AEAD. | |
| int (*openv)(const EVP_AEAD_CTX *ctx, bssl::Span<const CRYPTO_IOVEC> iovecs, | |
| size_t *out_total_bytes, bssl::Span<const uint8_t> nonce, | |
| bssl::Span<const CRYPTO_IVEC> aadvecs); | |
| int (*sealv)(const EVP_AEAD_CTX *ctx, bssl::Span<const CRYPTO_IOVEC> iovecs, | |
| bssl::Span<uint8_t> out_tag, size_t *out_tag_len, | |
| bssl::Span<const uint8_t> nonce, | |
| bssl::Span<const CRYPTO_IVEC> aadvecs); | |
| int (*openv_detached)(const EVP_AEAD_CTX *ctx, | |
| bssl::Span<const CRYPTO_IOVEC> iovecs, | |
| bssl::Span<const uint8_t> nonce, | |
| bssl::Span<const uint8_t> in_tag, | |
| bssl::Span<const CRYPTO_IVEC> aadvecs); | |
| int (*get_iv)(const EVP_AEAD_CTX *ctx, const uint8_t **out_iv, | |
| size_t *out_len); | |
| size_t (*tag_len)(const EVP_AEAD_CTX *ctx, size_t in_len); | |
| }; | |
| struct evp_cipher_st { | |
| // type contains a NID identifying the cipher. (e.g. NID_aes_128_gcm.) | |
| int nid; | |
| // block_size contains the block size, in bytes, of the cipher, or 1 for a | |
| // stream cipher. | |
| unsigned block_size; | |
| // key_len contains the key size, in bytes, for the cipher. If the cipher | |
| // takes a variable key size then this contains the default size. | |
| unsigned key_len; | |
| // iv_len contains the IV size, in bytes, or zero if inapplicable. | |
| unsigned iv_len; | |
| // ctx_size contains the size, in bytes, of the per-key context for this | |
| // cipher. | |
| unsigned ctx_size; | |
| // flags contains the OR of a number of flags. See `EVP_CIPH_*`. | |
| uint32_t flags; | |
| int (*init)(EVP_CIPHER_CTX *ctx, const uint8_t *key, const uint8_t *iv, | |
| int enc); | |
| // cipher encrypts/decrypts `in`, write output to `out`. Writes exactly `len` | |
| // bytes, which must be a multiple of the `block_size`. | |
| // | |
| // For ciphers where encryption and decryption operations differ, `init` | |
| // shall set an internal state for this. | |
| // | |
| // Returns 1 on success, or 0 on error. | |
| int (*cipher_update)(EVP_CIPHER_CTX *ctx, uint8_t *out, const uint8_t *in, | |
| size_t len); | |
| // cipher_final finalizes the cipher, performing possible final | |
| // authentication checks. | |
| // | |
| // Only used for `EVP_CIPH_FLAG_CUSTOM_CIPHER` ciphers. | |
| // | |
| // Returns 1 on success, or 0 on error. When decrypting, if an error is | |
| // returned, the decrypted data must not be used. | |
| int (*cipher_final)(EVP_CIPHER_CTX *ctx); | |
| // update_aad adds `in` (of length `inl`) to the authenticated data for the | |
| // encryption operation. | |
| // | |
| // Only used for `EVP_CIPH_FLAG_CUSTOM_CIPHER` ciphers. | |
| // | |
| // Returns 1 on success, or 0 on error. | |
| int (*update_aad)(EVP_CIPHER_CTX *ctx, const uint8_t *in, size_t inl); | |
| // cleanup, if non-NULL, releases memory associated with the context. It is | |
| // called if `EVP_CTRL_INIT` succeeds. Note that `init` may not have been | |
| // called at this point. | |
| void (*cleanup)(EVP_CIPHER_CTX *); | |
| int (*ctrl)(EVP_CIPHER_CTX *, int type, int arg, void *ptr); | |
| }; | |
| } // extern C | |
| BSSL_NAMESPACE_BEGIN | |
| // CopySpan copies an entire span of bytes from `from` to `to`. | |
| // | |
| // The spans need to have the same length. | |
| inline void CopySpan(Span<const uint8_t> from, Span<uint8_t> to) { | |
| BSSL_CHECK(from.size() == to.size()); | |
| std::copy(from.begin(), from.end(), to.begin()); | |
| } | |
| // CopyToPrefix copies a span of bytes from `from` into `to`. It aborts | |
| // if there is not enough space. | |
| // | |
| // TODO(crbug.com/404286922): Can we simplify this in a C++20 world (e.g. | |
| // std::ranges::copy)? Must preserve range checking on the destination span. | |
| inline void CopyToPrefix(Span<const uint8_t> from, Span<uint8_t> to) { | |
| CopySpan(from, to.first(from.size())); | |
| } | |
| // Generic CRYPTO_IOVEC/CRYPTO_IVEC helpers. | |
| namespace iovec { | |
| // IsValid returns whether the given `CRYPTO_IVEC` or `CRYPTO_IOVEC` is | |
| // valid for use with public APIs, i.e. does not contain more than `SIZE_MAX` | |
| // bytes. Note that the `EVP_AEAD` methods need to accept an arbitrary number | |
| // of chunks. | |
| template <typename IVec> | |
| inline bool IsValid(Span<IVec> ivecs) { | |
| size_t allowed = SIZE_MAX; | |
| for (const IVec &ivec : ivecs) { | |
| size_t len = ivec.len; | |
| if (len > allowed) { | |
| return false; | |
| } | |
| allowed -= len; | |
| } | |
| return true; | |
| } | |
| // Length returns the total length in bytes of a given `CRYPTO_IVEC` or | |
| // `CRYPTO_IOVEC`. | |
| template <typename IVec> | |
| inline size_t TotalLength(Span<IVec> ivecs) { | |
| size_t total = 0; | |
| for (const IVec &ivec : ivecs) { | |
| total += ivec.len; | |
| } | |
| return total; | |
| } | |
| // GetAndRemoveSuffix takes `suffix_buf.size()` final bytes from the given | |
| // `CRYPTO_IVEC` or `CRYPTO_IOVEC` (mutating said iovec to no longer contain | |
| // those bytes) and returns them. | |
| // | |
| // If the byte range is contained in a single chunk of `ivecs`, it will just | |
| // return that span pointing into `ivecs`; otherwise, it will copy the bytes | |
| // into `out` and return that. | |
| // | |
| // If `ivecs` is too short, returns `nullopt`. | |
| template <typename IVec, typename ReadFromT = const uint8_t *, | |
| ReadFromT IVec::*ReadFrom = &IVec::in> | |
| inline std::optional<Span<const uint8_t>> GetAndRemoveSuffix( | |
| Span<uint8_t> suffix_buf, Span<IVec> ivecs) { | |
| // Get the trivial case out. | |
| if (suffix_buf.empty()) { | |
| return suffix_buf; | |
| } | |
| // Strip trailing zero length chunks. | |
| while (!ivecs.empty() && ivecs.back().len == 0) { | |
| ivecs = ivecs.first(ivecs.size() - 1); | |
| } | |
| if (ivecs.empty()) { | |
| return std::nullopt; | |
| } | |
| // Is the requested chunk entirely contained? If so, just return it. | |
| if (ivecs.back().len >= suffix_buf.size()) { | |
| ivecs.back().len -= suffix_buf.size(); | |
| return Span(ivecs.back().*ReadFrom + ivecs.back().len, suffix_buf.size()); | |
| } | |
| // Otherwise, collect it into the buffer while trimming `ivecs`. | |
| Span<uint8_t> remaining = suffix_buf; | |
| while (!ivecs.empty()) { | |
| Span<const uint8_t> src(ivecs.back().*ReadFrom, ivecs.back().len); | |
| if (src.size() >= remaining.size()) { | |
| CopySpan(src.last(remaining.size()), remaining); | |
| ivecs.back().len -= remaining.size(); | |
| return suffix_buf; | |
| } | |
| CopySpan(src, remaining.last(src.size())); | |
| remaining = remaining.first(remaining.size() - src.size()); | |
| ivecs.back().len = 0; | |
| ivecs = ivecs.first(ivecs.size() - 1); | |
| } | |
| return std::nullopt; | |
| } | |
| // GetAndRemoveOutSuffix is like `GetAndRemoveSuffix` but takes from a | |
| // `CRYPTO_IOVEC`'s `out` member instead. | |
| inline std::optional<Span<const uint8_t>> GetAndRemoveOutSuffix( | |
| Span<uint8_t> out, Span<CRYPTO_IOVEC> iovecs) { | |
| return GetAndRemoveSuffix<CRYPTO_IOVEC, /*ReadFromT=*/uint8_t *, | |
| /*ReadFrom=*/&CRYPTO_IOVEC::out>(out, iovecs); | |
| } | |
| namespace internal { | |
| inline void CopySpanToIOVec(Span<const uint8_t> out, CRYPTO_IOVEC head, | |
| Span<const CRYPTO_IOVEC> rest) { | |
| for (;;) { | |
| size_t to_copy = std::min(head.len, out.size()); | |
| CopySpan(out.first(to_copy), Span(head.out, to_copy)); | |
| out = out.subspan(to_copy); | |
| if (out.empty()) { | |
| break; | |
| } | |
| head = rest.front(); // Checkfails if insufficient space in CRYPTO_IOVEC. | |
| rest = rest.subspan(1); | |
| } | |
| } | |
| } // namespace internal | |
| // ForEachBlockRange iterates over the `ivecs` as follows: | |
| // | |
| // - `f_whole` gets called on whole blocks crossing `ivecs` chunk boundaries, or | |
| // ranges of whole blocks that are entirely in chunks. | |
| // - `f` gets called exactly once, on the last block range which may | |
| // end up with a partial block. | |
| // - Both functions receive an `in` pointer that either points into `ivecs` or | |
| // into a chunk assembly buffer and a `len` which indicates the number of | |
| // bytes from `in` that can be accessed. If the function returns 0, | |
| // iteration stops. | |
| // - If `WriteOut` is set, `f_whole` and `f` receive an extra `out` | |
| // argument to which they can write output. This output will be placed into | |
| // the `ivecs`'s `out` members either during or after the call. If iteration | |
| // was stopped, the contents of `out` are indeterminate. | |
| // - The return value is true if iteration was not stopped by the callbacks. | |
| template < | |
| size_t BlockSize, bool WriteOut = false, typename IVec, | |
| typename ReadFromT = const uint8_t *, ReadFromT IVec::*ReadFrom = &IVec::in, | |
| typename /* bool(const uint8_t *in, [uint8_t *out,] size_t len) */ FWhole, | |
| typename /* bool(const uint8_t *in, [uint8_t *out,] size_t len) */ | |
| FFinal> | |
| inline bool ForEachBlockRange(Span<IVec> ivecs, const FWhole &f_whole, | |
| const FFinal &f_final) { | |
| using MutableIVec = std::remove_const_t<IVec>; | |
| // Helper to make the function calls simpler. | |
| auto call_func = [&](const auto &f, const IVec &ivec) { | |
| if constexpr (WriteOut) { | |
| return f(ivec.*ReadFrom, ivec.out, ivec.len); | |
| } else { | |
| return f(ivec.*ReadFrom, ivec.len); | |
| } | |
| }; | |
| // Helper to cut from the start of an IVec. | |
| auto remove_prefix = [&](MutableIVec &ivec, size_t by) { | |
| ivec.*ReadFrom += by; | |
| if constexpr (WriteOut) { | |
| ivec.out += by; | |
| } | |
| ivec.len -= by; | |
| }; | |
| // Helper to copy a range to an iovec list. | |
| auto maybe_copy_to_iovec = [&](Span<const uint8_t> out, MutableIVec head, | |
| Span<IVec> rest) { | |
| if constexpr (WriteOut) { | |
| internal::CopySpanToIOVec(out, head, rest); | |
| } | |
| }; | |
| // Ensure the last item in `ivecs` is nonempty. This is necessary for | |
| // detecting being at the end and calling `f_final` at the appropriate time. | |
| Span<IVec> ivecs_trimmed = ivecs; | |
| while (!ivecs_trimmed.empty() && ivecs_trimmed.back().len == 0) { | |
| ivecs_trimmed = ivecs_trimmed.first(ivecs_trimmed.size() - 1); | |
| } | |
| if (ivecs_trimmed.empty()) { | |
| return call_func(f_final, IVec{}); | |
| } | |
| // Now there are at least two non-empty `ivecs`, and neither the first nor the | |
| // last can be empty. | |
| MutableIVec current_range_head = ivecs_trimmed.front(); | |
| Span<IVec> current_range_rest = ivecs_trimmed.subspan(1); | |
| while (!current_range_rest.empty()) { | |
| // Process as many whole blocks as possible. | |
| size_t whole_blocks_len = (current_range_head.len / BlockSize) * BlockSize; | |
| if (whole_blocks_len != 0) { | |
| MutableIVec whole_part = current_range_head; | |
| whole_part.len = whole_blocks_len; | |
| if (!call_func(f_whole, whole_part)) { | |
| return false; | |
| } | |
| remove_prefix(current_range_head, whole_blocks_len); | |
| } | |
| if (current_range_head.len == 0) { | |
| current_range_head = current_range_rest.front(); | |
| current_range_rest = current_range_rest.subspan(1); | |
| continue; | |
| } | |
| // Collect a whole block. | |
| alignas(BlockSize) InplaceVector<uint8_t, BlockSize> in; | |
| alignas(BlockSize) uint8_t out[BlockSize]; | |
| MutableIVec collect_from_head = current_range_head; | |
| Span<IVec> collect_from_rest = current_range_rest; | |
| while (in.size() <= BlockSize) { | |
| size_t remaining = BlockSize - in.size(); | |
| if (remaining < collect_from_head.len) { | |
| // Got enough to complete the block _and more_. | |
| in.Append(Span(collect_from_head.*ReadFrom, remaining)); | |
| remove_prefix(collect_from_head, remaining); | |
| break; | |
| } | |
| // Consume all of `ivec` and advance. | |
| in.Append(Span(collect_from_head.*ReadFrom, collect_from_head.len)); | |
| if (collect_from_rest.empty()) { | |
| // Nothing left - so this is the final block. | |
| auto finalout = Span(out).first(in.size()); | |
| MutableIVec finalvec = {}; | |
| finalvec.len = in.size(); | |
| finalvec.*ReadFrom = in.data(); | |
| if constexpr (WriteOut) { | |
| finalvec.out = finalout.data(); | |
| } | |
| if (!call_func(f_final, finalvec)) { | |
| return false; | |
| } | |
| maybe_copy_to_iovec(finalout, current_range_head, current_range_rest); | |
| return true; | |
| } | |
| collect_from_head = collect_from_rest.front(); | |
| collect_from_rest = collect_from_rest.subspan(1); | |
| } | |
| assert(in.size() == BlockSize); | |
| // The above loop ensures this condition by the `break` only happening if | |
| // `collect_from_head` has at least one byte remaining, and the loop | |
| // otherwise ensuring as an invariant that the final chunk - which is | |
| // nonempty - is among `collect_from_head` and `collect_from_rest`. | |
| // | |
| // As such, at least one byte is remaining, and thus calling `f_whole` is | |
| // appropriate. | |
| assert(collect_from_head.len != 0 || !collect_from_rest.empty()); | |
| // Process the block. | |
| MutableIVec wholevec = {}; | |
| wholevec.len = in.size(); | |
| wholevec.*ReadFrom = in.data(); | |
| if constexpr (WriteOut) { | |
| wholevec.out = out; | |
| } | |
| if (!call_func(f_whole, wholevec)) { | |
| return false; | |
| } | |
| maybe_copy_to_iovec(Span(out).first(in.size()), current_range_head, | |
| current_range_rest); | |
| // Set the new position. | |
| current_range_head = collect_from_head; | |
| current_range_rest = collect_from_rest; | |
| } | |
| // If current_range_head.len is zero, then the last item of ivecs is empty. | |
| // That however was excluded at the start of the function to ensure `f_final` | |
| // is always used for the last call. | |
| assert(current_range_head.len != 0); | |
| return call_func(f_final, current_range_head); | |
| } | |
| // MaybeInplaceArray can hold a copy of a CRYPTO_IOVEC. If it is a low | |
| // amount of entries, it will be stored on the stack, otherwise on the heap. | |
| using MaybeInplaceArray = bssl::MaybeInplaceArray<CRYPTO_IOVEC, 16>; | |
| // ForEachOutBlockRange is like `ForEachBlockRange` but reads from a | |
| // `CRYPTO_IOVEC`'s `out` member instead. | |
| template < | |
| size_t BlockSize, | |
| typename /* int(const uint8_t *in, [uint8_t *out,] size_t len) */ FWhole, | |
| typename /* int(const uint8_t *in, [uint8_t *out,] size_t len) */ | |
| FFinal> | |
| inline int ForEachOutBlockRange(Span<const CRYPTO_IOVEC> iovecs, | |
| const FWhole &f_whole, const FFinal &f_final) { | |
| return ForEachBlockRange<BlockSize, /*WriteOut=*/false, const CRYPTO_IOVEC, | |
| /*ReadFromT=*/uint8_t *, | |
| /*ReadFrom=*/&CRYPTO_IOVEC::out>(iovecs, f_whole, | |
| f_final); | |
| } | |
| // ForEachBlockRange_Dynamic is simply `ForEachBlockRange` with a | |
| // runtime dispatch on the block size. | |
| template < | |
| bool WriteOut = false, typename IVec, typename ReadFromT = const uint8_t *, | |
| ReadFromT IVec::*ReadFrom = &IVec::in, | |
| typename /* int(const uint8_t *in, uint8_t *out, size_t len) */ FWhole, | |
| typename /* int(const uint8_t *in, uint8_t *out, size_t len) */ | |
| FFinal> | |
| inline int ForEachBlockRange_Dynamic(size_t block_size, Span<IVec> ivecs, | |
| const FWhole &f_whole, | |
| const FFinal &f_final) { | |
| switch (block_size) { | |
| case 8: | |
| return ForEachBlockRange<8, WriteOut, IVec, ReadFromT, ReadFrom>( | |
| ivecs, f_whole, f_final); | |
| break; | |
| case 16: | |
| return ForEachBlockRange<16, WriteOut, IVec, ReadFromT, ReadFrom>( | |
| ivecs, f_whole, f_final); | |
| break; | |
| default: | |
| return 0; | |
| } | |
| } | |
| } // namespace iovec | |
| BSSL_NAMESPACE_END | |
| #endif // OPENSSL_HEADER_CRYPTO_FIPSMODULE_CIPHER_INTERNAL_H |