200   float efficiency;  member
205   return e1.efficiency < e2.efficiency;  in lower_efficiency()
251       entry.efficiency = it->gflops / max_gflops;  in import_input_file_range_one_product_size()
306   float efficiency = 1.0f;  in efficiency_of_subset()  local
319 …iciency_this_entry = min(efficiency_this_entry, preprocessed_inputfiles[*i].entries[e].efficiency);  in efficiency_of_subset()
323       efficiency = min(efficiency, efficiency_this_product_size);  in efficiency_of_subset()
331   return efficiency;  in efficiency_of_subset()
370 …iciency_this_entry = min(efficiency_this_entry, preprocessed_inputfiles[*i].entries[e].efficiency);  in dump_table_for_subset()
404   float efficiency = 1.0f;  in efficiency_of_partition()  local
406     efficiency = min(efficiency, efficiency_of_subset(preprocessed_inputfiles, *s));  in efficiency_of_partition()
408   return efficiency;  in efficiency_of_partition()
482     cerr << "can't beat efficiency 1." << endl;  in find_subset_with_efficiency_higher_than()
572   float efficiency = efficiency_of_partition(preprocessed_inputfiles, partition);  in print_partition()  local
573 …artition into " << partition.size() << " subsets for " << efficiency * 100.0f << "% efficiency"  <…  in print_partition()
576 …      << ", efficiency " << efficiency_of_subset(preprocessed_inputfiles, *subset) * 100.0f << "%:"  in print_partition()
640            << " % efficiency"  in run()
790            << " % of product sizes have default efficiency <= "  in run()