Displaying 2 results from an estimated 2 matches for "coroutinestack".
2011 May 06
0
[LLVMdev] Requirements for the EH representation
...rticular syntax of a subset of coroutine semantics:
void f() { throw 1; }
void h();
void g() {
try {
f();
} catch (...) {
h();
}
}
assumming a hypothetical Coroutine object that supports manual cleanup of the stack allocated objects, the code above is semantically equivalent to:
struct CoroutineStack {
Coroutine* context;
CoroutineStack* next;
}
Coroutine* currentContext;
CoroutineStack * nextCatchContextLink;
void f () { currentContext->yieldTo( nextCatchContextLink->context ); }
void h();
void g() {
Coroutine tryContext( [&] => { f(); } );
Coroutine catchContext( [&] =...
2011 May 04
2
[LLVMdev] Greedy register allocation
On May 4, 2011, at 8:23 AM, Evan Cheng wrote:
>> I don't know how realistic it is to model the loop buffer in the register allocator, but this would a very interesting thing to try to optimize for in a later pass. If an inner loop "almost" fits, then it would probably be worth heroic effort to try to reduce the size of it to shave off a few bytes.
>
> Jakob and I have