tal/str: new module.

[ccan] / ccan / tal / str / test / run-strreg.c

diff --git a/ccan/tal/str/test/run-strreg.c b/ccan/tal/str/test/run-strreg.c
new file mode 100644 (file)
index 0000000..a2a7dd9
--- /dev/null
+++ b/ccan/tal/str/test/run-strreg.c
@@ -0,0 +1,95 @@
+#include <ccan/tal/str/str.h>
+#include <ccan/tal/str/str.c>
+#include <ccan/tap/tap.h>
+
+static unsigned int tal_total_blocks(tal_t *ctx)
+{
+       unsigned int num = 1;
+       tal_t *i;
+
+       for (i = tal_first(ctx); i; i = tal_next(ctx, i))
+               num++;
+       return num;
+}
+
+static bool find_parent(tal_t *child, tal_t *parent)
+{
+       tal_t *i;
+
+       for (i = child; i; i = tal_parent(i))
+               if (i == parent)
+                       return true;
+
+       return false;
+}
+
+int main(int argc, char *argv[])
+{
+       void *ctx = tal_strdup(NULL, "toplevel");
+       unsigned int top_blocks = tal_total_blocks(ctx);
+       char *a, *b;
+       /* If it accesses this, it will crash. */
+       char **invalid = (char **)1L;
+
+       plan_tests(25);
+       /* Simple matching. */
+       ok1(strreg(ctx, "hello world!", "hello") == true);
+       ok1(strreg(ctx, "hello world!", "hi") == false);
+
+       /* No parentheses means we don't use any extra args. */
+       ok1(strreg(ctx, "hello world!", "hello", invalid) == true);
+       ok1(strreg(ctx, "hello world!", "hi", invalid) == false);
+
+       ok1(strreg(ctx, "hello world!", "[a-z]+", invalid) == true);
+       ok1(strreg(ctx, "hello world!", "([a-z]+)", &a, invalid) == true);
+       /* Found string */
+       ok1(streq(a, "hello"));
+       /* Allocated off ctx */
+       ok1(find_parent(a, ctx));
+       tal_free(a);
+
+       ok1(strreg(ctx, "hello world!", "([a-z]*) ([a-z]+)",
+                  &a, &b, invalid) == true);
+       ok1(streq(a, "hello"));
+       ok1(streq(b, "world"));
+       ok1(find_parent(a, ctx));
+       ok1(find_parent(b, ctx));
+       tal_free(a);
+       tal_free(b);
+
+       /* * after parentheses returns last match. */
+       ok1(strreg(ctx, "hello world!", "([a-z])* ([a-z]+)",
+                  &a, &b, invalid) == true);
+       ok1(streq(a, "o"));
+       ok1(streq(b, "world"));
+       tal_free(a);
+       tal_free(b);
+
+       /* Nested parentheses are ordered by open brace. */
+       ok1(strreg(ctx, "hello world!", "(([a-z]*) world)",
+                  &a, &b, invalid) == true);
+       ok1(streq(a, "hello world"));
+       ok1(streq(b, "hello"));
+       tal_free(a);
+       tal_free(b);
+
+       /* Nested parentheses are ordered by open brace. */
+       ok1(strreg(ctx, "hello world!", "(([a-z]*) world)",
+                  &a, &b, invalid) == true);
+       ok1(streq(a, "hello world"));
+       ok1(streq(b, "hello"));
+       tal_free(a);
+       tal_free(b);
+
+       /* NULL means we're not interested. */
+       ok1(strreg(ctx, "hello world!", "((hello|goodbye) world)",
+                  &a, NULL, invalid) == true);
+       ok1(streq(a, "hello world"));
+       tal_free(a);
+
+       /* No leaks! */
+       ok1(tal_total_blocks(ctx) == top_blocks);
+       tal_free(ctx);
+
+       return exit_status();
+}