Fix some typos in comments and tests (#58118)

Author: miguelraz

Compiler/test/irpasses.jl

@@ -1181,7 +1181,7 @@ end
 
 @test Compiler.is_effect_free(Base.infer_effects(getfield, (Complex{Int}, Symbol)))
 
-# We consider a potential deprecatio warning an effect, so for completely unkown getglobal,
+# We consider a potential deprecatio warning an effect, so for completely unknown getglobal,
 # we taint the effect_free bit.
 @test !Compiler.is_effect_free(Base.infer_effects(getglobal, (Module, Symbol)))
 

base/deprecated.jl

@@ -87,7 +87,7 @@ else
 end
 ```
 
-To find out the correct verrsion to use as the first argument, you may use
+To find out the correct version to use as the first argument, you may use
 `Base.__next_removal_version`, which is set to the next version number in which
 the list of changes will be cleared.
 

base/invalidation.jl

@@ -210,7 +210,7 @@ function scan_new_method!(methods_with_invalidated_source::IdSet{Method}, method
         b = convert(Core.Binding, gr)
         if binding_was_invalidated(b)
             # TODO: We could turn this into an addition if condition. For now, use it as a reasonably cheap
-            # additional consistency chekc
+            # additional consistency check
             @assert !image_backedges_only
             push!(methods_with_invalidated_source, method)
         end

base/strings/string.jl

@@ -226,7 +226,7 @@ end
     end)(s, i, n, l)
 end
 
-## checking UTF-8 & ACSII validity ##
+## checking UTF-8 & ASCII validity ##
 #=
     The UTF-8 Validation is performed by a shift based DFA.
     ┌───────────────────────────────────────────────────────────────────┐
@@ -374,7 +374,7 @@ end
 
 ##
 
-# Classifcations of string
+# Classifications of string
     # 0: neither valid ASCII nor UTF-8
     # 1: valid ASCII
     # 2: valid UTF-8

src/task.c

@@ -993,7 +993,7 @@ the xoshiro256 state. There are two problems with that fix, however:
    need four variations of the internal RNG stream for the four xoshiro256
    registers. That means we'd have to apply the PCG finalizer, add it to
    our dot product accumulator field in the child task, then apply the
-   MurmurHash3 finalizer to that dot product and use the result to purturb
+   MurmurHash3 finalizer to that dot product and use the result to perturb
    the main RNG state.
 
 We avoid both problems by recognizing that the mixing function can be much less

test/core.jl

@@ -7340,7 +7340,7 @@ Array{Int}(undef, bignum, bignum, 0, bignum, bignum)
 # but also test that it does throw if the axes multiply to a multiple of typemax(UInt)
 @test_throws ArgumentError Array{Int}(undef, bignum, bignum)
 @test_throws ArgumentError Array{Int}(undef, 1, bignum, bignum)
-# also test that we always throw erros for negative dims even if other dims are 0 or the product is positive
+# also test that we always throw errors for negative dims even if other dims are 0 or the product is positive
 @test_throws ArgumentError Array{Int}(undef, 0, -4, -4)
 @test_throws ArgumentError Array{Int}(undef, -4, 1, 0)
 @test_throws ArgumentError Array{Int}(undef, -4, -4, 1)

test/file.jl

@@ -471,7 +471,7 @@ if Sys.iswindows()
 else
     @test filesize(dir) > 0
 end
-# We need both: one to check passed time, one to comapare file's mtime()
+# We need both: one to check passed time, one to compare file's mtime()
 nowtime = time_ns() / 1e9
 nowwall = time()
 # Allow 10s skew in addition to the time it took us to actually execute this code
@@ -1383,7 +1383,7 @@ if !Sys.iswindows()
         stat_d_mv = stat(d_mv)
         # make sure d does not exist anymore
         @test !ispath(d)
-        # comare s, with d_mv
+        # compare s, with d_mv
         @test isfile(s) == isfile(d_mv)
         @test islink(s) == islink(d_mv)
         islink(s) && @test readlink(s) == readlink(d_mv)

test/threads_exec.jl

@@ -898,7 +898,7 @@ function _atthreads_greedy_dynamic_schedule()
 end
 @test _atthreads_greedy_dynamic_schedule() == threadpoolsize(:default) * threadpoolsize(:default)
 
-function _atthreads_dymamic_greedy_schedule()
+function _atthreads_dynamic_greedy_schedule()
     inc = Threads.Atomic{Int}(0)
     Threads.@threads :dynamic for _ = 1:threadpoolsize(:default)
         Threads.@threads :greedy for _ = 1:threadpoolsize(:default)
@@ -907,7 +907,7 @@ function _atthreads_dymamic_greedy_schedule()
     end
     return inc[]
 end
-@test _atthreads_dymamic_greedy_schedule() == threadpoolsize(:default) * threadpoolsize(:default)
+@test _atthreads_dynamic_greedy_schedule() == threadpoolsize(:default) * threadpoolsize(:default)
 
 function _atthreads_static_greedy_schedule()
     ids = zeros(Int, threadpoolsize(:default))