From 57f06363cb3c5a20b87a6c5e22e8246d89902a10 Mon Sep 17 00:00:00 2001 From: Dillon Date: Thu, 28 Dec 2023 21:44:27 -0800 Subject: [PATCH] Many fixes from failing to save files --- README.md | 2 +- src/evaluate.cc | 1 + test/test.h | 1 - 3 files changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 28d92979..060fa6b6 100644 --- a/README.md +++ b/README.md @@ -100,7 +100,7 @@ This is not limited to sequences of elementwise operations, frameworks often hav As a less contrived example: [FlashAttention](https://arxiv.org/abs/2205.14135) is largely just applying locality optimizations to transformers (used in large language models) in much the same way Slinky proposes to do more generally (and automatically). ## Data we have so far -This [performance test](test/performance.cc) attempts to measure the overhead of interpreting pipelines at runtime. +This [performance app](apps/performance.cc) attempts to measure the overhead of interpreting pipelines at runtime. The test performs a copy between two 2D buffers of "total size" bytes, and the inner dimension is "copy size" bytes The inner dimension is copied with `memcpy`, the outer dimension is a loop implemented in one of two ways: 1. An "explicit loop" version, which has a loop in the pipeline for the outer dimension (interpreted by Slinky). diff --git a/src/evaluate.cc b/src/evaluate.cc index 007c9056..ecdf781a 100644 --- a/src/evaluate.cc +++ b/src/evaluate.cc @@ -5,6 +5,7 @@ #include "print.h" #include "simplify.h" +#include "substitute.h" namespace slinky { diff --git a/test/test.h b/test/test.h index eef9d8f9..0c4f5a1d 100644 --- a/test/test.h +++ b/test/test.h @@ -1,7 +1,6 @@ #ifndef SLINKY_TEST_TEST_H #define SLINKY_TEST_TEST_H -#include #include #include #include