equalfuncs.c File Reference

#include "postgres.h"
#include "miscadmin.h"
#include "utils/datum.h"
#include "equalfuncs.funcs.c"
#include "equalfuncs.switch.c"

Include dependency graph for equalfuncs.c:

Go to the source code of this file.

Macros
#define	COMPARE_SCALAR_FIELD(fldname)
#define	COMPARE_NODE_FIELD(fldname)
#define	COMPARE_BITMAPSET_FIELD(fldname)
#define	COMPARE_STRING_FIELD(fldname)
#define	equalstr(a, b)    (((a) != NULL && (b) != NULL) ? (strcmp(a, b) == 0) : (a) == (b))
#define	COMPARE_ARRAY_FIELD(fldname)
#define	COMPARE_POINTER_FIELD(fldname, sz)
#define	COMPARE_LOCATION_FIELD(fldname)    ((void) 0)
#define	COMPARE_COERCIONFORM_FIELD(fldname)    ((void) 0)

Functions
static bool	_equalConst (const Const *a, const Const *b)
static bool	_equalExtensibleNode (const ExtensibleNode *a, const ExtensibleNode *b)
static bool	_equalA_Const (const A_Const *a, const A_Const *b)
static bool	_equalBitmapset (const Bitmapset *a, const Bitmapset *b)
static bool	_equalList (const List *a, const List *b)
bool	equal (const void *a, const void *b)

Macro Definition Documentation

COMPARE_ARRAY_FIELD

#define COMPARE_ARRAY_FIELD

(

fldname

)

Value:

    do { \
		if (memcmp(a->fldname, b->fldname, sizeof(a->fldname)) != 0) \
            return false; \
    } while (0)

Definition at line 66 of file equalfuncs.c.

       { \
		if (memcmp(a->fldname, b->fldname, sizeof(a->fldname)) != 0) \
            return false; \
    } while (0)

COMPARE_BITMAPSET_FIELD

#define COMPARE_BITMAPSET_FIELD

(

fldname

)

Value:

    do { \
		if (!bms_equal(a->fldname, b->fldname)) \
            return false; \
    } while (0)

Definition at line 48 of file equalfuncs.c.

       { \
		if (!bms_equal(a->fldname, b->fldname)) \
            return false; \
    } while (0)

COMPARE_COERCIONFORM_FIELD

#define COMPARE_COERCIONFORM_FIELD

(

fldname

)

((void) 0)

Definition at line 84 of file equalfuncs.c.

COMPARE_LOCATION_FIELD

#define COMPARE_LOCATION_FIELD

(

fldname

)

((void) 0)

Definition at line 80 of file equalfuncs.c.

COMPARE_NODE_FIELD

#define COMPARE_NODE_FIELD

(

fldname

)

Value:

    do { \
		if (!equal(a->fldname, b->fldname)) \
            return false; \
    } while (0)

Definition at line 41 of file equalfuncs.c.

       { \
		if (!equal(a->fldname, b->fldname)) \
            return false; \
    } while (0)

COMPARE_POINTER_FIELD

#define COMPARE_POINTER_FIELD	(		fldname,
			sz
	)

Value:

    do { \
		if (memcmp(a->fldname, b->fldname, (sz)) != 0) \
            return false; \
    } while (0)

Definition at line 73 of file equalfuncs.c.

       { \
		if (memcmp(a->fldname, b->fldname, (sz)) != 0) \
            return false; \
    } while (0)

COMPARE_SCALAR_FIELD

#define COMPARE_SCALAR_FIELD

(

fldname

)

Value:

    do { \
		if (a->fldname != b->fldname) \
            return false; \
    } while (0)

Definition at line 34 of file equalfuncs.c.

       { \
		if (a->fldname != b->fldname) \
            return false; \
    } while (0)

COMPARE_STRING_FIELD

#define COMPARE_STRING_FIELD

(

fldname

)

Value:

    do { \
		if (!equalstr(a->fldname, b->fldname)) \
            return false; \
    } while (0)

Definition at line 55 of file equalfuncs.c.

       { \
		if (!equalstr(a->fldname, b->fldname)) \
            return false; \
    } while (0)

equalstr

#define equalstr	(		a,
			b
	)		(((a) != NULL && (b) != NULL) ? (strcmp(a, b) == 0) : (a) == (b))

