Download c source code

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
#include <assert.h>
#include <stdlib.h>
#include <pthread.h>

#include "array.h"


typedef struct array
{
	void** elements;
	size_t capacity;
	size_t count;
	pthread_mutex_t mutex;
} array_t;

// Private declarations
size_t array_find_first_private(array_t* array, const void* element, size_t start_pos);


array_t* array_create(size_t capacity)
{
	assert(capacity);
	
	array_t* array = calloc(1, sizeof(array_t));
	if ( array == NULL )
		return NULL;

	array->capacity = capacity;
	array->count = 0;

	pthread_mutex_init( &array->mutex, NULL );

	array->elements = (void**)malloc( capacity * sizeof(void*) );
	if ( array->elements == NULL )
		return (void)free(array), NULL;
	
	return array;
}

void array_destroy(array_t* array)
{
	assert(array);

	pthread_mutex_destroy(&array->mutex);

	free(array->elements);
	free(array);
}

int array_increase_capacity(array_t* array)
{
	assert(array);

	size_t new_capacity = 10 * array->capacity;
	void** new_elements = (void**)realloc( array->elements, new_capacity * sizeof(void*) );
	if ( new_elements == NULL )
		return -1;

	array->capacity = new_capacity;
	array->elements = new_elements;

	return 0; // Success
}

int array_decrease_capacity(array_t* array)
{
	assert(array);

	size_t new_capacity = array->capacity / 10;
	if ( new_capacity < 10 )
		return 0;

	void** new_elements = (void**)realloc( array->elements, new_capacity * sizeof(void*) );
	if ( new_elements == NULL )
		return -1;

	array->capacity = new_capacity;
	array->elements = new_elements;

	return 0; // Success
}

size_t array_get_count(array_t* array)
{
	assert(array);

	pthread_mutex_lock( &array->mutex );
	size_t result = array->count;
	pthread_mutex_unlock( &array->mutex );
	return result;
}

void* array_get_element(array_t* array, size_t index)
{
	assert(array);
	assert( index < array_get_count(array) );

	pthread_mutex_lock( &array->mutex );
	void* result = array->elements[index];
	pthread_mutex_unlock( &array->mutex );
	return result;
}

int array_append(array_t* array, void* element)
{
	assert(array);

	pthread_mutex_lock( &array->mutex );
	if ( array->count == array->capacity )
		if ( array_increase_capacity(array) )
			return (void)pthread_mutex_unlock( &array->mutex ), -1;

	assert( array->count < array->capacity );
	array->elements[array->count++] = element;
	pthread_mutex_unlock( &array->mutex );
	return 0; // Success
}

size_t array_find_first(array_t* array, const void* element, size_t start_pos)
{
	assert( array );
	
	pthread_mutex_lock( &array->mutex );
	size_t result = array_find_first_private(array, element, start_pos);
	pthread_mutex_unlock( &array->mutex );
	return result;
}

size_t array_find_first_private(array_t* array, const void* element, size_t start_pos)
{
	assert( array );

	for ( size_t index = start_pos; index < array->count; ++index )
		if ( array->elements[index] == element )
			return index;

	return array_not_found;
}

int array_remove_first(array_t* array, const void* element, size_t start_pos)
{
	assert( array );

	pthread_mutex_lock( &array->mutex );
	size_t index = array_find_first_private(array, element, start_pos);
	if ( index == array_not_found )
		return (void)pthread_mutex_unlock( &array->mutex ), -1;

	for ( --array->count; index < array->count; ++index )
		array->elements[index] = array->elements[index + 1];
	if ( array->count == array->capacity / 10 )
		array_decrease_capacity(array);

	pthread_mutex_unlock( &array->mutex );
	return 0; // Removed
}