proc_clean.cc File Reference

#include "kernel/register.h"
#include "kernel/log.h"
#include <stdlib.h>
#include <stdio.h>

Include dependency graph for proc_clean.cc:

Go to the source code of this file.

Data Structures
struct	ProcCleanPass

Functions
YOSYS_NAMESPACE_BEGIN void	proc_clean_case (RTLIL::CaseRule *cs, bool &did_something, int &count, int max_depth)
YOSYS_NAMESPACE_END USING_YOSYS_NAMESPACE PRIVATE_NAMESPACE_BEGIN void	proc_clean_switch (RTLIL::SwitchRule *sw, RTLIL::CaseRule *parent, bool &did_something, int &count, int max_depth)
YOSYS_NAMESPACE_END PRIVATE_NAMESPACE_BEGIN void	proc_clean (RTLIL::Module *mod, RTLIL::Process *proc, int &total_count)

Variables
ProcCleanPass	ProcCleanPass

Function Documentation

YOSYS_NAMESPACE_END PRIVATE_NAMESPACE_BEGIN void proc_clean	(	RTLIL::Module *	mod,
		RTLIL::Process *	proc,
		int &	total_count
	)

Definition at line 122 of file proc_clean.cc.

{
    int count = 0;
    bool did_something = true;
    for (size_t i = 0; i < proc->syncs.size(); i++) {
        for (size_t j = 0; j < proc->syncs[i]->actions.size(); j++)
            if (proc->syncs[i]->actions[j].first.size() == 0)
                proc->syncs[i]->actions.erase(proc->syncs[i]->actions.begin() + (j--));
        if (proc->syncs[i]->actions.size() == 0) {
            delete proc->syncs[i];
            proc->syncs.erase(proc->syncs.begin() + (i--));
        }
    }
    while (did_something) {
        did_something = false;
        proc_clean_case(&proc->root_case, did_something, count, -1);
    }
    if (count > 0)
        log("Found and cleaned up %d empty switch%s in `%s.%s'.\n", count, count == 1 ? "" : "es", mod->name.c_str(), proc->name.c_str());
    total_count += count;
}

Here is the call graph for this function:

Here is the caller graph for this function:

YOSYS_NAMESPACE_BEGIN void proc_clean_case	(	RTLIL::CaseRule *	cs,
		bool &	did_something,
		int &	count,
		int	max_depth
	)

Definition at line 99 of file proc_clean.cc.

{
    for (size_t i = 0; i < cs->actions.size(); i++) {
        if (cs->actions[i].first.size() == 0) {
            did_something = true;
            cs->actions.erase(cs->actions.begin() + (i--));
        }
    }
    for (size_t i = 0; i < cs->switches.size(); i++) {
        RTLIL::SwitchRule *sw = cs->switches[i];
        if (sw->cases.size() == 0) {
            cs->switches.erase(cs->switches.begin() + (i--));
            did_something = true;
            delete sw;
            count++;
        } else if (max_depth != 0)
            proc_clean_switch(sw, cs, did_something, count, max_depth-1);
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

YOSYS_NAMESPACE_END USING_YOSYS_NAMESPACE PRIVATE_NAMESPACE_BEGIN void proc_clean_switch	(	RTLIL::SwitchRule *	sw,
		RTLIL::CaseRule *	parent,
		bool &	did_something,
		int &	count,
		int	max_depth
	)

Definition at line 32 of file proc_clean.cc.

{
    if (sw->signal.size() > 0 && sw->signal.is_fully_const())
    {
        int found_matching_case_idx = -1;
        for (int i = 0; i < int(sw->cases.size()) && found_matching_case_idx < 0; i++)
        {
            RTLIL::CaseRule *cs = sw->cases[i];
            if (cs->compare.size() == 0)
                break;
            for (int j = 0; j < int(cs->compare.size()); j++) {
                RTLIL::SigSpec &val = cs->compare[j];
                if (!val.is_fully_const())
                    continue;
                if (val == sw->signal) {
                    cs->compare.clear();
                    found_matching_case_idx = i;
                    break;
                } else
                    cs->compare.erase(cs->compare.begin()+(j--));
            }
            if (cs->compare.size() == 0 && found_matching_case_idx < 0) {
                sw->cases.erase(sw->cases.begin()+(i--));
                delete cs;
            }
        }
        while (found_matching_case_idx >= 0 && int(sw->cases.size()) > found_matching_case_idx+1) {
            delete sw->cases.back();
            sw->cases.pop_back();
        }
        if (found_matching_case_idx == 0)
            sw->signal = RTLIL::SigSpec();
    }

    if (parent->switches.front() == sw && sw->cases.size() == 1 &&
            (sw->signal.size() == 0 || sw->cases[0]->compare.empty()))
    {
        did_something = true;
        for (auto &action : sw->cases[0]->actions)
            parent->actions.push_back(action);
        for (auto sw2 : sw->cases[0]->switches)
            parent->switches.push_back(sw2);
        sw->cases[0]->switches.clear();
        delete sw->cases[0];
        sw->cases.clear();
    }
    else
    {
        bool all_cases_are_empty = true;
        for (auto cs : sw->cases) {
            if (cs->actions.size() != 0 || cs->switches.size() != 0)
                all_cases_are_empty = false;
            if (max_depth != 0)
                proc_clean_case(cs, did_something, count, max_depth-1);
        }
        if (all_cases_are_empty) {
            did_something = true;
            for (auto cs : sw->cases)
                delete cs;
            sw->cases.clear();
        }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

Variable Documentation

ProcCleanPass ProcCleanPass