+ /* trim leading spaces */
+ xbt_str_ltrim(beg," ");
+ end=beg;
+
+ while (!done) {
+
+
+ switch (*end) {
+ case '\\':
+ ctn = 1;
+ /* Protected char; move it closer */
+ memmove(end,end+1,strlen(end));
+ if (*end=='\0')
+ THROW0(arg_error,0,"String ends with \\");
+ end++; /* Pass the protected char */
+ break;
+
+ case '\'':
+ ctn = 1;
+ if (!in_double_quote) {
+ in_simple_quote = !in_simple_quote;
+ memmove(end,end+1,strlen(end));
+ } else {
+ /* simple quote protected by double ones */
+ end++;
+ }
+ break;
+ case '"':
+ ctn = 1;
+ if (!in_simple_quote) {
+ in_double_quote = !in_double_quote;
+ memmove(end,end+1,strlen(end));
+ } else {
+ /* double quote protected by simple ones */
+ end++;
+ }
+ break;
+
+ case ' ':
+ case '\t':
+ case '\n':
+ case '\0':
+ if (*end == '\0' && (in_simple_quote || in_double_quote)) {
+ THROW2(arg_error,0,
+ "End of string found while searching for %c in %s",
+ (in_simple_quote?'\'':'"'),
+ s);
+ }
+ if (in_simple_quote || in_double_quote) {
+ end++;
+ } else {
+ if (ctn) {
+ /* Found a separator. Push the string if contains something */
+ char *topush=xbt_malloc(end-beg+1);
+ memcpy(topush,beg,end-beg);
+ topush[end - beg] = '\0';
+ xbt_dynar_push(res,&topush);
+ }
+ ctn= 0;
+
+ if (*end == '\0') {
+ done = 1;
+ break;
+ }
+
+ beg=++end;
+ xbt_str_ltrim(beg," ");
+ end=beg;
+ }
+ break;
+
+ default:
+ ctn = 1;
+ end++;
+ }
+ }
+ free(str);
+ return res;
+}
+
+#ifdef SIMGRID_TEST
+#define mytest(name, input, expected) \
+ xbt_test_add0(name); \
+ d=xbt_str_split_quoted(input); \
+ s=xbt_str_join(d,"XXX"); \
+ xbt_test_assert3(!strcmp(s,expected),\
+ "Input (%s) leads to (%s) instead of (%s)", \
+ input,s,expected);\
+ free(s); \
+ xbt_dynar_free(&d);
+
+XBT_TEST_SUITE("xbt_str","String Handling");
+XBT_TEST_UNIT("xbt_str_split_quoted",test_split_quoted, "test the function xbt_str_split_quoted") {
+ xbt_dynar_t d;
+ char *s;
+
+ mytest("Empty", "", "");
+ mytest("Basic test", "toto tutu", "totoXXXtutu");
+ mytest("Useless backslashes", "\\t\\o\\t\\o \\t\\u\\t\\u", "totoXXXtutu");
+ mytest("Protected space", "toto\\ tutu", "toto tutu");
+ mytest("Several spaces", "toto tutu", "totoXXXtutu");
+ mytest("LTriming", " toto tatu", "totoXXXtatu");
+ mytest("Triming", " toto tutu ", "totoXXXtutu");
+ mytest("Single quotes", "'toto tutu' tata", "toto tutuXXXtata");
+ mytest("Double quotes", "\"toto tutu\" tata", "toto tutuXXXtata");
+ mytest("Mixed quotes", "\"toto' 'tutu\" tata", "toto' 'tutuXXXtata");
+ mytest("Backslashed quotes", "\\'toto tutu\\' tata", "'totoXXXtutu'XXXtata");
+ mytest("Backslashed quotes + quotes", "'toto \\'tutu' tata", "toto 'tutuXXXtata");
+
+}
+#endif /* SIMGRID_TEST */
+
+/** @brief Join a set of strings as a single string */
+
+char *xbt_str_join(xbt_dynar_t dyn, const char*sep) {
+ int len=1,dyn_len=xbt_dynar_length(dyn);
+ int cpt;
+ char *cursor;
+ char *res,*p;
+
+ if (!dyn_len)
+ return xbt_strdup("");
+
+ /* compute the length */
+ xbt_dynar_foreach(dyn,cpt,cursor) {
+ len+=strlen(cursor);
+ }
+ len+=strlen(sep)*dyn_len;
+ /* Do the job */
+ res = xbt_malloc(len);
+ p=res;
+ xbt_dynar_foreach(dyn,cpt,cursor) {
+ if (cpt<dyn_len-1)
+ p+=sprintf(p,"%s%s",cursor,sep);
+ else
+ p+=sprintf(p,"%s",cursor);
+ }
+ return res;
+}
+
+#if !defined(HAVE_GETLINE) || defined(DOXYGEN)
+/** @brief Get a single line from the stream (reimplementation of the GNU getline)
+ *
+ * This is a redefinition of the GNU getline function, used on platforms where it does not exists.
+ *
+ * getline() reads an entire line from stream, storing the address of the buffer
+ * containing the text into *buf. The buffer is null-terminated and includes
+ * the newline character, if one was found.
+ *
+ * If *buf is NULL, then getline() will allocate a buffer for storing the line,
+ * which should be freed by the user program. Alternatively, before calling getline(),
+ * *buf can contain a pointer to a malloc()-allocated buffer *n bytes in size. If the buffer
+ * is not large enough to hold the line, getline() resizes it with realloc(), updating *buf and *n
+ * as necessary. In either case, on a successful call, *buf and *n will be updated to
+ * reflect the buffer address and allocated size respectively.
+ */
+long getline(char **buf, size_t *n, FILE *stream) {
+
+ int i, ch;
+
+ if (!*buf) {
+ *buf = xbt_malloc(512);
+ *n = 512;
+ }
+
+ if (feof(stream))
+ return (ssize_t)-1;
+
+ for (i=0; (ch = fgetc(stream)) != EOF; i++) {
+
+ if (i >= (*n) + 1)
+ *buf = xbt_realloc(*buf, *n += 512);
+
+ (*buf)[i] = ch;
+
+ if ((*buf)[i] == '\n') {
+ i++;
+ (*buf)[i] = '\0';
+ break;
+ }
+ }
+
+ if (i == *n)
+ *buf = xbt_realloc(*buf, *n += 1);
+
+ (*buf)[i] = '\0';
+
+ return (ssize_t)i;
+}
+
+#endif /* HAVE_GETLINE */
+
+/*
+ * Diff related functions
+ */
+static xbt_matrix_t diff_build_LCS(xbt_dynar_t da, xbt_dynar_t db) {
+ xbt_matrix_t C = xbt_matrix_new(xbt_dynar_length(da),xbt_dynar_length(db),
+ sizeof(int),NULL);
+ int i,j;
+ /* Compute the LCS */
+ /*
+ C = array(0..m, 0..n)
+ for i := 0..m
+ C[i,0] = 0
+ for j := 1..n
+ C[0,j] = 0
+ for i := 1..m
+ for j := 1..n
+ if X[i] = Y[j]
+ C[i,j] := C[i-1,j-1] + 1
+ else:
+ C[i,j] := max(C[i,j-1], C[i-1,j])
+ return C[m,n]
+ */
+ for (i=0; i<xbt_dynar_length(da); i++)
+ *((int*) xbt_matrix_get_ptr(C,i,0) ) = 0;
+
+ for (j=0; j<xbt_dynar_length(db); j++)
+ *((int*) xbt_matrix_get_ptr(C,0,j) ) = 0;
+
+ for (i=1; i<xbt_dynar_length(da); i++)
+ for (j=1; j<xbt_dynar_length(db); j++) {
+
+ if (!strcmp(xbt_dynar_get_as(da,i,char*), xbt_dynar_get_as(db,j,char*)))
+ *((int*) xbt_matrix_get_ptr(C,i,j) ) = xbt_matrix_get_as(C,i-1,j-1,int) + 1;
+ else
+ *((int*) xbt_matrix_get_ptr(C,i,j) ) = max(xbt_matrix_get_as(C,i ,j-1,int),
+ xbt_matrix_get_as(C,i-1,j,int));
+ }
+ return C;
+}
+
+static void diff_build_diff(xbt_dynar_t res,
+ xbt_matrix_t C,
+ xbt_dynar_t da, xbt_dynar_t db,
+ int i,int j) {
+ char *topush;
+ /* Construct the diff
+ function printDiff(C[0..m,0..n], X[1..m], Y[1..n], i, j)
+ if i > 0 and j > 0 and X[i] = Y[j]
+ printDiff(C, X, Y, i-1, j-1)
+ print " " + X[i]
+ else
+ if j > 0 and (i = 0 or C[i,j-1] >= C[i-1,j])
+ printDiff(C, X, Y, i, j-1)
+ print "+ " + Y[j]
+ else if i > 0 and (j = 0 or C[i,j-1] < C[i-1,j])
+ printDiff(C, X, Y, i-1, j)
+ print "- " + X[i]
+ */
+
+ if (i>=0 && j >= 0 && !strcmp(xbt_dynar_get_as(da,i,char*),
+ xbt_dynar_get_as(db,j,char*))) {
+ diff_build_diff(res,C,da,db,i-1,j-1);
+ topush = bprintf(" %s",xbt_dynar_get_as(da,i,char*));
+ xbt_dynar_push(res, &topush);
+ } else if (j>=0 &&
+ (i<=0 || xbt_matrix_get_as(C,i,j-1,int) >= xbt_matrix_get_as(C,i-1,j,int))) {
+ diff_build_diff(res,C,da,db,i,j-1);
+ topush = bprintf("+ %s",xbt_dynar_get_as(db,j,char*));
+ xbt_dynar_push(res,&topush);
+ } else if (i>=0 &&
+ (j<=0 || xbt_matrix_get_as(C,i,j-1,int) < xbt_matrix_get_as(C,i-1,j,int))) {
+ diff_build_diff(res,C,da,db,i-1,j);
+ topush = bprintf("- %s",xbt_dynar_get_as(da,i,char*));
+ xbt_dynar_push(res,&topush);
+ } else if (i<=0 && j<=0) {
+ return;
+ } else {
+ THROW2(arg_error,0,"Invalid values: i=%d, j=%d",i,j);
+ }
+
+}
+
+/** @brief Compute the unified diff of two strings */
+char *xbt_str_diff(char *a, char *b) {
+ xbt_dynar_t da = xbt_str_split(a, "\n");
+ xbt_dynar_t db = xbt_str_split(b, "\n");
+
+ xbt_matrix_t C = diff_build_LCS(da,db);
+ xbt_dynar_t diff = xbt_dynar_new(sizeof(char*),free_string);
+ char *res=NULL;
+
+ diff_build_diff(diff, C, da,db, xbt_dynar_length(da)-1, xbt_dynar_length(db)-1);
+ /* Clean empty lines at the end */
+ while (xbt_dynar_length(diff) > 0) {
+ char *str;
+ xbt_dynar_pop(diff,&str);
+ if (str[0]=='\0' || !strcmp(str," ")) {
+ free(str);
+ } else {
+ xbt_dynar_push(diff,&str);
+ break;
+ }
+ }
+ res = xbt_str_join(diff, "\n");
+
+ xbt_dynar_free(&da);
+ xbt_dynar_free(&db);
+ xbt_dynar_free(&diff);
+ xbt_matrix_free(C);
+
+ return res;
+}