78 lines
1.7 KiB
C++
78 lines
1.7 KiB
C++
// RUN: %clangxx -O0 -g %s -o %t && %run %t 2>&1 | FileCheck %s
|
|
//
|
|
// UNSUPPORTED: darwin, target={{.*solaris.*}}
|
|
|
|
#include <assert.h>
|
|
#include <regex.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
#ifndef __arraycount
|
|
#define __arraycount(a) ((sizeof(a) / sizeof(a[0])))
|
|
#endif
|
|
|
|
void test_matched(const regex_t *preg, const char *string) {
|
|
int rv = regexec(preg, string, 0, NULL, 0);
|
|
if (!rv)
|
|
printf("%s: matched\n", string);
|
|
else if (rv == REG_NOMATCH)
|
|
printf("%s: not-matched\n", string);
|
|
else
|
|
abort();
|
|
}
|
|
|
|
void test_print_matches(const regex_t *preg, const char *string) {
|
|
regmatch_t rm[10];
|
|
int rv = regexec(preg, string, __arraycount(rm), rm, 0);
|
|
if (!rv) {
|
|
for (size_t i = 0; i < __arraycount(rm); i++) {
|
|
// This condition shall be simplified, but verify that the data fields
|
|
// are accessible.
|
|
if (rm[i].rm_so == -1 && rm[i].rm_eo == -1)
|
|
continue;
|
|
printf("matched[%zu]='%.*s'\n", i, (int)(rm[i].rm_eo - rm[i].rm_so),
|
|
string + rm[i].rm_so);
|
|
}
|
|
} else if (rv == REG_NOMATCH)
|
|
printf("%s: not-matched\n", string);
|
|
else
|
|
abort();
|
|
}
|
|
|
|
int main(void) {
|
|
printf("regex\n");
|
|
|
|
{
|
|
regex_t regex;
|
|
int rv = regcomp(®ex, "[[:upper:]]\\([[:upper:]]\\)", 0);
|
|
assert(!rv);
|
|
|
|
test_matched(®ex, "abc");
|
|
test_matched(®ex, "ABC");
|
|
|
|
test_print_matches(®ex, "ABC");
|
|
|
|
regfree(®ex);
|
|
}
|
|
|
|
{
|
|
regex_t regex;
|
|
int rv = regcomp(®ex, "[[:upp:]]", 0);
|
|
assert(rv);
|
|
|
|
char errbuf[1024];
|
|
regerror(rv, ®ex, errbuf, sizeof errbuf);
|
|
printf("error: %s\n", errbuf);
|
|
|
|
regfree(®ex);
|
|
}
|
|
|
|
// CHECK: regex
|
|
// CHECK: abc: not-matched
|
|
// CHECK: ABC: matched
|
|
// CHECK: matched[0]='AB'
|
|
// CHECK: matched[1]='B'
|
|
// CHECK: error:{{.*}}
|
|
|
|
return 0;
|
|
}
|