2 libc-extension.cc -- compensate for lacking libc functions.
5 source file of the flowerlib
7 (c) 1997--1999 Han-Wen Nienhuys <hanwen@cs.uu.nl>
8 Jan Nieuwenhuizen <janneke@gnu.org>
14 #include "libc-extension.hh"
20 strnlwr (char* start_l
,int n
)
22 char * p
= start_l
+ n
;
23 while (--p
>= start_l
)
25 *p
= tolower (*p
); /* a macro on some compilers */
31 strnupr (char* start_l
, int n
)
33 char * p
= start_l
+ n
;
34 while (--p
>= start_l
)
36 *p
= toupper (*p
); /* a macro on some compilers */
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 */
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_l
= needle
;
62 Byte
const *subhaystack_l
= haystack
;
63 while (subneedle_l
< end_needle
)
64 if (*subneedle_l
++ != *subhaystack_l
++)
67 // completed the needle. Gotcha.
68 return (Byte
*) haystack
;
78 memrchr (Byte
const * p
, int n
, char c
)
92 my_swap (T
&t1
, T
&t2
, T
&tmp
)
100 strrev (Byte
* byte_l
, int length_i
)
104 Byte
* left_l
= byte_l
;
105 Byte
* right_l
= byte_l
+ length_i
;
107 while (right_l
> left_l
)
109 my_swap (*right_l
-- , *left_l
++ , tmp_byte
);
116 snprintf (char *str
, size_t, char const *format
, ...)
119 va_start (ap
, format
);
120 int i
= vsprintf (str
, format
, ap
);
128 vsnprintf (char *str
, size_t, char const *format
, va_list args
)
130 int i
= vsprintf (str
, format
, args
);