2012-03-08 18:45:21 -05:00
|
|
|
/*
|
|
|
|
* 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/>.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2012-03-07 19:46:24 -05:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
#include "contact_list.h"
|
|
|
|
|
2012-03-08 17:43:28 -05:00
|
|
|
// contact list node
|
2012-03-09 16:23:39 -05:00
|
|
|
struct _contact_node_t {
|
2012-03-09 18:07:53 -05:00
|
|
|
contact_t *contact;
|
2012-03-09 16:23:39 -05:00
|
|
|
struct _contact_node_t *next;
|
2012-03-07 19:46:24 -05:00
|
|
|
};
|
|
|
|
|
|
|
|
// the contact list
|
2012-03-09 16:23:39 -05:00
|
|
|
static struct _contact_node_t *_contact_list = NULL;
|
2012-03-07 19:46:24 -05:00
|
|
|
|
2012-03-09 18:07:53 -05:00
|
|
|
static struct _contact_node_t * _make_contact_node(const char * const name,
|
2012-03-09 19:22:57 -05:00
|
|
|
const char * const show, const char * const status);
|
|
|
|
static contact_t * _new_contact(const char * const name, const char * const show,
|
|
|
|
const char * const status);
|
2012-03-09 18:07:53 -05:00
|
|
|
static void _destroy_contact(contact_t *contact);
|
2012-03-08 17:43:28 -05:00
|
|
|
|
2012-03-07 19:46:24 -05:00
|
|
|
void contact_list_clear(void)
|
|
|
|
{
|
2012-03-09 16:23:39 -05:00
|
|
|
struct _contact_node_t *curr = _contact_list;
|
2012-03-08 17:43:28 -05:00
|
|
|
|
|
|
|
if (curr) {
|
|
|
|
while(curr) {
|
2012-03-09 18:07:53 -05:00
|
|
|
contact_t *contact = curr->contact;
|
|
|
|
_destroy_contact(contact);
|
2012-03-07 19:46:24 -05:00
|
|
|
curr = curr->next;
|
|
|
|
}
|
2012-03-08 17:43:28 -05:00
|
|
|
|
2012-03-07 19:46:24 -05:00
|
|
|
free(_contact_list);
|
2012-03-08 17:43:28 -05:00
|
|
|
_contact_list = NULL;
|
2012-03-07 19:46:24 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-03-09 18:07:53 -05:00
|
|
|
int contact_list_remove(const char * const name)
|
2012-03-07 19:46:24 -05:00
|
|
|
{
|
2012-03-08 18:03:26 -05:00
|
|
|
if (!_contact_list) {
|
|
|
|
return 0;
|
|
|
|
} else {
|
2012-03-09 16:23:39 -05:00
|
|
|
struct _contact_node_t *curr = _contact_list;
|
|
|
|
struct _contact_node_t *prev = NULL;
|
2012-03-08 18:03:26 -05:00
|
|
|
|
|
|
|
while(curr) {
|
2012-03-09 18:07:53 -05:00
|
|
|
contact_t *contact = curr->contact;
|
|
|
|
if (strcmp(contact->name, name) == 0) {
|
2012-03-08 18:03:26 -05:00
|
|
|
if (prev)
|
|
|
|
prev->next = curr->next;
|
|
|
|
else
|
|
|
|
_contact_list = curr->next;
|
2012-03-09 18:07:53 -05:00
|
|
|
|
|
|
|
_destroy_contact(contact);
|
2012-03-08 18:03:26 -05:00
|
|
|
free(curr);
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
prev = curr;
|
|
|
|
curr = curr->next;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
2012-03-08 17:43:28 -05:00
|
|
|
}
|
2012-03-07 19:46:24 -05:00
|
|
|
|
2012-03-09 19:22:57 -05:00
|
|
|
int contact_list_add(const char * const name, const char * const show,
|
|
|
|
const char * const status)
|
2012-03-08 17:43:28 -05:00
|
|
|
{
|
2012-03-09 18:07:53 -05:00
|
|
|
|
2012-03-08 17:43:28 -05:00
|
|
|
if (!_contact_list) {
|
2012-03-09 19:22:57 -05:00
|
|
|
_contact_list = _make_contact_node(name, show, status);
|
2012-03-08 17:43:28 -05:00
|
|
|
|
|
|
|
return 1;
|
2012-03-07 19:46:24 -05:00
|
|
|
} else {
|
2012-03-09 16:23:39 -05:00
|
|
|
struct _contact_node_t *curr = _contact_list;
|
|
|
|
struct _contact_node_t *prev = NULL;
|
2012-03-08 17:43:28 -05:00
|
|
|
|
|
|
|
while(curr) {
|
2012-03-09 18:07:53 -05:00
|
|
|
contact_t *curr_contact = curr->contact;
|
2012-03-09 18:33:26 -05:00
|
|
|
if (strcmp(curr_contact->name, name) == 0) {
|
2012-03-09 19:22:57 -05:00
|
|
|
_destroy_contact(curr->contact);
|
|
|
|
curr->contact = _new_contact(name, show, status);
|
2012-03-08 17:43:28 -05:00
|
|
|
return 0;
|
2012-03-09 18:33:26 -05:00
|
|
|
}
|
2012-03-07 19:46:24 -05:00
|
|
|
|
2012-03-08 17:43:28 -05:00
|
|
|
prev = curr;
|
|
|
|
curr = curr->next;
|
2012-03-07 19:46:24 -05:00
|
|
|
}
|
|
|
|
|
2012-03-09 19:22:57 -05:00
|
|
|
curr = _make_contact_node(name, show, status);
|
2012-03-08 17:43:28 -05:00
|
|
|
|
|
|
|
if (prev)
|
|
|
|
prev->next = curr;
|
2012-03-07 19:46:24 -05:00
|
|
|
|
2012-03-08 17:43:28 -05:00
|
|
|
return 1;
|
2012-03-07 19:46:24 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-03-09 16:23:39 -05:00
|
|
|
contact_list_t *get_contact_list(void)
|
2012-03-07 19:46:24 -05:00
|
|
|
{
|
2012-03-08 17:43:28 -05:00
|
|
|
int count = 0;
|
|
|
|
|
2012-03-09 16:23:39 -05:00
|
|
|
contact_list_t *list =
|
|
|
|
(contact_list_t *) malloc(sizeof(contact_list_t));
|
2012-03-07 19:46:24 -05:00
|
|
|
|
2012-03-09 16:23:39 -05:00
|
|
|
struct _contact_node_t *curr = _contact_list;
|
2012-03-08 17:43:28 -05:00
|
|
|
|
|
|
|
if (!curr) {
|
2012-03-07 19:46:24 -05:00
|
|
|
list->contacts = NULL;
|
|
|
|
} else {
|
2012-03-09 18:07:53 -05:00
|
|
|
list->contacts = (contact_t **) malloc(sizeof(contact_t *));
|
2012-03-08 17:43:28 -05:00
|
|
|
|
|
|
|
while(curr) {
|
2012-03-09 18:07:53 -05:00
|
|
|
contact_t *curr_contact = curr->contact;
|
2012-03-07 19:46:24 -05:00
|
|
|
list->contacts[count] =
|
2012-03-09 19:22:57 -05:00
|
|
|
_new_contact(curr_contact->name, curr_contact->show,
|
|
|
|
curr_contact->status);
|
2012-03-07 19:46:24 -05:00
|
|
|
count++;
|
2012-03-08 17:43:28 -05:00
|
|
|
curr = curr->next;
|
2012-03-07 19:46:24 -05:00
|
|
|
}
|
|
|
|
}
|
2012-03-08 17:43:28 -05:00
|
|
|
|
|
|
|
list->size = count;
|
|
|
|
|
|
|
|
return list;
|
2012-03-07 19:46:24 -05:00
|
|
|
}
|
2012-03-08 17:43:28 -05:00
|
|
|
|
2012-03-09 20:26:44 -05:00
|
|
|
static struct _contact_node_t * _make_contact_node(const char * const name,
|
2012-03-09 19:22:57 -05:00
|
|
|
const char * const show, const char * const status)
|
2012-03-08 17:43:28 -05:00
|
|
|
{
|
2012-03-09 16:23:39 -05:00
|
|
|
struct _contact_node_t *new =
|
|
|
|
(struct _contact_node_t *) malloc(sizeof(struct _contact_node_t));
|
2012-03-09 19:22:57 -05:00
|
|
|
new->contact = _new_contact(name, show, status);
|
2012-03-08 17:43:28 -05:00
|
|
|
new->next = NULL;
|
|
|
|
|
|
|
|
return new;
|
|
|
|
}
|
|
|
|
|
2012-03-09 19:22:57 -05:00
|
|
|
static contact_t * _new_contact(const char * const name, const char * const show,
|
|
|
|
const char * const status)
|
2012-03-09 18:07:53 -05:00
|
|
|
{
|
|
|
|
contact_t *new = (contact_t *) malloc(sizeof(contact_t));
|
|
|
|
new->name = (char *) malloc((strlen(name) + 1) * sizeof(char));
|
|
|
|
strcpy(new->name, name);
|
|
|
|
|
2012-03-09 19:22:57 -05:00
|
|
|
if (show == NULL || (strcmp(show, "") == 0)) {
|
|
|
|
new->show = (char *) malloc((strlen("online") + 1) * sizeof(char));
|
|
|
|
strcpy(new->show, "online");
|
|
|
|
} else {
|
2012-03-09 18:07:53 -05:00
|
|
|
new->show = (char *) malloc((strlen(show) + 1) * sizeof(char));
|
|
|
|
strcpy(new->show, show);
|
2012-03-09 19:22:57 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
if (status != NULL) {
|
|
|
|
new->status = (char *) malloc((strlen(status) + 1) * sizeof(char));
|
|
|
|
strcpy(new->status, status);
|
2012-03-09 18:07:53 -05:00
|
|
|
} else {
|
2012-03-09 19:22:57 -05:00
|
|
|
new->status = NULL;
|
2012-03-09 18:07:53 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
return new;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void _destroy_contact(contact_t *contact)
|
|
|
|
{
|
|
|
|
free(contact->name);
|
|
|
|
|
2012-03-09 19:22:57 -05:00
|
|
|
if (contact->show != NULL)
|
2012-03-09 18:07:53 -05:00
|
|
|
free(contact->show);
|
2012-03-09 19:22:57 -05:00
|
|
|
if (contact->status != NULL)
|
|
|
|
free(contact->status);
|
2012-03-09 18:07:53 -05:00
|
|
|
|
|
|
|
free(contact);
|
|
|
|
}
|
|
|
|
|