2 * Copyright (c) 2003 David Roundy
3 * Copyright (c) 2005-6 Don Stewart
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the names of the authors or the names of any contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 /* copy a string in reverse */
35 void reverse(unsigned char *dest, unsigned char *from, int len) {
44 /* compare bytes ascii-wise */
45 static int cmp(const void *p, const void *q) {
46 return (*(unsigned char *)p - *(unsigned char *)q);
49 /* quicksort wrapper */
50 void my_qsort(unsigned char *base, size_t size) {
51 qsort(base, size, sizeof(char), cmp);
54 /* duplicate a string, interspersing the character through the elements
55 of the duplicated string */
56 void intersperse(unsigned char *dest, unsigned char *from, int len, char c) {
60 while (p < from + len - 1) {
67 /* find maximum char in a packed string */
68 unsigned char maximum(unsigned char *p, int len) {
69 unsigned char *q, c = *p;
70 for (q = p; q < p + len; q++)
76 /* find minimum char in a packed string */
77 unsigned char minimum(unsigned char *p, int len) {
78 unsigned char *q, c = *p;
79 for (q = p; q < p + len; q++)
85 /* count the number of occurences of a char in a string */
86 int count(unsigned char *p, int len, unsigned char w) {
88 for (c = 0; len--; ++p)