summaryrefslogtreecommitdiffstats
path: root/clib/src/list_iter.c
blob: fb1b81e9d12b8020b10c5bea5843ddec299efdad (plain)
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
/*
 * Copyright (c) International Business Machines Corp., 2014
 *
 * This program 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.
 *
 * This program 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
 */

/*
 *   File: list_iter.c
 * Author: Shaun Wetzstein <shaun@us.ibm.com>
 *  Descr: List iterator
 *   Note:
 *   Date: 10/22/10
 */

#include <unistd.h>
#include <stdarg.h>
#include <stdlib.h>
#include <malloc.h>
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include <errno.h>
#include <limits.h>

#include "libclib.h"
#include "list_iter.h"

/* ======================================================================= */

static inline list_node_t *__list_iter_bwd(list_iter_t * self)
{
	assert(self != NULL);

	assert(self->list != NULL);
	assert(self->node != NULL);

	if (self->node == &self->list->node)
		self->node = NULL;
	else
		self->node = list_node_prev(self->node);

	return self->node;
}

static inline list_node_t *__list_iter_fwd(list_iter_t * self)
{
	assert(self != NULL);
	assert(self->list != NULL);
	assert(self->node != NULL);

	if (self->node == &self->list->node)
		self->node = NULL;
	else
		self->node = list_node_next(self->node);

	return self->node;
}

void list_iter_init(list_iter_t * self, list_t * list, uint32_t flags)
{
	assert(self != NULL);
	assert(list != NULL);

	self->flags = flags;
	self->list = list;

	if (self->flags & LI_FLAG_BWD)
		self->node = list_tail(self->list);
	else
		self->node = list_head(self->list);
}

void list_iter_clear(list_iter_t * self)
{
	assert(self != NULL);

	if (self->flags & LI_FLAG_BWD)
		self->node = list_tail(self->list);
	else
		self->node = list_head(self->list);
}

list_node_t *list_iter_elem(list_iter_t * self)
{
	assert(self != NULL);
	return self->node;
}

list_node_t *list_iter_inc1(list_iter_t * self)
{
	return list_iter_inc2(self, 1);
}

list_node_t *list_iter_inc2(list_iter_t * self, size_t count)
{
	assert(self != NULL);

	for (size_t i = 0; i < count && self->node != NULL; i++) {
		if (self->flags & LI_FLAG_BWD)
			__list_iter_bwd(self);
		else
			__list_iter_fwd(self);
	}

	return self->node;
}

list_node_t *list_iter_dec1(list_iter_t * self)
{
	return list_iter_dec2(self, 1);
}

list_node_t *list_iter_dec2(list_iter_t * self, size_t count)
{
	assert(self != NULL);

	for (size_t i = 0; i < count && self->node != NULL; i++) {
		if (self->flags & LI_FLAG_BWD)
			__list_iter_fwd(self);
		else
			__list_iter_bwd(self);
	}

	return self->node;
}

/* ======================================================================= */
OpenPOWER on IntegriCloud