| 639 | } |
| 640 | |
| 641 | Expr MakeNestedList(int size) { |
| 642 | Expr e; |
| 643 | Expr* node = &e; |
| 644 | e.set_id(1); |
| 645 | for (int i = 0; i < size; ++i) { |
| 646 | node = &node->mutable_list_expr() |
| 647 | .mutable_elements() |
| 648 | .emplace_back() |
| 649 | .mutable_expr(); |
| 650 | node->set_id(i + 2); |
| 651 | } |
| 652 | return e; |
| 653 | } |
| 654 | |
| 655 | TEST(Expr, FlattenedErase256k) { |
| 656 | // Large expr to ensure we're not recursing. Would likely hit stack limits |