profanity/contact_list.c

/* 
 * contact_list.c
 *
 * Copyright (C) 2012 James Booth <boothj5@gmail.com>
 * 
 * This file is part of Profanity.
 *
 * Profanity 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 3 of the License, or
 * (at your option) any later version.
 *
 * Profanity 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 Profanity.  If not, see <http://www.gnu.org/licenses/>.
 *
 */

#include <stdlib.h>
#include <string.h>

#include "contact_list.h"

// contact list node
struct _contact_node_t {
    char *contact;    
    struct _contact_node_t *next;
};

// the contact list
static struct _contact_node_t *_contact_list = NULL;

static struct _contact_node_t * _make_contact_node(const char * const contact);

void contact_list_clear(void)
{
    struct _contact_node_t *curr = _contact_list;
    
    if (curr) {
        while(curr) {
            free(curr->contact);
            curr = curr->next;
        }

        free(_contact_list);
        _contact_list = NULL;
    }
}

int contact_list_remove(const char * const contact)
{
    if (!_contact_list) {
        return 0;
    } else {
        struct _contact_node_t *curr = _contact_list;
        struct _contact_node_t *prev = NULL;
        
        while(curr) {
            if (strcmp(curr->contact, contact) == 0) {
                if (prev)
                    prev->next = curr->next;
                else
                    _contact_list = curr->next;
                
                free(curr->contact);
                free(curr);

                return 1;
            }

            prev = curr;
            curr = curr->next;
        }

        return 0;
    }
}

int contact_list_add(const char * const contact)
{
    if (!_contact_list) {
        _contact_list = _make_contact_node(contact);
        
        return 1;
    } else {
        struct _contact_node_t *curr = _contact_list;
        struct _contact_node_t *prev = NULL;

        while(curr) {
            if (strcmp(curr->contact, contact) == 0)
                return 0;

            prev = curr;
            curr = curr->next;
        }

        curr = _make_contact_node(contact);        
        
        if (prev)
            prev->next = curr;

        return 1;
    }
}

contact_list_t *get_contact_list(void)
{
    int count = 0;
    
    contact_list_t *list = 
        (contact_list_t *) malloc(sizeof(contact_list_t));

    struct _contact_node_t *curr = _contact_list;
    
    if (!curr) {
        list->contacts = NULL;
    } else {
        list->contacts = (char **) malloc(sizeof(char **));

        while(curr) {
            list->contacts[count] = 
                (char *) malloc((strlen(curr->contact) + 1) * sizeof(char));
            strcpy(list->contacts[count], curr->contact);
            count++;
            curr = curr->next;
        }
    }

    list->size = count;

    return list;
}

struct _contact_node_t * _make_contact_node(const char * const contact)
{
    struct _contact_node_t *new = 
        (struct _contact_node_t *) malloc(sizeof(struct _contact_node_t));
    new->contact = (char *) malloc((strlen(contact) + 1) * sizeof(char));
    strcpy(new->contact, contact);
    new->next = NULL;

    return new;
}