annotate th_util.c @ 28:c47dcb8a4ffe

Change how ringbuffer actually works to be more sensible.
author Matti Hamalainen <ccr@tnsp.org>
date Sat, 11 Jun 2011 05:01:38 +0300
parents 4232dc54b818
children 06a72c643460
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
1 /*
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
2 * Generic utility-functions, macros and defaults
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
3 * Programmed and designed by Matti 'ccr' Hamalainen
16
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
4 * (C) Copyright 2002-2010 Tecnic Software productions (TNSP)
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
5 *
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
6 * Please read file 'COPYING' for information on license and distribution.
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
7 */
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
8 #ifdef HAVE_CONFIG_H
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
9 #include "config.h"
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
10 #endif
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
11 #include "th_util.h"
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
12 #include <stdio.h>
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
13
4
67f4a4233372 Move defaults to header file.
Matti Hamalainen <ccr@tnsp.org>
parents: 0
diff changeset
14 /* Default settings
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
15 */
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
16 static BOOL th_initialized = FALSE;
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
17 int th_verbosityLevel = 2;
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
18 char *th_prog_name = NULL,
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
19 *th_prog_fullname = NULL,
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
20 *th_prog_version = NULL,
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
21 *th_prog_author = NULL,
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
22 *th_prog_license = NULL;
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
23
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
24
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
25 /* Initialize th_util-library and global variables
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
26 */
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
27 void th_init(char *progName, char *progFullName, char *progVersion,
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
28 char *progAuthor, char *progLicense)
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
29 {
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
30 th_prog_name = progName;
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
31 th_prog_fullname = progFullName;
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
32 th_prog_version = progVersion;
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
33
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
34 if (progAuthor)
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
35 th_prog_author = progAuthor;
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
36 else
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
37 th_prog_author = TH_PROG_AUTHOR;
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
38
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
39 if (progLicense)
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
40 th_prog_license = progLicense;
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
41 else
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
42 th_prog_license = TH_PROG_LICENSE;
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
43
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
44 th_initialized = TRUE;
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
45 }
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
46
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
47
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
48 /* Print formatted error, warning and information messages
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
49 * TODO: Implement th_vfprintf() and friends?
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
50 */
11
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
51 void THERR_V(const char *fmt, va_list ap)
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
52 {
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
53 assert(th_initialized == TRUE);
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
54
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
55 fprintf(stderr, "%s: ", th_prog_name);
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
56 vfprintf(stderr, fmt, ap);
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
57 }
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
58
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
59
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
60 void THMSG_V(int level, const char *fmt, va_list ap)
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
61 {
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
62 assert(th_initialized == TRUE);
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
63
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
64 if (th_verbosityLevel >= level) {
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
65 fprintf(stderr, "%s: ", th_prog_name);
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
66 vfprintf(stderr, fmt, ap);
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
67 }
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
68 }
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
69
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
70
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
71 void THPRINT_V(int level, const char *fmt, va_list ap)
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
72 {
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
73 assert(th_initialized == TRUE);
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
74
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
75 if (th_verbosityLevel >= level) {
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
76 vfprintf(stderr, fmt, ap);
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
77 }
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
78 }
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
79
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
80
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
81 void THERR(const char *fmt, ...)
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
82 {
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
83 va_list ap;
11
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
84 assert(th_initialized == TRUE);
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
85
11
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
86 va_start(ap, fmt);
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
87 THERR_V(fmt, ap);
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
88 va_end(ap);
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
89 }
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
90
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
91
11
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
92 void THMSG(int level, const char *fmt, ...)
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
93 {
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
94 va_list ap;
11
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
95 assert(th_initialized == TRUE);
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
96
11
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
97 va_start(ap, fmt);
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
98 THMSG_V(level, fmt, ap);
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
99 va_end(ap);
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
100 }
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
101
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
102
11
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
103 void THPRINT(int level, const char *fmt, ...)
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
104 {
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
105 va_list ap;
11
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
106 assert(th_initialized == TRUE);
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
107
11
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
108 va_start(ap, fmt);
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
109 THPRINT_V(level, fmt, ap);
e467b3586e4d Cleanups.
Matti Hamalainen <ccr@tnsp.org>
parents: 10
diff changeset
110 va_end(ap);
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
111 }
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
112
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
113
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
114 /* Memory handling routines
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
115 */
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
116 void *th_malloc(size_t l)
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
117 {
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
118 return malloc(l);
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
119 }
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
120
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
121
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
122 void *th_calloc(size_t n, size_t l)
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
123 {
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
124 return calloc(n, l);
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
125 }
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
126
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
127
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
128 void *th_realloc(void *p, size_t l)
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
129 {
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
130 return realloc(p, l);
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
131 }
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
132
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
133
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
134 void th_free(void *p)
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
135 {
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
136 /* Check for NULL pointers for portability due to some libc
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
137 * implementations not handling free(NULL) too well.
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
138 */
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
139 if (p) free(p);
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
140 }
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
141
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
142
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
143 #ifndef HAVE_MEMSET
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
144 void *th_memset(void *p, int c, size_t n)
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
145 {
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
146 unsigned char *dp = (unsigned char *) p;
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
147
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
148 while (n--)
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
149 *(dp++) = c;
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
150
10
a25f5d22483e Updates.
Matti Hamalainen <ccr@tnsp.org>
parents: 7
diff changeset
151 return p;
0
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
152 }
bd61a80a6c54 Initial import into Mercurial repository. Discarding old cvs/svn history
Matti Hamalainen <ccr@tnsp.org>
parents:
diff changeset
153 #endif
16
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
154
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
155
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
156 /* Doubly linked list handling
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
157 *
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
158 * In this implementation first node's prev points to last node of the list,
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
159 * and last node's next is NULL. This way we can semi-efficiently traverse to
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
160 * beginning and end of the list, assuming user does not do weird things.
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
161 */
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
162 qlist_t * th_llist_new(void *data)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
163 {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
164 qlist_t *res = th_calloc(sizeof(qlist_t), 1);
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
165 res->data = data;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
166 return res;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
167 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
168
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
169 void th_llist_free_func(qlist_t *list, void (*freefunc)(void *data))
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
170 {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
171 qlist_t *curr = list;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
172
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
173 while (curr != NULL) {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
174 qlist_t *next = curr->next;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
175 if (freefunc != NULL && curr->data != NULL)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
176 freefunc(curr->data);
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
177 th_free(curr);
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
178 curr = next;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
179 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
180 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
181
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
182
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
183 void th_llist_free(qlist_t *list)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
184 {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
185 th_llist_free_func(list, NULL);
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
186 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
187
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
188 void th_llist_append_node(qlist_t **list, qlist_t *node)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
189 {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
190 if (*list != NULL) {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
191 node->prev = (*list)->prev;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
192 (*list)->prev->next = node;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
193 (*list)->prev = node;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
194 (*list)->num++;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
195 } else {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
196 *list = node;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
197 node->prev = *list;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
198 (*list)->num = 1;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
199 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
200
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
201 node->next = NULL;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
202 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
203
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
204
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
205 qlist_t *th_llist_append(qlist_t **list, void *data)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
206 {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
207 qlist_t *node = th_llist_new(data);
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
208
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
209 th_llist_append_node(list, node);
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
210
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
211 return node;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
212 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
213
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
214
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
215 void th_llist_prepend_node(qlist_t **list, qlist_t *node)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
216 {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
217 if (*list != NULL) {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
218 node->prev = (*list)->prev;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
219 node->next = *list;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
220 (*list)->prev = node;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
221 node->num = (*list)->num + 1;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
222 *list = node;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
223 } else {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
224 *list = node->prev = node;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
225 node->next = NULL;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
226 (*list)->num = 1;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
227 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
228
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
229 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
230
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
231
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
232 qlist_t *th_llist_prepend(qlist_t **list, void *data)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
233 {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
234 qlist_t *node = th_llist_new(data);
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
235
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
236 th_llist_prepend_node(list, node);
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
237
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
238 return node;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
239 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
240
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
241 /*
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
242 1) Remove a middle node
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
243
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
244 node0->prev->next = node->next (node1)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
245 node0->next->prev = node->prev (list)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
246
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
247 node2 <- list <=> node0 <=> node1 <=> node2 -> NULL
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
248 node2 <- list <=> node1 <=> node2 -> NULL
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
249
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
250 2) Remove first node when many items
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
251
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
252
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
253 node2 <- list <=> node0 <=> node1 <=> node2 -> NULL
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
254 node2 <- node0 <=> node1 <=> node2 -> NULL
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
255
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
256 *list = node0
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
257
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
258 3) Remove last node in list
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
259
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
260 if (node->next == NULL) {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
261 list->prev = node->prev;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
262 node->prev->next = NULL;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
263 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
264
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
265 node2 <- list <=> node0 <=> node1 <=> node2 -> NULL
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
266 node1 <- list <=> node0 <=> node1 -> NULL
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
267
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
268 4) Remove last
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
269
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
270 list <- list -> NULL
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
271
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
272
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
273 */
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
274 static void th_llist_delete_node_fast(qlist_t **list, qlist_t *node)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
275 {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
276 if (node == *list) {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
277 /* First node in list */
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
278 qlist_t *tmp = (*list)->next;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
279 if (tmp != NULL) {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
280 tmp->num = (*list)->num - 1;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
281 tmp->prev = (*list)->prev;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
282 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
283 *list = tmp;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
284 } else {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
285 /* Somewhere in middle or end */
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
286 if (node->prev != NULL)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
287 node->prev->next = node->next;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
288
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
289 if (node->next != NULL)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
290 node->next->prev = node->prev;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
291 else
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
292 (*list)->prev = node; /* Last node */
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
293
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
294 (*list)->num--;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
295 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
296
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
297 node->next = node->prev = NULL;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
298 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
299
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
300
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
301 void th_llist_delete_node(qlist_t **list, qlist_t *node)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
302 {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
303 qlist_t *curr = *list;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
304
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
305 while (curr != NULL) {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
306 qlist_t *next = curr->next;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
307 if (curr == node) {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
308 th_llist_delete_node_fast(list, curr);
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
309 th_free(node);
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
310 break;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
311 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
312 curr = next;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
313 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
314 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
315
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
316
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
317 void th_llist_delete(qlist_t **list, const void *data)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
318 {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
319 qlist_t *curr = *list;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
320
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
321 while (curr != NULL) {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
322 qlist_t *next = curr->next;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
323 if (curr->data == data) {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
324 th_llist_delete_node_fast(list, curr);
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
325 th_free(curr);
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
326 break;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
327 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
328 curr = next;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
329 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
330 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
331
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
332
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
333 qlist_t * th_llist_get_nth(qlist_t *list, const size_t n)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
334 {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
335 qlist_t *curr = list;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
336 size_t i;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
337
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
338 for (i = 0; curr != NULL && i < n; curr = curr->next, i++);
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
339
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
340 return curr;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
341 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
342
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
343
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
344 size_t th_llist_length(const qlist_t *list)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
345 {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
346 if (list == NULL)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
347 return 0;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
348 else
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
349 return list->num;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
350 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
351
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
352
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
353 ssize_t th_llist_position(const qlist_t *list, const qlist_t *node)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
354 {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
355 const qlist_t *curr = list;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
356 ssize_t i = 0;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
357
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
358 while (curr != NULL) {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
359 if (curr == node)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
360 return i;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
361 else
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
362 i++;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
363
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
364 curr = curr->next;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
365 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
366
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
367 return -1;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
368 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
369
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
370
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
371 qlist_t * th_llist_find(qlist_t *list, const void *data)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
372 {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
373 qlist_t *curr = list;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
374
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
375 while (curr != NULL) {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
376 if (curr->data == data)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
377 return curr;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
378 curr = curr->next;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
379 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
380
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
381 return NULL;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
382 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
383
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
384
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
385 qlist_t * th_llist_find_func(qlist_t *list, const void *userdata, int (compare)(const void *, const void *))
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
386 {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
387 qlist_t *curr = list;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
388
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
389 while (curr != NULL) {
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
390 if (compare(curr->data, userdata) == 0)
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
391 return curr;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
392 curr = curr->next;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
393 }
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
394
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
395 return NULL;
Matti Hamalainen <ccr@tnsp.org>
parents: 11
diff changeset
396 }
23
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
397
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
398
26
04187ae0b3b6 Comment.
Matti Hamalainen <ccr@tnsp.org>
parents: 25
diff changeset
399 /*
04187ae0b3b6 Comment.
Matti Hamalainen <ccr@tnsp.org>
parents: 25
diff changeset
400 * Ringbuffers
04187ae0b3b6 Comment.
Matti Hamalainen <ccr@tnsp.org>
parents: 25
diff changeset
401 */
23
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
402 qringbuf_t * th_ringbuf_new(const size_t size, void (*mdeallocator)(void *data))
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
403 {
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
404 qringbuf_t *res = th_calloc(1, sizeof(qringbuf_t));
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
405
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
406 res->data = (void **) th_malloc(size * sizeof(void *));
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
407 res->size = size;
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
408 res->n = 0;
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
409 res->deallocator = mdeallocator;
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
410
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
411 return res;
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
412 }
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
413
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
414
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
415 BOOL th_ringbuf_grow(qringbuf_t *buf, const size_t n)
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
416 {
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
417 buf->size += n;
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
418 buf->data = (void **) th_realloc(buf->data, buf->size * sizeof(void *));
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
419 return (buf->data != NULL);
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
420 }
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
421
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
422
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
423 void th_ringbuf_free(qringbuf_t *buf)
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
424 {
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
425 int i;
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
426
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
427 for (i = 0; i < buf->n; i++)
25
2f7270a9d593 Make ringbuffer deallocator function call only happen if data pointer is != NULL
Matti Hamalainen <ccr@tnsp.org>
parents: 23
diff changeset
428 if (buf->data[i] != NULL)
2f7270a9d593 Make ringbuffer deallocator function call only happen if data pointer is != NULL
Matti Hamalainen <ccr@tnsp.org>
parents: 23
diff changeset
429 buf->deallocator(buf->data[i]);
23
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
430
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
431 th_free(buf->data);
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
432 th_free(buf);
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
433 }
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
434
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
435
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
436 void th_ringbuf_add(qringbuf_t *buf, void *ptr)
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
437 {
28
c47dcb8a4ffe Change how ringbuffer actually works to be more sensible.
Matti Hamalainen <ccr@tnsp.org>
parents: 27
diff changeset
438 if (buf->n < buf->size)
23
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
439 buf->n++;
28
c47dcb8a4ffe Change how ringbuffer actually works to be more sensible.
Matti Hamalainen <ccr@tnsp.org>
parents: 27
diff changeset
440
c47dcb8a4ffe Change how ringbuffer actually works to be more sensible.
Matti Hamalainen <ccr@tnsp.org>
parents: 27
diff changeset
441 th_free(buf->data[0]);
c47dcb8a4ffe Change how ringbuffer actually works to be more sensible.
Matti Hamalainen <ccr@tnsp.org>
parents: 27
diff changeset
442 memmove(&(buf->data[0]), &(buf->data[1]), (buf->size - 1) * sizeof(void *));
c47dcb8a4ffe Change how ringbuffer actually works to be more sensible.
Matti Hamalainen <ccr@tnsp.org>
parents: 27
diff changeset
443 buf->data[buf->size - 1] = ptr;
23
a4f894105953 Add ringbuffer implementation.
Matti Hamalainen <ccr@tnsp.org>
parents: 16
diff changeset
444 }