aboutsummaryrefslogtreecommitdiff
path: root/string/common.c
blob: 5e9f8b1d08b3275e232177654cef3e79663d502f (plain)
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
/*
 * This program 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 2 of the License, or
 * (at your option) any later version.
 *
 * This program 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 this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
 * MA 02110-1301, USA.
 *
 */

#ifndef STRING_COMMON_C
#define STRING_COMMON_C

#include <toast.h>

uint64_t strlen(const char *string)
{
	uint64_t l = 0;
	while (string[l++]);
	return l-1;
}

bool itoa(uint32_t num, char *buffer, uint8_t base)
{
	// Lookup table is valid up to heptadecimal (it's an inside joke)
	char lookup[] = "0123456789ABCDEFG";
	if (base > 17)
		return FALSE;
	uint8_t i;
	/// (Buffer size is 32 bytes)
	for(i = 31; i > 0; i--)
	{
		buffer[i-1] = lookup[(num % base)];
		num = (uint32_t)(num/base);
	}
	buffer[31] = 0;
	return TRUE;
}

uint32_t atoi(const char *string)
{
	uint32_t i;
	uint32_t multiplier = 1;
	uint32_t total = 0;
	for (i = 0; i < strlen(string); i++)
	{
		total += (string[strlen(string)-1-i] - 48) * multiplier;
		multiplier*=10;
	}
	return total;
}

//strcmp()
// UNFINISHED

// HAYSTACK:
// foo bar hello woo

// NEEDLE:
// hello
bool string_contains(char *haystack, char *needle)
{
	uint32_t i;
	uint32_t j;
	uint32_t hlen = strlen(haystack);
	uint32_t nlen = strlen(needle);

	// If needle is longer than haystack, it can't be in there!
	if (strlen(needle) > strlen(haystack))
		return FALSE;

	for (i = 0; i < hlen; i++)
	{
		for (j = 0; j < nlen; j++)
		{
			if (haystack[j+i] != needle[j])
				break;
		}
		// Reached end of haystack without mismatch, we've found the needle!
		if (j == nlen)
			return TRUE;
	}
	return FALSE;
}

void memcpy(void *to, const void *from, uint32_t size)
{
	// TO DO: copy more than one byte at a time
	char *t = to;
	const char *f = from;
	uint32_t i;
	for (i = 0; i < size; i++)
		t[i] = f[i];
}


void memset(void *to, uint8_t value, uint32_t size)
{
	// TO DO: copy more than one byte at a time
	char *t = to;
	uint32_t i;
	for (i = 0; i < size; i++)
		t[i] = value;

}
#endif