aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorKimplul <kimi.h.kuparinen@gmail.com>2023-06-24 23:03:35 +0300
committerGitHub <noreply@github.com>2023-06-24 23:03:35 +0300
commit8cdc4c263a9515405964ca8f21439fd57eca6ba6 (patch)
tree844c9756d34e4f3bda515c0fcbeafcf1687ec622
parent8d4b133652230b945e945d5f14f7c0b1f9f7bffc (diff)
downloadcopyjit-8cdc4c263a9515405964ca8f21439fd57eca6ba6.tar.gz
copyjit-8cdc4c263a9515405964ca8f21439fd57eca6ba6.zip
Update README.md
-rw-r--r--README.md6
1 files changed, 3 insertions, 3 deletions
diff --git a/README.md b/README.md
index 1ec562b..d6c8d25 100644
--- a/README.md
+++ b/README.md
@@ -8,10 +8,10 @@ we can then copy in place. This relies heavily on continuation passing, meaning
that all operations defined by the jit library have to allow for continuation
passing optimizations to happen. In copy-and-patch, the templates are filled in
at runtime with whatever values the user chooses, but since this relies on
-parsin ELF relocations, the library will have to be implemented for different
+parsin ELF relocations, the library will have to be ported to different
platforms. Not a huge issue, but if we could avoid runtime patching of
-relocations we could (in theory) build a jit library that's equally portable
-as whatever compiler is used to compile it while having very low latencies.
+relocations we could (in theory) build a jit library that's architecture agnostic,
+while having very low latencies.
## Building