-
Notifications
You must be signed in to change notification settings - Fork 0
/
shell_token.c
99 lines (90 loc) · 1.88 KB
/
shell_token.c
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
#include "shell.h"
/* rayesyounes - spoutnikrs */
/**
* **strto_word_1 - split string into words, delim are ignored
* @str: input string
* @d: delim string
* Return: pointer to arr of string, or NULL if (FAIL)
*/
char **strto_word_1(char *str, char *d)
{
int i, j, k, m, num_words = 0;
char **s;
if (str == NULL || str[0] == 0)
return (NULL);
if (!d)
d = " ";
for (i = 0; str[i] != '\0'; i++)
if (!is_delim(str[i], d) && (is_delim(str[i + 1], d) || !str[i + 1]))
num_words++;
if (num_words == 0)
return (NULL);
s = malloc((1 + num_words) * sizeof(char *));
if (!s)
return (NULL);
for (i = 0, j = 0; j < num_words; j++)
{
while (is_delim(str[i], d))
i++;
k = 0;
while (!is_delim(str[i + k], d) && str[i + k])
k++;
s[j] = malloc((k + 1) * sizeof(char));
if (!s[j])
{
for (k = 0; k < j; k++)
free(s[k]);
free(s);
return (NULL);
}
for (m = 0; m < k; m++)
s[j][m] = str[i++];
s[j][m] = 0;
}
s[j] = NULL;
return (s);
}
/**
* **strto_word_2 - split a string into words
* @str: input string
* @d: delim
* Return: pointer to arr of string, or NULL (FAIL)
*/
char **strto_word_2(char *str, char d)
{
int i, j, k, m, num_words = 0;
char **s;
if (str == NULL || str[0] == 0)
return (NULL);
for (i = 0; str[i] != '\0'; i++)
if ((str[i] != d && str[i + 1] == d) ||
(str[i] != d && !str[i + 1]) ||
str[i + 1] == d)
num_words++;
if (num_words == 0)
return (NULL);
s = malloc((1 + num_words) * sizeof(char *));
if (!s)
return (NULL);
for (i = 0, j = 0; j < num_words; j++)
{
while (str[i] == d && str[i] != d)
i++;
k = 0;
while (str[i + k] != d && str[i + k] && str[i + k] != d)
k++;
s[j] = malloc((k + 1) * sizeof(char));
if (!s[j])
{
for (k = 0; k < j; k++)
free(s[k]);
free(s);
return (NULL);
}
for (m = 0; m < k; m++)
s[j][m] = str[i++];
s[j][m] = 0;
}
s[j] = NULL;
return (s);
}