Displaying 2 results from an estimated 2 matches for "stackcount".
Did you mean:
setaccount
2007 Aug 14
0
[LLVMdev] ocaml+llvm
...// Visits a GC point, including information necessary to
identify all
// live GC roots in the stack frame.
virtual bool VisitGCPoint(MachineInstruction *Point,
GCPointKind Kind,
intptr_t *StackRoots, size_t
StackCount,
int *RegisterRoots, size_t
RegisterCount);
};
That could enable several kinds of conservative collectors.
The code generator would need to cooperate by:
1. Inserting nodes for GC points if required, recording the
corresponding original Instruction*....
2007 Aug 14
4
[LLVMdev] ocaml+llvm
On Aug 14, 2007, at 00:23, Chris Lattner wrote:
> On Mon, 13 Aug 2007, Gordon Henriksen wrote:
>
>> Changing these structures breaks binary compatibility (including C
>> interop).
>
> If that is so, and if there is no way around this, then it makes
> sense to develop some compatibility mode. How does native C code
> generate these tables?
I might've