@@ -621,31 +621,31 @@ create_moc_release_context(void* moc_in_context, Smoc* moc,
621621for (size_t k =1 ; k < depth; ++k)
622622{
623623rnode_iterz (moc_data, m.layout [k].level_end );
624- rnode_itern (moc_data, m.layout [k +1 ].level_end );
624+ rnode_iterb (moc_data, m.layout [k +1 ].level_end );
625625rnode_iter last_z;
626626rnode_iter z_end = rend;
627627for ( ; z != z_end; ++z)
628628{
629629if (z.page_ready ())
630630{
631- n .set (make_node (z.index (), (*z).start ));
632- last_rend =n ;
633- rend = ++n ;
631+ b .set (make_node (z.index (), (*z).start ));
632+ last_rend =b ;
633+ rend = ++b ;
634634}
635635last_z = z;
636636}
637637if (!last_z.page_ready ())
638638{
639- n .set (make_node (last_z.index (), (*last_z).start ));
640- last_rend =n ;
641- rend = ++n ;
639+ b .set (make_node (last_z.index (), (*last_z).start ));
640+ last_rend =b ;
641+ rend = ++b ;
642642}
643643}
644644
645645// The level-end section must be put relative to the actual beginning
646646// of the root node to prevent confusing redunancies.
647647int32 tree_begin = last_rend.index () - depth * MOC_INDEX_ALIGN;
648-
648+
649649// fill out level-end section
650650int32* level_ends = data_as<int32>(detoasted_offset (moc, tree_begin));
651651moc->depth = depth;
