Displaying 3 results from an estimated 3 matches for "llvm_linkag".
Did you mean:
llvm_linkage
2007 Nov 27
0
[LLVMdev] Fibonacci example in OCaml
...tructuring than identifier bloat, e.g.:
module Linkage = struct
type linkage =
[ `External
| `Link_once
| `Weak
| `Appending
| `Internal
| `Dllimport
| `Dllexport
| `External_weak
| `Ghost ]
external linkage : llvalue -> linkage = "llvm_linkage"
end
> > I'd rather box everything rather than tag ints to start with. I'll
> > relegate that to a potential optimization.
>
> You could go about it that way, sure. Memory pressure will be very high.
Let's ignore that for now and get something up and running. I...
2007 Nov 26
4
[LLVMdev] Fibonacci example in OCaml
On Nov 26, 2007, at 14:18, Jon Harrop wrote:
> On Monday 26 November 2007 16:21, Gordon Henriksen wrote:
>>
>
>> Unfortunately, even if the bindings were more strongly typed, it
>> would still be structurally possible to build invalid LLVM code, so
>> you've just got to take care not to violate the invariants, then
>> use the verifier as a
2007 Nov 27
1
[LLVMdev] Fibonacci example in OCaml
...nsigned greater than is not unordered
greater than).
> I'd also rather see structuring than identifier bloat, e.g.:
>
> module Linkage = struct
> type linkage =
> [ `External
> | ...
> | `Ghost ]
>
> external linkage : llvalue -> linkage = "llvm_linkage"
> end
This is a fair idea for grouping enums.
>> It should be possible for LLVM to perform intra- or interprocedural
>> escape analysis and lower heap allocations to stack allocations,
>> but I don't believe this is implemented. Garbage collection would
>&...