reverse
int reverse = 0;
if (!reverse)
reverse = !reverse;
tcp = reverse(cp, revbuf, sizeof(revbuf));
int passed_salt = 0, quiet = 0, table = 0, reverse = 0;
reverse = 1;
quiet, table, reverse, pw_maxlen, mode))
table, reverse, pw_maxlen, mode))
int reverse, size_t pw_maxlen, passwd_modes mode);
int reverse, size_t pw_maxlen, passwd_modes mode)
if (table && !reverse)
else if (table && reverse)
int reverse = 0;
reverse = 1; /* needed to maintain sorting between currently
if (reverse) {
next = reverse ? curr->prev : curr->next;
reverse(f1, f2-size);
reverse (f1, f2-size);
int sign_x, sign_y, step, reverse, i;
reverse = 1;
reverse = 0;
plot(object, x, y, reverse, color);
plot(object, x1, y1, reverse, color); /* plot first two points */
plot(object, x, y, reverse, color);
plot(object, ++x, y, reverse, color);
plot(object, x1, y1, reverse, color);
plot(object, --x1, y1, reverse, color);
plot(object, x, y, reverse, color);
plot(object, ++x, y += step, reverse,
plot(object, x1, y1, reverse, color);
plot(object, --x1, y1 -= step, reverse,
plot(object, x, y += step, reverse, color);
plot(object, ++x, y, reverse, color);
plot(object, x1, y1 -= step, reverse,
plot(object, --x1, y1, reverse, color);
plot(object, ++x, y, reverse, color); /* pattern 1 */
plot(object, ++x, y, reverse, color);
plot(object, --x1, y1, reverse, color);
plot(object, ++x, y, reverse, color); /* pattern 2 */
plot(object, ++x, y += step, reverse, color);
plot(object, --x1, y1, reverse, color);
plot(object, ++x, y += step, reverse, color);
plot(object, ++x, y, reverse, color);
plot(object, --x1, y1 -= step, reverse, color);
plot(object, x, y += step, reverse, color);
plot(object, ++x, y += step, reverse, color);
plot(object, x1, y1 -= step, reverse, color);
plot(object, --x1, y1 -= step, reverse, color);
plot(object, x, y, reverse, color);
plot(object, ++x, y += step, reverse,
plot(object, x1, y1, reverse, color);
plot(object, --x1, y1 -= step, reverse,
plot(object, x, y += step, reverse, color);
plot(object, ++x, y, reverse, color);
plot(object, x1, y1 -= step, reverse, color);
plot(object, --x1, y1, reverse, color);
plot(object, ++x, y += step, reverse, color); /* pattern 4 */
plot(object, ++x, y += step, reverse,
plot(object, --x1, y1 -= step, reverse,
plot(object, ++x, y, reverse, color); /* pattern 2 */
plot(object, ++x, y += step, reverse, color);
plot(object, --x1, y1, reverse, color);
plot(object, ++x, y += step, reverse, color);
plot(object, ++x, y, reverse, color);
plot(object, --x1, y1 -= step, reverse, color);
plot(object, --x1, y1, reverse, color);
prop_list_sort(nvlist_t *props, char *property, bool reverse)
if ((lval < rval && reverse) ||
(lval > rval && !reverse))
if ((strcmp(sc_prev.val, sc_next.val) < 0 && reverse) ||
(strcmp(sc_prev.val, sc_next.val) > 0 && !reverse))
bool reverse;
reverse = false;
reverse = false;
reverse = true;
prop_list_sort(props, column, reverse);
int maxtsentries = 0, reverse = 0, sorting = STSORT_DEFAULT;
if (reverse)
if (reverse)
if (reverse)
reverse = !reverse;
es->reverse = blk_sizes[i].reverse;
u8 reverse; /* reverse FV order */
u8 reverse; /* set to true to reverse FV order */
if (hw->blk[params->blk].es.reverse)
bool reverse)
#define list_advance_entry(pos, reverse) \
((reverse) ? list_prev_entry(pos, list) : list_next_entry(pos, list))
#define list_for_each_advance_continue(pos, head, reverse) \
for (pos = list_advance_entry(pos, reverse); \
pos = list_advance_entry(pos, reverse))
list_for_each_advance_continue(iter, &root->children, reverse) {
ft = find_closest_ft_recursive(iter, &iter->children, reverse);
static struct mlx5_flow_table *find_closest_ft(struct fs_prio *prio, bool reverse)
ft = find_closest_ft_recursive(parent, &curr_node->list, reverse);
ATF_TC(reverse);
ATF_TC_HEAD(reverse, conf)
ATF_TC_BODY(reverse, dummy)
ATF_TP_ADD_TC(vlan_rotate, reverse);
reverse? bt_ntoa(&ba, bastr) : arg,
reverse? "name" : "address",
reverse? he->h_name :
int reverse;
reverse = 1;
reverse = 0;
herror(reverse? bt_ntoa(&ba, bastr) : arg);
printf("%s", reverse? he->h_name :
extern bool reverse;
if (reverse && out_existed) {
} else if (!reverse && out_existed) {
reverse = !reverse;
reverse ? "Assuming" : "Ignoring",
reverse ? "R" : "Unr");
reverse ? "Assume" : "Ignore");
reverse = !reverse;
reverse = !reverse;
reverse = !reverse;
reverse = !reverse;
reverse ? "R" : "Unr",
reverse ? "Assuming" : "Ignoring");
reverse ? "R" : "Unr",
reverse ? "Assume" : "Ignore");
reverse = !reverse;
reverse = reverse_flag_specified;
reverse = true;
bool reverse = false;
if (reverse) /* backwards patch? */
void reverse(FILE *, const char *, enum STYLE, off_t, struct stat *);
reverse(fp, fn, style, off, &sb);
reverse(stdin, fn, style, off, &sb);
reverse();
reverse();
static void reverse(void);
reverse++;
return(reverse ? -r : r);
static int reverse; /* Reverse sort order */