static ERL_NIF_TERM macros(ErlNifEnv* env, int argc, const ERL_NIF_TERM argv[])
{
const ERL_NIF_TERM* a;
ERL_NIF_TERM lists, tuples;
int arity;
if (!enif_get_tuple(env, argv[0], &arity, &a) || arity != 9) {
return enif_make_badarg(env);
}
lists = enif_make_list(env,9,
enif_make_list1(env,a[0]),
enif_make_list2(env,a[0],a[1]),
enif_make_list3(env,a[0],a[1],a[2]),
enif_make_list4(env,a[0],a[1],a[2],a[3]),
enif_make_list5(env,a[0],a[1],a[2],a[3],a[4]),
enif_make_list6(env,a[0],a[1],a[2],a[3],a[4],a[5]),
enif_make_list7(env,a[0],a[1],a[2],a[3],a[4],a[5],a[6]),
enif_make_list8(env,a[0],a[1],a[2],a[3],a[4],a[5],a[6],a[7]),
enif_make_list9(env,a[0],a[1],a[2],a[3],a[4],a[5],a[6],a[7],a[8]));
tuples = enif_make_list(env,9,
enif_make_tuple1(env,a[0]),
enif_make_tuple2(env,a[0],a[1]),
enif_make_tuple3(env,a[0],a[1],a[2]),
enif_make_tuple4(env,a[0],a[1],a[2],a[3]),
enif_make_tuple5(env,a[0],a[1],a[2],a[3],a[4]),
enif_make_tuple6(env,a[0],a[1],a[2],a[3],a[4],a[5]),
enif_make_tuple7(env,a[0],a[1],a[2],a[3],a[4],a[5],a[6]),
enif_make_tuple8(env,a[0],a[1],a[2],a[3],a[4],a[5],a[6],a[7]),
enif_make_tuple9(env,a[0],a[1],a[2],a[3],a[4],a[5],a[6],a[7],a[8]));
return enif_make_tuple2(env,lists,tuples);
}
static ERL_NIF_TERM re2_match(ErlNifEnv* env, int argc,
const ERL_NIF_TERM argv[])
{
ErlNifBinary sdata;
if (enif_inspect_iolist_as_binary(env, argv[0], &sdata))
{
const re2::StringPiece s((const char*)sdata.data, sdata.size);
autohandle<re2::RE2> re;
union re2_handle_union handle;
ErlNifBinary pdata;
matchoptions opts(env);
if (argc == 3 && !parse_match_options(env, argv[2], opts))
return enif_make_badarg(env);
if (enif_get_resource(env, argv[1], re2_resource_type, &handle.vp)
&& handle.p->re != NULL)
{
re.set(handle.p->re, true);
if (opts.caseless) // caseless allowed either in compile or match
return enif_make_badarg(env);
}
else if (enif_inspect_iolist_as_binary(env, argv[1], &pdata))
{
const re2::StringPiece p((const char*)pdata.data, pdata.size);
re2::RE2::Options re2opts;
re2opts.set_log_errors(false);
if (opts.caseless)
re2opts.set_case_sensitive(false);
re2::RE2* re2 = (re2::RE2*)enif_alloc(sizeof(re2::RE2));
if (re2 == NULL)
return error(env, a_err_enif_alloc);
re.set(new (re2) re2::RE2(p, re2opts)); // placement new
}
else
{
return enif_make_badarg(env);
}
if (!re->ok())
return enif_make_badarg(env);
int n = re->NumberOfCapturingGroups()+1;
std::vector<re2::StringPiece> group;
group.reserve(n);
if (re->Match(s, opts.offset, s.size(),
re2::RE2::UNANCHORED, &group[0], n))
{
int start = 0;
int arrsz = n;
if (opts.vs == matchoptions::VS_NONE) {
// return match atom only
return a_match;
} else if (opts.vs == matchoptions::VS_FIRST) {
// return first match only
ERL_NIF_TERM first = mres(env, s, group[0], opts.ct);
if (enif_is_identical(first, a_err_alloc_binary)) {
return error(env, a_err_alloc_binary);
} else {
return enif_make_tuple2(env, a_match,
enif_make_list1(env, first));
}
} else if (opts.vs == matchoptions::VS_ALL_BUT_FIRST) {
// skip first match
start = 1;
arrsz--;
}
if (opts.vs == matchoptions::VS_VLIST) {
// return matched subpatterns as specified in ValueList
return re2_match_ret_vlist(env, re, s, opts, group, n);
} else {
// return all or all_but_first matches
ERL_NIF_TERM* arr =
(ERL_NIF_TERM*)enif_alloc(sizeof(ERL_NIF_TERM)*n);
for(int i = start, arridx=0; i < n; i++,arridx++) {
ERL_NIF_TERM res = mres(env, s, group[i], opts.ct);
if (enif_is_identical(res, a_err_alloc_binary)) {
enif_free(arr);
return error(env, a_err_alloc_binary);
} else {
arr[arridx] = res;
}
}
ERL_NIF_TERM list = enif_make_list_from_array(env,arr,arrsz);
enif_free(arr);
return enif_make_tuple2(env, a_match, list);
}
} else {
return a_nomatch;
}
} else {
return enif_make_badarg(env);
}
}