Definition at line 62 of file equalfuncs.c.

                                                        : (a) == (b))

Function Documentation

_equalA_Const()

static bool _equalA_Const ( const A_Const *  a, const A_Const *  b  )

static

Definition at line 134 of file equalfuncs.c.

{
    COMPARE_SCALAR_FIELD(isnull);
    /* Hack for in-line val field.  Also val is not valid if isnull is true */
    if (!a->isnull &&
        !equal(&a->val, &b->val))
        return false;
    COMPARE_LOCATION_FIELD(location);
 
    return true;
}

References a, b, COMPARE_LOCATION_FIELD, COMPARE_SCALAR_FIELD, and equal().

_equalBitmapset()

static bool _equalBitmapset ( const Bitmapset *  a, const Bitmapset *  b  )

static

Definition at line 147 of file equalfuncs.c.

{
    return bms_equal(a, b);
}

References a, b, and bms_equal().

_equalConst()

static bool _equalConst ( const Const *  a, const Const *  b  )

static

Definition at line 96 of file equalfuncs.c.

{
    COMPARE_SCALAR_FIELD(consttype);
    COMPARE_SCALAR_FIELD(consttypmod);
    COMPARE_SCALAR_FIELD(constcollid);
    COMPARE_SCALAR_FIELD(constlen);
    COMPARE_SCALAR_FIELD(constisnull);
    COMPARE_SCALAR_FIELD(constbyval);
    COMPARE_LOCATION_FIELD(location);
 
    /*
     * We treat all NULL constants of the same type as equal. Someday this
     * might need to change?  But datumIsEqual doesn't work on nulls, so...
     */
    if (a->constisnull)
        return true;
    return datumIsEqual(a->constvalue, b->constvalue,
                        a->constbyval, a->constlen);
}

References a, b, COMPARE_LOCATION_FIELD, COMPARE_SCALAR_FIELD, datumIsEqual(), and fb().

_equalExtensibleNode()

static bool _equalExtensibleNode ( const ExtensibleNode *  a, const ExtensibleNode *  b  )

static

Definition at line 117 of file equalfuncs.c.

{
    const ExtensibleNodeMethods *methods;
 
    COMPARE_STRING_FIELD(extnodename);
 
    /* At this point, we know extnodename is the same for both nodes. */
    methods = GetExtensibleNodeMethods(a->extnodename, false);
 
    /* compare the private fields */
    if (!methods->nodeEqual(a, b))
        return false;
 
    return true;
}

References a, b, COMPARE_STRING_FIELD, GetExtensibleNodeMethods(), and ExtensibleNodeMethods::nodeEqual.

_equalList()

static bool _equalList ( const List *  a, const List *  b  )

static

Definition at line 156 of file equalfuncs.c.

{
    const ListCell *item_a;
    const ListCell *item_b;
 
    /*
     * Try to reject by simple scalar checks before grovelling through all the
     * list elements...
     */
    COMPARE_SCALAR_FIELD(type);
    COMPARE_SCALAR_FIELD(length);
 
    /*
     * We place the switch outside the loop for the sake of efficiency; this
     * may not be worth doing...
     */
    switch (a->type)
    {
        case T_List:
            forboth(item_a, a, item_b, b)
            {
                if (!equal(lfirst(item_a), lfirst(item_b)))
                    return false;
            }
            break;
        case T_IntList:
            forboth(item_a, a, item_b, b)
            {
                if (lfirst_int(item_a) != lfirst_int(item_b))
                    return false;
            }
            break;
        case T_OidList:
            forboth(item_a, a, item_b, b)
            {
                if (lfirst_oid(item_a) != lfirst_oid(item_b))
                    return false;
            }
            break;
        case T_XidList:
            forboth(item_a, a, item_b, b)
            {
                if (lfirst_xid(item_a) != lfirst_xid(item_b))
                    return false;
            }
            break;
        default:
            elog(ERROR, "unrecognized list node type: %d",
                 (int) a->type);
            return false;       /* keep compiler quiet */
    }
 
    /*
     * If we got here, we should have run out of elements of both lists
     */
    Assert(item_a == NULL);
    Assert(item_b == NULL);
 
    return true;
}

