htop/StringUtils.c

154 lines
3.5 KiB
C
Raw Normal View History

2006-03-04 18:16:49 +00:00
/*
2015-08-19 16:58:29 +00:00
htop - StringUtils.c
2011-05-26 16:35:07 +00:00
(C) 2004-2011 Hisham H. Muhammad
2006-03-04 18:16:49 +00:00
Released under the GNU GPL, see the COPYING file
in the source distribution for its full text.
*/
#include "StringUtils.h"
2016-02-02 14:53:02 +00:00
#include "XAlloc.h"
2011-12-26 21:35:57 +00:00
#include "config.h"
2006-03-04 18:16:49 +00:00
#include <string.h>
#include <strings.h>
#include <stdlib.h>
/*{
#include <stdio.h>
#define String_startsWith(s, match) (strncmp((s),(match),strlen(match)) == 0)
#define String_contains_i(s1, s2) (strcasestr(s1, s2) != NULL)
}*/
/*
* String_startsWith gives better performance if strlen(match) can be computed
* at compile time (e.g. when they are immutable string literals). :)
*/
2010-02-25 01:43:18 +00:00
char* String_cat(const char* s1, const char* s2) {
2006-03-04 18:16:49 +00:00
int l1 = strlen(s1);
int l2 = strlen(s2);
2016-02-02 14:53:02 +00:00
char* out = xMalloc(l1 + l2 + 1);
2006-03-04 18:16:49 +00:00
strncpy(out, s1, l1);
strncpy(out+l1, s2, l2+1);
return out;
}
2010-02-25 01:43:18 +00:00
char* String_trim(const char* in) {
2006-03-04 18:16:49 +00:00
while (in[0] == ' ' || in[0] == '\t' || in[0] == '\n') {
in++;
}
int len = strlen(in);
while (len > 0 && (in[len-1] == ' ' || in[len-1] == '\t' || in[len-1] == '\n')) {
len--;
}
2016-02-02 14:53:02 +00:00
char* out = xMalloc(len+1);
2006-03-04 18:16:49 +00:00
strncpy(out, in, len);
out[len] = '\0';
return out;
}
inline int String_eq(const char* s1, const char* s2) {
2006-03-04 18:16:49 +00:00
if (s1 == NULL || s2 == NULL) {
if (s1 == NULL && s2 == NULL)
return 1;
else
return 0;
}
return (strcmp(s1, s2) == 0);
}
char** String_split(const char* s, char sep, int* n) {
*n = 0;
2006-03-04 18:16:49 +00:00
const int rate = 10;
2016-02-02 14:53:02 +00:00
char** out = xCalloc(rate, sizeof(char*));
2006-03-04 18:16:49 +00:00
int ctr = 0;
int blocks = rate;
char* where;
while ((where = strchr(s, sep)) != NULL) {
int size = where - s;
2016-02-02 14:53:02 +00:00
char* token = xMalloc(size + 1);
2006-03-04 18:16:49 +00:00
strncpy(token, s, size);
token[size] = '\0';
out[ctr] = token;
ctr++;
if (ctr == blocks) {
blocks += rate;
out = (char**) xRealloc(out, sizeof(char*) * blocks);
2006-03-04 18:16:49 +00:00
}
s += size + 1;
}
if (s[0] != '\0') {
int size = strlen(s);
2016-02-02 14:53:02 +00:00
char* token = xMalloc(size + 1);
2006-03-04 18:16:49 +00:00
strncpy(token, s, size + 1);
out[ctr] = token;
ctr++;
}
out = xRealloc(out, sizeof(char*) * (ctr + 1));
2006-03-04 18:16:49 +00:00
out[ctr] = NULL;
*n = ctr;
2006-03-04 18:16:49 +00:00
return out;
}
void String_freeArray(char** s) {
for (int i = 0; s[i] != NULL; i++) {
free(s[i]);
}
free(s);
}
char* String_getToken(const char* line, const unsigned short int numMatch) {
const unsigned short int len = strlen(line);
char inWord = 0;
unsigned short int count = 0;
char match[50];
unsigned short int foundCount = 0;
for (unsigned short int i = 0; i < len; i++) {
char lastState = inWord;
inWord = line[i] == ' ' ? 0:1;
if (lastState == 0 && inWord == 1)
count++;
if(inWord == 1){
if (count == numMatch && line[i] != ' ' && line[i] != '\0' && line[i] != '\n' && line[i] != (char)EOF) {
match[foundCount] = line[i];
foundCount++;
}
}
}
match[foundCount] = '\0';
2016-02-02 14:53:02 +00:00
return((char*)xStrdup(match));
}
char* String_readLine(FILE* fd) {
const int step = 1024;
int bufSize = step;
char* buffer = xMalloc(step + 1);
char* at = buffer;
for (;;) {
char* ok = fgets(at, step + 1, fd);
if (!ok) {
free(buffer);
return NULL;
}
char* newLine = strrchr(at, '\n');
if (newLine) {
*newLine = '\0';
return buffer;
} else {
if (feof(fd)) {
return buffer;
}
}
bufSize += step;
buffer = xRealloc(buffer, bufSize + 1);
at = buffer + bufSize - step;
}
}