| … | |
… | |
| 464 | if (!spaces) |
464 | if (!spaces) |
| 465 | return false; |
465 | return false; |
| 466 | |
466 | |
| 467 | for (int i = 0; i < size (); ++i) |
467 | for (int i = 0; i < size (); ++i) |
| 468 | { |
468 | { |
| 469 | #if 0 // temporarily disabled for improved(?) stability, schmorp #TODO#d#//D |
|
|
| 470 | if (cede_count >= 500) |
469 | if (cede_count >= 500) |
| 471 | { |
470 | { |
| 472 | cede_count = 0; |
471 | cede_count = 0; |
| 473 | coroapi::cede (); |
472 | coroapi::cede (); |
| 474 | } |
473 | } |
| 475 | #endif |
|
|
| 476 | |
474 | |
| 477 | int unique = 0; |
475 | int unique = 0; |
| 478 | for (object *op = spaces [i].bot; op; op = op->above) |
476 | for (object *op = spaces [i].bot; op; op = op->above) |
| 479 | { |
477 | { |
| 480 | // count per-object, but cede only when modification-safe |
478 | // count per-object, but cede only when modification-safe |
| … | |
… | |
| 1081 | |
1079 | |
| 1082 | //object *middle = 0; |
1080 | //object *middle = 0; |
| 1083 | //object *top = 0; |
1081 | //object *top = 0; |
| 1084 | //object *floor = 0; |
1082 | //object *floor = 0; |
| 1085 | // this seems to generate better code than using locals, above |
1083 | // this seems to generate better code than using locals, above |
| 1086 | object *&top = faces_obj[0]; |
1084 | object *&top = faces_obj[0] = 0; |
| 1087 | object *&middle = faces_obj[1]; |
1085 | object *&middle = faces_obj[1] = 0; |
| 1088 | object *&floor = faces_obj[2]; |
1086 | object *&floor = faces_obj[2] = 0; |
| 1089 | |
1087 | |
| 1090 | for (tmp = bot; tmp; last = tmp, tmp = tmp->above) |
1088 | for (tmp = bot; tmp; last = tmp, tmp = tmp->above) |
| 1091 | { |
1089 | { |
| 1092 | /* This could be made additive I guess (two lights better than |
1090 | /* This could be made additive I guess (two lights better than |
| 1093 | * one). But if so, it shouldn't be a simple additive - 2 |
1091 | * one). But if so, it shouldn't be a simple additive - 2 |
