Method config_binary_reduction

src/Reducer.cpp:1099–1144

}

void
Reducer::config_binary_reduction(string cmd)
{
	if (cmd.find(":") == string::npos) {
		// the reducer treats func_1 as main
		reduce_binaries = (cmd == "all");
	}
	else {
		size_t i;
		// for rollback, ignore this reduction if ends with a '-', keep vars as used_vars if ends with '+'
		char last = cmd[cmd.length()-1];
		if (last == '-') return;
		if (last == '+') {
			cmd = cmd.substr(0, cmd.length()-1);
		}
		vector<int> ints;
		StringUtils::split_int_string(cmd, ints, "[:]");
		assert(ints.size() >= 2);
		const Statement* stm = find_stm_by_id(ints[0]);
		assert(stm);
		ints.erase(ints.begin());
		// must be pairs of "<exp_id>:<choice>" where choice is 1 (select left) or 2 (select right)
		assert(ints.size() % 2 == 0);

		for (i = 0; i < ints.size(); i += 2) {
			// special case: reduce if (...) to if (1)
			if (ints[i] == 0) {
				assert(ints[i+1] == -1);
				assert(stm->eType == eIfElse);
				const FunctionInvocation* fi = stm->get_direct_invocation();
				assert(fi);
				map_reduced_invocations[fi] = new Constant(&fi->get_type(), "1");
				break;
			}
			const FunctionInvocation* fi = find_invoke_by_eid(stm, ints[i]);
			assert(fi && fi->invoke_type == eBinaryPrim);
			int choice = ints[i+1] - 1;
			assert(choice == 0 || choice == 1);
			const Expression* op = fi->param_value[choice];
			if (last == '+') {
				must_use_var_invocations.push_back(fi);
			}
			map_reduced_invocations[fi] = op;
		}
	}
}

void
Reducer::config_if_reduction(string cmd)