Mercurial > hg > Gears > GearsAgda

comparison src/parallel_execution/rb_tree.c @ 141:4f6a660c14a1 stack-interface

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
stack interface worked
author Shinji KONO <kono@ie.u-ryukyu.ac.jp>
date Wed, 09 Nov 2016 15:43:22 +0900
parents f31b4e4bf4bb
children 34a7a21edc36
comparison
equal deleted inserted replaced
140:f31b4e4bf4bb 141:4f6a660c14a1
203 } 203 }
204 204
205 __code insertCase5(struct Context* context, struct Traverse* traverse,struct Stack *nodeStack) { 205 __code insertCase5(struct Context* context, struct Traverse* traverse,struct Stack *nodeStack) {
206 nodeStack->stack = (union Data*)traverse->nodeStack; 206 nodeStack->stack = (union Data*)traverse->nodeStack;
207 nodeStack->next = InsertCase51; 207 nodeStack->next = InsertCase51;
208 goto meta(context, traverse->nodeStack->get2); 208 goto meta(context, traverse->nodeStack->pop2);
209 } 209 }
210 210
211 __code insert5_stub(struct Context* context) { 211 __code insert5_stub(struct Context* context) {
212 goto insertCase5(context, &context->data[Traverse]->traverse, &context->data[Stack]->stack); 212 goto insertCase5(context, &context->data[Traverse]->traverse, &context->data[Stack]->stack);
213 } 213 }
307 parent); 307 parent);
308 } 308 }
309 309
310 __code stackClear(struct Context* context, struct Traverse* traverse) { 310 __code stackClear(struct Context* context, struct Traverse* traverse) {
311 traverse->current = 0; 311 traverse->current = 0;
312 struct SingleLinkedStack* nodeStack = &context->data[Traverse]->traverse.nodeStack->stack->singleLinkedStack; 312 struct SingleLinkedStack* nodeStack = (struct SingleLinkedStack*)traverse->nodeStack->stack;
313 nodeStack->top = NULL; 313 nodeStack->top = NULL;
314 314
315 goto meta(context, context->next); 315 goto meta(context, context->next);
316 } 316 }
317 317