Displaying 8 results from an estimated 8 matches for "linked_list".
2005 Mar 08
3
[LLVMdev] Recursive Types using the llvm support library
..., when you construct a type using the support
library StructType::get, you have to pass in a list of types. How can
you make a Recursive type by passing in a pointer to the type you are
constucting.
An example where something really simple like the line below was output
would be perfect.
%struct.linked_list = type { %struct.linked_list*, %sbyte* }
Thanks for any help,
John
2005 Mar 08
0
[LLVMdev] Recursive Types using the llvm support library
...support
> library StructType::get, you have to pass in a list of types. How can
> you make a Recursive type by passing in a pointer to the type you are
> constucting.
>
> An example where something really simple like the line below was output
> would be perfect.
>
> %struct.linked_list = type { %struct.linked_list*, %sbyte* }
Use something like this:
PATypeHolder StructTy = OpaqueType::get();
std::vector<const Type*> Elts;
Elts.push_back(PointerType::get(StructTy));
Elts.push_back(PointerType::get(Type::SByteTy));
StructType *NewSTy = StructType::get(Elts);...
2005 Mar 08
2
[LLVMdev] Recursive Types using the llvm support library
>> An example where something really simple like the line below was output
>> would be perfect.
>>
>> %struct.linked_list = type { %struct.linked_list*, %sbyte* }
>
> Use something like this:
>
> PATypeHolder StructTy = OpaqueType::get();
> std::vector<const Type*> Elts;
> Elts.push_back(PointerType::get(StructTy));
> Elts.push_back(PointerType::get(Type::SByteTy));
> StructTy...
2005 Mar 08
0
[LLVMdev] Recursive Types using the llvm support library
On Tue, 8 Mar 2005, Vladimir Merzliakov wrote:
>>> An example where something really simple like the line below was output
>>> would be perfect.
>>>
>>> %struct.linked_list = type { %struct.linked_list*, %sbyte* }
>>
>> Use something like this:
>>
>> PATypeHolder StructTy = OpaqueType::get();
>> std::vector<const Type*> Elts;
>> Elts.push_back(PointerType::get(StructTy));
>> Elts.push_back(PointerType::get(Type...
2005 Mar 09
4
[LLVMdev] Recursive Types using the llvm support library
...1 PM
Subject: Re: [LLVMdev] Recursive Types using the llvm support library
> On Tue, 8 Mar 2005, Vladimir Merzliakov wrote:
>
>>>> An example where something really simple like the line below was output
>>>> would be perfect.
>>>>
>>>> %struct.linked_list = type { %struct.linked_list*, %sbyte* }
>>>
>>> Use something like this:
>>>
>>> PATypeHolder StructTy = OpaqueType::get();
>>> std::vector<const Type*> Elts;
>>> Elts.push_back(PointerType::get(StructTy));
>>> Elts.push_...
2016 Aug 18
5
[PATCH v2 0/4] New getprogname module
...| 3 -
tests/test-exclude.c | 3 -
tests/test-fchownat.c | 3 -
tests/test-fdopendir.c | 3 -
tests/test-filenamecat.c | 3 -
tests/test-fstatat.c | 3 -
tests/test-fstrcmp.c | 3 -
tests/test-linked_list.c | 3 -
tests/test-linkedhash_list.c | 3 -
tests/test-mkdirat.c | 3 -
tests/test-nonblocking-pipe-main.c | 3 -
tests/test-nonblocking-socket-main.c | 3 -
tests/test-obstack-printf.c | 3 -
tests/test-openat.c | 3 -...
2012 Jul 17
3
complexity of operations in R
Hello!
I am optimizing my code in R and for this I need to know a bit more about
the internals. It would help tremendously if someone could link me to a
page with O()-complexities of all the operations.
In this particular case, I need something like a linked list with O(1)
insertLast/First ability. I can't preallocate a vector since I do not know
the final size of the list ahead of time.
The
2023 Apr 05
3
[PATCH v2 0/2] rust: virtio: add virtio support
This used to be a single patch, but I split it into two with the
addition of struct Scatterlist.
Again a bit new with Rust submissions. I was told by Gary Guo to
rebase on top of rust-next, but it seems *very* behind?
The first patch does not build on its own due to a dead_code warning.
It is hard to not have dead code when one is adding infrastructure to be
used by others at a later