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
|
/*
This file is part of LilyPond, the GNU music typesetter.
Copyright (C) 1997--2011 Han-Wen Nienhuys <hanwen@xs4all.nl>
Jan Nieuwenhuizen <janneke@gnu.org>
LilyPond 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 3 of the License, or
(at your option) any later version.
LilyPond 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 LilyPond. If not, see <http://www.gnu.org/licenses/>.
*/
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <cassert>
using namespace std;
#include "libc-extension.hh"
char *
strnlwr (char *start, int n)
{
char *p = start + n;
while (--p >= start)
{
*p = (char)tolower (*p); /* a macro on some compilers */
}
return start;
}
char *
strnupr (char *start, int n)
{
char *p = start + n;
while (--p >= start)
{
*p = (char)toupper (*p); /* a macro on some compilers */
}
return start;
}
#if !HAVE_MEMMEM
/** locate a substring. #memmem# finds the first occurrence of
#needle# in #haystack#. This is not ANSI-C.
The prototype is not in accordance with the Linux Programmer's
Manual v1.15, but it is with /usr/include/string.h */
unsigned char *
_memmem (unsigned char const *haystack, int haystack_len,
unsigned char const *needle, int needle_len)
{
unsigned char const *end_haystack = haystack + haystack_len - needle_len + 1;
unsigned char const *end_needle = needle + needle_len;
/* Ahhh ... Some minimal lowlevel stuff. This *is* nice; Varation
is the spice of life */
while (haystack < end_haystack)
{
unsigned char const *subneedle = needle;
unsigned char const *subhaystack = haystack;
while (subneedle < end_needle)
if (*subneedle++ != *subhaystack++)
goto next;
/* Completed the needle. Gotcha. */
return (unsigned char *) haystack;
next:
haystack++;
}
return 0;
}
void *
memmem (void const *haystack, int haystack_len,
void const *needle, int needle_len)
{
unsigned char const *haystack_byte_c = (unsigned char const *)haystack;
unsigned char const *needle_byte_c = (unsigned char const *)needle;
return _memmem (haystack_byte_c, haystack_len, needle_byte_c, needle_len);
}
#endif
unsigned char *
memrchr (unsigned char const *p, int n, char c)
{
const unsigned char *q = p + n;
while (q > p)
{
if (*--q == c)
return (unsigned char *)q;
}
return 0;
}
template<class T>
inline void
my_swap (T &t1, T &t2, T &tmp)
{
tmp = t1;
t1 = t2;
t2 = tmp;
}
unsigned char *
memrev (unsigned char *byte, int length)
{
unsigned char tmp_byte;
unsigned char *left = byte;
unsigned char *right = byte + length;
while (right > left)
my_swap (*right--, *left++, tmp_byte);
return byte;
}
/*
There are some strange problems with round() on early glibcs.
*/
double
my_round (double x)
{
return floor (x -0.5)+ 1.0;
}
/* namespace std { */
#ifndef isinf
#if !HAVE_ISINF
int
isinf (double x)
{
return x && (x == x/ 2);
}
#endif
#endif
#if ! HAVE_SNPRINTF
int
snprintf (char *str, size_t n, char const *format, ...)
{
va_list ap;
va_start (ap, format);
int i = vsprintf (str, format, ap);
if (i > 0 && (unsigned) i > n)
assert (false);
va_end (ap);
return i;
}
#endif
#if ! HAVE_VSNPRINTF
int
vsnprintf (char *str, size_t n, char const *format, va_list args)
{
int i = vsprintf (str, format, args);
if (i > 0 && (unsigned) i > n)
assert (false);
return i;
}
#endif
/* } namespace std */
|
