nis-util-netgroup/map.cc

Go to the documentation of this file.

//
// nis-util - NIS Administration Utilities
// Copyright (C) 2002, 2008, 2009, 2011, 2012 Peter Miller
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or (at
// your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
//

#include <algorithm>

#include <lib/output/file.h>
#include <lib/space/netgroup/slurp.h>

#include <nis-util-netgroup/map.h>


void
map_by_name(const rcstring &ifn, const rcstring &ofn)
{
    output::pointer ofp = output_file::create(ofn);
    space_netgroup::pointer ifp = space_netgroup::create(ifn);
    for (;;)
    {
        space_netgroup::record::pointer rp = ifp->get();
        if (!rp)
            break;
        ofp->put(rp->get_name());
        ofp->put(' ');
        ofp->put(rp->representation());
        ofp->put('\n');
    }
}


void
map_by_host(const rcstring &ifn, const rcstring &ofn)
{
    //
    // Read the input file.
    //
    space_netgroup_slurp::pointer ifp = space_netgroup_slurp::create(ifn);
    ifp->read_and_process();

    //
    // Open the output file.
    //
    output::pointer ofp = output_file::create(ofn);

    //
    // Spew out the inverted index.
    // (Because we use std::map, the keys are already sorted.
    // sorting is important for stable automated test results.)
    //
    space_netgroup_slurp::name_list_t keys = ifp->keys_by_host();
    // std::sort(keys.begin(), keys.end());
    for
    (
        space_netgroup_slurp::name_list_t::const_iterator kit = keys.begin();
        kit != keys.end();
        ++kit
    )
    {
        rcstring key = *kit;
        space_netgroup_slurp::name_list_t nlp = ifp->query_by_host(key);
        if (nlp.empty())
            continue;
        // std::sort(nlp->begin(), nlp->end());
        ofp->put(key);
        ofp->put(".* ");
        for
        (
            space_netgroup_slurp::name_list_t::const_iterator nit = nlp.begin();
            nit != nlp.end();
            ++nit
        )
        {
            if (nit != nlp.begin())
                ofp->put(',');
            ofp->put(*nit);
        }
        // FIXME: check NIS row size?
        ofp->put('\n');
    }
}


void
map_by_user(const rcstring &ifn, const rcstring &ofn)
{
    //
    // Read the input file.
    //
    space_netgroup_slurp::pointer ifp = space_netgroup_slurp::create(ifn);
    ifp->read_and_process();

    //
    // Open the output file.
    //
    output::pointer ofp = output_file::create(ofn);

    //
    // Spew out the inverted index.
    // (The sort is to give more stable results, for testing purposes,
    // but by using std::map no sort is required.)
    //
    space_netgroup_slurp::name_list_t keys = ifp->keys_by_user();
    // std::sort(keys.begin(), keys.end());
    for
    (
        space_netgroup_slurp::name_list_t::const_iterator kit = keys.begin();
        kit != keys.end();
        ++kit
    )
    {
        rcstring key = *kit;
        space_netgroup_slurp::name_list_t nlp = ifp->query_by_user(key);
        if (nlp.empty())
            continue;
        // std::sort(nlp.begin(), nlp.end());
        ofp->put(key);
        ofp->put(".* ");
        for
        (
            space_netgroup_slurp::name_list_t::const_iterator nit = nlp.begin();
            nit != nlp.end();
            ++nit
        )
        {
            if (nit != nlp.begin())
                ofp->put(',');
            ofp->put(*nit);
        }
        // FIXME: check NIS row size?
        ofp->put('\n');
    }
}


// vim: set ts=8 sw=4 et :