Found by running the checkpatch.pl Linux script to enforce coding style.
Reviewed-by: Kurt Roeckx <kurt@roeckx.be>
Reviewed-by: Neil Horman <nhorman@openssl.org>
Reviewed-by: Norbert Pocs <norbertp@openssl.org>
Reviewed-by: Eugene Syromiatnikov <esyr@openssl.org>
MergeDate: Wed Jul 8 10:11:11 2026
(Merged from https://github.com/openssl/openssl/pull/31860)
&outlen, loopargs[k].buf,
lengths[testnum])) {
BIO_puts(bio_err,
- "\nFailed to to encrypt the data\n");
+ "\nFailed to encrypt the data\n");
dofail();
exit(1);
}
* |A| (our key->m, with the public key holding an expanded (16-bit per scalar
* coefficient) key->t vector).
*
- * Caller passes storage in |tmp| for for two temporary vectors.
+ * Caller passes storage in |tmp| for two temporary vectors.
*/
static __owur int encrypt_cpa(uint8_t out[ML_KEM_SHARED_SECRET_BYTES],
const uint8_t message[DEGREE / 8],
* We are generating a fixed point number on the interval [0, 1).
* Multiplying this by the range gives us a number on [0, upper).
* The high word of the multiplication result represents the integral
- * part we want. The lower word is the fractional part. We can early exit if
+ * part we want. The lower word is the fractional part. We can early exit
* if the fractional part is small enough that no carry from the next lower
* word can cause an overflow and carry into the integer part. This
* happens when the fractional part is bounded by 2^32 - upper which
* repeat the process with the next lower word.
*
* Each *bit* of randomness has a probability of one half of terminating
- * this process, so each each word beyond the first has a probability
+ * this process, so each word beyond the first has a probability
* of 2^-32 of not terminating the process. That is, we're extremely
* likely to stop very rapidly.
*/
if (!ossl_rsa_check_factors(rsa)) {
ERR_raise_data(ERR_LIB_RSA, RSA_R_INVALID_KEYPAIR,
- "RSA factors/exponents are too big for for n-modulus\n");
+ "RSA factors/exponents are too big for n-modulus\n");
goto err;
}
/*
* Give each of the k trees a unique range at each level.
* e.g. If we have 4096 leaf nodes (2^a = 2^12) for each tree
- * tree i will use indexes from 4096 * i + (0..4095) for its bottom level.
+ * i will use indexes from 4096 * i + (0..4095) for its bottom level.
* For the next level up from the bottom there would be 2048 nodes
* (so tree i uses indexes 2048 * i + (0...2047) for this level)
*/
/*
* The subject key identifier of the issuer cert is acceptable unless
* the issuer cert is same as subject cert, but the subject will not
- * not be self-signed (i.e. will be signed with a different key).
+ * be self-signed (i.e. will be signed with a different key).
*/
i = X509_get_ext_by_NID(issuer_cert, NID_subject_key_identifier, -1);
if (i >= 0 && (ext = X509_get_ext(issuer_cert, i)) != NULL
for (bnam = method->usr_data; bnam->lname; bnam++) {
/*
* If the bitnumber did not change from the last iteration, this entry
- * is an an alias for the previous bit; treat the first result as
+ * is an alias for the previous bit; treat the first result as
* canonical and ignore the rest.
*/
if (last_seen_bit == bnam->bitnum)
break;
/*
- * This function is confusingly named as it is is named from nghttp3's
+ * This function is confusingly named as it is named from nghttp3's
* 'perspective'; it is used to pass data *into* the HTTP/3 stack which
* has been received from the network.
*/
bio_module = (*st->bio_new_file_cb)(st->module_filename, "rb");
/* This section can be called on demand and that could race with deferred
- * tests being executed in another thread, so we use use helpers to get
+ * tests being executed in another thread, so we use helpers to get
* proper locking around this critical section */
if (SELF_TEST_lock_deferred(fips_global)) {
ossl_quic_channel_set_msg_callback_arg(qc->ch, ql->obj.ssl.ctx->msg_callback_arg);
/*
- * We deliberately pass NULL for engine and port, because we don't want to
+ * We deliberately pass NULL for engine and port, because we don't want
* to turn QCSO we create here into an event leader, nor port leader.
* Both those roles are occupied already by listener (`ssl`) we use
* to create a new QCSO here.
* This is not a major concern for clients, since if a client has a 1-RTT EL
* provisioned the server is guaranteed to also have a 1-RTT EL provisioned.
*
- * TODO(QUIC FUTURE): Revisit this when when have reached a decision on how
+ * TODO(QUIC FUTURE): Revisit this when we have reached a decision on how
* best to implement this
*/
if (*conn_close_enc_level > enc_level
/*
* Frequently platform conversions can not deal with one second before the
- * the Unix epoch, due to inheriting terrible API design and knocking this
+ * Unix epoch, due to inheriting terrible API design and knocking this
* time value out as an error return.
*
* We should do better.
continue;
}
if (!TEST_int_eq(mdpth, want_depth)) {
- TEST_info("In test test %d", testno);
+ TEST_info("In test %d", testno);
ret = 0;
}
}