Function parser_node_equal

Src/Base/Parser/AMReX_Parser_Y.cpp:772–838

}

bool parser_node_equal (struct parser_node* a, struct parser_node* b)
{
    if (a->type != b->type) { return false; }
    switch (a->type)
    {
    case PARSER_NUMBER:
        return parser_get_number(a) == parser_get_number(b);
    case PARSER_SYMBOL:
        return parser_same_symbol(a,b);
    case PARSER_ADD:
    case PARSER_SUB:
    case PARSER_MUL:
    case PARSER_DIV:
        return parser_node_equal(a->l,b->l) && parser_node_equal(a->r,b->r);
    case PARSER_F1:
        return (((struct parser_f1*)a)->ftype == ((struct parser_f1*)b)->ftype)
            && parser_node_equal(((struct parser_f1*)a)->l,
                                 ((struct parser_f1*)b)->l);
    case PARSER_F2:
        return (((struct parser_f2*)a)->ftype == ((struct parser_f2*)b)->ftype)
            && parser_node_equal(((struct parser_f2*)a)->l,
                                 ((struct parser_f2*)b)->l)
            && parser_node_equal(((struct parser_f2*)a)->r,
                                 ((struct parser_f2*)b)->r);
    case PARSER_F3:
        return (((struct parser_f3*)a)->ftype == ((struct parser_f3*)b)->ftype)
            && parser_node_equal(((struct parser_f3*)a)->n1,
                                 ((struct parser_f3*)b)->n1)
            && parser_node_equal(((struct parser_f3*)a)->n2,
                                 ((struct parser_f3*)b)->n2)
            && parser_node_equal(((struct parser_f3*)a)->n3,
                                 ((struct parser_f3*)b)->n3);
    case PARSER_USRF1:
        return (std::strcmp(((struct parser_usrf1*)a)->name,
                            ((struct parser_usrf1*)b)->name) == 0)
            && parser_node_equal(((struct parser_usrf1*)a)->l,
                                 ((struct parser_usrf1*)b)->l);
    case PARSER_USRF2:
        return (std::strcmp(((struct parser_usrf2*)a)->name,
                            ((struct parser_usrf2*)b)->name) == 0)
            && parser_node_equal(((struct parser_usrf2*)a)->l,
                                 ((struct parser_usrf2*)b)->l)
            && parser_node_equal(((struct parser_usrf2*)a)->r,
                                 ((struct parser_usrf2*)b)->r);
    case PARSER_USRFN:
    {
        short argca = ((struct parser_usrfn*)a)->argc;
        short argcb = ((struct parser_usrfn*)b)->argc;
        bool r = (argca == argcb)
            && (std::strcmp(((struct parser_usrfn*)a)->name,
                            ((struct parser_usrfn*)b)->name) == 0)
            && parser_node_equal(((struct parser_usrfn*)a)->n1,
                                 ((struct parser_usrfn*)b)->n1);
        for (short iarg = 0; (iarg < argca-1) && r; ++iarg) {
            r = r && parser_node_equal(((struct parser_usrfn*)a)->others[iarg],
                                       ((struct parser_usrfn*)b)->others[iarg]);
        }
        return r;