search for: williamsteven

...sting one is too small. > > Ultimately you will need to work out if you want pascal / java style > strings like mine, or C style NULL terminated strings. And how the memory > for these strings will be managed. > > > On Sun, Oct 13, 2013 at 4:43 AM, William Moses < > moses.williamsteven at gmail.com> wrote: > >> All, >> >> I am building my own language with llvm as the base. >> >> I was working on string concatenation (where a string is just an array of >> characters cast to a pointer to a character (i8*) ). Given two strings, it >>...

On 9 Nov 2013, at 16:35, William Moses <moses.williamsteven at gmail.com> wrote: > Is it possible to create something which has the same effect of a variable-length phi node in the C++ api. Specifically, create a phi-node where the number of incoming values is not known at the time of its creation. The PHI node preallocates its storage, so no. >...

All, Is it possible to create something which has the same effect of a variable-length phi node in the C++ api. Specifically, create a phi-node where the number of incoming values is not known at the time of its creation. If there is no such way of creating a phinode like that, would it be possible to create a dummy instruction and perform a replaceAllUsesWith? If so, what should the dummy

...// Initialize some new operands. ++NumOperands; setIncomingValue(NumOperands - 1, V); setIncomingBlock(NumOperands - 1, BB); } -Filip On Nov 9, 2013, at 9:56 AM, David Chisnall <David.Chisnall at cl.cam.ac.uk> wrote: > On 9 Nov 2013, at 16:35, William Moses <moses.williamsteven at gmail.com> wrote: > >> Is it possible to create something which has the same effect of a variable-length phi node in the C++ api. Specifically, create a phi-node where the number of incoming values is not known at the time of its creation. > > The PHI node preallocates its st...

...reallocate the buffer only if the existing one is too small. Ultimately you will need to work out if you want pascal / java style strings like mine, or C style NULL terminated strings. And how the memory for these strings will be managed. On Sun, Oct 13, 2013 at 4:43 AM, William Moses < moses.williamsteven at gmail.com> wrote: > All, > > I am building my own language with llvm as the base. > > I was working on string concatenation (where a string is just an array of > characters cast to a pointer to a character (i8*) ). Given two strings, it > is possible to determine the len...

All, I am building my own language with llvm as the base. I was working on string concatenation (where a string is just an array of characters cast to a pointer to a character (i8*) ). Given two strings, it is possible to determine the length of new string by summing the number of characters until the null terminator and adding one. Unfortunately, I have no idea how to use the c-api to store

All, Is there a fast way to retrieve all of the predecessors to a BasicBlock in a function. Specifically, is there a fast way to iterate through all BasicBlocks which can break to a specific BasicBlock? Thanks, Billy -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20131114/aa6220a2/attachment.html>

All, I was wondering if the following operations could be implemented atomically in LLVM (a la AtomicRMW): Multiplication, Division, Remainder, Bit Shifting, or Logical Not (this could be implemented by xor with a value of all 1's). Is there a reason implementation-wise that they are not there? Additionally, would it be possible to create something similar to AtomicRMW that returned the new