-
-
Notifications
You must be signed in to change notification settings - Fork 5.5k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'master' into ndims_broadcasted
- Loading branch information
Showing
24 changed files
with
466 additions
and
111 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,111 @@ | ||
| # This file is a part of Julia. License is MIT: https://julialang.org/license | ||
|
|
||
| struct GlobalRefIterator | ||
| mod::Module | ||
| end | ||
| IteratorSize(::Type{GlobalRefIterator}) = SizeUnknown() | ||
| globalrefs(mod::Module) = GlobalRefIterator(mod) | ||
|
|
||
| function iterate(gri::GlobalRefIterator, i = 1) | ||
| m = gri.mod | ||
| table = ccall(:jl_module_get_bindings, Ref{SimpleVector}, (Any,), m) | ||
| i == length(table) && return nothing | ||
| b = table[i] | ||
| b === nothing && return iterate(gri, i+1) | ||
| return ((b::Core.Binding).globalref, i+1) | ||
| end | ||
|
|
||
| const TYPE_TYPE_MT = Type.body.name.mt | ||
| const NONFUNCTION_MT = Core.MethodTable.name.mt | ||
| function foreach_module_mtable(visit, m::Module, world::UInt) | ||
| for gb in globalrefs(m) | ||
| binding = gb.binding | ||
| bpart = lookup_binding_partition(world, binding) | ||
| if is_defined_const_binding(binding_kind(bpart)) | ||
| v = partition_restriction(bpart) | ||
| uw = unwrap_unionall(v) | ||
| name = gb.name | ||
| if isa(uw, DataType) | ||
| tn = uw.name | ||
| if tn.module === m && tn.name === name && tn.wrapper === v && isdefined(tn, :mt) | ||
| # this is the original/primary binding for the type (name/wrapper) | ||
| mt = tn.mt | ||
| if mt !== nothing && mt !== TYPE_TYPE_MT && mt !== NONFUNCTION_MT | ||
| @assert mt.module === m | ||
| visit(mt) || return false | ||
| end | ||
| end | ||
| elseif isa(v, Module) && v !== m && parentmodule(v) === m && _nameof(v) === name | ||
| # this is the original/primary binding for the submodule | ||
| foreach_module_mtable(visit, v, world) || return false | ||
| elseif isa(v, Core.MethodTable) && v.module === m && v.name === name | ||
| # this is probably an external method table here, so let's | ||
| # assume so as there is no way to precisely distinguish them | ||
| visit(v) || return false | ||
| end | ||
| end | ||
| end | ||
| return true | ||
| end | ||
|
|
||
| function foreach_reachable_mtable(visit, world::UInt) | ||
| visit(TYPE_TYPE_MT) || return | ||
| visit(NONFUNCTION_MT) || return | ||
| for mod in loaded_modules_array() | ||
| foreach_module_mtable(visit, mod, world) | ||
| end | ||
| end | ||
|
|
||
| function should_invalidate_code_for_globalref(gr::GlobalRef, src::CodeInfo) | ||
| found_any = false | ||
| labelchangemap = nothing | ||
| stmts = src.code | ||
| isgr(g::GlobalRef) = gr.mod == g.mod && gr.name === g.name | ||
| isgr(g) = false | ||
| for i = 1:length(stmts) | ||
| stmt = stmts[i] | ||
| if isgr(stmt) | ||
| found_any = true | ||
| continue | ||
| end | ||
| for ur in Compiler.userefs(stmt) | ||
| arg = ur[] | ||
| # If any of the GlobalRefs in this stmt match the one that | ||
| # we are about, we need to move out all GlobalRefs to preserve | ||
| # effect order, in case we later invalidate a different GR | ||
| if isa(arg, GlobalRef) | ||
| if isgr(arg) | ||
| @assert !isa(stmt, PhiNode) | ||
| found_any = true | ||
| break | ||
| end | ||
| end | ||
| end | ||
| end | ||
| return found_any | ||
| end | ||
|
|
||
| function invalidate_code_for_globalref!(gr::GlobalRef, new_max_world::UInt) | ||
| valid_in_valuepos = false | ||
| foreach_reachable_mtable(new_max_world) do mt::Core.MethodTable | ||
| for method in MethodList(mt) | ||
| if isdefined(method, :source) | ||
| src = _uncompressed_ir(method) | ||
| old_stmts = src.code | ||
| if should_invalidate_code_for_globalref(gr, src) | ||
| for mi in specializations(method) | ||
| ci = mi.cache | ||
| while true | ||
| if ci.max_world > new_max_world | ||
| ccall(:jl_invalidate_code_instance, Cvoid, (Any, UInt), ci, new_max_world) | ||
| end | ||
| isdefined(ci, :next) || break | ||
| ci = ci.next | ||
| end | ||
| end | ||
| end | ||
| end | ||
| end | ||
| return true | ||
| end | ||
| end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.