diff options
| author | Julian Blake Kongslie | 2022-10-15 14:01:38 -0700 |
|---|---|---|
| committer | Julian Blake Kongslie | 2022-10-15 14:01:38 -0700 |
| commit | 6ddafafa7292f6f6716d6683579bf1ce3287e1d5 (patch) | |
| tree | 0b215f8e9ddf7010389ead062a8993fdb9142022 | |
| download | nanosim-6ddafafa7292f6f6716d6683579bf1ce3287e1d5.tar.xz | |
Initial commit (copied from biggolf)
Diffstat (limited to '')
| -rw-r--r-- | arbiter.h | 55 | ||||
| -rw-r--r-- | pipetrace.cpp | 9 | ||||
| -rw-r--r-- | pipetrace.h | 37 | ||||
| -rw-r--r-- | port.h | 45 | ||||
| -rwxr-xr-x | pt | 104 | ||||
| -rw-r--r-- | queue.h | 29 | ||||
| -rw-r--r-- | sim.cpp | 9 | ||||
| -rw-r--r-- | sim.h | 38 | ||||
| -rw-r--r-- | stat.h | 35 |
9 files changed, 361 insertions, 0 deletions
diff --git a/arbiter.h b/arbiter.h new file mode 100644 index 0000000..79a9920 --- /dev/null +++ b/arbiter.h | |||
| @@ -0,0 +1,55 @@ | |||
| 1 | #pragma once | ||
| 2 | |||
| 3 | #include <array> | ||
| 4 | #include <cassert> | ||
| 5 | |||
| 6 | #include "infra/sim.h" | ||
| 7 | |||
| 8 | namespace infra { | ||
| 9 | template<typename T, unsigned int peers> struct priority_arbiter : public sim { | ||
| 10 | std::array<port<T>, peers> peerp; | ||
| 11 | port<T> *outp = nullptr; | ||
| 12 | |||
| 13 | void clock() { | ||
| 14 | for (unsigned int i = 0; i < peers; ++i) { | ||
| 15 | if (outp->can_write() && peerp[i].can_read()) | ||
| 16 | outp->write(peerp[i].read()); | ||
| 17 | } | ||
| 18 | } | ||
| 19 | }; | ||
| 20 | |||
| 21 | template<typename T, unsigned int peers> struct round_robin_arbiter : public sim { | ||
| 22 | std::array<port<T>, peers> peerp; | ||
| 23 | port<T> *outp = nullptr; | ||
| 24 | unsigned int initial = 0; | ||
| 25 | |||
| 26 | void clock() { | ||
| 27 | bool initially_empty = outp->can_write(); | ||
| 28 | for (unsigned int i = initial; i < peers; ++i) { | ||
| 29 | if (outp->can_write() && peerp[i].can_read()) | ||
| 30 | outp->write(peerp[i].read()); | ||
| 31 | } | ||
| 32 | for (unsigned int i = 0; i < initial; ++i) { | ||
| 33 | if (outp->can_write() && peerp[i].can_read()) | ||
| 34 | outp->write(peerp[i].read()); | ||
| 35 | } | ||
| 36 | if (initially_empty && !outp->can_write()) | ||
| 37 | if (++initial == peers) | ||
| 38 | initial = 0; | ||
| 39 | } | ||
| 40 | }; | ||
| 41 | |||
| 42 | template<typename T, unsigned int peers> struct shared_bus : public sim { | ||
| 43 | std::array<port<T>, peers> peerp; | ||
| 44 | port<T> *outp = nullptr; | ||
| 45 | |||
| 46 | void clock() { | ||
| 47 | for (unsigned int i = 0; i < peers; ++i) { | ||
| 48 | if (peerp[i].can_read()) { | ||
| 49 | assert(outp->can_write()); | ||
| 50 | outp->write(peerp[i].read()); | ||
| 51 | } | ||
| 52 | } | ||
| 53 | } | ||
| 54 | }; | ||
| 55 | } | ||
diff --git a/pipetrace.cpp b/pipetrace.cpp new file mode 100644 index 0000000..e6642ef --- /dev/null +++ b/pipetrace.cpp | |||
| @@ -0,0 +1,9 @@ | |||
| 1 | #include <cstdint> | ||
| 2 | #include <ostream> | ||
| 3 | |||
| 4 | #include "infra/pipetrace.h" | ||
| 5 | |||
| 6 | namespace infra { | ||
| 7 | std::ostream *pt::ptfile = nullptr; | ||
| 8 | std::uint64_t pt::next_record = 0; | ||
| 9 | } | ||
diff --git a/pipetrace.h b/pipetrace.h new file mode 100644 index 0000000..656b9b9 --- /dev/null +++ b/pipetrace.h | |||
| @@ -0,0 +1,37 @@ | |||
| 1 | #pragma once | ||
| 2 | |||
| 3 | #include <cstdint> | ||
| 4 | #include <fmt/format.h> | ||
| 5 | #include <ostream> | ||
| 6 | #include <string> | ||
| 7 | |||
| 8 | namespace infra { | ||
| 9 | struct transaction { | ||
| 10 | std::uint64_t record = ~(std::uint64_t)0; | ||
| 11 | }; | ||
| 12 | |||
| 13 | struct pt { | ||
| 14 | static std::ostream *ptfile; | ||
| 15 | |||
| 16 | static std::uint64_t next_record; | ||
| 17 | |||
| 18 | static transaction toplevel() { | ||
| 19 | transaction t; | ||
| 20 | t.record = next_record++; | ||
| 21 | return t; | ||
| 22 | } | ||
| 23 | |||
| 24 | static transaction child(const transaction &p) { | ||
| 25 | transaction t; | ||
| 26 | t.record = next_record++; | ||
| 27 | if (ptfile) | ||
| 28 | *ptfile << fmt::format("{} parent {}\n", t.record, p.record); | ||
| 29 | return t; | ||
| 30 | } | ||
| 31 | |||
| 32 | static void event(const transaction &t, const char *event, std::uint64_t time, const std::string &data) { | ||
| 33 | if (ptfile) | ||
| 34 | *ptfile << fmt::format("@{} {} {} {}\n", time, t.record, event, data); | ||
| 35 | } | ||
| 36 | }; | ||
| 37 | } | ||
| @@ -0,0 +1,45 @@ | |||
| 1 | #pragma once | ||
| 2 | |||
| 3 | #include <cassert> | ||
| 4 | #include <optional> | ||
| 5 | #include <utility> | ||
| 6 | |||
| 7 | #include "infra/sim.h" | ||
| 8 | |||
| 9 | namespace infra { | ||
| 10 | template<typename T> struct port : public sim { | ||
| 11 | std::optional<T> consumer_side; | ||
| 12 | std::optional<T> producer_side; | ||
| 13 | |||
| 14 | bool can_read() { return consumer_side.has_value(); } | ||
| 15 | bool can_write() { return !producer_side.has_value(); } | ||
| 16 | |||
| 17 | T read() { | ||
| 18 | assert(can_read()); | ||
| 19 | auto x = std::move(*consumer_side); | ||
| 20 | consumer_side.reset(); | ||
| 21 | return x; | ||
| 22 | } | ||
| 23 | |||
| 24 | const T & peek() { | ||
| 25 | assert(can_read()); | ||
| 26 | return *consumer_side; | ||
| 27 | } | ||
| 28 | |||
| 29 | void discard() { | ||
| 30 | consumer_side.reset(); | ||
| 31 | } | ||
| 32 | |||
| 33 | void write(T &&x) { | ||
| 34 | assert(can_write()); | ||
| 35 | producer_side = std::move(x); | ||
| 36 | } | ||
| 37 | |||
| 38 | void unclock() { | ||
| 39 | if (!consumer_side && producer_side) { | ||
| 40 | consumer_side = std::move(*producer_side); | ||
| 41 | producer_side.reset(); | ||
| 42 | } | ||
| 43 | } | ||
| 44 | }; | ||
| 45 | } | ||
| @@ -0,0 +1,104 @@ | |||
| 1 | #!/usr/bin/ruby | ||
| 2 | |||
| 3 | $filter = ARGV | ||
| 4 | |||
| 5 | $parents = {} | ||
| 6 | $events = {} | ||
| 7 | $has = {} | ||
| 8 | $data = {} | ||
| 9 | $horiz = {} | ||
| 10 | $maxtime = -1 | ||
| 11 | |||
| 12 | $stats = false | ||
| 13 | |||
| 14 | $stdin.each_line do | line | | ||
| 15 | case line | ||
| 16 | |||
| 17 | when /^(\d+) parent (\d+)$/ | ||
| 18 | child = $1.to_i | ||
| 19 | parent = $2.to_i | ||
| 20 | $parents[child] = parent | ||
| 21 | |||
| 22 | when /^@(\d+) (\d+) (\S*) (.*)$/ | ||
| 23 | time = $1.to_i | ||
| 24 | rec = $2.to_i | ||
| 25 | event = $3 | ||
| 26 | data = $4 | ||
| 27 | if event.size > 0 | ||
| 28 | $events[rec] ||= {} | ||
| 29 | $events[rec][time] = event | ||
| 30 | $has[rec] ||= {} | ||
| 31 | $has[rec][event] = true | ||
| 32 | $horiz[event] ||= "" | ||
| 33 | $horiz[event] = $horiz[event].ljust(time) | ||
| 34 | $horiz[event][time] = event | ||
| 35 | end | ||
| 36 | if data.size > 0 | ||
| 37 | $data[rec] ||= "" | ||
| 38 | $data[rec] += " #{event}@#{time}:" if event.size > 0 | ||
| 39 | $data[rec] += " #{data}" | ||
| 40 | end | ||
| 41 | $maxtime = [$maxtime, time+1].max | ||
| 42 | |||
| 43 | when /^#\s*(.*)$/ | ||
| 44 | $stats = true | ||
| 45 | $stdout.write("#{$1}\n") | ||
| 46 | |||
| 47 | else | ||
| 48 | raise "Unexpected line: #{line}" | ||
| 49 | end | ||
| 50 | end | ||
| 51 | |||
| 52 | $stdout.write("\n") if $stats | ||
| 53 | |||
| 54 | $hier = {} | ||
| 55 | $hier_direct = {} | ||
| 56 | |||
| 57 | $events.each_key do | rec | | ||
| 58 | subhier = {} | ||
| 59 | $hier_direct[rec] = subhier | ||
| 60 | if $parents.key?(rec) | ||
| 61 | $hier_direct[$parents[rec]][rec] = subhier | ||
| 62 | else | ||
| 63 | $hier[rec] = subhier | ||
| 64 | end | ||
| 65 | end | ||
| 66 | |||
| 67 | $order = [] | ||
| 68 | |||
| 69 | def flatten(hier) | ||
| 70 | hier.each do | rec, subhier | | ||
| 71 | $order << rec | ||
| 72 | flatten(subhier) | ||
| 73 | end | ||
| 74 | end | ||
| 75 | flatten($hier) | ||
| 76 | |||
| 77 | rwidth = $order.map { | x | x.to_s.size }.max | ||
| 78 | |||
| 79 | $horiz.keys.sort.each do | occ | | ||
| 80 | $stdout.write(" " * rwidth + " #{$horiz[occ].ljust($maxtime)}") | ||
| 81 | count = $horiz[occ].delete(" ").size | ||
| 82 | $stdout.write(" #{($maxtime.to_f / count.to_f).round(2).to_s.rjust(5)} cyc/evt\n") | ||
| 83 | end | ||
| 84 | $stdout.write("\n") | ||
| 85 | |||
| 86 | mwidth = 0 | ||
| 87 | |||
| 88 | $order.each do | rec | | ||
| 89 | estr = "" | ||
| 90 | filter_match = $filter.empty? | ||
| 91 | $has[rec].each_key do | event | | ||
| 92 | filter_match ||= $filter.include?(event) | ||
| 93 | end | ||
| 94 | next unless filter_match | ||
| 95 | $events[rec].keys.sort.each do | time | | ||
| 96 | estr = estr.ljust(time + 1, estr.size == 0 ? " " : "-") | ||
| 97 | estr[time] = $events[rec][time] if $events[rec][time].size > 0 | ||
| 98 | end | ||
| 99 | estr += " " * 5 | ||
| 100 | estr = estr.ljust(mwidth - 1) | ||
| 101 | estr = estr.ljust(estr.size + 20 - estr.size % 20) | ||
| 102 | mwidth = [mwidth, estr.size].max | ||
| 103 | $stdout.write(rec.to_s.rjust(rwidth) + ": #{estr}#{$data[rec]}\n") | ||
| 104 | end | ||
| @@ -0,0 +1,29 @@ | |||
| 1 | #pragma once | ||
| 2 | |||
| 3 | #include <cassert> | ||
| 4 | #include <deque> | ||
| 5 | #include <optional> | ||
| 6 | #include <utility> | ||
| 7 | |||
| 8 | #include "infra/port.h" | ||
| 9 | #include "infra/sim.h" | ||
| 10 | |||
| 11 | namespace infra { | ||
| 12 | template<typename T, unsigned int size> struct queue : public sim { | ||
| 13 | port<T> input; | ||
| 14 | port<T> *output = nullptr; | ||
| 15 | std::deque<T> elements; | ||
| 16 | |||
| 17 | void clock() { | ||
| 18 | if (input.can_read() && elements.size() < size) { | ||
| 19 | auto x = input.read(); | ||
| 20 | elements.emplace_back(std::move(x)); | ||
| 21 | } | ||
| 22 | if (output->can_write() && !elements.empty()) { | ||
| 23 | auto &x = elements.front(); | ||
| 24 | output->write(std::move(x)); | ||
| 25 | elements.pop_front(); | ||
| 26 | } | ||
| 27 | } | ||
| 28 | }; | ||
| 29 | } | ||
| @@ -0,0 +1,9 @@ | |||
| 1 | #include <cstdint> | ||
| 2 | #include <vector> | ||
| 3 | |||
| 4 | #include "infra/sim.h" | ||
| 5 | |||
| 6 | namespace infra { | ||
| 7 | std::vector<sim *> sim::sims; | ||
| 8 | std::uint64_t sim::now = 0; | ||
| 9 | } | ||
| @@ -0,0 +1,38 @@ | |||
| 1 | #pragma once | ||
| 2 | |||
| 3 | #include <cstdint> | ||
| 4 | #include <string> | ||
| 5 | #include <vector> | ||
| 6 | |||
| 7 | #include "infra/pipetrace.h" | ||
| 8 | |||
| 9 | namespace infra { | ||
| 10 | struct sim { | ||
| 11 | virtual void clock() {} | ||
| 12 | virtual void unclock() {} | ||
| 13 | |||
| 14 | static std::vector<sim *> sims; | ||
| 15 | |||
| 16 | static std::uint64_t now; | ||
| 17 | |||
| 18 | sim() { | ||
| 19 | sims.emplace_back(this); | ||
| 20 | } | ||
| 21 | |||
| 22 | virtual ~sim() { | ||
| 23 | std::erase(sims, this); | ||
| 24 | } | ||
| 25 | |||
| 26 | static void advance() { | ||
| 27 | for (auto &s : sims) | ||
| 28 | s->clock(); | ||
| 29 | for (auto &s : sims) | ||
| 30 | s->unclock(); | ||
| 31 | ++now; | ||
| 32 | } | ||
| 33 | |||
| 34 | void pte(const transaction &t, const char *event, const std::string &data) { | ||
| 35 | pt::event(t, event, now, data); | ||
| 36 | } | ||
| 37 | }; | ||
| 38 | } | ||
| @@ -0,0 +1,35 @@ | |||
| 1 | #pragma once | ||
| 2 | |||
| 3 | #include <fmt/format.h> | ||
| 4 | #include <utility> | ||
| 5 | |||
| 6 | #include "infra/sim.h" | ||
| 7 | |||
| 8 | namespace infra { | ||
| 9 | struct stat : public sim { | ||
| 10 | std::string name; | ||
| 11 | std::uint64_t numerator = 0; | ||
| 12 | std::uint64_t denominator = 0; | ||
| 13 | |||
| 14 | stat(std::string name) | ||
| 15 | : name(std::move(name)) | ||
| 16 | { } | ||
| 17 | |||
| 18 | ~stat() { | ||
| 19 | fmt::print("# {} {}\n", name, (double)numerator/(double)denominator); | ||
| 20 | } | ||
| 21 | |||
| 22 | void unclock() { | ||
| 23 | ++denominator; | ||
| 24 | } | ||
| 25 | |||
| 26 | stat & operator++() { | ||
| 27 | ++numerator; | ||
| 28 | return *this; | ||
| 29 | } | ||
| 30 | |||
| 31 | stat & operator++(int) { | ||
| 32 | return operator++(); | ||
| 33 | } | ||
| 34 | }; | ||
| 35 | } | ||
