https://github.com/JuliaLang/julia
- HEAD
- refs/branches/jn/codeinfo-lineno
- refs/heads/KristofferC-patch-1
- refs/heads/KristofferC-patch-2
- refs/heads/KristofferC-patch-3
- refs/heads/KristofferC-patch-4
- refs/heads/KristofferC-patch-5
- refs/heads/KristofferC-patch-6
- refs/heads/KristofferC-patch-7
- refs/heads/KristofferC-patch-8
- refs/heads/LilithHafner-patch-1
- refs/heads/LilithHafner-patch-3
- refs/heads/SubtypeError
- refs/heads/aa-tcp-write-opt-18
- refs/heads/aa/build-llvm-unwind
- refs/heads/aa/freebsd-llvm-libunwind
- refs/heads/aa/test-throws-nothing
- refs/heads/add-buffer-type
- refs/heads/add-buffer-type2
- refs/heads/adnan-alhomssi-aa-export-numstacks-counter
- refs/heads/adr/snapshot
- refs/heads/ajf/arrays-are-tables
- refs/heads/ajf/broadcast-dicts
- refs/heads/ajf/cartesianrange-array
- refs/heads/ajf/default-length-definition
- refs/heads/ajf/deprecatemultivaluenonscalarindexedassignment
- refs/heads/ajf/dict-iterate-values
- refs/heads/ajf/mappedarray
- refs/heads/ajf/pairs2
- refs/heads/ajf/propage_inbounds_broadcast
- refs/heads/ajf/skipmissing-length
- refs/heads/ajf/strides-trait
- refs/heads/amp-ref
- refs/heads/anj/map
- refs/heads/asan_tasks_eh
- refs/heads/avi/1.11-precompile-ext-absint
- refs/heads/avi/46713
- refs/heads/avi/47137-again
- refs/heads/avi/52991
- refs/heads/avi/EA-finalizer
- refs/heads/avi/EASROA
- refs/heads/avi/absint-cache
- refs/heads/avi/async-completion
- refs/heads/avi/bailout-effects
- refs/heads/avi/bailoutintrinsics
- refs/heads/avi/boundscheck-docs
- refs/heads/avi/boundserror
- refs/heads/avi/cache-irinterp
- refs/heads/avi/callinfo-effects
- refs/heads/avi/codegen-custom-lookup-oc
- refs/heads/avi/configconstprop
- refs/heads/avi/constType-Union
- refs/heads/avi/early_const_prop
- refs/heads/avi/effects-override-bittype
- refs/heads/avi/effects_constprop
- refs/heads/avi/hunt-type-instabilities
- refs/heads/avi/inbounds-nothrow
- refs/heads/avi/infer_effects
- refs/heads/avi/infresult_iterator
- refs/heads/avi/inline_string
- refs/heads/avi/inlined-stacktrace
- refs/heads/avi/inlining-policy
- refs/heads/avi/inlining_cost
- refs/heads/avi/interval
- refs/heads/avi/issue55548
- refs/heads/avi/jet413
- refs/heads/avi/kwinline
- refs/heads/avi/moreeffects
- refs/heads/avi/multisroa
- refs/heads/avi/mutablephi
- refs/heads/avi/opt-and-or-int
- refs/heads/avi/opt-assume-bindings-static
- refs/heads/avi/opt-toplevel-chunk
- refs/heads/avi/optlifetime
- refs/heads/avi/plugin8
- refs/heads/avi/plugin8-2
- refs/heads/avi/replace-55583
- refs/heads/avi/return_type-max_methods
- refs/heads/avi/small-image4
- refs/heads/avi/temp-methodinstance-to-invoke
- refs/heads/avi/turn-on-aliasedfieldanalysis
- refs/heads/avi/typed_hvcat-return_type
- refs/heads/avi/typelattice
- refs/heads/avi/typetypeinf
- refs/heads/avi/undef
- refs/heads/avi/unused-noconstprop
- refs/heads/avi/wip
- refs/heads/backport-1.1.0
- refs/heads/backports-release-1.1
- refs/heads/backports-release-1.11
- refs/heads/backports-release-1.6
- refs/heads/backports-release-1.8
- refs/heads/breakmore
- refs/heads/bump-llvm17
- refs/heads/caf/bump-juliasyntax-0.4.7
- refs/heads/cjf/disallow-infix-macros
- refs/heads/cjf/fpe-exceptions
- refs/heads/cjf/hide-in-stacktrace-meta
- refs/heads/cjf/hide-stacktrace-frames
- refs/heads/cjf/internal-properties
- refs/heads/cjf/logging-custom-levels
- refs/heads/cjf/logging-custom-levels-wip
- refs/heads/cjf/remove-loaderror
- refs/heads/cjf/toplevel-backtraces
- refs/heads/cjf/toplevel-backtraces-via-interpframe-stack
- refs/heads/cjh/doxygen
- refs/heads/cjh/fix-4774
- refs/heads/cjh/parallel-bench
- refs/heads/codepoint_overlong
- refs/heads/ct/jl_nothing-crash
- refs/heads/ct/julia-opt-zone
- refs/heads/ct/juliaclogging
- refs/heads/ct/more-fprint
- refs/heads/ct/typed-callable
- refs/heads/ct/union-sret-abi
- refs/heads/ctruncate_string_show
- refs/heads/curry
- refs/heads/cv/abstractstring-eq
- refs/heads/cv/arm-hotfix
- refs/heads/cv/broadcast-steprange-timetype
- refs/heads/cv/char-code-reservation
- refs/heads/cv/dates-replace
- refs/heads/cv/fix-redundant-dict-error
- refs/heads/cv/generator-indexing
- refs/heads/cv/invalid-rational
- refs/heads/cv/namedtuple-pair
- refs/heads/da/devcontainer-update
- refs/heads/dcn-1.9-with-mem-pressure-callback
- refs/heads/dcn-3-color
- refs/heads/dcn-allocated-bytes-in-alloc
- refs/heads/dcn-canonicalize-callable-names
- refs/heads/dcn-check-oldest-object-in-size-class
- refs/heads/dcn-gc-paper-1.9-branch
- refs/heads/dcn-gc-paper-dev-branch
- refs/heads/dcn-null-out-gc-slots
- refs/heads/dcn-prepend-sigid-and-tid-on-backtraces
- refs/heads/dcn-save-registers-for-conservative-scanning
- refs/heads/dcn-tmp
- refs/heads/dcn/docs
- refs/heads/dcn/mq
- refs/heads/dk/abstractqsimilar
- refs/heads/dk/antialias
- refs/heads/dk/banded
- refs/heads/dk/blaspromo
- refs/heads/dk/cat_with_q_and_scaling
- refs/heads/dk/choleskypivot
- refs/heads/dk/hvcat_scaling_number
- refs/heads/dk/missing
- refs/heads/dk/stable_div
- refs/heads/dont-tabcomplete-internals
- refs/heads/dpa/UndefVarError-scope-nothing
- refs/heads/dpa/base-prompt-public-api
- refs/heads/dpa/ci-environment-variable
- refs/heads/dpa/deprecation_exec
- refs/heads/dpa/diagnostics-interactiveutils
- refs/heads/dpa/infodump-interactiveutils
- refs/heads/dpa/more-public-task-local-storage-methods
- refs/heads/dpa/new-global-load-path-entry
- refs/heads/dpa/num-precompile-tasks
- refs/heads/dpa/parentmodule
- refs/heads/dpa/pidfile-windows-eacces
- refs/heads/dpa/small-change-module-qualified-names
- refs/heads/dpa/sparsearrays
- refs/heads/dpa/test_throws-undefined-fields
- refs/heads/dpa/versioninfo-official-release
- refs/heads/fe/--threads-propagate
- refs/heads/fe/-P
- refs/heads/fe/active-depot
- refs/heads/fe/backport-31967
- refs/heads/fe/deprecate-logging
- refs/heads/fe/depwarn-default
- refs/heads/fe/doctest-fix
- refs/heads/fe/errorexception
- refs/heads/fe/helpmode-stdout
- refs/heads/fe/hermsym-matrixfunc
- refs/heads/fe/integer-construction
- refs/heads/fe/misc
- refs/heads/fe/nvr
- refs/heads/fe/repr-versioninfo
- refs/heads/fe/rm-artifacts
- refs/heads/fe/ssh
- refs/heads/fe/structured-matrix-constructor
- refs/heads/fe/version-v2
- refs/heads/fe/walkdir
- refs/heads/fix9475
- refs/heads/gb/analyzer-fun
- refs/heads/gb/asm-win
- refs/heads/gb/branch-bits
- refs/heads/gb/compile-all-method
- refs/heads/gb/config-lib
- refs/heads/gb/fast-tls-rng
- refs/heads/gb/gc-correct-constraint
- refs/heads/gb/gc-other-impl
- refs/heads/gb/hashtable_typelist
- refs/heads/gb/inlining-method-error
- refs/heads/gb/io-loop-thread
- refs/heads/gb/libfuncattrs
- refs/heads/gb/llvmpasses-dep
- refs/heads/gb/lockless-array
- refs/heads/gb/mi-alias
- refs/heads/gb/once
- refs/heads/gb/oneten-big-image
- refs/heads/gb/opt-global
- refs/heads/gb/parallel-stack-pools
- refs/heads/gb/pipeline-fun
- refs/heads/gb/pretty-ir
- refs/heads/gb/rpath-fun
- refs/heads/gb/sign
- refs/heads/gb/small-image
- refs/heads/gb/small-image2
- refs/heads/gb/small-image3
- refs/heads/gb/small-image4
- refs/heads/gb/stack-protect
- refs/heads/gb/system-mutex
- refs/heads/gb/toplevel-root
- refs/heads/gb/workstealing-fun
- refs/heads/gpu-broadcast
- refs/heads/id_norm
- refs/heads/jb/06_compiler_perf
- refs/heads/jb/39698
- refs/heads/jb/AbstractOneTo
- refs/heads/jb/IdUnitRangeparent
- refs/heads/jb/allowoverwrite
- refs/heads/jb/analyzevars
- refs/heads/jb/arraygcperf
- refs/heads/jb/badidentifierstart
- refs/heads/jb/bidi16
- refs/heads/jb/cg_temp
- refs/heads/jb/codeinfostuff
- refs/heads/jb/copyanonfns
- refs/heads/jb/copyfile
- refs/heads/jb/diagblockdiagonal
- refs/heads/jb/dotcolon
- refs/heads/jb/fastercat
- refs/heads/jb/fix14106
- refs/heads/jb/fix29501
- refs/heads/jb/fix38902
- refs/heads/jb/fix39834
- refs/heads/jb/fix47318
- refs/heads/jb/fix49318
- refs/heads/jb/freethreadstate
- refs/heads/jb/gb/static-call-graph
- refs/heads/jb/gb/static-call-graph-backup
- refs/heads/jb/gotofromtry
- refs/heads/jb/implicitssa
- refs/heads/jb/interpreter_opt
- refs/heads/jb/iowriteperf
- refs/heads/jb/jr/tuplelattice
- refs/heads/jb/latency10
- refs/heads/jb/latency12
- refs/heads/jb/latency3
- refs/heads/jb/latency33615
- refs/heads/jb/latency_experiments
- refs/heads/jb/limitedmethods
- refs/heads/jb/macrostuff
- refs/heads/jb/modprefixshow
- refs/heads/jb/news111
- refs/heads/jb/novaoverride
- refs/heads/jb/nullableget
- refs/heads/jb/open3
- refs/heads/jb/quietparams
- refs/heads/jb/r5rs
- refs/heads/jb/revinlinethresh
- refs/heads/jb/ruleinlinecost
- refs/heads/jb/serializeperf
- refs/heads/jb/shortstrlen
- refs/heads/jb/silentparams
- refs/heads/jb/simpler_intersection2
- refs/heads/jb/sjkelly-sjk/precomp_trace2
- refs/heads/jb/small-image3
- refs/heads/jb/steprangegetindex
- refs/heads/jb/stripmeta
- refs/heads/jb/tasksize
- refs/heads/jb/tasksp
- refs/heads/jb/taskwaitswitch
- refs/heads/jb/threadedregion-test
- refs/heads/jb/tuplebottom
- refs/heads/jb/typedefIR2
- refs/heads/jb/typegetfield
- refs/heads/jb/typemap0
- refs/heads/jb/varlocs
- refs/heads/jcb/arrayviews
- refs/heads/jcb/evalmacrocallthrows
- refs/heads/jcb/juliarepl
- refs/heads/jcb/simdmdloop
- refs/heads/jh/setops
- refs/heads/jishnub/adjtransshow
- refs/heads/jishnub/bandindex_getindex
- refs/heads/jishnub/bidiag_naivemul
- refs/heads/jishnub/bidimul
- refs/heads/jishnub/blocktridiagonalindexing
- refs/heads/jishnub/diag_block_eltype
- refs/heads/jishnub/diagmatrixfns
- refs/heads/jishnub/diagsymmetric
- refs/heads/jishnub/diagzero
- refs/heads/jishnub/eigvecs_triangular
- refs/heads/jishnub/generictriangularscaling
- refs/heads/jishnub/hermdiagsum
- refs/heads/jishnub/integerpow
- refs/heads/jishnub/matmulenumdispatch
- refs/heads/jishnub/matprod_dest_public
- refs/heads/jishnub/ntupleshow
- refs/heads/jishnub/rangefindfirstlast
- refs/heads/jishnub/rangezero
- refs/heads/jishnub/rational_iszero_denominator
- refs/heads/jishnub/reshape_integer
- refs/heads/jishnub/symeigen_alg
- refs/heads/jishnub/triangular_broadcast
- refs/heads/jishnub/tridiag_triangular_lmul
- refs/heads/jishnub/upperlowertriview_tridiag
- refs/heads/jishnub/zeroonefill
- refs/heads/jmw/null-syntax
- refs/heads/jn/26512
- refs/heads/jn/29872-compare
- refs/heads/jn/34886
- refs/heads/jn/37349
- refs/heads/jn/StructRet_abi
- refs/heads/jn/array-inbounds-audit
- refs/heads/jn/atomic-modify-opt
- refs/heads/jn/avi/noopt-interp-irinterp-compare
- refs/heads/jn/backedge-fixup
- refs/heads/jn/backports-release-1.4
- refs/heads/jn/better-broadcast-inlining
- refs/heads/jn/bigfloat-mem
- refs/heads/jn/broadcast-some-more
- refs/heads/jn/check_sadd
- refs/heads/jn/codeinfo-edges
- refs/heads/jn/compile-all-0.6
- refs/heads/jn/compile_all_generic_box
- refs/heads/jn/drop-inexact
- refs/heads/jn/exposed-hygiene
- refs/heads/jn/fix-macro-scope-design
- refs/heads/jn/fix34159
- refs/heads/jn/future-compiler
- refs/heads/jn/gc-pool-lazy
- refs/heads/jn/generalized-LOAD_PATH-compilecache
- refs/heads/jn/have_fma_sysimg
- refs/heads/jn/iddict
- refs/heads/jn/import-strtod
- refs/heads/jn/in-isequal
- refs/heads/jn/invoke-codeinstance
- refs/heads/jn/iocolor
- refs/heads/jn/iocolor2
- refs/heads/jn/ircode-memory
- refs/heads/jn/iterate
- refs/heads/jn/jb-subtype
- refs/heads/jn/jb-subtype-const-type-fix
- refs/heads/jn/jb-subtype-faster-isa-Type
- refs/heads/jn/jitlink-always
- refs/heads/jn/jlinterpreter
- refs/heads/jn/kf-linecolstr
- refs/heads/jn/kf/iterate-wip
- refs/heads/jn/kf/newlocs
- refs/heads/jn/lazydoc
- refs/heads/jn/license-committers
- refs/heads/jn/llvmcall2
- refs/heads/jn/localize-multiversioning
- refs/heads/jn/memoize-freevars
- refs/heads/jn/methmatch-cache
- refs/heads/jn/mixed-equal
- refs/heads/jn/ml-match-opt
- refs/heads/jn/ml-matches-leaf-cache2
- refs/heads/jn/modulecoalescing
- refs/heads/jn/more-faster-typeset
- refs/heads/jn/more-inline-costs
- refs/heads/jn/msvclink
- refs/heads/jn/new-stdlib-script-docs
- refs/heads/jn/newir-test-fixes
- refs/heads/jn/noinline-structs
- refs/heads/jn/once
- refs/heads/jn/opt-makefile-compile-take2
- refs/heads/jn/release0.6-26833
- refs/heads/jn/requirenewmodule
- refs/heads/jn/simple-scope
- refs/heads/jn/simulate-longjmp
- refs/heads/jn/slot-type-infer-optimize
- refs/heads/jn/steprange
- refs/heads/jn/subtype-sig-equal
- refs/heads/jn/test-warn-repr
- refs/heads/jn/threading
- refs/heads/jn/tune_whos
- refs/heads/jn/tuplecc
- refs/heads/jn/type-construction-normalization
- refs/heads/jn/typeinfo_arg
- refs/heads/jn/typename_hide_null_svec
- refs/heads/jn/unhandled_exception_handler
- refs/heads/jn/union-bits-layout
- refs/heads/jn/update-precompile-heuristic
- refs/heads/jn/widen_method_matchs
- refs/heads/jn/win32-stack_overflow_warning
- refs/heads/jq-19-backport
- refs/heads/jq-dense-strings
- refs/heads/jq-tcp-socket-keepalive
- refs/heads/jq/40303
- refs/heads/jq/buffer
- refs/heads/jq/bufferall
- refs/heads/jr/betterspoof
- refs/heads/jr/cinfoworldboundstmp
- refs/heads/jr/compiledebug
- refs/heads/jr/moarpartialtuple
- refs/heads/jr/ptupleprop
- refs/heads/jr/tmp2
- refs/heads/jr/tupleconst
- refs/heads/jr/tuplekindtypefix
- refs/heads/jr/tuplelatticeold
- refs/heads/jr/wip
- refs/heads/julia-in-julia
- refs/heads/kc/1.9.0-beta3
- refs/heads/kc/JULIA_ENV
- refs/heads/kc/TM
- refs/heads/kc/active_mod_repl
- refs/heads/kc/arg_usings
- refs/heads/kc/artifact_nested_load
- refs/heads/kc/artifact_str_world
- refs/heads/kc/assume_unchanged_loading
- refs/heads/kc/backport_gcc10
- refs/heads/kc/backport_vtj
- refs/heads/kc/backporter
- refs/heads/kc/backports-release-1.10
- refs/heads/kc/build_stdlib_env
- refs/heads/kc/cache_precompile
- refs/heads/kc/cglobal
- refs/heads/kc/codeloading2.0
- refs/heads/kc/complete_num
- refs/heads/kc/core_compiler_tracy
- refs/heads/kc/cpu_target_pkgimage
- refs/heads/kc/debug_mode
- refs/heads/kc/debug_mode2
- refs/heads/kc/debug_precompile
- refs/heads/kc/debug_release-1.9
- refs/heads/kc/dir_dlload
- refs/heads/kc/doctest_meta2
- refs/heads/kc/doctests_CI
- refs/heads/kc/exception_trait
- refs/heads/kc/excise_libgit2_v2
- refs/heads/kc/ext_fail_load_sysimage
- refs/heads/kc/ext_fail_load_sysimage_wip
- refs/heads/kc/ext_fail_load_sysimage_wip_wip
- refs/heads/kc/extension
- refs/heads/kc/filtering_precompile
- refs/heads/kc/fix_init
- refs/heads/kc/fix_print_type
- refs/heads/kc/glue_modules
- refs/heads/kc/immut_dict
- refs/heads/kc/inline_print
- refs/heads/kc/inval
- refs/heads/kc/llvm-opt-zone
- refs/heads/kc/llvm-opt-zone2
- refs/heads/kc/llvm_pass_trac
- refs/heads/kc/llvmcall_pos_arg
- refs/heads/kc/loading_debug_error
- refs/heads/kc/loading_stuff
- refs/heads/kc/macro_mixups
- refs/heads/kc/move_dates_anub
- refs/heads/kc/n_triggers
- refs/heads/kc/perf_ident
- refs/heads/kc/pidlock_repl_history
- refs/heads/kc/pkg3_patch
- refs/heads/kc/pkgdir_fix
- refs/heads/kc/pkgstdlib
- refs/heads/kc/pkgversion
- refs/heads/kc/precompile_overhead
- refs/heads/kc/precompile_with_pkg3
- refs/heads/kc/repl_displaysize_iocontext
- refs/heads/kc/repl_fast
- refs/heads/kc/reuse_compile
- refs/heads/kc/reuse_precompile
- refs/heads/kc/seed_fast
- refs/heads/kc/set_threads
- refs/heads/kc/sigdigits_timing
- refs/heads/kc/so_long_and_thanks_for_the_packages
- refs/heads/kc/spec_f
- refs/heads/kc/sprint_displaysize
- refs/heads/kc/stat_reductions
- refs/heads/kc/stdlib
- refs/heads/kc/stdlib_markdown
- refs/heads/kc/stdlib_printing
- refs/heads/kc/str_lit_cont
- refs/heads/kc/submodule_entry
- refs/heads/kc/substr_toml
- refs/heads/kc/substring_parse
- refs/heads/kc/test
- refs/heads/kc/test_inline
- refs/heads/kc/toml_loading
- refs/heads/kc/tracy_plot
- refs/heads/kc/tuple_afoldl
- refs/heads/kc/type_cache_insert_default
- refs/heads/kc/unused
- refs/heads/kc/upgradable_stdlibs
- refs/heads/kc/warn_using
- refs/heads/kc/was
- refs/heads/kc/weak_deps_2
- refs/heads/kc/whatdocstoshow
- refs/heads/kc/wip_stacktraces
- refs/heads/kc/zone
- refs/heads/kf/53515
- refs/heads/kf/53832
- refs/heads/kf/anysparamlattice
- refs/heads/kf/asan2
- refs/heads/kf/bbmsan
- refs/heads/kf/bindingpartitionwip
- refs/heads/kf/cedarwip
- refs/heads/kf/cfgwip
- refs/heads/kf/circshift
- refs/heads/kf/closestcandidates
- refs/heads/kf/codegen
- refs/heads/kf/codetypedconst
- refs/heads/kf/compiler_wip_dont_look
- refs/heads/kf/compilerperfwip
- refs/heads/kf/currygetproperty
- refs/heads/kf/customlattice
- refs/heads/kf/cvppipeline
- refs/heads/kf/cwip
- refs/heads/kf/cyclepostorder
- refs/heads/kf/effectpreconds
- refs/heads/kf/erroroptwip
- refs/heads/kf/expzerocase
- refs/heads/kf/fieldtypetfuncunion
- refs/heads/kf/filestdio
- refs/heads/kf/fillrevert
- refs/heads/kf/fixassert
- refs/heads/kf/forcedar
- refs/heads/kf/forcedartemp
- refs/heads/kf/gallium
- refs/heads/kf/getfieldlowering
- refs/heads/kf/heappromote
- refs/heads/kf/hooks3
- refs/heads/kf/ia/conditionalbug
- refs/heads/kf/incomplete2
- refs/heads/kf/incomplete_type
- refs/heads/kf/inferencefaster
- refs/heads/kf/interphook
- refs/heads/kf/iter
- refs/heads/kf/iteratewip
- refs/heads/kf/jb/rm_deps_3
- refs/heads/kf/jscall
- refs/heads/kf/loadingrename
- refs/heads/kf/loosenhardlimit
- refs/heads/kf/macrocallsig
- refs/heads/kf/magiccompilerdustforceleste2
- refs/heads/kf/magiccompilerdustforceleste3
- refs/heads/kf/magiccompilerdustforceleste4
- refs/heads/kf/mimedata
- refs/heads/kf/mirefactor
- refs/heads/kf/mmap
- refs/heads/kf/multiany
- refs/heads/kf/newclidrivers
- refs/heads/kf/newdinfo
- refs/heads/kf/nospecialsupertype
- refs/heads/kf/nospecialtypename
- refs/heads/kf/notworkingbadwip
- refs/heads/kf/opaque_closures2
- refs/heads/kf/permuteddimssimilar
- refs/heads/kf/reclimit
- refs/heads/kf/refactortodo
- refs/heads/kf/replfixes
- refs/heads/kf/rmwatchers
- refs/heads/kf/sanitizermake
- refs/heads/kf/stdioredirect
- refs/heads/kf/switchwip
- refs/heads/kf/topush
- refs/heads/kf/tpu
- refs/heads/kf/tpu2
- refs/heads/kf/tpu3
- refs/heads/kf/typeoftypes
- refs/heads/kf/typeofvalid
- refs/heads/kf/ubdocs
- refs/heads/kf/unionpenalties2
- refs/heads/kf/unionsplit2
- refs/heads/kf/usingspartition
- refs/heads/kf/uvint32
- refs/heads/kf/wasm
- refs/heads/kf/wasm2
- refs/heads/kf/wasm3
- refs/heads/kf/wasm4
- refs/heads/kf/wine-check_ws
- refs/heads/kf/winefix2
- refs/heads/kf/winfix
- refs/heads/kf/wip
- refs/heads/kf/wrapintops
- refs/heads/kf/xlademo
- refs/heads/kp-improve-rl
- refs/heads/kp/disable-gc-atexit
- refs/heads/kp/fix-53325
- refs/heads/kp/old_partr
- refs/heads/kp/schedtask
- refs/heads/ksh/pkgtestset
- refs/heads/ksh/sockdoc
- refs/heads/lh/FieldError-doctstring
- refs/heads/lh/compiler-helpers
- refs/heads/lh/delete-redundant-cat-methods
- refs/heads/lh/dict-token-api
- refs/heads/lh/fix-typos
- refs/heads/lh/fix-typos-base
- refs/heads/lh/prepared-comparisons
- refs/heads/lh/readdir_direntry
- refs/heads/lh/save
- refs/heads/lh/snake_effects
- refs/heads/lh/sort-tuple
- refs/heads/lh/stacktrace-reverse-print
- refs/heads/lh/strides
- refs/heads/lh/typos-fixup-base
- refs/heads/lh/unknown-cycle-size
- refs/heads/lh/using-as
- refs/heads/master
- refs/heads/mb/I,broadcast
- refs/heads/mb/aliasscopebroadcast
- refs/heads/mb/inbounds-expression
- refs/heads/mb/outline-broadcast
- refs/heads/mb/recursive-cat
- refs/heads/mb/self-aliasing-broadcasts
- refs/heads/mb/thisshouldhaveoccurredtome
- refs/heads/mb/transpose
- refs/heads/mb/true28866
- refs/heads/mb/viewdefault
- refs/heads/mh/circular_types
- refs/heads/mh/ctor-inferability
- refs/heads/mh/fix-38327
- refs/heads/mh/fix-38364
- refs/heads/mh/fix-50548
- refs/heads/mh/fix-50617
- refs/heads/mh/improve-tmeet-for-vararg-partialstruct
- refs/heads/mh/patch_rdims
- refs/heads/mh/rework_apply
- refs/heads/mh/totuple_builtin
- refs/heads/mji/zygote
- refs/heads/mp/ssh-key-debug
- refs/heads/nhd-alloc-profiler-types+reasons
- refs/heads/nhd-apply-generic-stack-args
- refs/heads/nhd-channel-funcs-nospecialize
- refs/heads/nhd-enforce-stable
- refs/heads/nhd-fix-typo
- refs/heads/nhd-getindex-propagate_inbounds
- refs/heads/nhd-heap-snapshot-sampling-3
- refs/heads/nhd-parse-type
- refs/heads/nhd-test_logs-kwargs
- refs/heads/nl/Dict
- refs/heads/nl/broadcast2
- refs/heads/nl/cat
- refs/heads/nl/compiled
- refs/heads/nl/get!
- refs/heads/nl/length
- refs/heads/nl/mapreducedim
- refs/heads/ob/cttx
- refs/heads/ob/rref
- refs/heads/ob/stackmaps
- refs/heads/openssl
- refs/heads/origin/kf/ccsisdefined
- refs/heads/os/better-givens
- refs/heads/oscardssmith-exhaustive-Float160-tests
- refs/heads/pc/codeinfo-args
- refs/heads/pc/codlayer8
- refs/heads/pc/gm-stack
- refs/heads/pc/more-licm
- refs/heads/pc/reoptimize
- refs/heads/pc/sleep
- refs/heads/pc/zone
- refs/heads/pepijndevos-constpropcrimes
- refs/heads/pop-abstractset
- refs/heads/pv-alloc-profile-wrap-pool-alloc
- refs/heads/release-0.1
- refs/heads/release-0.2
- refs/heads/release-0.3
- refs/heads/release-0.4
- refs/heads/release-0.5
- refs/heads/release-0.6
- refs/heads/release-0.7
- refs/heads/release-1.0
- refs/heads/release-1.1
- refs/heads/release-1.10
- refs/heads/release-1.11
- refs/heads/release-1.2
- refs/heads/release-1.3
- refs/heads/release-1.4
- refs/heads/release-1.5
- refs/heads/release-1.6
- refs/heads/release-1.7
- refs/heads/release-1.8
- refs/heads/release-1.9
- refs/heads/revert-22049-kf/memcpyopt
- refs/heads/revert-26854-kc/bump_pkg3_6
- refs/heads/revert-28319-kc/precompiler_build2
- refs/heads/revert-29494-kf/uncolon_recursion
- refs/heads/revert-37410-slurp_assignment
- refs/heads/revert-44205-patch-1
- refs/heads/revert-45153-heaphoist-fix
- refs/heads/revert-45677-revert-45195-vc/llvm_14.0.2
- refs/heads/revert-50466-dcn/fix-50419
- refs/heads/revert-52003-revert-29919-sb/reduce-empty
- refs/heads/revert-52086-jn/sort-nonvector-collect
- refs/heads/revert-54916-avi/cache-unoptimized-generated
- refs/heads/rf/Bit
- refs/heads/rf/broaden-hash
- refs/heads/rf/conv-str-regex
- refs/heads/rf/defaults
- refs/heads/rf/digits-unsigned-nonrecur
- refs/heads/rf/iter-access
- refs/heads/rf/merge-iter
- refs/heads/rf/ndigits-bases
- refs/heads/rf/pure-push
- refs/heads/rf/pure-push-iocontext
- refs/heads/rf/rand-distrib
- refs/heads/rf/rand-f16-shift
- refs/heads/rf/rand-same-same
- refs/heads/rf/rand/default_rng_dispatch
- refs/heads/rf/rand/hash-seed
- refs/heads/rf/randn-bigfloat
- refs/heads/rf/randn-fillarray
- refs/heads/rf/randperm-ndl
- refs/heads/rf/regex-partial
- refs/heads/rf/regex-testset
- refs/heads/rf/repl/simplify
- refs/heads/rf/repl/switch-mode
- refs/heads/rf/seed-rng
- refs/heads/rf/show/sorted
- refs/heads/rf/typed-hash
- refs/heads/rf/union-immutable-set
- refs/heads/rf/unmerge-merge
- refs/heads/rf/xoshiro/randn
- refs/heads/rf/zeros-bang
- refs/heads/sb/accumulate
- refs/heads/sb/float-div
- refs/heads/sb/libgit2/peel
- refs/heads/sb/reduce-and
- refs/heads/sb/sigfpe2
- refs/heads/sb/task-fenv
- refs/heads/sb/test-scope
- refs/heads/sb/tmstruct-utc
- refs/heads/sds/codegen_globals_wip
- refs/heads/sds/eachindex
- refs/heads/sds/extended_slurp2
- refs/heads/sds/fix_hash_factorization
- refs/heads/sds/inline_bindings
- refs/heads/sds/invalid_argument
- refs/heads/sds/ir_indent
- refs/heads/sds/iter_cartesian
- refs/heads/sds/less_demangle
- refs/heads/sds/named_opaque
- refs/heads/sds/nonstandard_expr_printing
- refs/heads/sds/prop_destruct_macroexpand
- refs/heads/sds/repl_paste
- refs/heads/sds/shell_complete
- refs/heads/sds/timestimes
- refs/heads/sds/tkf/type-capturing
- refs/heads/sds/typedglobals2
- refs/heads/sds/unesc_backslash_cmd
- refs/heads/sf/DO_NOT_DELETE_THIS_BRANCH_unbuildable_commits_test
- refs/heads/sf/altered_treehashes
- refs/heads/sf/armv7l_fixes
- refs/heads/sf/cedar
- refs/heads/sf/cedar2
- refs/heads/sf/core_o_rama
- refs/heads/sf/lazy_jlls
- refs/heads/sf/no_more_base_blas
- refs/heads/sf/patchelf_builddir_not_srccache
- refs/heads/sf/phi_node_replacement
- refs/heads/sf/read_only_stdlib
- refs/heads/sf/simplify_threading_check
- refs/heads/sgj/Test.GenericDimensionful
- refs/heads/sgj/displaydigits
- refs/heads/sgj/hascodepoint
- refs/heads/sgj/hess_eig
- refs/heads/sgj/iteratedfunction
- refs/heads/sgj/mapreduce_pairwise
- refs/heads/sgj/mdwalk
- refs/heads/sgj/no_Lm_start
- refs/heads/shell_mode_windows
- refs/heads/show-container-type
- refs/heads/sjk/spqr
- refs/heads/sk/debuginfo=none
- refs/heads/sk/hash_uint
- refs/heads/sk/highlander.alt
- refs/heads/sk/highlander.alt1
- refs/heads/sk/highlander.alt2
- refs/heads/sk/libgit2-ssh-network-options
- refs/heads/sk/newchar
- refs/heads/sk/precompile-blacklist
- refs/heads/sk/stringstate
- refs/heads/sk/unzip
- refs/heads/sk/vendored-packages
- refs/heads/sk/void
- refs/heads/sk/winpaths
- refs/heads/sort_readdir
- refs/heads/srp/repl-undo
- refs/heads/staging
- refs/heads/stevengj-patch-1
- refs/heads/stevengj-patch-2
- refs/heads/stevengj-patch-3
- refs/heads/stevengj-patch-5
- refs/heads/tan/readdlm2
- refs/heads/tb/avoid_oom
- refs/heads/tb/codegen-norecursion
- refs/heads/tb/cuda
- refs/heads/tb/debug_intrinsics
- refs/heads/tb/dinfo_abspath
- refs/heads/tb/excstack_without_handler_backport
- refs/heads/tb/features
- refs/heads/tb/generator_error
- refs/heads/tb/have_fminmax
- refs/heads/tb/inference_hooks
- refs/heads/tb/ircompact_ssavalue_render
- refs/heads/tb/llvm_type_ctor
- refs/heads/tb/map!_boundschecks
- refs/heads/tb/pmb_test
- refs/heads/tb/pointerref_addrspace
- refs/heads/tb/poison
- refs/heads/tb/riscv
- refs/heads/tb/strip_as
- refs/heads/tb/task_debug_build
- refs/heads/tb/task_switch_hook
- refs/heads/tb/tdma
- refs/heads/tb/tpu
- refs/heads/teh-vc/serialize_partial_rebase
- refs/heads/teh/bcast_range
- refs/heads/teh/cache_native
- refs/heads/teh/checkindex_traits
- refs/heads/teh/doc_skip_warn
- refs/heads/teh/make_backref_just_visited
- refs/heads/teh/minmax_isless
- refs/heads/teh/pctools
- refs/heads/teh/serialize_partial_recache
- refs/heads/teh/shareindexes
- refs/heads/teh/tuple_limit
- refs/heads/teh/unwrap_isequal
- refs/heads/teh/valgrind-codegen-suppress
- refs/heads/tk/geev
- refs/heads/tkf/jltapir-pr
- refs/heads/topolarity-ct/macroexpand-no-toplevel-recursion
- refs/heads/v1.0
- refs/heads/vc-gb/pc/sleep
- refs/heads/vc/TTLI
- refs/heads/vc/aliasscopes
- refs/heads/vc/amdas
- refs/heads/vc/backport_threadsafety
- refs/heads/vc/bump_llvm
- refs/heads/vc/ccall_safe_gc
- refs/heads/vc/compiler_instance_v2
- refs/heads/vc/dsweep
- refs/heads/vc/dynamicdomtree
- refs/heads/vc/eabi_half
- refs/heads/vc/enable_jit_profiling_using_ittapi
- refs/heads/vc/external_functions_rebase
- refs/heads/vc/fattr_pgcstack
- refs/heads/vc/fixthreadswitching
- refs/heads/vc/float128
- refs/heads/vc/float128_basic
- refs/heads/vc/float16_intrinsics
- refs/heads/vc/gdb-pp
- refs/heads/vc/heap_increment
- refs/heads/vc/hwloc
- refs/heads/vc/instrumentations
- refs/heads/vc/int128_atomics
- refs/heads/vc/ittapi_integration
- refs/heads/vc/julia_cong
- refs/heads/vc/julia_vec_shm
- refs/heads/vc/libffi
- refs/heads/vc/libuv_lock
- refs/heads/vc/licm
- refs/heads/vc/llvm-11-svm-back
- refs/heads/vc/llvm-dialects
- refs/heads/vc/llvm11_debug
- refs/heads/vc/llvm11again
- refs/heads/vc/llvm8
- refs/heads/vc/llvm_undef
- refs/heads/vc/loop-unroll
- refs/heads/vc/mlir
- refs/heads/vc/no_copy_stacks
- refs/heads/vc/pappa_demo
- refs/heads/vc/pir
- refs/heads/vc/pkgimg_split
- refs/heads/vc/ppc-llvm6
- refs/heads/vc/ppc_fixes
- refs/heads/vc/ppc_llvm9_revert
- refs/heads/vc/ppc_patch
- refs/heads/vc/ppc_unix_signals
- refs/heads/vc/ppc_yield
- refs/heads/vc/pragmas
- refs/heads/vc/preload_zlib
- refs/heads/vc/remove_track_allocations
- refs/heads/vc/restored-1.0.1
- refs/heads/vc/round_even
- refs/heads/vc/rv_passes
- refs/heads/vc/smallints
- refs/heads/vc/tapir
- refs/heads/vc/tapir2_rts
- refs/heads/vc/tapir3-codegen-chi
- refs/heads/vc/tapir_build
- refs/heads/vc/task_code_const
- refs/heads/vc/tomlcc
- refs/heads/vc/tsan_nort
- refs/heads/vc/unreachable_methods
- refs/heads/vc/uring
- refs/heads/vc/vsts
- refs/heads/vc/wasm
- refs/heads/vc/wasm2
- refs/heads/vc/weakref_tasks
- refs/heads/vc/win_poolalignment
- refs/heads/vc/ws
- refs/heads/vc/wsqueue
- refs/heads/vc/x86low
- refs/heads/vc/yhls/dynamicdomtree
- refs/heads/vs/SparseArrays-bump-ss7.5.1
- refs/heads/vs/rm-openlibm
- refs/heads/yyc/arm/crc32c
- refs/heads/yyc/arm/fenv-0.5
- refs/heads/yyc/bigint
- refs/heads/yyc/codegen/eh
- refs/heads/yyc/codegen/local-push
- refs/heads/yyc/codegen/no-safepoint
- refs/heads/yyc/codegen/wb2
- refs/heads/yyc/dft_split
- refs/heads/yyc/dftnew_rebase
- refs/heads/yyc/gc-alloc
- refs/heads/yyc/gc-debug-env
- refs/heads/yyc/gc/safepoint-rt
- refs/heads/yyc/gc/thread-DO-NOT-merge
- refs/heads/yyc/less-getfield
- refs/heads/yyc/ovldot
- refs/heads/yyc/test/release-0.6
- refs/heads/yyc/tests/appveyor
- refs/heads/yyc/tests/arm
- refs/heads/yyc/tests/llvm39
- refs/heads/yyc/tests/master
- refs/heads/yyc/travis-test
- refs/heads/yyc/typeinf/egal
- refs/heads/yyc/typeinf/pure
- refs/heads/zierenberg-master
- refs/remotes/KC/kc/error_msgs
- refs/remotes/origin/avi/validwidenconst
- refs/remotes/origin/backports-release-1.6
- refs/remotes/origin/dcn-canonicalize-callable-names
- refs/remotes/origin/dcn/adjust-n-gc-threads
- refs/remotes/origin/sgj/readuntil_inplace
- refs/tags/v0.1
- refs/tags/v0.1.1
- refs/tags/v0.1.2
- refs/tags/v0.2.0-rc1
- refs/tags/v0.2.0-rc2
- refs/tags/v0.3.0
- refs/tags/v0.3.0-rc1
- refs/tags/v0.3.0-rc2
- refs/tags/v0.3.0-rc3
- refs/tags/v0.3.0-rc4
- refs/tags/v0.3.1
- refs/tags/v0.3.10
- refs/tags/v0.3.11
- refs/tags/v0.3.12
- refs/tags/v0.3.2
- refs/tags/v0.3.3
- refs/tags/v0.3.4
- refs/tags/v0.3.5
- refs/tags/v0.3.6
- refs/tags/v0.3.7
- refs/tags/v0.3.8
- refs/tags/v0.3.9
- refs/tags/v0.4.0
- refs/tags/v0.4.0-rc1
- refs/tags/v0.4.0-rc2
- refs/tags/v0.4.0-rc3
- refs/tags/v0.4.0-rc4
- refs/tags/v0.4.1
- refs/tags/v0.4.2
- refs/tags/v0.4.3
- refs/tags/v0.4.4
- refs/tags/v0.4.5
- refs/tags/v0.4.6
- refs/tags/v0.4.7
- refs/tags/v0.5.0
- refs/tags/v0.5.0-rc0
- refs/tags/v0.5.0-rc1
- refs/tags/v0.5.0-rc2
- refs/tags/v0.5.0-rc3
- refs/tags/v0.5.0-rc4
- refs/tags/v0.5.1
- refs/tags/v0.5.2
- refs/tags/v0.6.0
- refs/tags/v0.6.0-pre.alpha
- refs/tags/v0.6.0-pre.beta
- refs/tags/v0.6.0-rc1
- refs/tags/v0.6.0-rc2
- refs/tags/v0.6.0-rc3
- refs/tags/v0.6.1
- refs/tags/v0.6.2
- refs/tags/v0.6.3
- refs/tags/v0.6.4
- refs/tags/v0.7.0
- refs/tags/v0.7.0-alpha
- refs/tags/v0.7.0-beta
- refs/tags/v0.7.0-beta2
- refs/tags/v0.7.0-rc1
- refs/tags/v0.7.0-rc2
- refs/tags/v0.7.0-rc3
- refs/tags/v1.0.0
- refs/tags/v1.0.0-rc1
- refs/tags/v1.0.1
- refs/tags/v1.0.2
- Branches list truncated to 996 entries, 100 were omitted.
Take a new snapshot of a software origin
If the archived software origin currently browsed is not synchronized with its upstream version (for instance when new commits have been issued), you can explicitly request Software Heritage to take a new snapshot of it.
Use the form below to proceed. Once a request has been submitted and accepted, it will be processed as soon as possible. You can then check its processing state by visiting this dedicated page.Processing "take a new snapshot" request ...
Permalinks
To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.
Revision | Author | Date | Message | Commit Date |
---|---|---|---|---|
50faa84 | Simeon David Schaub | 12 February 2022, 22:55:29 UTC | wip | 12 February 2022, 22:55:29 UTC |
071ae18 | Cameron Bieganek | 12 February 2022, 18:17:56 UTC | doc: add note about `reduce([hv]cat, x)` in `[hv]cat` (#44049) | 12 February 2022, 18:17:56 UTC |
7826ac8 | Tim Besard | 12 February 2022, 17:46:05 UTC | Generalize storage of factorizations. (#42594) Introduce additional type parameters to remove hard-coded arrays from structures. | 12 February 2022, 17:46:05 UTC |
4c101a1 | Jasha10 | 12 February 2022, 17:09:55 UTC | fix asyncmap docs typo (#43571) | 12 February 2022, 17:09:55 UTC |
e422590 | Thibaut Lienart | 12 February 2022, 17:07:42 UTC | clarify mkpath docstring (#43987) Close #43964 | 12 February 2022, 17:07:42 UTC |
3326cc3 | Jameson Nash | 12 February 2022, 17:04:24 UTC | Revert "use specialized code when compiling opaque closure expressions (#43320)" (#44149) This reverts commit 5cb0f14a1beb65fe562ef24d27741e9ec92d1feb due to failing on CI (analyzegc). | 12 February 2022, 17:04:24 UTC |
e7f2307 | Bogumił Kamiński | 12 February 2022, 17:02:45 UTC | Fix docstring for keepat! (#44128) `keepat!` also works with `BitVector` | 12 February 2022, 17:02:45 UTC |
aad5c1c | Jakob Nybo Nissen | 12 February 2022, 14:41:50 UTC | doc: improve docstring of eachsplit (#43745) | 12 February 2022, 14:41:50 UTC |
f6aab71 | Atsushi Sakai | 12 February 2022, 13:47:51 UTC | RFC: Add description to load a local module and using it in example codes. (#41398) * Add description to load a local module and using it in example codes. * make example codes to doctests. Co-authored-by: Viral B. Shah <ViralBShah@users.noreply.github.com> | 12 February 2022, 13:47:51 UTC |
0a91e71 | Fons van der Plas | 12 February 2022, 03:00:46 UTC | Docs: clarify `JULIA_NUM_THREADS=auto` compat 1.7 (#43842) | 12 February 2022, 03:00:46 UTC |
b1d152d | Felipe Noronha | 12 February 2022, 02:57:05 UTC | improve Channel special constructor docstring (#43979) | 12 February 2022, 02:57:05 UTC |
e376fcc | Ian Butterworth | 12 February 2022, 02:17:45 UTC | Add a `:dynamic` scheduling option for `Threads.@threads` (#43919) Co-authored-by: Julian Samaroo <jpsamaroo@jpsamaroo.me> Co-authored-by: Takafumi Arakaki <29282+tkf@users.noreply.github.com> Co-authored-by: Valentin Churavy <vchuravy@users.noreply.github.com> | 12 February 2022, 02:17:45 UTC |
4409a1b | Oscar Smith | 11 February 2022, 21:00:58 UTC | remove tuple indexing by non-integer (#43760) Co-authored-by: Fredrik Ekre <ekrefredrik@gmail.com> Co-authored-by: Simeon Schaub <schaub@mit.edu> | 11 February 2022, 21:00:58 UTC |
a557536 | Keno Fischer | 11 February 2022, 17:51:10 UTC | Add a few missing effects taints (#44125) Should fix Downloads test (it decided Downloads' easy_hook didn't do anything and accidentally deleted it). | 11 February 2022, 17:51:10 UTC |
5cb0f14 | Jeff Bezanson | 11 February 2022, 16:47:35 UTC | use specialized code when compiling opaque closure expressions (#43320) invoke specialization when an OC is created at run time | 11 February 2022, 16:47:35 UTC |
98e60ff | Cameron Bieganek | 11 February 2022, 14:41:52 UTC | Add `allequal` (#43354) * Add `allequal`. | 11 February 2022, 14:41:52 UTC |
32a026a | Eric Hanson | 10 February 2022, 19:24:53 UTC | Test: document and export `TestLogger` and `LogRecord`. (#44080) | 10 February 2022, 19:24:53 UTC |
85c83a7 | Jeff Bezanson | 10 February 2022, 19:19:03 UTC | some improvements to GC stat printing (#44098) - line up `elapsed time` - print most numbers unconditionally - print minor/full collections instead of all/full collections - count `free` calls for arrays, since we count `malloc`s for them | 10 February 2022, 19:19:03 UTC |
0bf6ce3 | Fredrik Ekre | 10 February 2022, 15:07:51 UTC | Fix doctests for CodeUnits indexing. (#44105) | 10 February 2022, 15:07:51 UTC |
94bbfd4 | Jeremiah | 10 February 2022, 14:02:00 UTC | [Docs] Add missing code block (#44094) * [Docs] Add missing code block * Fix block order | 10 February 2022, 14:02:00 UTC |
aae68a5 | Pete Vilter | 10 February 2022, 08:04:01 UTC | alloc profiler: add compat note to docstring (#44100) | 10 February 2022, 08:04:01 UTC |
c360a58 | Louis Ponet | 10 February 2022, 07:16:20 UTC | Fixed inference on String and Symbol causing invalidations in show.jl (#44091) | 10 February 2022, 07:16:20 UTC |
fed4544 | Shuhei Kadowaki | 10 February 2022, 05:58:41 UTC | inference: follow up #43852 (#44101) This commit consists of minor follow up tweaks for #43852: - inlining: use `ConstResult` if available - refactor tests - simplify `CodeInstance` constructor signature - tweak `concrete_eval_const_proven_total_or_error` signature for JET integration | 10 February 2022, 05:58:41 UTC |
708873a | Oscar Smith | 10 February 2022, 05:03:03 UTC | actually add the atributes (#44097) Co-authored-by: oscarddssmith <oscar.smith@juliacomputing.com> | 10 February 2022, 05:03:03 UTC |
93a5f69 | Eric Hanson | 09 February 2022, 22:59:56 UTC | Test.TestLogger: add `respect_maxlog` option (#44085) | 09 February 2022, 22:59:56 UTC |
f090992 | Keno Fischer | 09 February 2022, 22:24:00 UTC | Take purity modeling seriously (#43852) * Implement new effect system * TLDR Before: ``` julia> let b = Expr(:block, (:(y += sin($x)) for x in randn(1000))...) @eval function f_sin_perf() y = 0.0 $b y end end f_sin_perf (generic function with 1 method) julia> @time @code_typed f_sin_perf() 15.707267 seconds (25.95 M allocations: 1.491 GiB, 3.30% gc time) [lots of junk] ``` After: ``` julia> @time @code_typed f_sin_perf() 0.016818 seconds (187.35 k allocations: 7.901 MiB, 99.73% compilation time) CodeInfo( 1 ─ return 27.639138714768546 ) => Float64 ``` so roughly a 1000x improvement in compile time performance for const-prop heavy functions. There are also run time improvements for functions that have patterns like: ``` function some_function_to_big_to_be_inlined_but_pure(x) .... end function foo(x) some_function_to_big_to_be_inlined_but_pure(x) return x end ``` The inliner will now be able to see that some_function_to_big_to_be_inlined_but_pure is effect free, even without inlining it and just delete it, improving runtime performance (if some_function_to_big_to_be_inlined_but_pure is small enough to be inlined, there is a small compile time throughput win, by being able to delete it without inlining, but that's a smaller gain than the compile time gain above). * Motivation / Overview There are two motivations for this work. The first is the above mentioned improvement in compiler performance for const-prop heavy functions. This comes up a fair bit in various Modeling & Simulation codes we have where Julia code is often auto-generated from some combination of parameterized model codes and data. This ends up creating enormous functions with significant need for constant propagation (~50k statements with ~20k constant calls are not uncommon). Our current compiler was designed for people occasionally throwing a `sqrt(2)` or something in a function, not 20k of them, so performance is quite bad. The second motivation is to have finer grained control over our purity modeling. We have `@Base.pure`, but that has somewhat nebulous semantics and is quite a big hammer that is not appropriate in most situations. These may seem like orthogonal concerns at first, but they are not. The compile time issues fundamentally stem from us running constant propagation in inference's abstract interpreter. However, for simple, pure functions, that is entirely unnecessary, because we have a super-fast, JIT compiler version of that function just laying around in general. The issue is that we currently, we generally do not know when it is legal to run the JIT-compiled version of the function and when we need to abstractly interpret it. However, if the compiler were able to figure out an appropriate notion of purity, it could start doing that (which is what it does now for `@Base.pure` functions). This PR adds that kind of notion of purity, converges it along with type information during inference and then makes use of it to speed up evaluation of constant propagation (where it is legal to do so), as well as improving the inliner. * The new purity notions The new purity model consists of four different kinds flags per code instance. For builtins and intrinsics the existing effect free and nothrow models are re-used. There is also a new macro `@Base.assume_effects` available, which can set the purity base case for methods or `:foreigncall`s. Here is the docstring for that macro, which also explains the semantics of the new purity flags: ``` @assume_effects setting... ex @assume_effects(setting..., ex) `@assume_effects` overrides the compiler's effect modeling for the given method. `ex` must be a method definition. WARNING: Improper use of this macro causes undefined behavior (including crashes, incorrect answers, or other hard to track bugs). Use with care an only if absolutely required. In general, each `setting` value makes an assertion about the behavior of the function, without requiring the compiler to prove that this behavior is indeed true. These assertions are made for all world ages. It is thus advisable to limit the use of generic functions that may later be extended to invalidate the assumption (which would cause undefined behavior). The following `settings` are supported. ** `:idempotent` The `:idempotent` setting asserts that for egal inputs: - The manner of termination (return value, exception, non-termination) will always be the same. - If the method returns, the results will always be egal. Note: This in particular implies that the return value of the method must be immutable. Multiple allocations of mutable objects (even with identical contents) are not egal. Note: The idempotency assertion is made world-arge wise. More formally, write fₐ for the evaluation of `f` in world-age `a`, then we require: ∀ a, x, y: x === y → fₐ(x) === fₐ(y) However, for two world ages `a, b` s.t. `a != b`, we may have `fₐ(x) !== fₐ(y)`` Note: A further implication is that idempontent functions may not make their return value dependent on the state of the heap or any other global state that is not constant for a given world age. Note: The idempontency includes all legal rewrites performed by the optimizizer. For example, floating-point fastmath operations are not considered idempotent, because the optimizer may rewrite them causing the output to not be idempotent, even for the same world age (e.g. because one ran in the interpreter, while the other was optimized). ** `:effect_free` The `:effect_free` setting asserts that the method is free of externally semantically visible side effects. The following is an incomplete list of externally semantically visible side effects: - Changing the value of a global variable. - Mutating the heap (e.g. an array or mutable value), except as noted below - Changing the method table (e.g. through calls to eval) - File/Network/etc. I/O - Task switching However, the following are explicitly not semantically visible, even if they may be observable: - Memory allocations (both mutable and immutable) - Elapsed time - Garbage collection - Heap mutations of objects whose lifetime does not exceed the method (i.e. were allocated in the method and do not escape). - The returned value (which is externally visible, but not a side effect) The rule of thumb here is that an externally visible side effect is anything that would affect the execution of the remainder of the program if the function were not executed. Note: The effect free assertion is made both for the method itself and any code that is executed by the method. Keep in mind that the assertion must be valid for all world ages and limit use of this assertion accordingly. ** `:nothrow` The `:nothrow` settings asserts that this method does not terminate abnormally (i.e. will either always return a value or never return). Note: It is permissible for :nothrow annotated methods to make use of exception handling internally as long as the exception is not rethrown out of the method itself. Note: MethodErrors and similar exceptions count as abnormal termination. ** `:terminates_globally` The `:terminates_globally` settings asserts that this method will eventually terminate (either normally or abnormally), i.e. does not infinite loop. Note: The compiler will consider this a strong indication that the method will terminate relatively *quickly* and may (if otherwise legal), call this method at compile time. I.e. it is a bad idea to annotate this setting on a method that *technically*, but not *practically*, terminates. Note: The `terminates_globally` assertion, covers any other methods called by the annotated method. ** `:terminates_locally` The `:terminates_locally` setting is like `:terminates_globally`, except that it only applies to syntactic control flow *within* the annotated method. It is this a much weaker (and thus safer) assertion that allows for the possibility of non-termination if the method calls some other method that does not terminate. Note: `terminates_globally` implies `terminates_locally`. * `:total` The `setting` combines the following other assertions: - `:idempotent` - `:effect_free` - `:nothrow` - `:terminates_globally` and is a convenient shortcut. Note: `@assume_effects :total` is similar to `@Base.pure` with the primary distinction that the idempotency requirement applies world-age wise rather than globally as described above. However, in particular, a method annotated `@Base.pure` is always total. ``` * Changes to data structures - Each CodeInstance gains two sets of four flags corresponding to the notions above (except terminates_locally, which is just a type inference flag). One set of flags tracks IPO-valid information (as determined by inference), the other set of flags tracks optimizer-valid information (as determined after optimization). Otherwise they have identical semantics. - Method and CodeInfo each gain 5 bit flags corresponding 1:1 to the purity notions defined above. No separate distinction is made between IPO valid and optimizer valid flags here. We might in the future want such a distinction, but I'm hoping to get away without it for now, since the IPO-vs-optimizer distinction is a bit subtle and I don't really want to expose that to the user. - `:foreigncall` gains an extra argument (after `cconv`) to describe the effects of the call. * Algorithm Relatively straightforward. - Every call or builtin accumulates its effect information into the current frame. - Finding an effect (throw/global side effect/non-idempotenct, etc.) taints the entire frame. Idempotency is technically a dataflow property, but that is not modeled here and any non-idempotent intrinsic will taint the idempotency flag, even if it does not contribute to the return value. I don't think that's a huge problem in practice, because currently we only use idempotency if effect-free is also set and in effect-free functions you'd generally expect every statement to contribute to the return value. - Any backedge taints the termination effect, as does any recursion - Unknown statements (generic calls, things I haven't gotten around to) taint all effects * Make INV_2PI a tuple Without this, the compiler cannot assume that the range reduction is idempotent to make use of the new fast constprop code path. In the future this could potentially be an ImmutableArray, but since this is relatively small, a tuple is probably fine. * Evalute :total function in the proper world * Finish effects implementation for ccall * Add missing `esc` * Actually make use of terminates_locally override * Mark ^(x::Float64, n::Integer) as locally terminating * Shove effects into calling convention field * Make inbounds taint consistency Inbounds and `--check-bounds=no` basically make the assertion: If this is dynamically reached during exceution then the index will be inbounds. However, effects on a function are a stronger statement. In particular, for *any* input values (not just the dynamically reached ones), the effects need to hold. This is in particular true, because inference can run functions that are dynamically dead, e.g. ``` if unknown_bool_return() # false at runtime, but inference doesn't know x = sin(1.0) end ``` Inference will (and we want it to) run the `sin(1.0)` even though it is not dynamically reached. For the moment, make any use of `--check-bounds=no` or `@inbounds` taint the consistency effect, which is semantically meaningful and prevents inference from running the function. In the future, we may want more precise tracking of inbounds that would let us recover some precision here. * Allow constprop to refine effects * Properly taint unknown call in apply * Add NEWS and doc anchor * Correct effect modeling for arraysize * Address Shuhei's review * Fix regression on inference time benchmark The issue wasn't actually the changes here, they just added additional error paths which bridged inference into the Base printing code, which as usual takes a fairly long time to infer. Add some judicious barriers and nospecialize statements to bring inference time back down. * refine docstrings of `@assume_effects` This commit tries to render the docstring of `@assume_effects` within Documenter.jl-generated HTML: - render bullet points - codify the names of settings - use math syntax - use note admonitions * improve effect analysis on allocation Improves `:nothrow` assertion for mutable allocations. Also adds missing `IR_FLAG_EFFECT_FREE` flagging for non-inlined callees in `handle_single_case!` so that we can do more dead code elimination. * address some reviews * Address Jameson's review feedback * Fix tests - address rebase issues Co-authored-by: Shuhei Kadowaki <aviatesk@gmail.com> | 09 February 2022, 22:24:00 UTC |
76fa182 | Pete Vilter | 09 February 2022, 22:23:13 UTC | alloc profiler: adjust warnings in docs; remove logged warning from implementation (#44077) * docs: update warning in the manual; add to reference * remove missed allocs warning from `fetch` since we think we've gotten all the allocs * remove tests of warning message, since it's no longer there | 09 February 2022, 22:23:13 UTC |
6b16eba | Dilum Aluthge | 09 February 2022, 21:37:22 UTC | doc: remind users that versioninfo may include secrets (#43839) Add a warning to the docstring of `InteractiveUtils.versioninfo()` reminding users to remove sensitive information before sharing the output text. | 09 February 2022, 21:37:22 UTC |
a84a058 | Jameson Nash | 09 February 2022, 19:50:41 UTC | Merge pull request #43953 from JuliaLang/jn/43636 impose stricter and earlier validation on ccall/cfunction types | 09 February 2022, 19:50:41 UTC |
dc0aa61 | Tomas Fiers | 09 February 2022, 16:53:16 UTC | Manual for `JULIA_EDITOR`: note `code.cmd` for vscode on Windows (#44083) | 09 February 2022, 16:53:16 UTC |
2118a08 | Keno Fischer | 09 February 2022, 11:19:23 UTC | Add an option to not emit unionsplit fallback blocks (#43923) When union splitting, we currently emit a fallback block that prints `fatal error in type inference (type bound)`. This has always been an oddity, because there are plenty of other places in the compiler that we rely on the correctness of inference, but it has caught a number of issues over the years and we do still have a few issues (e.g. #43064) that show this error. Nevertheless, the occurrence of issues like this has become less frequent, so it might be time to turn it off soon. At the same time, we have downstream users of the compiler infrastructure that get confused by having extra `throw` calls inserted into functions that (post-#43852) were inferred as `:nothrow`. Here we add an optimization param (defaulted to on) to determine whether or not to insert the unionsplit fallback block. Because of the conservative default, we can decide later what the correct default is (maybe turn it on in `debug` mode?), while letting downstream consumers play with the setting for now to see if any issues crop up. | 09 February 2022, 11:19:23 UTC |
0bdf24f | N5N3 | 09 February 2022, 09:11:36 UTC | Move `reinterpret`-based optimization for complex matrix * real vec/mat to lower level. (#44052) | 09 February 2022, 09:11:36 UTC |
33a71b7 | Sebastian Stock | 09 February 2022, 09:00:55 UTC | Allow negative `stride(A,2)` in `gemv!` (#42054) | 09 February 2022, 09:00:55 UTC |
a947fc7 | Keno Fischer | 09 February 2022, 06:36:07 UTC | Add a donotdelete builtin (#44036) In #43852 we noticed that the compiler is getting good enough to completely DCE a number of our benchmarks. We need to add some sort of mechanism to prevent the compiler from doing so. This adds just such an intrinsic. The intrinsic itself doesn't do anything, but it is considered effectful by our optimizer, preventing it from being DCE'd. At the LLVM level, it turns into call to an external varargs function. The docs for the new intrinsic are as follows: ``` donotdelete(args...) This function prevents dead-code elimination (DCE) of itself and any arguments passed to it, but is otherwise the lightest barrier possible. In particular, it is not a GC safepoint, does model an observable heap effect, does not expand to any code itself and may be re-ordered with respect to other side effects (though the total number of executions may not change). A useful model for this function is that it hashes all memory `reachable` from args and escapes this information through some observable side-channel that does not otherwise impact program behavior. Of course that's just a model. The function does nothing and returns `nothing`. This is intended for use in benchmarks that want to guarantee that `args` are actually computed. (Otherwise DCE may see that the result of the benchmark is unused and delete the entire benchmark code). **Note**: `donotdelete` does not affect constant foloding. For example, in `donotdelete(1+1)`, no add instruction needs to be executed at runtime and the code is semantically equivalent to `donotdelete(2).` *# Examples function loop() for i = 1:1000 # The complier must guarantee that there are 1000 program points (in the correct # order) at which the value of `i` is in a register, but has otherwise # total control over the program. donotdelete(i) end end ``` | 09 February 2022, 06:36:07 UTC |
2e2b1d2 | Louis Ponet | 09 February 2022, 03:46:26 UTC | Fixed inference on String causing invalidations in binaryplatform (#44084) | 09 February 2022, 03:46:26 UTC |
7ccc83e | Julian Samaroo | 09 February 2022, 01:36:22 UTC | Add USDTs for the task runtime (#43453) Co-authored-by: Takafumi Arakaki <aka.tkf@gmail.com> | 09 February 2022, 01:36:22 UTC |
0639d0d | DilumAluthgeBot | 09 February 2022, 00:07:44 UTC | 🤖 Bump the Pkg stdlib from 89517355 to c991ce0a (#44075) Co-authored-by: Dilum Aluthge <dilum@aluthge.com> | 09 February 2022, 00:07:44 UTC |
d7fd3b7 | Nathan Daly | 08 February 2022, 21:18:35 UTC | `===` Optimization: Defer recursion into pointees (#43658) * jl_egal Optimization: Defer recursion into pointees Immutable struct comparisons with `===` can be arbitrarily expensive for deeply recursive but (almost) equal objects. Whenever possible, it's valuable to defer the potentially expensive recursion by first comparing the struct fields for bitwise equality. Before this commit, two structs are compare elementwise, in the order of the struct definition, recursing when pointer fields are encountered. This commit defers the recursion into pointed-to fields until after all other non-pointer fields of the struct are compared. This has two advantages: 1. It defers the expensive part of === comparison as long as possible, in the hopes that we can exit early from dissimilarities discovered elsewhere in the struct instances. 2. It improves cache-locality by scanning the whole struct before jumping into any new places in memory (and reducing comparisons needed on the current cache line after returning from the recursive call). The drawback is that you'll have to scan the pointer fields again, which means potentially more cache misses if the struct is very large. The best way to tell if this is helpful or harmful is benchmarking. Here is the motivating benchmark, which indeed improves by 10x with this commit, compared to master: ```julia julia> using BenchmarkTools julia> struct VN val::Float32 next::Union{VN, Array} # put a mutable thing at the end, to prevent runtime from sharing instances end julia> struct NV next::Union{NV, Array} # put a mutable thing at the end, to prevent runtime from sharing instances val::Float32 end julia> function make_chain_vn(n, sentinal) head = VN(1, sentinal) for i in 2:n head = VN(rand(Int), head) end return head end make_chain_vn (generic function with 1 method) julia> function make_chain_nv(n, sentinal) head = NV(sentinal, 1) for i in 2:n head = NV(head, rand(Int)) end return head end make_chain_nv (generic function with 1 method) julia> vn1, vn2 = make_chain_vn(10000, []), make_chain_vn(10000, []); julia> nv1, nv2 = make_chain_nv(10000, []), make_chain_nv(10000, []); ``` Master: ``` julia> @btime $vn1 === $vn2 7.562 ns (0 allocations: 0 bytes) false julia> @btime $nv1 === $nv2 # slower, since it recurses pointers unnecessarily 76.952 μs (0 allocations: 0 bytes) false ``` After this commit: ``` julia> @btime $vn1 === $vn2 8.597 ns (0 allocations: 0 bytes) false julia> @btime $nv1 === $nv2 # We get to skip the recursion and exit early. :) 10.280 ns (0 allocations: 0 bytes) false ``` However, I think that there are probably other benchmarks where it harms performance, so we'll have to see... For example, here's one: In the exact opposite case as above, if the two objects _are_ (almost) equal, necessitating checking every object, the `NV` comparisons could have exited after all the recursive pointer checks, and never compare the fields, whereas now the fields are checked first, so this gets slower. I'm not exactly sure why the `VN` comparisons get somewhat slower too, but it's maybe because of the second scan mentioned above. ```julia julia> function make_chain_nv(n, sentinal) head = NV(sentinal, 1) for i in 2:n head = NV(head, i) end return head end make_chain_nv (generic function with 1 method) julia> function make_chain_vn(n, sentinal) head = VN(1, sentinal) for i in 2:n head = VN(i, head) end return head end make_chain_vn (generic function with 1 method) julia> vn1, vn2 = make_chain_vn(10000, []), make_chain_vn(10000, []); julia> nv1, nv2 = make_chain_nv(10000, []), make_chain_nv(10000, []); ``` Master: ``` julia> @btime $vn1 === $vn2 95.996 μs (0 allocations: 0 bytes) false julia> @btime $nv1 === $nv2 82.192 μs (0 allocations: 0 bytes) false ``` This commit: ``` julia> @btime $vn1 === $vn2 127.512 μs (0 allocations: 0 bytes) false julia> @btime $nv1 === $nv2 126.837 μs (0 allocations: 0 bytes) ``` * Ignore pointer fields completely in the first pass of === Delay the nullptr checks until all non-ptr fields have been compared, since we have to go back to those anyways to follow the pointers. Co-authored-by:Jeff Bezanson <jeff.bezanson@gmail.com> | 08 February 2022, 21:18:35 UTC |
60f414e | Valentin Churavy | 08 February 2022, 20:38:50 UTC | Merge pull request #44081 from oscardssmith/fix-linux32-ci fix #43978 (missing parens) | 08 February 2022, 20:38:50 UTC |
9c9bb86 | N5N3 | 08 February 2022, 20:22:30 UTC | Make `to_indices` infered better for CartesianIndex/Indices (#42055) | 08 February 2022, 20:22:30 UTC |
f6def1a | Jishnu Bhattacharya | 08 February 2022, 20:17:24 UTC | Optimize real matrix * complex matrix by using real matmul (#44074) | 08 February 2022, 20:17:24 UTC |
7b1e454 | Simeon Schaub | 08 February 2022, 20:08:15 UTC | support type annotations on global variables (#43671) add type declarations to global bindings replaces #43455 closes #964 Co-authored-by: Miguel Raz Guzmán Macedo <miguelraz@gmail.com> | 08 February 2022, 20:08:15 UTC |
0f6c9d3 | Oscar Smith | 08 February 2022, 19:47:06 UTC | oops | 08 February 2022, 19:47:06 UTC |
942697f | Simeon Schaub | 08 February 2022, 18:11:00 UTC | make sure Julia doesn't use x87 math. (#43978) * use fpmath=sse on 32 bit x86 to prevent 80 bit floats causing double rounding Co-authored-by: Oscar Smith <oscardssmith@gmail.com> | 08 February 2022, 18:11:00 UTC |
d30f403 | gbaraldi | 08 February 2022, 16:40:49 UTC | Detect the number of performance cores in the M1 macs via the new macos12 API (#44072) * Use the new macos12 api to query perf cores | 08 February 2022, 16:40:49 UTC |
24d96ab | Nathan Daly | 08 February 2022, 14:53:52 UTC | Instrument jl_gc_big_alloc() when called from generated code for Allocations Profiler (#44043) * Instrument jl_gc_big_alloc() when called from generated code for Allocations Profiler Add _maybe_record_alloc_to_profile() call into jl_gc_big_alloc() to allow us to instrument it in the Allocations Profiler. Followup to #43868 Finishes fixing #43688 (gets the stacks, though not the types, of big allocs). ----- - Rename jl_gc_big_alloc to jl_gc_big_alloc_inner, make it inlined - add jl_gc_pool_alloc_noinline that calls jl_gc_big_alloc_inner - replace all internal calls to jl_gc_big_alloc to call this instead - add a new jl_gc_pool_alloc that calls jl_gc_big_alloc_inner - This one is instrumented, and is meant to be called by generated code. Co-authored-by: Pete Vilter <7341+vilterp@users.noreply.github.com> | 08 February 2022, 14:53:52 UTC |
e865d33 | Jishnu Bhattacharya | 08 February 2022, 11:33:10 UTC | Optimize real matrix * complex vector by reintrepreting as real (#44011) | 08 February 2022, 11:33:10 UTC |
6bad936 | Daniel Karrasch | 08 February 2022, 09:17:54 UTC | Improve performance of `svd` and `eigen` of `Diagonal`s (#43856) | 08 February 2022, 09:17:54 UTC |
c84896c | Daniel Karrasch | 08 February 2022, 09:09:21 UTC | Fix `Diagonal \ StaticArray` (#44018) | 08 February 2022, 09:09:21 UTC |
418fbb3 | Jameson Nash | 27 January 2022, 20:33:12 UTC | impose stricter and earlier validation on ccall/cfunction types Closes #43636 | 07 February 2022, 19:59:58 UTC |
9f3b3f5 | Jameson Nash | 07 February 2022, 19:58:43 UTC | ccall: fix jl_value_ptr definition | 07 February 2022, 19:59:58 UTC |
546a774 | Jeff Bezanson | 07 February 2022, 18:49:32 UTC | fix #43960, evaluation order of splat inside ref (#44024) | 07 February 2022, 18:49:32 UTC |
48b7d49 | Pete Vilter | 07 February 2022, 17:16:48 UTC | allocation profiler: get stacks for pool allocs via wrapper function (#43868) | 07 February 2022, 17:16:48 UTC |
70e2432 | st-- | 07 February 2022, 14:58:21 UTC | improve eigvals & co docstrings (#43904) | 07 February 2022, 14:58:21 UTC |
e0a4b77 | N5N3 | 06 February 2022, 12:55:09 UTC | Generalize `strides` for `ReinterpretArray` and `ReshapedArray` (#44027) | 06 February 2022, 12:55:09 UTC |
5181e36 | Steven G. Johnson | 05 February 2022, 21:53:34 UTC | document behavior of keywords in dot calls (#44033) | 05 February 2022, 21:53:34 UTC |
e623275 | Ian Butterworth | 05 February 2022, 04:09:18 UTC | Try/finally to stop allocation profiler even on error (#44045) | 05 February 2022, 04:09:18 UTC |
46032c5 | Tim Holy | 04 February 2022, 20:16:27 UTC | Inferrability: eliminate more Core.Box (#44029) These stem from julia#15276, i.e., https://docs.julialang.org/en/v1/manual/performance-tips/#man-performance-captured They were identified by scanning all compiled MethodInstances with hasbox in the newly-released MethodAnalysis 0.4.5. Core.Box often causes "follow-on" inference problems, but for these cases there were relatively few, which may be why these didn't show up earlier during the Great Invalidation Hunt. Still, there doesn't seem to be any particular reason not to fix them. This doesn't eliminate all Core.Box cases from Base, but only a handful remain. The most common remaining case stems from inner functions calling themselves. It also prevents a couple of Test invalidations Co-authored-by: Jameson Nash <vtjnash@gmail.com> | 04 February 2022, 20:16:27 UTC |
bd9c510 | Ian Butterworth | 04 February 2022, 13:35:15 UTC | Remove incomplete manifest package load fallback. Add instantiate suggestion to error (#42822) | 04 February 2022, 13:35:15 UTC |
b486f0d | Leon | 04 February 2022, 08:56:37 UTC | docs: reference `error` in docstring for `throw`, closes #44028 (#44032) | 04 February 2022, 08:56:37 UTC |
9c5d7ff | DilumAluthgeBot | 04 February 2022, 02:29:53 UTC | 🤖 Bump the Pkg stdlib from 66482586 to 89517355 (#44023) | 04 February 2022, 02:29:53 UTC |
9c4b75d | Elliot Saba | 03 February 2022, 23:50:01 UTC | [libblastrampoline] Bump to v5.0.1 (#44017) This should allow us to use CBLAS symbols in MKL v2022. Verified that this fixes https://github.com/JuliaLinearAlgebra/libblastrampoline/issues/56 | 03 February 2022, 23:50:01 UTC |
a80afe5 | Valentin Churavy | 03 February 2022, 15:39:05 UTC | Merge pull request #44030 from KronosTheLate/change_order_of_differences_R Change order in "Noteworthy differences from R" | 03 February 2022, 15:39:05 UTC |
fa6084f | KronosTheLate | 03 February 2022, 10:51:00 UTC | Change order of differences from R I came to "Noteworthy differences from R" because I know julia well, but am starting some R now. When I came to the following section: " * In Julia, not all data structures support logical indexing. Furthermore, logical indexing in Julia is supported only with vectors of length equal to the object being indexed. For example: * In R, `c(1, 2, 3, 4)[c(TRUE, FALSE)]` is equivalent to `c(1, 3)`. * In R, `c(1, 2, 3, 4)[c(TRUE, FALSE, TRUE, FALSE)]` is equivalent to `c(1, 3)`. * In Julia, `[1, 2, 3, 4][[true, false]]` throws a [`BoundsError`](@ref). * In Julia, `[1, 2, 3, 4][[true, false, true, false]]` produces `[1, 3]`. " I did not know the `c(1, 2, 3)` syntax, so encountering this point did not help me. In this PR I have moved the line " * Julia constructs vectors using brackets. Julia's `[1, 2, 3]` is the equivalent of R's `c(1, 2, 3)`. " to immediately before the point I mentioned first. IMO this makes the section more readable. | 03 February 2022, 10:51:00 UTC |
c10dac1 | David Bach | 03 February 2022, 09:35:39 UTC | Dates parsing: remove `throw InexactError` from `tryparsenext`, fixes #44003 (#44004) | 03 February 2022, 09:35:39 UTC |
1edafa0 | Harmen Stoppels | 03 February 2022, 04:49:32 UTC | Fix detection of LIBGFORTRAN_VERSION (#44026) | 03 February 2022, 04:49:32 UTC |
60a811c | Simeon Schaub | 03 February 2022, 04:21:15 UTC | fix #44013: aliasing in property destructuring (#44020) | 03 February 2022, 04:21:15 UTC |
e6fa3ec | Ian Butterworth | 03 February 2022, 01:52:20 UTC | Profile: multithread getdict! (redo of #43805) (#43816) | 03 February 2022, 01:52:20 UTC |
cf8338a | Hendrik Ranocha | 02 February 2022, 15:13:37 UTC | fix typo in NEWS.md (#44015) I was reading the NEWS.md on `master` and found this typo. | 02 February 2022, 15:13:37 UTC |
e3b681c | Shuhei Kadowaki | 02 February 2022, 01:39:19 UTC | inference: always use const-prop'ed result (#44001) Previously, for `invoke`/opaque closure callsite, we use constant-prop'ed method body only when the inferred return type gets strictly improved by const-prop. But since the inliner is now able to inline the method body from `InferenceResult`, I believe it is always better to use method body shaped up by const-prop' no matter if the return type is improved (as we already do for ordinal call sites). > use constant prop' result even when the return type doesn't get refined ```julia const Gx = Ref{Any}() Base.@constprop :aggressive function conditional_escape!(cnd, x) if cnd Gx[] = x end return nothing end @test fully_eliminated((String,)) do x Base.@invoke conditional_escape!(false::Any, x::Any) end ``` | 02 February 2022, 01:39:19 UTC |
b405562 | Simeon Schaub | 01 February 2022, 21:21:35 UTC | fix macro expansion of `(::typeof(x))() = ...` (#43993) | 01 February 2022, 21:21:35 UTC |
0cbacf2 | Tomas Fiers | 01 February 2022, 15:23:20 UTC | docs: fix heading level of Manual > Modules > init & precomp (#43996) | 01 February 2022, 15:23:20 UTC |
a0093d2 | Keno Fischer | 01 February 2022, 00:11:22 UTC | adce: Slight tweak to phinode elimination (#43948) Just a slight tweak to #43922 to also allow the implicit narrowing from other phi users. It's not a particularly common occurrence, but can happen particularly when running the adce pass twice, (because that narrows the types of some phis by dropping edges). | 01 February 2022, 00:11:22 UTC |
a7beb93 | Viral B. Shah | 31 January 2022, 00:10:54 UTC | Update mailmap (#43991) * Update mailmap | 31 January 2022, 00:10:54 UTC |
76a3156 | Dilum Aluthge | 30 January 2022, 20:39:47 UTC | Add private functions for getting the locations of the global and local startup files (#43807) Co-authored-by: Jameson Nash <vtjnash@gmail.com> | 30 January 2022, 20:39:47 UTC |
4abf26e | Tim Holy | 30 January 2022, 20:04:58 UTC | Add relocatable root compression (#43881) Currently we can't cache "external" CodeInstances, i.e., those generated by compiling other modules' methods with externally-defined types. For example, consider `push!([], MyPkg.MyType())`: Base owns the method `push!(::Vector{Any}, ::Any)` but doesn't know about `MyType`. While there are several obstacles to caching exteral CodeInstances, the primary one is that in compressed IR, method roots are referenced from a list by index, and the index is defined by order of insertion. This order might change depending on package-loading sequence or other history-dependent factors. If the order isn't consistent, our current serialization techniques would result in corrupted code upon decompression, and that would generally trigger catastrophic failure. To avoid this problem, we simply avoid caching such CodeInstances. This enables roots to be referenced with respect to a `(key, index)` pair, where `key` identifies the module and `index` numbers just those roots with the same `key`. Roots with `key = 0` are considered to be of unknown origin, and CodeInstances referencing such roots will remain unserializable unless all such roots were added at the time of system image creation. To track this additional data, this adds two fields to core types: - to methods, it adds a `nroots_sysimg` field to count the number of roots defined at the time of writing the system image (such occur first in the list of `roots`) - to CodeInstances, it adds a flag `relocatability` having value 1 if every root is "safe," meaning it was either added at sysimg creation or is tagged with a non-zero `key`. Even a single unsafe root will cause this to have value 0. | 30 January 2022, 20:04:58 UTC |
11bac43 | SamuraiAku | 30 January 2022, 14:16:13 UTC | Update PCRE download location in SPDX file (#43985) * Update PCRE download location in SPDX file * Make it the actual git URL | 30 January 2022, 14:16:13 UTC |
e8f469a | Valentin Churavy | 29 January 2022, 19:25:49 UTC | Merge pull request #43973 from JuliaLang/avi/infresult AbstractInterpreter: pass `caller::InferenceResult` to the optimizer | 29 January 2022, 19:25:49 UTC |
c3235cd | Daniel Karrasch | 29 January 2022, 02:45:02 UTC | Fix typo in triangular ldiv! (#43962) | 29 January 2022, 02:45:02 UTC |
9a3cfd9 | Steven G. Johnson | 28 January 2022, 22:43:40 UTC | cross-ref bunch-kaufman to ldlt docs (#43968) | 28 January 2022, 22:43:40 UTC |
e88bb22 | Steven G. Johnson | 28 January 2022, 20:24:41 UTC | fix incorrect quotes in SVD docs (#43969) | 28 January 2022, 20:24:41 UTC |
1aac07e | pchintalapudi | 28 January 2022, 20:10:51 UTC | codegen: encapsulate complex global types in jl_codectx_t (#43789) Move global complex types to context type cache in LLVM codegen. | 28 January 2022, 20:10:51 UTC |
4789979 | Steven G. Johnson | 28 January 2022, 20:06:30 UTC | use iszero for generic numbers (#43970) | 28 January 2022, 20:06:30 UTC |
eb43734 | Shuhei Kadowaki | 28 January 2022, 17:27:10 UTC | optimizer: delay `atype` computation in inlining (#43974) Makes `Signature` data structure slightly more efficient. | 28 January 2022, 17:27:10 UTC |
cd458a9 | Shuhei Kadowaki | 28 January 2022, 15:26:51 UTC | AbstractInterpreter: pass `caller::InferenceResult` to the optimizer `caller::InferenceResult` will be used as a key for caching interprocedural information analyzed at optimization phase (as we will do with the escape analysis). | 28 January 2022, 15:26:51 UTC |
ad2b8fc | Dilum Aluthge | 28 January 2022, 12:57:03 UTC | Fix the download URLs for the libunwind source code (#43958) | 28 January 2022, 12:57:03 UTC |
2ba3a22 | Ian Butterworth | 28 January 2022, 09:17:39 UTC | doc: add note about Timer needing yield, closes #43954 (#43956) | 28 January 2022, 09:17:39 UTC |
3dbd31b | Daniel Karrasch | 28 January 2022, 08:31:46 UTC | Fix typo in 3-arg "rdiv!" (#43951) | 28 January 2022, 08:31:46 UTC |
9400c91 | Shuhei Kadowaki | 28 January 2022, 04:22:26 UTC | a bit simplify inlining analysis code (#43959) | 28 January 2022, 04:22:26 UTC |
a25f128 | Takafumi Arakaki | 28 January 2022, 01:28:43 UTC | Don't `invokelatest` in `@threads` (#43957) | 28 January 2022, 01:28:43 UTC |
78b7d76 | Shuhei Kadowaki | 28 January 2022, 00:44:34 UTC | [REPLCompletions] follow up #43865, keep input tuple type in `MethodCompletion` (#43946) `MethodCompletion.tt` is being used by an external consumer like Juno or VSCode's runtime completion features to get additional information like return type, etc. | 28 January 2022, 00:44:34 UTC |
ef35804 | Alex Arslan | 27 January 2022, 16:29:32 UTC | Update libunwind to v1.5.0 (#42782) This updates the nongnu libunwind, not LLVM libunwind, so this only affects Linux and FreeBSD. | 27 January 2022, 16:29:32 UTC |
8f13fea | Eric Hanson | 27 January 2022, 16:08:48 UTC | relax `withenv` signature from Function to Any (#43584) | 27 January 2022, 16:08:48 UTC |
2983327 | Keno Fischer | 27 January 2022, 12:13:27 UTC | Teach cfg_simplify to drop GotoIfNots that go to the same destination (#43906) An example is in the test. The primary reason to do this is not for the GotoIfNot itself, but rather to drop the use of the GotoIfNot condition, which may be rooting a number of other statements. | 27 January 2022, 12:13:27 UTC |
5b893dd | Keno Fischer | 27 January 2022, 12:10:44 UTC | deleteat!: Handle unassigned array elements (#43941) This function was erroring on unassigned array elements. This is the minimal fix to resolve that issue. I tried something more generic, but it turns out all of our Array code basically assumes that all elements are assigned. Even basic things like `==`, `hash`, etc. error for arrays with unassigned elements. I think we may want to strongly consider removing the ability to unassign elements in arrays in favor of Union{Nothing, T} arrays, which our existing code handles fine and should be able to be made to have equivalent performance. | 27 January 2022, 12:10:44 UTC |
4650cff | Jishnu Bhattacharya | 27 January 2022, 09:50:46 UTC | Forward negation of a Tridiagonal matrix to diagonals (#43942) | 27 January 2022, 09:50:46 UTC |
9868411 | Shuhei Kadowaki | 27 January 2022, 04:11:41 UTC | optimizer: performance tuning (#43928) | 27 January 2022, 04:11:41 UTC |
05e0cb9 | Takafumi Arakaki | 27 January 2022, 01:42:26 UTC | Merge pull request #43418 from JuliaLang/improve-threads Improve thread scheduler memory ordering | 27 January 2022, 01:42:26 UTC |
fcd34ae | Takafumi Arakaki | 26 January 2022, 20:45:03 UTC | Refine `isunordered` docstring (#43828) | 26 January 2022, 20:45:03 UTC |
d261458 | Takafumi Arakaki | 26 January 2022, 20:43:33 UTC | Remove fast_unwind_on_malloc and malloc_context_size restrictions in ASAN CI (#42515) No need to set ASAN_OPTIONS any more either: these options are already set in `loader_exe.c` with `__asan_default_options`. | 26 January 2022, 20:43:33 UTC |