Mercurial > hg > Gears > GearsAgda
annotate src/parallel_execution/rb_tree.c @ 132:7c309e1aea73
Code Gears stack api
author | one |
---|---|
date | Thu, 27 Oct 2016 18:54:11 +0900 |
parents | a4507906938c |
children | 568730b1239e |
rev | line source |
---|---|
86 | 1 #include <stdio.h> |
2 | |
3 #include "context.h" | |
4 #include "origin_cs.h" | |
5 | |
131
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
6 extern union Data* allocator(struct Context* context); |
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
7 extern enum Relational compare(struct Node* node1, struct Node* node2); |
86 | 8 |
126 | 9 void printTree1(union Data* data) { |
132 | 10 struct Node* node = &data->node; |
126 | 11 if (node == NULL) { |
12 printf("NULL"); | |
13 } else { | |
14 printf("key = %d (", node->key); | |
132 | 15 printTree1(GET_DATA(node->right)); |
126 | 16 printf("), ("); |
132 | 17 printTree1(GET_DATA(node->left)); |
126 | 18 printf(")"); |
19 } | |
20 } | |
21 | |
22 void printTree(union Data* data) { | |
23 printTree1(data); | |
24 printf("\n"); | |
25 } | |
86 | 26 |
130 | 27 __code put(struct Context* context, struct Stack* nodeStack, struct Tree* tree, struct Node* node, struct Traverse* traverse, struct Node* root, struct Node* newNode) { |
132 | 28 printTree(GET_DATA(tree->root)); |
122 | 29 traverse->newNode = newNode; |
30 tree->root = newNode; // this should done at stackClear | |
86 | 31 if (root) { |
91 | 32 traverse->current = root; |
131
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
33 traverse->result = compare(traverse->current, node); |
132 | 34 nodeStack->data = GET_DATA(newNode); |
130 | 35 nodeStack->next = Replace1; |
36 goto meta(context, nodeStack->push); | |
86 | 37 } |
38 | |
39 goto meta(context, Insert); | |
40 } | |
41 | |
42 __code put_stub(struct Context* context) { | |
121 | 43 struct Allocate* allocate = &context->data[Allocate]->allocate; |
44 allocate->size = sizeof(struct Node); | |
45 allocator(context); | |
91 | 46 goto put(context, |
132 | 47 context->data[Traverse]->traverse.nodeStack, |
91 | 48 &context->data[Tree]->tree, |
124 | 49 &context->data[Node]->node, |
91 | 50 &context->data[Traverse]->traverse, |
51 context->data[Tree]->tree.root, | |
124 | 52 &context->data[context->dataNum]->node |
53 ); | |
121 | 54 } |
55 | |
132 | 56 __code replaceNode(struct Context* context, struct Traverse* traverse, struct Node* oldNode, struct Node* newNode, struct Stack* nodeStack) { |
121 | 57 *newNode = *oldNode; |
132 | 58 nodeStack->data = GET_DATA(newNode); |
59 nodeStack->next = Replace1; | |
60 goto meta(context, nodeStack->push); | |
86 | 61 } |
62 | |
121 | 63 __code replaceNode_stub(struct Context* context) { |
64 goto replaceNode(context, | |
65 &context->data[Traverse]->traverse, | |
66 context->data[Traverse]->traverse.current, | |
122 | 67 context->data[Traverse]->traverse.newNode, |
132 | 68 context->data[Traverse]->traverse.nodeStack); |
121 | 69 } |
70 | |
71 __code replaceNode1(struct Context* context, struct Traverse* traverse, struct Node* node, struct Node* oldNode, struct Node* newNode, struct Node* newnewNode, int result) { | |
86 | 72 if (result == EQ) { |
121 | 73 newNode->value = node->value; |
117 | 74 // go to stack clear |
86 | 75 goto meta(context, context->next); |
76 } else if (result == GT) { | |
91 | 77 traverse->current = oldNode->right; |
121 | 78 newNode->right = newnewNode; |
86 | 79 } else { |
91 | 80 traverse->current = oldNode->left; |
121 | 81 newNode->left = newnewNode; |
86 | 82 } |
122 | 83 traverse->newNode = newnewNode; |
91 | 84 if (traverse->current) { |
131
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
85 traverse->result = compare(traverse->current, node); |
86 | 86 goto meta(context, Replace); |
87 } | |
88 | |
89 goto meta(context, Insert); | |
121 | 90 |
86 | 91 } |
92 | |
121 | 93 __code replaceNode1_stub(struct Context* context) { |
132 | 94 struct Node* newnewNode = &ALLOCATE(context, Node)->node; |
121 | 95 goto replaceNode1(context, |
91 | 96 &context->data[Traverse]->traverse, |
124 | 97 &context->data[Node]->node, |
91 | 98 context->data[Traverse]->traverse.current, |
124 | 99 &context->data[Traverse]->traverse.nodeStack->data->node, |
100 newnewNode, | |
91 | 101 context->data[Traverse]->traverse.result); |
86 | 102 } |
103 | |
127 | 104 __code insertNode(struct Context* context, struct Traverse* traverse, struct Node* node, struct Node* newNode) { |
86 | 105 *newNode = *node; |
122 | 106 newNode->color = Red; |
91 | 107 traverse->current = newNode; |
86 | 108 goto meta(context, InsertCase1); |
109 } | |
110 | |
111 __code insertNode_stub(struct Context* context) { | |
91 | 112 goto insertNode(context, |
113 &context->data[Traverse]->traverse, | |
114 &context->data[Node]->node, | |
124 | 115 context->data[Traverse]->traverse.newNode); |
86 | 116 } |
117 | |
132 | 118 __code insertCase1(struct Context* context, struct Tree* tree, struct Stack* nodeStack) { |
119 if (nodeStack != NULL) { | |
86 | 120 goto meta(context, InsertCase2); |
122 | 121 } |
127 | 122 tree->root->color = Black; |
119 | 123 goto meta(context, StackClear); |
86 | 124 } |
125 | |
126 __code insert1_stub(struct Context* context) { | |
127 | 127 goto insertCase1(context, |
128 &context->data[Tree]->tree, | |
129 context->data[Traverse]->traverse.nodeStack); | |
86 | 130 } |
131 | |
122 | 132 __code insertCase2(struct Context* context, struct Node* parent) { |
86 | 133 if (parent->color == Black) { |
119 | 134 goto meta(context, StackClear); |
86 | 135 } |
136 goto meta(context, InsertCase3); | |
137 } | |
138 | |
139 __code insert2_stub(struct Context* context) { | |
124 | 140 goto insertCase2(context, (struct Node*)context->data[Traverse]->traverse.nodeStack->data); |
86 | 141 } |
142 | |
124 | 143 __code insertCase3(struct Context* context, struct Traverse* traverse, struct Node* parent, struct Node* grandparent) { |
86 | 144 struct Node* uncle; |
145 | |
146 if (grandparent->left == parent) | |
147 uncle = grandparent->right; | |
148 else | |
149 uncle = grandparent->left; | |
150 | |
151 if (uncle && (uncle->color == Red)) { | |
117 | 152 // do insertcase1 on grandparent, stack must be pop by two |
86 | 153 parent->color = Black; |
154 uncle->color = Black; | |
155 grandparent->color = Red; | |
91 | 156 traverse->current = grandparent; |
124 | 157 goto meta(context, InsertCase31); |
86 | 158 } |
159 goto meta(context, InsertCase4); | |
160 } | |
161 | |
162 __code insert3_stub(struct Context* context) { | |
122 | 163 goto insertCase3(context, &context->data[Traverse]->traverse, |
124 | 164 (struct Node*)context->data[Traverse]->traverse.nodeStack->data, |
165 (struct Node*)context->data[Traverse]->traverse.nodeStack->next->data | |
122 | 166 ); |
86 | 167 } |
122 | 168 __code insertCase31(struct Context* context, struct Traverse* traverse) { |
169 traverse->nodeStack = traverse->nodeStack->next->next; | |
120 | 170 goto meta(context, InsertCase1); |
171 } | |
122 | 172 __code insert31_stub(struct Context* context) { |
173 goto insertCase31(context, &context->data[Traverse]->traverse); | |
120 | 174 } |
86 | 175 |
122 | 176 __code insertCase4(struct Context* context, struct Traverse* traverse, struct Node* current,struct Node* parent, struct Node* grandparent) { |
91 | 177 traverse->current = parent; |
86 | 178 |
179 if ((current == parent->right) && (parent == grandparent->left)) { | |
119 | 180 traverse->rotateNext = InsertCase4_1; |
122 | 181 goto meta(context, InsertCase4_01); |
86 | 182 } else if ((current == parent->left) && (parent == grandparent->right)) { |
119 | 183 traverse->rotateNext = InsertCase4_2; |
122 | 184 goto meta(context, InsertCase4_02); |
86 | 185 } |
186 | |
91 | 187 traverse->current = current; |
86 | 188 goto meta(context, InsertCase5); |
189 } | |
190 | |
191 __code insert4_stub(struct Context* context) { | |
124 | 192 goto insertCase4(context, &context->data[Traverse]->traverse, context->data[Traverse]->traverse.current, |
193 &context->data[Traverse]->traverse.nodeStack->data->node, | |
194 &context->data[Traverse]->traverse.nodeStack->next->data->node); | |
86 | 195 } |
196 | |
122 | 197 __code insertCase4_01(struct Context* context, struct Traverse* traverse) { |
126 | 198 traverse->nodeStack = traverse->nodeStack -> next; |
199 traverse->rotateNext = InsertCase5; | |
122 | 200 goto meta(context, RotateL); |
201 } | |
202 | |
203 __code insert4_01_stub(struct Context* context) { | |
204 goto insertCase4_01(context, &context->data[Traverse]->traverse); | |
205 } | |
91 | 206 __code insertCase4_1(struct Context* context, struct Traverse* traverse) { |
207 traverse->current = traverse->current->left; | |
86 | 208 goto meta(context, InsertCase5); |
209 } | |
210 | |
211 __code insert4_1_stub(struct Context* context) { | |
122 | 212 struct Allocate* allocate = &context->data[Allocate]->allocate; |
213 allocate->size = sizeof(struct Element); | |
214 allocator(context); | |
124 | 215 struct Element* element = &context->data[context->dataNum]->element; |
216 struct Traverse* traverse = &context->data[Traverse]->traverse; | |
217 element->data = (union Data*)traverse->current; | |
91 | 218 goto insertCase4_1(context, &context->data[Traverse]->traverse); |
86 | 219 } |
122 | 220 __code insertCase4_02(struct Context* context, struct Traverse* traverse) { |
126 | 221 traverse->nodeStack = traverse->nodeStack -> next; |
222 traverse->rotateNext = InsertCase5; | |
122 | 223 goto meta(context, RotateR); |
224 } | |
225 | |
226 __code insert4_02_stub(struct Context* context) { | |
227 goto insertCase4_02(context, &context->data[Traverse]->traverse); | |
228 } | |
86 | 229 |
91 | 230 __code insertCase4_2(struct Context* context, struct Traverse* traverse) { |
231 traverse->current = traverse->current->right; | |
86 | 232 goto meta(context, InsertCase5); |
233 } | |
234 | |
123 | 235 __code insert4_2_stub(struct Context* context) { |
122 | 236 struct Allocate* allocate = &context->data[Allocate]->allocate; |
237 allocate->size = sizeof(struct Element); | |
238 allocator(context); | |
124 | 239 struct Element* element = &context->data[context->dataNum]->element; |
240 struct Traverse* traverse = &context->data[Traverse]->traverse; | |
241 element->data = (union Data*)traverse->current; | |
91 | 242 goto insertCase4_2(context, &context->data[Traverse]->traverse); |
86 | 243 } |
244 | |
124 | 245 __code insertCase5(struct Context* context, struct Traverse* traverse, struct Node* current, struct Node* parent, struct Node* grandparent) { |
86 | 246 parent->color = Black; |
247 grandparent->color = Red; | |
248 | |
91 | 249 traverse->current = grandparent; |
119 | 250 traverse->rotateNext = StackClear; |
86 | 251 if ((current == parent->left) && (parent == grandparent->left)) |
252 goto meta(context, RotateR); | |
253 else | |
254 goto meta(context, RotateL); | |
255 } | |
256 | |
257 __code insert5_stub(struct Context* context) { | |
124 | 258 struct Traverse* traverse = &context->data[Traverse]->traverse; |
122 | 259 struct Node* parent = (struct Node*)traverse->nodeStack->data; |
260 struct Node* grandparent = (struct Node*)traverse->nodeStack->next->data; | |
261 traverse->nodeStack = traverse->nodeStack->next->next; | |
124 | 262 goto insertCase5(context, &context->data[Traverse]->traverse, context->data[Traverse]->traverse.current, parent, grandparent); |
86 | 263 } |
264 | |
117 | 265 // put rotateLeft's continuation as argument |
126 | 266 __code rotateLeft(struct Context* context, struct Node* node, struct Tree* tree, struct Traverse* traverse, struct Node* parent) { |
86 | 267 struct Node* tmp = node->right; |
123 | 268 |
269 if (parent) { | |
270 if (node == parent->left) | |
271 parent->left = tmp; | |
272 else | |
273 parent->right = tmp; | |
274 } else { | |
275 tree->root = tmp; | |
276 } | |
117 | 277 |
123 | 278 node->right = tmp->left; |
279 tmp->left = node; | |
280 traverse->current = tmp; | |
281 | |
282 goto meta(context, traverse->rotateNext); | |
283 } | |
284 | |
285 __code rotateLeft_stub(struct Context* context) { | |
124 | 286 struct Traverse* traverse = &context->data[Traverse]->traverse; |
123 | 287 struct Node* parent = (traverse->nodeStack)?(struct Node*)traverse->nodeStack->data:NULL; |
288 goto rotateLeft(context, | |
125 | 289 context->data[Traverse]->traverse.current, |
123 | 290 &context->data[Tree]->tree, |
124 | 291 &context->data[Traverse]->traverse, |
126 | 292 parent); |
123 | 293 } |
86 | 294 |
126 | 295 __code rotateRight(struct Context* context, struct Node* node, struct Tree* tree, struct Traverse* traverse, struct Node* parent) { |
123 | 296 struct Node* tmp = node->left; |
297 | |
86 | 298 if (parent) { |
299 if (node == parent->left) | |
300 parent->left = tmp; | |
301 else | |
302 parent->right = tmp; | |
303 } else { | |
304 tree->root = tmp; | |
305 } | |
306 | |
307 node->left = tmp->right; | |
308 tmp->right = node; | |
91 | 309 traverse->current = tmp; |
86 | 310 |
119 | 311 goto meta(context, traverse->rotateNext); |
86 | 312 } |
313 | |
314 __code rotateRight_stub(struct Context* context) { | |
125 | 315 struct Traverse* traverse = &context->data[Traverse]->traverse; |
316 struct Node* parent = (traverse->nodeStack)?(struct Node*)traverse->nodeStack->data:NULL; | |
91 | 317 goto rotateRight(context, |
125 | 318 context->data[Traverse]->traverse.current, |
124 | 319 &context->data[Tree]->tree, |
320 &context->data[Traverse]->traverse, | |
126 | 321 parent); |
86 | 322 } |
323 | |
131
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
324 __code stackClear(struct Context* context, struct Traverse* traverse) { |
91 | 325 traverse->current = 0; |
127 | 326 traverse->nodeStack = NULL; |
86 | 327 |
328 goto meta(context, context->next); | |
329 } | |
330 | |
331 __code stackClear_stub(struct Context* context) { | |
131
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
332 goto stackClear(context, &context->data[Traverse]->traverse); |
86 | 333 } |
334 | |
335 | |
92 | 336 __code get(struct Context* context, struct Tree* tree, struct Traverse* traverse) { |
337 if (tree->root) { | |
338 traverse->current = tree->root; | |
86 | 339 |
92 | 340 goto meta(context, Search); |
341 } | |
86 | 342 |
131
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
343 goto meta(context, traverse->next); |
92 | 344 } |
86 | 345 |
92 | 346 __code get_stub(struct Context* context) { |
347 goto get(context, &context->data[Tree]->tree, &context->data[Traverse]->traverse); | |
348 } | |
86 | 349 |
91 | 350 __code search(struct Context* context, struct Traverse* traverse, struct Node* node) { |
131
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
351 // compare(context, traverse, traverse->current->key, node->key); |
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
352 traverse->result = compare(traverse->current, node); |
91 | 353 if (traverse->result == EQ) { |
354 *node = *traverse->current; | |
86 | 355 |
131
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
356 goto meta(context, traverse->next); |
91 | 357 } else if (traverse->result == GT) { |
358 traverse->current = traverse->current->right; | |
359 } else { | |
360 traverse->current = traverse->current->left; | |
361 } | |
86 | 362 |
91 | 363 if (traverse->current) |
364 goto meta(context, Search); | |
86 | 365 |
131
a4507906938c
Fix compile error but not work
Tatsuki IHA <e125716@ie.u-ryukyu.ac.jp>
parents:
130
diff
changeset
|
366 goto meta(context, traverse->next); |
91 | 367 } |
86 | 368 |
91 | 369 __code search_stub(struct Context* context) { |
370 goto search(context, &context->data[Traverse]->traverse, &context->data[Node]->node); | |
371 } | |
86 | 372 |
373 /* /\* __code delete(struct Context* context, struct Tree* tree) { *\/ */ | |
374 /* /\* if (tree->root) { *\/ */ | |
375 /* /\* stack_push(context->code_stack, &context->next); *\/ */ | |
376 /* /\* context->next = Delete1; *\/ */ | |
377 /* /\* goto meta(context, Get); *\/ */ | |
378 /* /\* } *\/ */ | |
379 | |
380 /* /\* goto meta(context, context->next); *\/ */ | |
381 /* /\* } *\/ */ | |
382 | |
383 /* /\* __code delete_stub(struct Context* context) { *\/ */ | |
384 /* /\* goto delete(context, &context->data[Tree]->tree); *\/ */ | |
385 /* /\* } *\/ */ | |
386 | |
387 /* /\* __code delete1(struct Context* context, struct Tree* tree, struct Allocate* allocate) { *\/ */ | |
388 /* /\* allocate->size = sizeof(struct Node); *\/ */ | |
389 /* /\* allocator(context); *\/ */ | |
390 | |
391 /* /\* struct Node* root = tree->root; *\/ */ | |
392 | |
393 /* /\* tree->root = &context->data[context->dataNum]->node; *\/ */ | |
394 /* /\* tree->current = root; *\/ */ | |
395 | |
396 /* /\* compare(context, tree, tree->current->key, context->data[Node]->node.key); *\/ */ | |
397 | |
398 /* /\* goto meta(context, Replace_d1); *\/ */ | |
399 /* /\* } *\/ */ | |
400 | |
401 /* /\* __code delete1_stub(struct Context* context) { *\/ */ | |
402 /* /\* goto delete1(context, &context->data[Tree]->tree, &context->data[Allocate]->allocate); *\/ */ | |
403 /* /\* } *\/ */ | |
404 | |
405 /* /\* __code delete2(struct Context* context, struct Node* current) { *\/ */ | |
406 /* /\* if (current->color == Black) { *\/ */ | |
407 /* /\* struct Node* child = current->right == NULL ? current->left : current->right; *\/ */ | |
408 /* /\* current->color = child == NULL ? Black : child->color; *\/ */ | |
409 | |
410 /* /\* goto meta(context, DeleteCase1); *\/ */ | |
411 /* /\* } *\/ */ | |
412 | |
413 /* /\* goto meta(context, Delete3); *\/ */ | |
414 /* /\* } *\/ */ | |
415 | |
416 /* /\* __code delete2_stub(struct Context* context) { *\/ */ | |
417 /* /\* goto delete2(context, context->data[Tree]->tree.current); *\/ */ | |
418 /* /\* } *\/ */ | |
419 | |
420 /* /\* __code delete3(struct Context* context, struct Tree* tree, struct Node* current) { *\/ */ | |
421 /* /\* struct Node* tmp = current->right == NULL ? current->left : current->right; *\/ */ | |
422 | |
423 /* /\* if (current->parent) { *\/ */ | |
424 /* /\* if (current == current->parent->left) *\/ */ | |
425 /* /\* current->parent->left = tmp; *\/ */ | |
426 /* /\* else *\/ */ | |
427 /* /\* current->parent->right = tmp; *\/ */ | |
428 /* /\* } else { *\/ */ | |
429 /* /\* tree->root = tmp; *\/ */ | |
430 /* /\* } *\/ */ | |
431 | |
432 /* /\* if (tmp) *\/ */ | |
433 /* /\* tmp->parent = current->parent; *\/ */ | |
434 | |
435 /* /\* if (current->parent == NULL && tmp) *\/ */ | |
436 /* /\* tmp->color = Black; *\/ */ | |
437 | |
438 /* /\* current == current->parent->left ? (current->parent->left = NULL) : (current->parent->right = NULL); *\/ */ | |
439 | |
440 /* /\* stack_pop(context->code_stack, &context->next); *\/ */ | |
441 /* /\* goto meta(context, context->next); *\/ */ | |
442 /* /\* } *\/ */ | |
443 | |
444 /* /\* __code delete3_stub(struct Context* context) { *\/ */ | |
445 /* /\* goto delete3(context, &context->data[Tree]->tree, context->data[Tree]->tree.current); *\/ */ | |
446 /* /\* } *\/ */ | |
447 | |
448 /* /\* __code replaceNodeForDelete1(struct Context* context, struct Tree* tree, struct Node* oldNode, struct Node* newNode, int result) { *\/ */ | |
449 /* /\* *newNode = *oldNode; *\/ */ | |
450 | |
451 /* /\* if (result == EQ) *\/ */ | |
452 /* /\* goto meta(context, Replace_d2); *\/ */ | |
453 /* /\* else if (result == GT) *\/ */ | |
454 /* /\* tree->current = newNode->right; *\/ */ | |
455 /* /\* else *\/ */ | |
456 /* /\* tree->current = newNode->left; *\/ */ | |
457 | |
458 /* /\* tree->current->parent = newNode; *\/ */ | |
459 | |
460 /* /\* if (tree->current->left == NULL && tree->current->right == NULL) *\/ */ | |
461 /* /\* goto meta(context, Delete2); *\/ */ | |
462 | |
463 /* /\* if (result == GT) *\/ */ | |
464 /* /\* newNode->right = context->heap; *\/ */ | |
465 /* /\* else if (result == LT) *\/ */ | |
466 /* /\* newNode->left = context->heap; *\/ */ | |
467 | |
468 /* /\* allocator(context); *\/ */ | |
469 | |
470 /* /\* compare(context, tree, tree->current->key, context->data[Node]->node.key); *\/ */ | |
471 | |
472 /* /\* goto meta(context, Replace_d1); *\/ */ | |
473 /* /\* } *\/ */ | |
474 | |
475 /* /\* __code replaceNodeForDelete1_stub(struct Context* context) { *\/ */ | |
476 /* /\* goto replaceNodeForDelete1(context, &context->data[Tree]->tree, context->data[Tree]->tree.current, &context->data[context->dataNum]->node, context->data[Tree]->tree.result); *\/ */ | |
477 /* /\* } *\/ */ | |
478 | |
479 /* /\* __code replaceNodeForDelete2(struct Context* context, struct Tree* tree, struct Node* newNode) { *\/ */ | |
480 /* /\* if (tree->current->left && tree->current->right) { *\/ */ | |
481 /* /\* newNode->left->parent = newNode; *\/ */ | |
482 /* /\* tree->current = newNode->left; *\/ */ | |
483 /* /\* newNode->left = context->heap; *\/ */ | |
484 /* /\* tree->deleted = newNode; *\/ */ | |
485 | |
486 /* /\* allocator(context); *\/ */ | |
487 /* /\* tree->current->parent = newNode; *\/ */ | |
488 | |
489 /* /\* goto meta(context, FindMax1); *\/ */ | |
490 /* /\* } *\/ */ | |
491 | |
492 /* /\* goto meta(context, Delete2); *\/ */ | |
493 /* /\* } *\/ */ | |
494 | |
495 /* /\* __code replaceNodeForDelete2_stub(struct Context* context) { *\/ */ | |
496 /* /\* goto replaceNodeForDelete2(context, &context->data[Tree]->tree, &context->data[context->dataNum]->node); *\/ */ | |
497 /* /\* } *\/ */ | |
498 | |
499 /* /\* __code findMax1(struct Context* context, struct Tree* tree, struct Node* oldNode, struct Node* newNode) { *\/ */ | |
500 /* /\* *newNode = *oldNode; *\/ */ | |
501 | |
502 /* /\* if (newNode->right) *\/ */ | |
503 /* /\* goto meta(context, FindMax2); *\/ */ | |
504 | |
505 /* /\* tree->deleted->key = newNode->key; *\/ */ | |
506 /* /\* tree->deleted->value = newNode->value; *\/ */ | |
507 | |
508 /* /\* tree->current = newNode; *\/ */ | |
509 | |
510 /* /\* goto meta(context, Delete2); *\/ */ | |
511 /* /\* } *\/ */ | |
512 | |
513 /* /\* __code findMax1_stub(struct Context* context) { *\/ */ | |
514 /* /\* goto findMax1(context, &context->data[Tree]->tree, context->data[Tree]->tree.current, &context->data[context->dataNum]->node); *\/ */ | |
515 /* /\* } *\/ */ | |
516 | |
517 | |
518 /* /\* __code findMax2(struct Context* context, struct Tree* tree, struct Node* oldNode, struct Node* newNode) { *\/ */ | |
519 /* /\* *newNode = *oldNode; *\/ */ | |
520 | |
521 /* /\* if (newNode->right->right) { *\/ */ | |
522 /* /\* tree->current = newNode->right; *\/ */ | |
523 /* /\* newNode->right = context->heap; *\/ */ | |
524 | |
525 /* /\* allocator(context); *\/ */ | |
526 /* /\* tree->current->parent = newNode; *\/ */ | |
527 | |
528 /* /\* goto meta(context, FindMax2); *\/ */ | |
529 /* /\* } *\/ */ | |
530 | |
531 /* /\* tree->deleted->key = newNode->right->key; *\/ */ | |
532 /* /\* tree->deleted->value = newNode->right->value; *\/ */ | |
533 | |
534 /* /\* tree->current = newNode; *\/ */ | |
535 | |
536 /* /\* goto meta(context, Delete2); *\/ */ | |
537 /* /\* } *\/ */ | |
538 | |
539 /* /\* __code findMax2_stub(struct Context* context) { *\/ */ | |
540 /* /\* goto findMax2(context, &context->data[Tree]->tree, context->data[Tree]->tree.current, &context->data[context->dataNum]->node); *\/ */ | |
541 /* /\* } *\/ */ | |
542 | |
543 /* /\* __code deleteCase1(struct Context* context, struct Node* current) { *\/ */ | |
544 /* /\* if (current->parent) *\/ */ | |
545 /* /\* goto meta(context, DeleteCase2); *\/ */ | |
546 | |
547 /* /\* goto meta(context, Delete3); *\/ */ | |
548 /* /\* } *\/ */ | |
549 | |
550 /* /\* __code deleteCase1_stub(struct Context* context) { *\/ */ | |
551 /* /\* goto deleteCase1(context, context->data[Tree]->tree.current); *\/ */ | |
552 /* /\* } *\/ */ | |
553 | |
554 /* /\* __code deleteCase2(struct Context* context, struct Tree* tree, struct Node* current) { *\/ */ | |
555 /* /\* struct Node* sibling = current == current->parent->left ? current->parent->right : current->parent->left; *\/ */ | |
556 | |
557 /* /\* if ((sibling == NULL ? Black : sibling->color) == Red) { *\/ */ | |
558 /* /\* current->parent->color = Red; *\/ */ | |
559 /* /\* sibling->color = Black; *\/ */ | |
560 | |
561 /* /\* current == current->parent->left ? (current->parent->left = context->heap) : (current->parent->right = context->heap); *\/ */ | |
562 /* /\* allocator(context); *\/ */ | |
563 /* /\* context->data[context->dataNum]->node = *sibling; *\/ */ | |
564 | |
565 /* /\* tree->current = current->parent; *\/ */ | |
566 | |
567 /* /\* context->next = DeleteCase3; *\/ */ | |
568 /* /\* stack_push(context->code_stack, &context->next); *\/ */ | |
569 | |
570 /* /\* if (current == current->parent->left) *\/ */ | |
571 /* /\* goto meta(context, RotateL); *\/ */ | |
572 /* /\* else *\/ */ | |
573 /* /\* goto meta(context, RotateR); *\/ */ | |
574 /* /\* } *\/ */ | |
575 | |
576 /* /\* goto meta(context, DeleteCase3); *\/ */ | |
577 /* /\* } *\/ */ | |
578 | |
579 /* /\* __code deleteCase2_stub(struct Context* context) { *\/ */ | |
580 /* /\* goto deleteCase2(context, &context->data[Tree]->tree, context->data[Tree]->tree.current); *\/ */ | |
581 /* /\* } *\/ */ | |
582 | |
583 /* /\* __code deleteCase3(struct Context* context, struct Tree* tree, struct Node* current) { *\/ */ | |
584 /* /\* struct Node* sibling = current == current->parent->left ? current->parent->right : current->parent->left; *\/ */ | |
585 | |
586 /* /\* if (current->parent->color == Black && *\/ */ | |
587 /* /\* (sibling == NULL ? Black : sibling->color) == Black && *\/ */ | |
588 /* /\* (sibling->left == NULL ? Black : sibling->left->color) == Black && *\/ */ | |
589 /* /\* (sibling->right == NULL ? Black : sibling->right->color) == Black) { *\/ */ | |
590 /* /\* sibling->color = Red; *\/ */ | |
591 | |
592 /* /\* tree->current = current->parent; *\/ */ | |
593 /* /\* goto meta(context, DeleteCase1); *\/ */ | |
594 /* /\* } *\/ */ | |
595 | |
596 /* /\* goto meta(context, DeleteCase4); *\/ */ | |
597 /* /\* } *\/ */ | |
598 | |
599 /* /\* __code deleteCase3_stub(struct Context* context) { *\/ */ | |
600 /* /\* goto deleteCase3(context, &context->data[Tree]->tree, context->data[Tree]->tree.current); *\/ */ | |
601 /* /\* } *\/ */ | |
602 | |
603 /* /\* __code deleteCase4(struct Context* context, struct Node* current) { *\/ */ | |
604 /* /\* struct Node* sibling = current == current->parent->left ? current->parent->right : current->parent->left; *\/ */ | |
605 | |
606 /* /\* if (current->parent->color == Red && *\/ */ | |
607 /* /\* (sibling == NULL ? Black : sibling->color) == Black && *\/ */ | |
608 /* /\* (sibling->left == NULL ? Black : sibling->left->color) == Black && *\/ */ | |
609 /* /\* (sibling->right == NULL ? Black : sibling->right->color) == Black) { *\/ */ | |
610 /* /\* sibling->color = Red; *\/ */ | |
611 /* /\* current->parent->color = Black; *\/ */ | |
612 | |
613 /* /\* goto meta(context, Delete3); *\/ */ | |
614 /* /\* } *\/ */ | |
615 | |
616 /* /\* goto meta(context, DeleteCase5); *\/ */ | |
617 /* /\* } *\/ */ | |
618 | |
619 /* /\* __code deleteCase4_stub(struct Context* context) { *\/ */ | |
620 /* /\* goto deleteCase4(context, context->data[Tree]->tree.current); *\/ */ | |
621 /* /\* } *\/ */ | |
622 | |
623 /* /\* __code deleteCase5(struct Context* context, struct Tree* tree, struct Node* current) { *\/ */ | |
624 /* /\* struct Node* sibling = current == current->parent->left ? current->parent->right : current->parent->left; *\/ */ | |
625 /* /\* sibling->parent = current->parent; *\/ */ | |
626 | |
627 /* /\* if (current == current->parent->left && *\/ */ | |
628 /* /\* (sibling == NULL ? Black : sibling->color) == Black && *\/ */ | |
629 /* /\* (sibling->left == NULL ? Black : sibling->left->color) == Red && *\/ */ | |
630 /* /\* (sibling->right == NULL ? Black : sibling->right->color) == Black) { *\/ */ | |
631 /* /\* sibling->color = Red; *\/ */ | |
632 /* /\* sibling->left->color = Black; *\/ */ | |
633 | |
634 /* /\* sibling == sibling->parent->left ? (sibling->parent->left = context->heap) : (sibling->parent->right = context->heap); *\/ */ | |
635 /* /\* allocator(context); *\/ */ | |
636 /* /\* struct Node* tmp = &context->data[context->dataNum]->node; *\/ */ | |
637 /* /\* *tmp = *sibling; *\/ */ | |
638 /* /\* tmp->parent = current; *\/ */ | |
639 | |
640 /* /\* tmp->left = context->heap; *\/ */ | |
641 /* /\* allocator(context); *\/ */ | |
642 /* /\* context->data[context->dataNum]->node = *sibling->left; *\/ */ | |
643 /* /\* context->data[context->dataNum]->node.parent = tmp; *\/ */ | |
644 | |
645 /* /\* tree->current = tmp; *\/ */ | |
646 | |
647 /* /\* context->next = DeleteCase6; *\/ */ | |
648 /* /\* stack_push(context->code_stack, &context->next); *\/ */ | |
649 | |
650 /* /\* goto meta(context, RotateR); *\/ */ | |
651 /* /\* } else if (current == current->parent->right && *\/ */ | |
652 /* /\* (sibling == NULL ? Black : sibling->color) == Black && *\/ */ | |
653 /* /\* (sibling->left == NULL ? Black : sibling->left->color) == Black && *\/ */ | |
654 /* /\* (sibling->right == NULL ? Black : sibling->right->color) == Red) { *\/ */ | |
655 /* /\* sibling->color = Red; *\/ */ | |
656 /* /\* sibling->right->color = Black; *\/ */ | |
657 | |
658 /* /\* sibling == sibling->parent->left ? (sibling->parent->left = context->heap) : (sibling->parent->right = context->heap); *\/ */ | |
659 /* /\* allocator(context); *\/ */ | |
660 /* /\* struct Node* tmp = &context->data[context->dataNum]->node; *\/ */ | |
661 /* /\* *tmp = *sibling; *\/ */ | |
662 /* /\* tmp->parent = current; *\/ */ | |
663 | |
664 /* /\* tmp->right = context->heap; *\/ */ | |
665 /* /\* allocator(context); *\/ */ | |
666 /* /\* context->data[context->dataNum]->node = *sibling->right; *\/ */ | |
667 /* /\* context->data[context->dataNum]->node.parent = tmp; *\/ */ | |
668 | |
669 /* /\* tree->current = tmp; *\/ */ | |
670 | |
671 /* /\* context->next = DeleteCase6; *\/ */ | |
672 /* /\* stack_push(context->code_stack, &context->next); *\/ */ | |
673 /* /\* goto meta(context, RotateL); *\/ */ | |
674 /* /\* } *\/ */ | |
675 | |
676 /* /\* goto meta(context, DeleteCase6); *\/ */ | |
677 /* /\* } *\/ */ | |
678 | |
679 /* /\* __code deleteCase5_stub(struct Context* context) { *\/ */ | |
680 /* /\* goto deleteCase5(context, &context->data[Tree]->tree, context->data[Tree]->tree.current); *\/ */ | |
681 /* /\* } *\/ */ | |
682 | |
683 /* /\* __code deleteCase6(struct Context* context, struct Tree* tree, struct Node* current) { *\/ */ | |
684 /* /\* struct Node* sibling = current == current->parent->left ? current->parent->right : current->parent->left; *\/ */ | |
685 | |
686 /* /\* sibling == sibling->parent->left ? (sibling->parent->left = context->heap) : (sibling->parent->right = context->heap); *\/ */ | |
687 /* /\* allocator(context); *\/ */ | |
688 /* /\* struct Node* tmp = &context->data[context->dataNum]->node; *\/ */ | |
689 /* /\* *tmp = *sibling; *\/ */ | |
690 /* /\* tmp->parent = current; *\/ */ | |
691 | |
692 /* /\* tmp->color = current->parent->color; *\/ */ | |
693 /* /\* current->parent->color = Black; *\/ */ | |
694 | |
695 /* /\* context->next = Delete3; *\/ */ | |
696 /* /\* stack_push(context->code_stack, &context->next); *\/ */ | |
697 | |
698 /* /\* if (current == current->parent->left) { *\/ */ | |
699 /* /\* tmp->right->color = Black; *\/ */ | |
700 /* /\* tree->current = current->parent; *\/ */ | |
701 | |
702 /* /\* goto meta(context, RotateL); *\/ */ | |
703 /* /\* } else { *\/ */ | |
704 /* /\* tmp->left->color = Black; *\/ */ | |
705 /* /\* tree->current = current->parent; *\/ */ | |
706 | |
707 /* /\* goto meta(context, RotateR); *\/ */ | |
708 /* /\* } *\/ */ | |
709 /* /\* } *\/ */ | |
710 | |
711 /* /\* __code deleteCase6_stub(struct Context* context) { *\/ */ | |
712 /* /\* goto deleteCase6(context, &context->data[Tree]->tree, context->data[Tree]->tree.current); *\/ */ | |
713 /* /\* } *\/ */ |