cr_map.c

Go to the documentation of this file.

/*
 * $Id$
 *
 * Copyright (C) 2007-2008 1&1 Internet AG
 *
 * This file is part of SIP-router, a free SIP server.
 *
 * SIP-router 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
 *
 * SIP-router 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, write to the Free Software 
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 */

#include <stdlib.h>
#include "cr_map.h"
#include "../../mem/shm_mem.h"
#include "../../ut.h"



int map_name2id(struct name_map_t * map, int size, const str * name) {
        int i;

        if ((!name) || (name->len <= 0)) {
                return -1;
        }

        for (i=0; i<size; i++) {
                if (str_strcmp(&map[i].name, name) == 0) return map[i].id;
        }
        return -1;
}


str * map_id2name(struct name_map_t * map, int size, int id) {
        struct name_map_t key;
        struct name_map_t * tmp;

        key.id = id;
        tmp = bsearch(&key, map, size, sizeof(struct name_map_t), compare_name_map);
        if (tmp == NULL) return NULL;
        return &tmp->name;
}


int compare_name_map(const void *v1, const void *v2) {
        if (((struct name_map_t *)v1)->id < ((struct name_map_t *)v2)->id) return -1;
        else if (((struct name_map_t *)v1)->id > ((struct name_map_t *)v2)->id) return 1;
        else return 0;
}