References a, Assert, b, COMPARE_SCALAR_FIELD, elog, equal(), ERROR, fb(), forboth, lfirst, lfirst_int, lfirst_oid, lfirst_xid, and type.

Referenced by equal().

equal()

bool equal	(	const void *	a,
		const void *	b
	)

Definition at line 223 of file equalfuncs.c.

{
    bool        retval;
 
    if (a == b)
        return true;
 
    /*
     * note that a!=b, so only one of them can be NULL
     */
    if (a == NULL || b == NULL)
        return false;
 
    /*
     * are they the same type of nodes?
     */
    if (nodeTag(a) != nodeTag(b))
        return false;
 
    /* Guard against stack overflow due to overly complex expressions */
    check_stack_depth();
 
    switch (nodeTag(a))
    {
#include "equalfuncs.switch.c"
 
        case T_List:
        case T_IntList:
        case T_OidList:
        case T_XidList:
            retval = _equalList(a, b);
            break;
 
        default:
            elog(ERROR, "unrecognized node type: %d",
                 (int) nodeTag(a));
            retval = false;     /* keep compiler quiet */
            break;
    }
 
    return retval;
}

References _equalList(), a, b, check_stack_depth(), elog, ERROR, fb(), and nodeTag.

Referenced by _equalA_Const(), _equalList(), add_row_identity_var(), add_sp_item_to_pathtarget(), add_unique_group_var(), addRangeClause(), AlterPublicationTables(), calc_hist_selectivity_scalar(), calc_hist_selectivity_scalar(), calc_length_hist_frac(), calc_length_hist_frac(), check_new_partition_bound(), check_partition_bounds_for_split_list(), clause_is_strict_for(), CompareIndexInfo(), convert_subquery_pathkeys(), create_ordered_paths(), create_projection_path(), CreateStatistics(), deparseParam(), deparseVar(), dependencies_clauselist_selectivity(), dependency_is_compatible_expression(), ec_member_matches_foreign(), equalPolicy(), equalRuleLocks(), estimate_multivariate_bucketsize(), estimate_multivariate_ndistinct(), examine_variable(), ExecInitWindowAgg(), expand_grouping_sets(), exprs_known_equal(), finalize_grouping_exprs_walker(), find_compatible_agg(), find_ec_member_matching_expr(), find_em_for_rel_target(), find_list_position(), find_minmax_agg_replacement_param(), findTargetlistEntrySQL92(), findTargetlistEntrySQL99(), fix_expr_common(), fix_indexqual_operand(), get_eclass_for_sort_expr(), get_expression_sortgroupref(), get_partition_for_tuple(), get_variable(), group_by_has_partkey(), grouping_planner(), infer_collation_opclass_match(), length_hist_bsearch(), length_hist_bsearch(), list_delete(), list_member(), list_member_rangevar(), match_boolean_partition_clause(), match_clause_to_partition_key(), match_eclasses_to_foreign_key_col(), match_expr_to_partition_keys(), match_index_to_operand(), match_unique_clauses(), matches_boolean_partition_clause(), maybe_reread_subscription(), mcv_match_expression(), MergeAttributes(), MergeCheckConstraint(), MergeWithExistingConstraint(), operator_predicate_proof(), optimize_window_clauses(), pg_parse_query(), pg_plan_query(), pg_rewrite_query(), plan_union_children(), predicate_implied_by_simple_clause(), predicate_refuted_by_simple_clause(), preprocess_groupclause(), process_duplicate_ors(), process_equivalence(), process_matched_tle(), process_subquery_nestloop_params(), rbound_bsearch(), rbound_bsearch(), recomputeNamespacePath(), reconsider_full_join_clause(), reconsider_outer_join_clause(), RelationGetIndexAttrBitmap(), replace_nestloop_param_placeholdervar(), replace_nestloop_param_var(), replace_relid_callback(), restrict_infos_logically_equal(), search_indexed_tlist_for_sortgroupref(), split_selfjoin_quals(), stat_find_expression(), substitute_grouped_columns_mutator(), tlist_member(), tlist_same_exprs(), transformIndexConstraints(), transformPartitionBound(), transformPartitionCmdForMerge(), transformPartitionCmdForSplit(), transformWindowFuncCall(), trivial_subqueryscan(), and update_eclasses().