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
|
/*
* Calcurse - text-based organizer
*
* Copyright (c) 2004-2023 calcurse Development Team <misc@calcurse.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* - Redistributions of source code must retain the above
* copyright notice, this list of conditions and the
* following disclaimer.
*
* - Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the
* following disclaimer in the documentation and/or other
* materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
* Send your feedback or comments to : misc@calcurse.org
* Calcurse home page : http://calcurse.org
*
*/
#include <stdarg.h>
#include "calcurse.h"
#define STRING_INITIAL_BUFSIZE 128
void string_init(struct string *sb)
{
sb->buf = mem_malloc(STRING_INITIAL_BUFSIZE);
sb->bufsize = STRING_INITIAL_BUFSIZE;
sb->len = 0;
*sb->buf = '\0';
}
void string_reset(struct string *sb)
{
if (sb->buf)
mem_free(sb->buf);
string_init(sb);
}
int string_grow(struct string *sb, int minsize)
{
if (sb->bufsize >= minsize)
return 0;
while (sb->bufsize < minsize)
sb->bufsize *= 2;
sb->buf = mem_realloc(sb->buf, 1, sb->bufsize);
return 1;
}
char *string_buf(struct string *sb)
{
return sb->buf;
}
int string_vcatf(struct string *sb, const char *format, va_list ap)
{
va_list ap2;
int n;
va_copy(ap2, ap);
n = vsnprintf(sb->buf + sb->len, sb->bufsize - sb->len, format, ap);
if (string_grow(sb, sb->len + n + 1)) {
n = vsnprintf(sb->buf + sb->len, sb->bufsize - sb->len, format,
ap2);
}
sb->len += n;
return n;
}
int string_catf(struct string *sb, const char *format, ...)
{
va_list ap;
int n;
va_start(ap, format);
n = string_vcatf(sb, format, ap);
va_end(ap);
return n;
}
int string_printf(struct string *sb, const char *format, ...)
{
va_list ap;
int n;
va_start(ap, format);
string_reset(sb);
n = string_vcatf(sb, format, ap);
va_end(ap);
return n;
}
int string_catftime(struct string *sb, const char *format, const struct tm *tm)
{
int n = 0;
while (!n) {
string_grow(sb, sb->bufsize * 2);
n = strftime(sb->buf + sb->len, sb->bufsize - sb->len, format,
tm);
}
sb->len += n;
return n;
}
int string_strftime(struct string *sb, const char *format, const struct tm *tm)
{
string_reset(sb);
return string_catftime(sb, format, tm);
}
|
