Invalidate methods when binding is typed/const-defined

[topolarity]

This allows for patterns like:

julia> function foo(N)
    x = nothing
    for i = 1:N
        x = bar(i)
    end
    return x
end

julia> foo(1_000_000_000)
ERROR: UndefVarError: `bar` not defined

not to suffer a tremendous performance regression because of the fact that foo was inferred with bar still undefined.

This invalidation is not required for correctness, but for performance reasons once the global is defined we'd like to invalidate the code anyway to get an improved inference result:

julia> bar(x) = 3x
bar (generic function with 1 method)

julia> foo(1_000_000_000) # w/o PR: > 30 seconds, w/ PR: < 1μs

Note: This is essentially an optimized implementation of the non-semantic portion of #54654 for the special case of untyped/undefined globals, and this should mostly be compatible with that PR. Compared to that change, this adds explicit edges so that invalidation can be significantly faster and bit more fine-grained.

TODO:

• Add lock to jl_binding_edges_t to prevent corruption from concurrent access
• Add additional tests for global vs. const invalidations and x-module bindings
• Fix up binding->ty not to be reset on serialization (use the closed/open rules on type set instead)

[Keno]

I would prefer to do this after #54654 which requires these semantics already and at which point it'll simply become a time/space tradeoff. Which direction to pick for the tradeoff is hard to know without benchmarking.