Fix typos (#123775)

3 files changed, 3 insertions, 3 deletions

diff --git a/Objects/mimalloc/bitmap.h b/Objects/mimalloc/bitmap.h
index 578c5ec..d60f6dd 100644
--- a/Objects/mimalloc/bitmap.h
+++ b/Objects/mimalloc/bitmap.h
@@ -72,7 +72,7 @@ bool _mi_bitmap_try_find_claim_field(mi_bitmap_t bitmap, size_t idx, const size_
 // For now, `count` can be at most MI_BITMAP_FIELD_BITS and will never cross fields.
 bool _mi_bitmap_try_find_from_claim(mi_bitmap_t bitmap, const size_t bitmap_fields, const size_t start_field_idx, const size_t count, mi_bitmap_index_t* bitmap_idx);
 
-// Like _mi_bitmap_try_find_from_claim but with an extra predicate that must be fullfilled
+// Like _mi_bitmap_try_find_from_claim but with an extra predicate that must be fulfilled
 typedef bool (mi_cdecl *mi_bitmap_pred_fun_t)(mi_bitmap_index_t bitmap_idx, void* pred_arg);
 bool _mi_bitmap_try_find_from_claim_pred(mi_bitmap_t bitmap, const size_t bitmap_fields, const size_t start_field_idx, const size_t count, mi_bitmap_pred_fun_t pred_fun, void* pred_arg, mi_bitmap_index_t* bitmap_idx);
 
diff --git a/Objects/mimalloc/init.c b/Objects/mimalloc/init.c
index cb0ef66..81b2410 100644
--- a/Objects/mimalloc/init.c
+++ b/Objects/mimalloc/init.c
@@ -560,7 +560,7 @@ void mi_process_init(void) mi_attr_noexcept {
   _mi_verbose_message("secure level: %d\n", MI_SECURE);
   _mi_verbose_message("mem tracking: %s\n", MI_TRACK_TOOL);
   #if MI_TSAN
-  _mi_verbose_message("thread santizer enabled\n");
+  _mi_verbose_message("thread sanitizer enabled\n");
   #endif
   mi_thread_init();
 
diff --git a/Objects/mimalloc/segment-map.c b/Objects/mimalloc/segment-map.c
index 3cd2127..5141f2e 100644
--- a/Objects/mimalloc/segment-map.c
+++ b/Objects/mimalloc/segment-map.c
@@ -84,7 +84,7 @@ static mi_segment_t* _mi_segment_of(const void* p) {
   // TODO: maintain max/min allocated range for efficiency for more efficient rejection of invalid pointers?
 
   // search downwards for the first segment in case it is an interior pointer
-  // could be slow but searches in MI_INTPTR_SIZE * MI_SEGMENT_SIZE (512MiB) steps trough
+  // could be slow but searches in MI_INTPTR_SIZE * MI_SEGMENT_SIZE (512MiB) steps through
   // valid huge objects
   // note: we could maintain a lowest index to speed up the path for invalid pointers?
   size_t lobitidx;