search for: ilway25

...e any built-in notion of this, so you're going to have to > make significant changes to the compiler to do that. Whether this means > writing your own compiler would be less work I don't know. > > Hope this helps, > > > On Fri, Nov 15, 2013 at 9:15 AM, Shang-Yi Yang <ilway25 at gmail.com> wrote: > >> I've been playing around with LLVM to write a backend for a rather >> "simple" (co-)processor. Assume that only three arithmetic instructions >> exist: ADD mod N, SUB mod N and MUL mod N. The modulus N is programmable >> and stor...

...ion. LLVM doesn't really have any built-in notion of this, so you're going to have to make significant changes to the compiler to do that. Whether this means writing your own compiler would be less work I don't know. Hope this helps, On Fri, Nov 15, 2013 at 9:15 AM, Shang-Yi Yang <ilway25 at gmail.com> wrote: > I've been playing around with LLVM to write a backend for a rather > "simple" (co-)processor. Assume that only three arithmetic instructions > exist: ADD mod N, SUB mod N and MUL mod N. The modulus N is programmable > and stored in a register. No...

I've been playing around with LLVM to write a backend for a rather "simple" (co-)processor. Assume that only three arithmetic instructions exist: ADD mod N, SUB mod N and MUL mod N. The modulus N is programmable and stored in a register. No ordinary arithmetic instructions are available. The word size is 256-bit. In other words, the following function, b + c mod N, corresponds to

Hi Jonathan, After reading/skimming through the official LLVM backend documents, I actually tried following your steps to write a new backend, but how to write td files still remains unclear. The details are not well explained, though I know most of them can be found in other documents or have already been documented somewhere in the LLVM source code or td files. For a beginner with no