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
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
|
/*
* Copyright (c) 2000-2001
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. 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.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS 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 REGENTS 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.
*
*/
#include <ctype.h>
#include <math.h>
#include <signal.h>
#include <stdio.h>
#include <stdarg.h>
#include <string.h>
#include <unistd.h>
#include "buffer.h"
#include "util.h"
/* Panic with a message */
static void vfail(const char *fmt, va_list args) __attribute__((__noreturn__));
static void vfail(const char *fmt, va_list args)
{
vfprintf(stderr, fmt, args);
fflush(stdin);
fflush(stderr);
fflush(stdout);
sync();
fsync(STDIN_FILENO);
fsync(STDERR_FILENO);
fsync(STDOUT_FILENO);
abort();
while (1); /* Work around stupid gcc-2.96-85 bug */
}
/* Panic with a nice message */
void __fail(const char *file, unsigned int line,
const char *func __attribute__((unused)),
const char *fmt, ...)
{
va_list args;
va_start(args, fmt);
fprintf(stderr, "\n%s:%u ", file, line);
vfail(fmt, args);
}
#ifndef HAVE_VARIADIC_MACROS
/* Panic with a not-quite-as-nice message */
void fail(const char *fmt, ...)
{
va_list args;
va_start(args, fmt);
vfail(fmt, args);
}
#endif
void failure(const char *message)
{
fprintf(stderr,message);
exit(1);
}
/* Concatenate 2 strings, allocating space in r for the result */
char *rstrcat(region r, const char *s1, const char *s2)
{
char *result = rarrayalloc(r, strlen(s1)+strlen(s2)+1, char);
result[0] = '\0';
strcat(result, s1);
strcat(result, s2);
return result;
}
/* Concatenate n strings, allocating space in r for the result. The
last argument should be a null pointer. */
char *rstrscat(region r, ...)
{
char *result;
int len = 0;
const char *s;
va_list args;
va_start(args, r);
while ((s = va_arg(args, const char *)))
len += strlen(s);
result = rarrayalloc(r, len+1, char);
result[0] = '\0';
va_start(args, r);
while ((s = va_arg(args, const char *)))
strcat(result, s);
return result;
}
#if 0
/* Convert an integer to a string, storing the result in r */
const char *inttostr(region r, int i)
{
char *result;
int width;
if (i == 0)
width = 1;
else
width = (int) (floor(log10(abs((double) i))) + 1);
if (i<0) width++;
printf("i=%d, width=%d\n", i, width);
assert(width >0);
result = rarrayalloc(r, width + 1, char);
if (snprintf(result, width + 1, "%d", i) == -1) {
printf("i=%d, width=%d\n", i, width);
fail ("inttostr width wrong\n");
}
return result;
}
#endif
/* sprintf a string, allocating space in r for the result */
char *rsprintf(region r, const char *fmt, ...)
{
va_list args;
va_start(args, fmt);
return rvsprintf(r, fmt, args);
}
char *rvsprintf(region r, const char *fmt, va_list args)
{
growbuf buf = growbuf_new(r, 100);
gvprintf(buf, fmt, args);
return growbuf_contents(buf);
}
/* Space for the ASCII representation of a pointer -- 2 hex chars per
byte, plus 3 chars for 0x prefix and trailing \0 */
#define PTR_ASCII_SIZE ((int) (3 + sizeof(void *)*2))
/* Convert a pointer to an ascii string with leading 0x. Re-uses
internal buffer. */
char *ptr_to_ascii(void *ptr) {
static char addr[PTR_ASCII_SIZE];
int nchars;
nchars = snprintf(addr, PTR_ASCII_SIZE, "%p", ptr);
if (nchars == -1 || nchars >= PTR_ASCII_SIZE)
fail("Unable to convert ptr to ascii (need %d bytes, have %d)\n",
nchars, PTR_ASCII_SIZE);
return addr;
}
/* Convert a pointer to an integer */
long ptr_hash(void *ptr)
{
return (long) ptr;
}
/* Return TRUE iff ptr1 == ptr2 */
bool ptr_eq(void *ptr1, void *ptr2)
{
return ptr1 == ptr2;
}
/* Return TRUE iff s1 == s2 */
bool str_eq(const char *s1, const char *s2)
{
return (strcmp(s1, s2) == 0);
}
/* A total ordering on pointers. Returns 0 if ptr1 = ptr2, a value <0
if ptr1 < ptr2, or a value >0 if ptr1 > ptr2. */
int ptr_cmp(const void *ptr1, const void *ptr2)
{
return (char *) ptr1 - (char *) ptr2;
}
/* int abs(int a) { if (a < 0) return -a; else return a; } */
|
