Keno

$ RR_LOG=all:debug ~/rr-build/bin/rr replay -g 3770
[GdbCommandHandler] registering command: elapsed-time
[GdbCommandHandler] registering command: when
[GdbCommandHandler] registering command: when-ticks
[GdbCommandHandler] registering command: when-tid
[GdbCommandHandler] registering command: rr-history-push
[GdbCommandHandler] registering command: back
[GdbCommandHandler] registering command: forward
[GdbCommandHandler] registering command: checkpoint

Keno

Keno

"""
    circshift_gcdless!(arr::AbstractVector, shift)

Circularly shift the array `arr` by the given `shift` amount.
The algorithm used is the well-known GCD-less (aka implicit GCD)
juggling algorithm (e.g. STL3 in [SHENE97]).

[SHENE97] https://pages.mtu.edu/~shene/PUBLICATIONS/1997/Array-Rotation.pdf
"""
function circshift_gcdless!(arr::AbstractVector, shift::Integer)

Keno

#=
using Revise
Revise.track(Core.Compiler)
=#

using Symbolics

bar(a, b) = a * b
function foo(a, b, c)
    bar(a, b) + c

Keno

@compiler_plugin FastSinPlugin

#=
Some sort of implementation of FastSinPlugin where
sin(x::Float64) is replaced by fast_sin(x::Float64).

N.B.: If the function being called is not `sin`, this
needs to recurse.
N.B.: This needs to handle the non-inferred case
N.B.: This should be done in the optimizer and may assume

Keno

ticks:0x1234eb0c5 rip:0x70000002
ticks:0x1234eb0c5 rip:0x70000002
ticks:0x1234eb0c5 rip:0x7fd8c08f250c
ticks:0x1234eb0c5 rip:0x7fd8c08f250e
ticks:0x1234eb0c5 rip:0x7fd8c08f2515
ticks:0x1234eb0c5 rip:0x7fd8c08f2519
ticks:0x1234eb0c5 rip:0x7fd8c08ed71e
ticks:0x1234eb0c5 rip:0x7fd8c08ed722
ticks:0x1234eb0c5 rip:0x7fd8c08efaf9

Keno

julia> foreach(println, equations(sys))
0 ~ var"0"(t) - v1₊n₊v(t)
0 ~ var"0"(t) - r1₊n₊v(t)
0 ~ var"0"(t) - c1₊n₊v(t)
0 ~ var"0"(t)
0 ~ d1₊p₊i(t) + v1₊p₊i(t)
0 ~ net1(t) - v1₊p₊v(t)
0 ~ net1(t) - d1₊p₊v(t)
0 ~ c1₊p₊i(t) + d1₊n₊i(t) + r1₊p₊i(t)
0 ~ net2(t) - d1₊n₊v(t)

Keno

struct effects {
    // Meaning of concepts:
    //
    // idempotent   - The function will always return the same value when given
    //                identical argument, irrespective of the heap state. In
    //                particular, this means that the return value (or any other
    //                side effect) does not depend on non-constant globals, loads
    //                from memory, or mutable structs.
    //
    // effect_free  - The function has no side effects at all. In particular,

Keno

# ∂⃖rrule has a 4-recurrence - we model this as 4 separate structs that we
# cycle between. N.B.: These names match the names that these variables
# have in Snippet 19 of the terminology guide. They are probably not ideal,
# but if you rename them here, please update the terminology guide also.

struct ∂⃖rruleA{N, O}; ∂; ȳ; ȳ̄ ; end
struct ∂⃖rruleB{N, O}; ᾱ; ȳ̄ ; end
struct ∂⃖rruleC{N, O}; ȳ̄ ; Δ′′′; β̄ ; end
struct ∂⃖rruleD{N, O}; γ̄; β̄ ; end

Keno

; ModuleID = 'text.bc'
source_filename = "text"
target datalayout = "e-m:o-i64:64-i128:128-n32:64-S128"
target triple = "arm64-apple-macosx-macho"

@jl_undefref_exception = external constant {}*
@_MergedGlobals = external hidden global <{ void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void ()*, void