You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
219 lines
5.2 KiB
219 lines
5.2 KiB
/*
|
|
Copyright (c) 2004-2009 Jay Sorg
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a
|
|
copy of this software and associated documentation files (the "Software"),
|
|
to deal in the Software without restriction, including without limitation
|
|
the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
and/or sell copies of the Software, and to permit persons to whom the
|
|
Software is furnished to do so, subject to the following conditions:
|
|
|
|
The above copyright notice and this permission notice shall be included
|
|
in all copies or substantial portions of the Software.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
|
DEALINGS IN THE SOFTWARE.
|
|
|
|
simple list
|
|
*/
|
|
|
|
#include "arch.h"
|
|
#include "os_calls.h"
|
|
#include "list.h"
|
|
|
|
/*****************************************************************************/
|
|
struct list* APP_CC
|
|
list_create(void)
|
|
{
|
|
struct list* self;
|
|
|
|
self = (struct list*)g_malloc(sizeof(struct list), 1);
|
|
self->grow_by = 10;
|
|
self->alloc_size = 10;
|
|
self->items = (tbus*)g_malloc(sizeof(tbus) * 10, 1);
|
|
return self;
|
|
}
|
|
|
|
/*****************************************************************************/
|
|
void APP_CC
|
|
list_delete(struct list* self)
|
|
{
|
|
int i;
|
|
|
|
if (self == 0)
|
|
{
|
|
return;
|
|
}
|
|
if (self->auto_free)
|
|
{
|
|
for (i = 0; i < self->count; i++)
|
|
{
|
|
g_free((void*)self->items[i]);
|
|
self->items[i] = 0;
|
|
}
|
|
}
|
|
g_free(self->items);
|
|
g_free(self);
|
|
}
|
|
|
|
/*****************************************************************************/
|
|
void APP_CC
|
|
list_add_item(struct list* self, tbus item)
|
|
{
|
|
tbus* p;
|
|
int i;
|
|
|
|
if (self->count >= self->alloc_size)
|
|
{
|
|
i = self->alloc_size;
|
|
self->alloc_size += self->grow_by;
|
|
p = (tbus*)g_malloc(sizeof(tbus) * self->alloc_size, 1);
|
|
g_memcpy(p, self->items, sizeof(tbus) * i);
|
|
g_free(self->items);
|
|
self->items = p;
|
|
}
|
|
self->items[self->count] = item;
|
|
self->count++;
|
|
}
|
|
|
|
/*****************************************************************************/
|
|
tbus APP_CC
|
|
list_get_item(struct list* self, int index)
|
|
{
|
|
if (index < 0 || index >= self->count)
|
|
{
|
|
return 0;
|
|
}
|
|
return self->items[index];
|
|
}
|
|
|
|
/*****************************************************************************/
|
|
void APP_CC
|
|
list_clear(struct list* self)
|
|
{
|
|
int i;
|
|
|
|
if (self->auto_free)
|
|
{
|
|
for (i = 0; i < self->count; i++)
|
|
{
|
|
g_free((void*)self->items[i]);
|
|
self->items[i] = 0;
|
|
}
|
|
}
|
|
g_free(self->items);
|
|
self->count = 0;
|
|
self->grow_by = 10;
|
|
self->alloc_size = 10;
|
|
self->items = (tbus*)g_malloc(sizeof(tbus) * 10, 1);
|
|
}
|
|
|
|
/*****************************************************************************/
|
|
int APP_CC
|
|
list_index_of(struct list* self, tbus item)
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < self->count; i++)
|
|
{
|
|
if (self->items[i] == item)
|
|
{
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
/*****************************************************************************/
|
|
void APP_CC
|
|
list_remove_item(struct list* self, int index)
|
|
{
|
|
int i;
|
|
|
|
if (index >= 0 && index < self->count)
|
|
{
|
|
if (self->auto_free)
|
|
{
|
|
g_free((void*)self->items[index]);
|
|
self->items[index] = 0;
|
|
}
|
|
for (i = index; i < (self->count - 1); i++)
|
|
{
|
|
self->items[i] = self->items[i + 1];
|
|
}
|
|
self->count--;
|
|
}
|
|
}
|
|
|
|
/*****************************************************************************/
|
|
void APP_CC
|
|
list_insert_item(struct list* self, int index, tbus item)
|
|
{
|
|
tbus* p;
|
|
int i;
|
|
|
|
if (index == self->count)
|
|
{
|
|
list_add_item(self, item);
|
|
return;
|
|
}
|
|
if (index >= 0 && index < self->count)
|
|
{
|
|
self->count++;
|
|
if (self->count > self->alloc_size)
|
|
{
|
|
i = self->alloc_size;
|
|
self->alloc_size += self->grow_by;
|
|
p = (tbus*)g_malloc(sizeof(tbus) * self->alloc_size, 1);
|
|
g_memcpy(p, self->items, sizeof(tbus) * i);
|
|
g_free(self->items);
|
|
self->items = p;
|
|
}
|
|
for (i = (self->count - 2); i >= index; i--)
|
|
{
|
|
self->items[i + 1] = self->items[i];
|
|
}
|
|
self->items[index] = item;
|
|
}
|
|
}
|
|
|
|
/*****************************************************************************/
|
|
/* append one list to another using strdup for each item in the list */
|
|
/* begins copy at start_index, a zero based index on the soure list */
|
|
void APP_CC
|
|
list_append_list_strdup(struct list* self, struct list* dest, int start_index)
|
|
{
|
|
int index;
|
|
tbus item;
|
|
char* dup;
|
|
|
|
for (index = start_index; index < self->count; index++)
|
|
{
|
|
item = list_get_item(self, index);
|
|
dup = g_strdup((char*)item);
|
|
list_add_item(dest, (tbus)dup);
|
|
}
|
|
}
|
|
|
|
/*****************************************************************************/
|
|
void APP_CC
|
|
list_dump_items(struct list* self)
|
|
{
|
|
int index;
|
|
tbus item;
|
|
|
|
if (self->count == 0)
|
|
{
|
|
g_writeln("List is empty");
|
|
}
|
|
for (index = 0; index < self->count; index++)
|
|
{
|
|
g_writeln("%d: %s", index, list_get_item(self, index));
|
|
}
|
|
}
|