10 const int ascending1,
const int ascending2)
17 if (ascending1 == ascending2)
19 else if (ascending1 == INT_MIN)
21 else if (ascending2 == INT_MIN)
24 BZ_DEBUG_MESSAGE(
"Two array operands have different"
25 << endl <<
"ascending flags: for rank " << rank
26 <<
", the flags are " << ascending1 <<
" and "
27 << ascending2 << endl);
33 const int order1,
const int order2)
42 else if (order1 == INT_MIN)
44 else if (order2 == INT_MIN)
47 BZ_DEBUG_MESSAGE(
"Two array operands have different"
48 << endl <<
"orders: for rank " << rank <<
", the orders are "
49 << order1 <<
" and " << order2 << endl);
55 const int lbound1,
const int lbound2)
62 if (lbound1 == lbound2)
64 else if (lbound1 == INT_MIN)
66 else if (lbound2 == INT_MIN)
69 BZ_DEBUG_MESSAGE(
"Two array operands have different"
70 << endl <<
"lower bounds: in rank " << rank <<
", the bounds are "
71 << lbound1 <<
" and " << lbound2 << endl);
77 const int ubound1,
const int ubound2)
84 if (ubound1 == ubound2)
86 else if (ubound1 == INT_MAX)
88 else if (ubound2 == INT_MAX)
91 BZ_DEBUG_MESSAGE(
"Two array operands have different"
92 << endl <<
"upper bounds: in rank " << rank <<
", the bounds are "
93 << ubound1 <<
" and " << ubound2 << endl);
Definition array-impl.h:66
static int compute_ordering(const int BZ_DEBUG_PARAM(rank), const int order1, const int order2)
Definition bounds.h:32
static int compute_ubound(const int BZ_DEBUG_PARAM(rank), const int ubound1, const int ubound2)
Definition bounds.h:76
static int compute_ascending(const int BZ_DEBUG_PARAM(rank), const int ascending1, const int ascending2)
Definition bounds.h:9
static int compute_lbound(const int BZ_DEBUG_PARAM(rank), const int lbound1, const int lbound2)
Definition bounds.h:54