Stutter typos

Author: riptl

book/api/websocket.md

@@ -1400,11 +1400,11 @@ The source tpu for a transaction can be one of the following
 
 | TPU    | Description |
 |--------|-------------|
-| quic   | the primary ingress tpu for user transactions.  Utilizes the quic protocol to recieve packets |
-| udp    | ingress transactions recieved as simple UDP packets |
-| gossip | vote transactions recieved from the gossip network |
-| bundle | bundle transacionts recieved by the bundle tile from a block builder.  Utilizes a grpc connection to recieve packets |
-| send   | vote transactions procuded by this validator recieved from the send tile. These transactions are meant for the active cluster leader |
+| quic   | the primary ingress tpu for user transactions.  Utilizes the quic protocol to receive packets |
+| udp    | ingress transactions received as simple UDP packets |
+| gossip | vote transactions received from the gossip network |
+| bundle | bundle transacionts received by the bundle tile from a block builder.  Utilizes a grpc connection to receive packets |
+| send   | vote transactions procuded by this validator received from the send tile. These transactions are meant for the active cluster leader |
 
 These are the possible error codes that might be included in `txn_error_code` and their meanings.
 

src/disco/fd_disco_base.h

@@ -160,7 +160,7 @@ FD_FN_CONST static inline ulong fd_disco_replay_old_sig_slot( ulong sig ) { retu
 
    There are two types of messages on the shred_repair link.  The first
    type is a generic shred message. The second is a FEC set completion
-   message. Since we have run out of bits, the reciever must look at the
+   message. Since we have run out of bits, the receiver must look at the
    sz of the dcache entry to determine which type of message it is.
 
    For the first message type (SHRED):

src/discof/forest/fd_forest.c

@@ -651,7 +651,7 @@ fd_forest_iter_next( fd_forest_iter_t iter, fd_forest_t const * forest ) {
     }
 
     /* Common case - valid shred to request. Note you can't know the
-       ele->complete_idx until you have actually recieved the slot
+       ele->complete_idx until you have actually received the slot
        complete shred, thus the we can do lt instead of leq  */
 
     if( ele->complete_idx != UINT_MAX &&

src/discof/forest/test_forest.c

@@ -520,7 +520,7 @@ test_branched_forest_iterator( fd_wksp_t * wksp ) {
     slot 4    |
             slot 5
 
-  slot  complete_idx   recieved
+  slot  complete_idx   received
   0          1
   1          1            1
   2          2            2

src/flamenco/runtime/tests/fd_dump_pb.h

@@ -78,7 +78,7 @@ fd_dump_txn_to_protobuf( fd_exec_txn_ctx_t *txn_ctx, fd_spad_t * spad );
    will create an initial BlockContext type that saves some fields from the slot and epoch context, as well as any current
    builtins and sysvar accounts.
 
-   `fd_dump_block_to_protobuf_tx_only` takes an existing block context message and a runtime block and and dumps
+   `fd_dump_block_to_protobuf_tx_only` takes an existing block context message and a runtime block and dumps
    the transactions within the block to be replayed.
 
    CAVEATS: Currently, due to how spad frames are handled in the runtime, there is an edge case where block dumping will

src/groove/fd_groove_data.h

@@ -204,7 +204,7 @@ FD_PROTOTYPES_BEGIN
    fd_groove_data.  Assumes shdata points in the caller's address space
    to the memory region containing the fd_groove_data and that there are
    no current joins globally.  Returns shdata on success (caller has
-   ownership of the memory region, any volumes in the groove and and any
+   ownership of the memory region, any volumes in the groove and any
    groove data objects in these volumes) and NULL on failure (no
    ownership changes, logs details). */
 
@@ -495,10 +495,10 @@ fd_groove_data_verify( fd_groove_data_t const * data );
 
 /* fd_groove_data_volume_verify returns FD_GROOVE_SUCCESS if the
    groove volume mapped into the caller's address at _volume is appears
-   to be a valid groove volume and and FD_GROOVE_ERR_CORRUPT
-   otherwise (logs details).  Assumes join is a current local join and
-   the groove data is idle.  It is fine to verify volumes in parallel
-   (e.g. use hundreds of cores to verify petabytes of groove data). */
+   to be a valid groove volume and FD_GROOVE_ERR_CORRUPT otherwise (logs
+   details).  Assumes join is a current local join and the groove data
+   is idle.  It is fine to verify volumes in parallel (e.g. use hundreds
+   of cores to verify petabytes of groove data). */
 
 int
 fd_groove_data_volume_verify( fd_groove_data_t   const * data,

src/util/alloc/fd_alloc_cfg.h

@@ -30,7 +30,7 @@
    Critically, noting that ~ 512KiB/64 ~ 8KiB is pretty clumsy for small
    allocations, we recursively nest a smaller sized superblock within
    blocks of this superblock.
-   
+
    Specifically, we pick a "large" superblock size that will nest as
    tightly inside a block of a "huge" superblock when the huge
    superblock is divided into the minimum 8 blocks.  Noting that the
@@ -51,14 +51,14 @@
    rounding nearest.  (For the parameters here, this implies a few
    percent overhead from the implicit rounding up of an unaligned
    allocation.)
-   
+
    block_footprints are directly computed from these superblock
-   footprints and and the block counts are recomputed to squeeze some
-   extra blocks into the superblocks that various integer roundings
-   might have exposed.  We discard any sizeclasses that are redundant
-   and any sizeclasses that are too small to be useful (blocks need to
-   be at least 5 as a single byte unaligned allocation will still have a
-   4 byte fd_alloc_hdr_t associated with it).  This yields the 126 size
+   footprints and the block counts are recomputed to squeeze some extra
+   blocks into the superblocks that various integer roundings might have
+   exposed.  We discard any sizeclasses that are redundant and any
+   sizeclasses that are too small to be useful (blocks need to be at
+   least 5 as a single byte unaligned allocation will still have a 4
+   byte fd_alloc_hdr_t associated with it).  This yields the 126 size
    classes below.
 
    On the assumption that small allocations have a shorter lifetime /

src/util/bits/fd_uwide.h

@@ -126,11 +126,11 @@ static inline int fd_uwide_find_msb_def( ulong xh, ulong xl, int def ) { return
    Large values of s are fine (shifts to zero).  Returns the inexact
    flag (will be 0 or 1) which indicates if any non-zero bits of <xh,xl>
    were lost in the process.  Note that inexact handling and various
-   cases should be compile time optimized out if if s is known at
-   compile time on input and/or return value is not used.  Ignoring
-   inexact handling and assuming compile time s, for the worst case s,
-   cost is 3 u64 shifts and 1 u64 bit or.  FIXME: CONSIDER HAVING AN
-   INVALID FLAG FOR NEGATIVE S?  FIXME: BRANCHLESS? */
+   cases should be compile time optimized out if s is known at compile
+   time on input and/or return value is not used.  Ignoring inexact
+   handling and assuming compile time s, for the worst case s, cost is 3
+   u64 shifts and 1 u64 bit or.  FIXME: CONSIDER HAVING AN INVALID FLAG
+   FOR NEGATIVE S?  FIXME: BRANCHLESS? */
 
 static inline int
 fd_uwide_sl( ulong * FD_RESTRICT _zh, ulong * FD_RESTRICT _zl,
@@ -148,12 +148,12 @@ fd_uwide_sl( ulong * FD_RESTRICT _zh, ulong * FD_RESTRICT _zl,
    Large values of s are fine (shifts to zero).  Returns the inexact
    flag (will be 0 or 1) which indicates if any non-zero bits of <xh,xl>
    were lost in the process.  Note that inexact handling and various
-   cases should be compile time optimized out if if s is known at
-   compile time on input and/or return value is not used.  Ignoring
-   inexact handling and assuming compile time s, for the worst case s,
-   cost is 3 u64 shifts and 1 u64 bit or.  (FIXME: CONSIDER HAVING AN
-   INVALID FLAG FOR NEGATIVE S AND/OR MORE DETAILED INEXACT FLAGS TO
-   SIMPLIFY IMPLEMENTING FIXED AND FLOATING POINT ROUNDING MODES?) */
+   cases should be compile time optimized out if s is known at compile
+   time on input and/or return value is not used.  Ignoring inexact
+   handling and assuming compile time s, for the worst case s, cost is 3
+   u64 shifts and 1 u64 bit or.  (FIXME: CONSIDER HAVING AN INVALID FLAG
+   FOR NEGATIVE S AND/OR MORE DETAILED INEXACT FLAGS TO SIMPLIFY
+   IMPLEMENTING FIXED AND FLOATING POINT ROUNDING MODES?) */
 
 static inline int
 fd_uwide_sr( ulong * FD_RESTRICT _zh, ulong * FD_RESTRICT _zl,