*** empty log message ***
[lilypond.git] / flower / libc-extension.cc
blobf584bb4c879e4f7d52a1b20fd6510d44d9bff76c
1 /*
2 libc-extension.cc -- compensate for lacking libc functions.
5 source file of the flowerlib
7 (c) 1997--2000 Han-Wen Nienhuys <hanwen@cs.uu.nl>
8 Jan Nieuwenhuizen <janneke@gnu.org>
9 */
11 #include <stdio.h>
12 #include <string.h>
13 #include <ctype.h>
14 #include "libc-extension.hh"
17 urg: why soo wierd?
19 char*
20 strnlwr (char* start ,int n)
22 char * p = start + n;
23 while (--p >= start)
25 *p = tolower (*p); /* a macro on some compilers */
27 return start;
30 char*
31 strnupr (char* start, int n)
33 char * p = start + n;
34 while (--p >= start)
36 *p = toupper (*p); /* a macro on some compilers */
38 return start;
42 #if !HAVE_MEMMEM
44 /** locate a substring. #memmem# finds the first occurrence of
45 #needle# in #haystack#. This is not ANSI-C.
47 The prototype is not in accordance with the Linux Programmer's
48 Manual v1.15, but it is with /usr/include/string.h */
50 Byte *
51 _memmem (Byte const *haystack, int haystack_len,
52 Byte const *needle,int needle_len)
54 Byte const * end_haystack = haystack + haystack_len - needle_len + 1;
55 Byte const * end_needle = needle + needle_len ;
57 /* Ahhh ... Some minimal lowlevel stuff. This *is* nice; Varation
58 is the spice of life */
59 while (haystack < end_haystack)
61 Byte const *subneedle = needle;
62 Byte const *subhaystack = haystack;
63 while (subneedle < end_needle)
64 if (*subneedle++ != *subhaystack++)
65 goto next;
67 // completed the needle. Gotcha.
68 return (Byte *) haystack;
69 next:
70 haystack++;
72 return 0;
75 void *
76 memmem (void const *haystack, int haystack_len,
77 void const *needle,int needle_len)
79 Byte const* haystack_byte_c = (Byte const*)haystack;
80 Byte const* needle_byte_c = (Byte const*)needle;
81 return _memmem (haystack_byte_c, haystack_len, needle_byte_c, needle_len);
84 #endif
86 Byte *
87 memrchr (Byte const * p, int n, char c)
89 const Byte * q = p+n;
90 while (q > p)
92 if (*--q == c)
93 return (Byte*)q;
95 return 0;
99 template<class T>
100 inline void
101 my_swap (T &t1, T &t2, T &tmp)
103 tmp = t1;
104 t1 = t2;
105 t2 = tmp;
108 Byte*
109 strrev (Byte* byte, int length_i)
111 Byte tmp_byte;
113 Byte* left = byte;
114 Byte* right = byte + length_i;
116 while (right > left)
118 my_swap (*right-- , *left++ , tmp_byte);
120 return byte;
123 #if ! HAVE_SNPRINTF
124 int
125 snprintf (char *str, size_t, char const *format, ...)
127 va_list ap;
128 va_start (ap, format);
129 int i = vsprintf (str, format, ap);
130 va_end (ap);
131 return i;
133 #endif
135 #if ! HAVE_VSNPRINTF
136 int
137 vsnprintf (char *str, size_t, char const *format, va_list args)
139 int i = vsprintf (str, format, args);
140 return i;
142 #endif
145 #if !HAVE_ISINF
147 isinf (double x)
149 return x && ( x == x/ 2) ;
152 #endif