You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
173 lines
3.3 KiB
173 lines
3.3 KiB
#include "stringop.h"
|
|
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include "string.h"
|
|
#include "list.h"
|
|
#include <strings.h>
|
|
|
|
/* Note: This returns 8 characters for trimmed_start per tab character. */
|
|
char *strip_whitespace(char *_str, int *trimmed_start) {
|
|
*trimmed_start = 0;
|
|
if (*_str == '\0')
|
|
return _str;
|
|
char *strold = _str;
|
|
while (*_str == ' ' || *_str == '\t') {
|
|
if (*_str == '\t') {
|
|
*trimmed_start += 8;
|
|
} else {
|
|
*trimmed_start += 1;
|
|
}
|
|
_str++;
|
|
}
|
|
char *str = malloc(strlen(_str) + 1);
|
|
strcpy(str, _str);
|
|
free(strold);
|
|
int i;
|
|
for (i = 0; str[i] != '\0'; ++i);
|
|
do {
|
|
i--;
|
|
} while (i >= 0 && (str[i] == ' ' || str[i] == '\t'));
|
|
str[i + 1] = '\0';
|
|
return str;
|
|
}
|
|
|
|
char *strip_comments(char *str) {
|
|
int in_string = 0, in_character = 0;
|
|
int i = 0;
|
|
while (str[i] != '\0') {
|
|
if (str[i] == '"' && !in_character) {
|
|
in_string = !in_string;
|
|
} else if (str[i] == '\'' && !in_string) {
|
|
in_character = !in_character;
|
|
} else if (!in_character && !in_string) {
|
|
if (str[i] == '#' && i == 0) {
|
|
str[i] = '\0';
|
|
break;
|
|
}
|
|
}
|
|
++i;
|
|
}
|
|
return str;
|
|
}
|
|
|
|
list_t *split_string(const char *str, const char *delims) {
|
|
list_t *res = create_list();
|
|
int i, j;
|
|
int len = strlen(str);
|
|
for (i = 0, j = 0; i < len + 1; ++i) {
|
|
if (strchr(delims, str[i]) || i == len) {
|
|
if (i - j == 0) {
|
|
continue;
|
|
}
|
|
char *left = malloc(i - j + 1);
|
|
memcpy(left, str + j, i - j);
|
|
left[i - j] = 0;
|
|
list_add(res, left);
|
|
j = i + 1;
|
|
while (j <= len && str[j] && strchr(delims, str[j])) {
|
|
j++;
|
|
i++;
|
|
}
|
|
free(left);
|
|
}
|
|
}
|
|
return res;
|
|
}
|
|
|
|
void free_flat_list(list_t *list) {
|
|
int i;
|
|
for (i = 0; i < list->length; ++i) {
|
|
free(list->items[i]);
|
|
}
|
|
list_free(list);
|
|
}
|
|
|
|
char *code_strstr(const char *haystack, const char *needle) {
|
|
/* TODO */
|
|
return strstr(haystack, needle);
|
|
}
|
|
|
|
char *code_strchr(const char *str, char delimiter) {
|
|
int in_string = 0, in_character = 0;
|
|
int i = 0;
|
|
while (str[i] != '\0') {
|
|
if (str[i] == '"' && !in_character) {
|
|
in_string = !in_string;
|
|
} else if (str[i] == '\'' && !in_string) {
|
|
in_character = !in_character;
|
|
} else if (!in_character && !in_string) {
|
|
if (str[i] == delimiter) {
|
|
return (char *)str + i;
|
|
}
|
|
}
|
|
++i;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
int unescape_string(char *string) {
|
|
/* TODO: More C string escapes */
|
|
int len = strlen(string);
|
|
int i;
|
|
for (i = 0; string[i]; ++i) {
|
|
if (string[i] == '\\') {
|
|
--len;
|
|
int shift = 0;
|
|
switch (string[++i]) {
|
|
case '0':
|
|
string[i - 1] = '\0';
|
|
shift = 1;
|
|
break;
|
|
case 'a':
|
|
string[i - 1] = '\a';
|
|
shift = 1;
|
|
break;
|
|
case 'b':
|
|
string[i - 1] = '\b';
|
|
shift = 1;
|
|
break;
|
|
case 't':
|
|
string[i - 1] = '\t';
|
|
shift = 1;
|
|
break;
|
|
case 'n':
|
|
string[i - 1] = '\n';
|
|
shift = 1;
|
|
break;
|
|
case 'v':
|
|
string[i - 1] = '\v';
|
|
shift = 1;
|
|
break;
|
|
case 'f':
|
|
string[i - 1] = '\f';
|
|
shift = 1;
|
|
break;
|
|
case 'r':
|
|
string[i - 1] = '\r';
|
|
shift = 1;
|
|
break;
|
|
}
|
|
if (shift) {
|
|
memmove(string + i, string + i + shift, len - i);
|
|
}
|
|
}
|
|
}
|
|
return len;
|
|
}
|
|
|
|
char *join_args(char **argv, int argc) {
|
|
int len = 0, i;
|
|
for (i = 0; i < argc; ++i) {
|
|
len += strlen(argv[i]) + 1;
|
|
}
|
|
char *res = malloc(len);
|
|
len = 0;
|
|
for (i = 0; i < argc; ++i) {
|
|
strcpy(res + len, argv[i]);
|
|
len += strlen(argv[i]);
|
|
res[len++] = ' ';
|
|
}
|
|
res[len - 1] = '\0';
|
|
return res;
|
|
}
|