231   bb_sorted.create (0);  in sem_function()
238   bb_sorted.create (0);  in sem_function()
243   for (unsigned i = 0; i < bb_sorted.length (); i++)  in ~sem_function()
244     delete (bb_sorted[i]);  in ~sem_function()
247   bb_sorted.release ();  in ~sem_function()
277       for (unsigned i = 0; i < bb_sorted.length (); i++)  in get_hash()
278 	hstate.merge_hash (get_bb_hash (bb_sorted[i]));  in get_hash()
846   if (bb_sorted.length () != m_compared_func->bb_sorted.length ()  in equals_private()
877   for (unsigned i = 0; i < bb_sorted.length (); ++i)  in equals_private()
879       m_checker->parse_labels (bb_sorted[i]);  in equals_private()
880       m_checker->parse_labels (m_compared_func->bb_sorted[i]);  in equals_private()
884   for (unsigned i = 0; i < bb_sorted.length (); ++i)  in equals_private()
885     if(!m_checker->compare_bb (bb_sorted[i], m_compared_func->bb_sorted[i]))  in equals_private()
891   for (unsigned i = 0; i < bb_sorted.length (); ++i)  in equals_private()
893       bb1 = bb_sorted[i]->bb;  in equals_private()
894       bb2 = m_compared_func->bb_sorted[i]->bb;  in equals_private()
919   for (unsigned i = 0; i < bb_sorted.length (); i++)  in equals_private()
920     if (!compare_phi_node (bb_sorted[i]->bb, m_compared_func->bb_sorted[i]->bb))  in equals_private()
1404 	bb_sorted.safe_push (semantic_bb);  in init()