bin/csh/lex.c

625

int left, right, dol;

bin/csh/lex.c

648

left = 0, right = dol;

bin/csh/lex.c

656

left = right = -1;

bin/csh/lex.c

662

left = 0, right = dol;

bin/csh/lex.c

668

if (!getsel(&left, &right, dol))

bin/csh/lex.c

674

if (!getsel(&left, &right, dol))

bin/csh/lex.c

679

exclc = right - left + 1;

bin/ksh/exec.c

156

t = t->right;

bin/ksh/exec.c

169

t = t->right;

bin/ksh/exec.c

245

rv = execute(t->right, flags & XERROK, xerrok);

bin/ksh/exec.c

253

rv = !execute(t->right, XERROK, xerrok);

bin/ksh/exec.c

336

rv = execute(t->right, flags & XERROK, xerrok);

bin/ksh/exec.c

341

if (t->right == NULL)

bin/ksh/exec.c

344

execute(t->right->left, flags & XERROK, xerrok) :

bin/ksh/exec.c

345

execute(t->right->right, flags & XERROK, xerrok);

bin/ksh/exec.c

350

for (t = t->left; t != NULL && t->type == TPAT; t = t->right) {

bin/ksh/syn.c

139

tl = tl->right = block(TLIST, tl->right, p, NULL);

bin/ksh/syn.c

336

t->right = dogroup();

bin/ksh/syn.c

353

t->right = thenpart();

bin/ksh/syn.c

449

t->right = elsepart();

bin/ksh/syn.c

467

t->right = thenpart();

bin/ksh/syn.c

494

t = tl = tc, tl->right = NULL;

bin/ksh/syn.c

496

tl->right = tc, tl = tc;

bin/ksh/syn.c

622

t->right = t2;

bin/ksh/syn.c

757

t->left = t->right = NULL;

bin/ksh/syn.c

85

tl = tl->right = block(TPIPE, tl->right, p, NULL);

bin/ksh/tree.c

113

t = t->right;

bin/ksh/tree.c

119

if (t->right == NULL || t->right->type != TELIF)

bin/ksh/tree.c

121

t = t->right;

bin/ksh/tree.c

126

if (t->right != NULL) {

bin/ksh/tree.c

128

fptreef(shf, indent + INDENT, "else%;%T", t->right);

bin/ksh/tree.c

139

fptreef(shf, indent + INDENT, "%;%T", t->right);

bin/ksh/tree.c

477

r->right = tcopy(t->right, ap);

bin/ksh/tree.c

57

t = t->right;

bin/ksh/tree.c

61

t = t->right;

bin/ksh/tree.c

66

t->left, (t->type==TOR) ? "||" : "&&", t->right);

bin/ksh/tree.c

669

tfree(t->right, ap);

bin/ksh/tree.c

70

t = t->right;

bin/ksh/tree.c

99

for (t1 = t->left; t1 != NULL; t1 = t1->right) {

bin/ksh/tree.h

21

struct op *left, *right; /* descendents */

games/arithmetic/arithmetic.c

175

int left, op, right, result;

games/arithmetic/arithmetic.c

180

right = getrandom(rangemax + 1, op, 1);

games/arithmetic/arithmetic.c

186

result = left + right;

games/arithmetic/arithmetic.c

190

left = right + result;

games/arithmetic/arithmetic.c

194

result = left * right;

games/arithmetic/arithmetic.c

197

right = getrandom(rangemax, op, 1) + 1;

games/arithmetic/arithmetic.c

199

left = right * result + arc4random_uniform(right);

games/arithmetic/arithmetic.c

210

(void)printf("%d %c %d = ", left, op, right);

games/arithmetic/arithmetic.c

236

penalise(right, op, 1);

games/atc/extern.h

136

const char *right(char);

games/atc/input.c

104

{ 'r', 6, " right", right },

games/battlestar/command2.c

320

SetBit(location[right].objects, WOODSMAN);

games/battlestar/command2.c

321

SetBit(location[right].objects, DEADWOOD);

games/battlestar/command2.c

322

SetBit(location[right].objects, MALLET);

games/battlestar/command4.c

206

deposit = right;

games/battlestar/command7.c

202

else if (right && position != right)

games/battlestar/command7.c

203

moveplayer(right, RIGHT);

games/battlestar/cypher.c

134

if (!moveplayer(right, RIGHT))

games/battlestar/extern.h

274

extern int left, right, ahead, back;

games/battlestar/globals.c

249

int left, right, ahead, back;

games/battlestar/room.c

101

right = here.north;

games/battlestar/room.c

80

right = here.east;

games/battlestar/room.c

87

right = here.west;

games/battlestar/room.c

94

right = here.south;

games/worms/worms.c

330

op = &right[w->orientation];

games/worms/worms.c

89

right[8] = {

lib/libc/gen/tree.c

617

_rb_set_right(const struct rb_type *t, void *node, void *right)

lib/libc/gen/tree.c

620

struct rb_entry *rbr = (right == NULL) ? NULL : rb_n2e(t, right);

lib/libc/net/res_random.c

138

u_int left, right, tmp;

lib/libc/net/res_random.c

144

right = in & 0xff;

lib/libc/net/res_random.c

153

tmp = ru_prf->prf8[(i << (8 - 1)) | right] & 0x7f;

lib/libc/net/res_random.c

155

tmp = ru_prf->prf7[((i - 1) << (7 - 1)) | right];

lib/libc/net/res_random.c

157

left = right;

lib/libc/net/res_random.c

158

right = tmp;

lib/libc/net/res_random.c

161

return (right << 8) | left;

lib/libc/stdlib/tsearch.c

104

if (root->right != (struct node_t *)0)

lib/libc/stdlib/tsearch.c

105

trecurse(root->right, action, level + 1);

lib/libc/stdlib/tsearch.c

19

struct node_t *left, *right;

lib/libc/stdlib/tsearch.c

40

&(*rootp)->right; /* T4: follow right branch */

lib/libc/stdlib/tsearch.c

46

q->left = q->right = (struct node_t *)0;

lib/libc/stdlib/tsearch.c

69

&(*rootp)->right; /* follow right branch */

lib/libc/stdlib/tsearch.c

73

r = (*rootp)->right; /* D1: */

lib/libc/stdlib/tsearch.c

83

r->left = q->right;

lib/libc/stdlib/tsearch.c

85

q->right = (*rootp)->right;

lib/libc/stdlib/tsearch.c

97

if (root->left == (struct node_t *)0 && root->right == (struct node_t *)0)

lib/libcurses/base/lib_window.c

117

int right = wp->_line[y].lastchar + wp->_parx;

lib/libcurses/base/lib_window.c

120

CHANGED_RANGE(line, left, right);

lib/libcurses/base/lib_window.c

153

int right = pp->_line[win->_pary + y].lastchar - win->_parx;

lib/libcurses/base/lib_window.c

157

if (right > win->_maxx)

lib/libcurses/base/lib_window.c

158

right = win->_maxx;

lib/libcurses/base/lib_window.c

159

CHANGED_RANGE(line, left, right);

lib/libform/fld_def.c

101

p->right = _nc_Make_Argument(typ->right, ap, err);

lib/libform/fld_def.c

148

p->right = _nc_Copy_Argument(typ, argp->right, err);

lib/libform/fld_def.c

191

_nc_Free_Argument(typ->right, argp->right);

lib/libform/fld_ftlink.c

73

nftyp->right = type2;

lib/libform/fld_newftyp.c

143

if (typ->right)

lib/libform/fld_newftyp.c

144

typ->right->ref--;

lib/libform/form.h

177

struct typenode * right; /* ptr to operand for | */

lib/libform/form.priv.h

142

struct typearg *right;

lib/libform/frm_driver.c

1105

Check_Char(form, field, typ->right, ch, argp->right));

lib/libform/frm_driver.c

3053

Next_Choice(form, typ->right, field, argp->right));

lib/libform/frm_driver.c

3094

Previous_Choice(form, typ->right, field, argp->right));

lib/libform/frm_driver.c

3204

Check_Field(form, typ->right, field, argp->right));

lib/libform/fty_generic.c

183

p->right = GenericArgument(typ->right, argiterator, err);

lib/libmenu/m_driver.c

262

NAVIGATE(right);

lib/libmenu/m_global.c

412

item->right = ((col < (Number_Of_Columns - 1)) &&

lib/libmenu/m_global.c

461

item->right = ((i + Number_Of_Rows) < Number_Of_Items)

lib/libmenu/m_post.c

237

if (((hitem = hitem->right) != lasthor) && hitem)

lib/libmenu/menu.h

103

struct tagITEM *right;

sbin/unwind/libunbound/util/data/msgencode.c

132

prev = &p->right;

sbin/unwind/libunbound/util/data/msgencode.c

133

p = p->right;

sbin/unwind/libunbound/util/data/msgencode.c

189

n->right = 0;

sbin/unwind/libunbound/util/data/msgencode.c

235

newnode->right = prevnode;

sbin/unwind/libunbound/util/data/msgencode.c

85

struct compress_tree_node* right;

sbin/unwind/libunbound/util/rbtree.c

110

rbnode_type *right = node->right;

sbin/unwind/libunbound/util/rbtree.c

111

node->right = right->left;

sbin/unwind/libunbound/util/rbtree.c

112

if (right->left != RBTREE_NULL)

sbin/unwind/libunbound/util/rbtree.c

113

right->left->parent = node;

sbin/unwind/libunbound/util/rbtree.c

115

right->parent = node->parent;

sbin/unwind/libunbound/util/rbtree.c

119

node->parent->left = right;

sbin/unwind/libunbound/util/rbtree.c

121

node->parent->right = right;

sbin/unwind/libunbound/util/rbtree.c

124

rbtree->root = right;

sbin/unwind/libunbound/util/rbtree.c

126

right->left = node;

sbin/unwind/libunbound/util/rbtree.c

127

node->parent = right;

sbin/unwind/libunbound/util/rbtree.c

138

node->left = left->right;

sbin/unwind/libunbound/util/rbtree.c

139

if (left->right != RBTREE_NULL)

sbin/unwind/libunbound/util/rbtree.c

140

left->right->parent = node;

sbin/unwind/libunbound/util/rbtree.c

145

if (node == node->parent->right) {

sbin/unwind/libunbound/util/rbtree.c

146

node->parent->right = left;

sbin/unwind/libunbound/util/rbtree.c

153

left->right = node;

sbin/unwind/libunbound/util/rbtree.c

166

uncle = node->parent->parent->right;

sbin/unwind/libunbound/util/rbtree.c

181

if (node == node->parent->right) {

sbin/unwind/libunbound/util/rbtree.c

249

node = node->right;

sbin/unwind/libunbound/util/rbtree.c

255

data->left = data->right = RBTREE_NULL;

sbin/unwind/libunbound/util/rbtree.c

264

parent->right = data;

sbin/unwind/libunbound/util/rbtree.c

314

log_assert(parent->left == old || parent->right == old

sbin/unwind/libunbound/util/rbtree.c

315

|| parent->left == new || parent->right == new);

sbin/unwind/libunbound/util/rbtree.c

317

if(parent->right == old) parent->right = new;

sbin/unwind/libunbound/util/rbtree.c

337

if(to_delete->left != RBTREE_NULL && to_delete->right != RBTREE_NULL)

sbin/unwind/libunbound/util/rbtree.c

340

rbnode_type *smright = to_delete->right;

sbin/unwind/libunbound/util/rbtree.c

353

if(to_delete->right != smright)

sbin/unwind/libunbound/util/rbtree.c

359

change_child_ptr(smright->right, smright, to_delete);

sbin/unwind/libunbound/util/rbtree.c

360

change_child_ptr(smright->right, smright, to_delete);

sbin/unwind/libunbound/util/rbtree.c

362

if(to_delete->right != smright)

sbin/unwind/libunbound/util/rbtree.c

363

change_child_ptr(to_delete->right, to_delete, smright);

sbin/unwind/libunbound/util/rbtree.c

364

if(to_delete->right == smright)

sbin/unwind/libunbound/util/rbtree.c

367

to_delete->right = to_delete;

sbin/unwind/libunbound/util/rbtree.c

374

swap_np(&to_delete->right, &smright->right);

sbin/unwind/libunbound/util/rbtree.c

378

log_assert(to_delete->left == RBTREE_NULL || to_delete->right == RBTREE_NULL);

sbin/unwind/libunbound/util/rbtree.c

381

else child = to_delete->right;

sbin/unwind/libunbound/util/rbtree.c

401

to_delete->right = RBTREE_NULL;

sbin/unwind/libunbound/util/rbtree.c

413

if(child_parent->right == child) sibling = child_parent->left;

sbin/unwind/libunbound/util/rbtree.c

414

else sibling = child_parent->right;

sbin/unwind/libunbound/util/rbtree.c

428

if(child_parent->right == child)

sbin/unwind/libunbound/util/rbtree.c

432

if(child_parent->right == child) sibling = child_parent->left;

sbin/unwind/libunbound/util/rbtree.c

433

else sibling = child_parent->right;

sbin/unwind/libunbound/util/rbtree.c

439

&& sibling->right->color == BLACK)

sbin/unwind/libunbound/util/rbtree.c

447

if(child_parent->right == child) sibling = child_parent->left;

sbin/unwind/libunbound/util/rbtree.c

448

else sibling = child_parent->right;

sbin/unwind/libunbound/util/rbtree.c

456

&& sibling->right->color == BLACK)

sbin/unwind/libunbound/util/rbtree.c

468

if(child_parent->right == child

sbin/unwind/libunbound/util/rbtree.c

470

&& sibling->right->color == RED

sbin/unwind/libunbound/util/rbtree.c

474

sibling->right->color = BLACK;

sbin/unwind/libunbound/util/rbtree.c

477

if(child_parent->right == child) sibling = child_parent->left;

sbin/unwind/libunbound/util/rbtree.c

478

else sibling = child_parent->right;

sbin/unwind/libunbound/util/rbtree.c

483

&& sibling->right->color == BLACK)

sbin/unwind/libunbound/util/rbtree.c

489

if(child_parent->right == child) sibling = child_parent->left;

sbin/unwind/libunbound/util/rbtree.c

490

else sibling = child_parent->right;

sbin/unwind/libunbound/util/rbtree.c

496

if(child_parent->right == child)

sbin/unwind/libunbound/util/rbtree.c

504

log_assert(sibling->right->color == RED);

sbin/unwind/libunbound/util/rbtree.c

505

sibling->right->color = BLACK;

sbin/unwind/libunbound/util/rbtree.c

538

node = node->right;

sbin/unwind/libunbound/util/rbtree.c

562

for (node = rbtree->root; node->right != RBTREE_NULL; node = node->right);

sbin/unwind/libunbound/util/rbtree.c

575

if (node->right != RBTREE_NULL) {

sbin/unwind/libunbound/util/rbtree.c

577

for (node = node->right; node->left != RBTREE_NULL; node = node->left);

sbin/unwind/libunbound/util/rbtree.c

580

while (parent != RBTREE_NULL && node == parent->right) {

sbin/unwind/libunbound/util/rbtree.c

596

for (node = node->left; node->right != RBTREE_NULL; node = node->right);

sbin/unwind/libunbound/util/rbtree.c

616

traverse_post(func, arg, node->right);

sbin/unwind/libunbound/util/rbtree.h

61

rbnode_type *right;

sys/arch/hppa/gsc/harmony.c

1062

bits |= ((sc->sc_input_lvl.right >> (8 - GAINCTL_INPUT_BITS)) <<

sys/arch/hppa/gsc/harmony.c

1069

val = mask - (sc->sc_output_lvl.right >> (8 - GAINCTL_OUTPUT_BITS));

sys/arch/hppa/gsc/harmony.c

219

sc->sc_input_lvl.left = sc->sc_input_lvl.right = 240;

sys/arch/hppa/gsc/harmony.c

220

sc->sc_output_lvl.left = sc->sc_output_lvl.right = 244;

sys/arch/hppa/gsc/harmony.c

221

sc->sc_monitor_lvl.left = sc->sc_monitor_lvl.right = 208;

sys/arch/hppa/gsc/harmony.c

539

sc->sc_input_lvl.left = sc->sc_input_lvl.right =

sys/arch/hppa/gsc/harmony.c

544

sc->sc_input_lvl.right =

sys/arch/hppa/gsc/harmony.c

555

sc->sc_output_lvl.left = sc->sc_output_lvl.right =

sys/arch/hppa/gsc/harmony.c

560

sc->sc_output_lvl.right =

sys/arch/hppa/gsc/harmony.c

578

sc->sc_monitor_lvl.left = sc->sc_input_lvl.right =

sys/arch/hppa/gsc/harmony.c

626

sc->sc_input_lvl.right;

sys/arch/hppa/gsc/harmony.c

647

sc->sc_output_lvl.right;

sys/arch/hppa/gsc/harmonyvar.h

52

u_char left, right;

sys/arch/hppa/spmath/dbl_float.h

100

Extall(dst) = (Dallp2(leftb) << 31) | ((unsigned)Extall(right) >> 1) | \

sys/arch/hppa/spmath/dbl_float.h

101

Extlow(right)

sys/arch/hppa/spmath/dbl_float.h

416

#define Dbl_xortointp1(left,right,result) \

sys/arch/hppa/spmath/dbl_float.h

417

result = Dallp1(left) XOR Dallp1(right)

sys/arch/hppa/spmath/dbl_float.h

419

#define Dbl_xorfromintp1(left,right,result) \

sys/arch/hppa/spmath/dbl_float.h

420

Dallp1(result) = left XOR Dallp1(right)

sys/arch/hppa/spmath/dbl_float.h

422

#define Dbl_swap_lower(left,right) \

sys/arch/hppa/spmath/dbl_float.h

423

Dallp2(left) = Dallp2(left) XOR Dallp2(right); \

sys/arch/hppa/spmath/dbl_float.h

424

Dallp2(right) = Dallp2(left) XOR Dallp2(right); \

sys/arch/hppa/spmath/dbl_float.h

425

Dallp2(left) = Dallp2(left) XOR Dallp2(right)

sys/arch/hppa/spmath/dbl_float.h

95

#define Dbl_leftshiftby1_withextent(lefta,leftb,right,resulta,resultb) \

sys/arch/hppa/spmath/dbl_float.h

97

Shiftdouble(Dallp2(leftb), Extall(right), 31, Dallp2(resultb))

sys/arch/hppa/spmath/dbl_float.h

99

#define Dbl_rightshiftby1_withextent(leftb,right,dst) \

sys/arch/hppa/spmath/hppa.h

18

#define Shiftdouble(left,right,amount,dest) \

sys/arch/hppa/spmath/hppa.h

20

dest = ((left) << (32-(amount))) | ((unsigned int)(right) >> (amount))

sys/arch/hppa/spmath/hppa.h

23

#define Variableshiftdouble(left,right,amount,dest) \

sys/arch/hppa/spmath/hppa.h

25

if (amount == 0) dest = right; \

sys/arch/hppa/spmath/hppa.h

27

((unsigned) right >> (amount))

sys/arch/hppa/spmath/hppa.h

30

#define Variable_shift_double(left,right,amount,dest) \

sys/arch/hppa/spmath/hppa.h

32

dest = (left << (32-(amount))) | ((unsigned) right >> (amount))

sys/arch/hppa/spmath/sfadd.c

107

if (Sgl_isinfinity_exponent(right))

sys/arch/hppa/spmath/sfadd.c

109

if (Sgl_iszero_mantissa(right))

sys/arch/hppa/spmath/sfadd.c

112

*dstptr = right;

sys/arch/hppa/spmath/sfadd.c

118

if (Sgl_isone_signaling(right))

sys/arch/hppa/spmath/sfadd.c

124

Sgl_set_quiet(right);

sys/arch/hppa/spmath/sfadd.c

129

*dstptr = right;

sys/arch/hppa/spmath/sfadd.c

137

Sgl_copytoint_exponentmantissa(right,signless_upper_right);

sys/arch/hppa/spmath/sfadd.c

144

Sgl_xorfromintp1(save,right,/*to*/right);

sys/arch/hppa/spmath/sfadd.c

150

if((right_exponent = Sgl_exponent(right)) == 0)

sys/arch/hppa/spmath/sfadd.c

153

if(Sgl_iszero_mantissa(right))

sys/arch/hppa/spmath/sfadd.c

161

Sgl_or_signs(left,/*with*/right);

sys/arch/hppa/spmath/sfadd.c

165

Sgl_and_signs(left,/*with*/right);

sys/arch/hppa/spmath/sfadd.c

190

Sgl_clear_sign(right); /* Exponent is already cleared */

sys/arch/hppa/spmath/sfadd.c

198

Sgl_subtract(left,/*minus*/right,/*into*/result);

sys/arch/hppa/spmath/sfadd.c

215

Sgl_addition(left,right,/*into*/result);

sys/arch/hppa/spmath/sfadd.c

241

Sgl_clear_signexponent_set_hidden(right);

sys/arch/hppa/spmath/sfadd.c

258

Sgl_right_align(/*operand*/right,/*shifted by*/diff_exponent,

sys/arch/hppa/spmath/sfadd.c

269

Sgl_subtract_withextension(left,/*minus*/right,/*with*/extent,/*into*/result);

sys/arch/hppa/spmath/sfadd.c

27

register unsigned int left, right, result, extent;

sys/arch/hppa/spmath/sfadd.c

38

right = *rightptr;

sys/arch/hppa/spmath/sfadd.c

411

Sgl_addition(left,right,/*to*/result);

sys/arch/hppa/spmath/sfadd.c

42

Sgl_xortointp1(left,right,/*to*/save);

sys/arch/hppa/spmath/sfadd.c

51

if (Sgl_isnotnan(right))

sys/arch/hppa/spmath/sfadd.c

53

if (Sgl_isinfinity(right) && save!=0)

sys/arch/hppa/spmath/sfadd.c

87

else if (Sgl_is_signalingnan(right))

sys/arch/hppa/spmath/sfadd.c

93

Sgl_set_quiet(right);

sys/arch/hppa/spmath/sfadd.c

94

*dstptr = right;

sys/arch/hppa/spmath/sfcmp.c

103

if( Sgl_all(left) < Sgl_all(right) )

sys/arch/hppa/spmath/sfcmp.c

117

if( Sgl_all(left) > Sgl_all(right) )

sys/arch/hppa/spmath/sfcmp.c

28

register unsigned int left, right;

sys/arch/hppa/spmath/sfcmp.c

33

right = *rightptr;

sys/arch/hppa/spmath/sfcmp.c

38

|| (Sgl_exponent(right) == SGL_INFINITY_EXPONENT) )

sys/arch/hppa/spmath/sfcmp.c

47

( (Sgl_exponent(right) == SGL_INFINITY_EXPONENT)

sys/arch/hppa/spmath/sfcmp.c

48

&& Sgl_isnotzero_mantissa(right)

sys/arch/hppa/spmath/sfcmp.c

49

&& (Exception(cond) || Sgl_isone_signaling(right)) ) )

sys/arch/hppa/spmath/sfcmp.c

64

((Sgl_exponent(right) == SGL_INFINITY_EXPONENT)

sys/arch/hppa/spmath/sfcmp.c

65

&& Sgl_isnotzero_mantissa(right)) )

sys/arch/hppa/spmath/sfcmp.c

75

Sgl_xortointp1(left,right,xorresult);

sys/arch/hppa/spmath/sfcmp.c

81

&& Sgl_iszero_exponentmantissa(right) )

sys/arch/hppa/spmath/sfcmp.c

96

else if( Sgl_all(left) == Sgl_all(right) )

sys/arch/hppa/spmath/sfsub.c

105

if (Sgl_isinfinity_exponent(right))

sys/arch/hppa/spmath/sfsub.c

107

if (Sgl_iszero_mantissa(right))

sys/arch/hppa/spmath/sfsub.c

110

Sgl_invert_sign(right);

sys/arch/hppa/spmath/sfsub.c

111

*dstptr = right;

sys/arch/hppa/spmath/sfsub.c

117

if (Sgl_isone_signaling(right))

sys/arch/hppa/spmath/sfsub.c

123

Sgl_set_quiet(right);

sys/arch/hppa/spmath/sfsub.c

128

*dstptr = right;

sys/arch/hppa/spmath/sfsub.c

136

Sgl_copytoint_exponentmantissa(right,signless_upper_right);

sys/arch/hppa/spmath/sfsub.c

143

Sgl_xorfromintp1(save,right,/*to*/right);

sys/arch/hppa/spmath/sfsub.c

150

if((right_exponent = Sgl_exponent(right)) == 0)

sys/arch/hppa/spmath/sfsub.c

153

if(Sgl_iszero_mantissa(right))

sys/arch/hppa/spmath/sfsub.c

159

Sgl_invert_sign(right);

sys/arch/hppa/spmath/sfsub.c

162

Sgl_or_signs(left,/*with*/right);

sys/arch/hppa/spmath/sfsub.c

166

Sgl_and_signs(left,/*with*/right);

sys/arch/hppa/spmath/sfsub.c

192

Sgl_clear_sign(right); /* Exponent is already cleared */

sys/arch/hppa/spmath/sfsub.c

200

Sgl_subtract(left,/*minus*/right,/*into*/result);

sys/arch/hppa/spmath/sfsub.c

217

Sgl_addition(left,right,/*into*/result);

sys/arch/hppa/spmath/sfsub.c

244

Sgl_clear_signexponent_set_hidden(right);

sys/arch/hppa/spmath/sfsub.c

261

Sgl_right_align(/*operand*/right,/*shifted by*/diff_exponent,

sys/arch/hppa/spmath/sfsub.c

27

register unsigned int left, right, result, extent;

sys/arch/hppa/spmath/sfsub.c

272

Sgl_subtract_withextension(left,/*minus*/right,/*with*/extent,/*into*/result);

sys/arch/hppa/spmath/sfsub.c

36

right = *rightptr;

sys/arch/hppa/spmath/sfsub.c

40

Sgl_xortointp1(left,right,/*to*/save);

sys/arch/hppa/spmath/sfsub.c

414

Sgl_addition(left,right,/*to*/result);

sys/arch/hppa/spmath/sfsub.c

49

if (Sgl_isnotnan(right))

sys/arch/hppa/spmath/sfsub.c

51

if (Sgl_isinfinity(right) && save==0)

sys/arch/hppa/spmath/sfsub.c

85

else if (Sgl_is_signalingnan(right))

sys/arch/hppa/spmath/sfsub.c

91

Sgl_set_quiet(right);

sys/arch/hppa/spmath/sfsub.c

92

*dstptr = right;

sys/arch/hppa/spmath/sgl_float.h

234

#define Sgl_subtract_withextension(left,right,extent,result) \

sys/arch/hppa/spmath/sgl_float.h

236

Sgl_subtract(left,right,result); \

sys/arch/hppa/spmath/sgl_float.h

243

#define Sgl_xortointp1(left,right,result) \

sys/arch/hppa/spmath/sgl_float.h

244

result = Sall(left) XOR Sall(right);

sys/arch/hppa/spmath/sgl_float.h

246

#define Sgl_xorfromintp1(left,right,result) \

sys/arch/hppa/spmath/sgl_float.h

247

Sall(result) = left XOR Sall(right)

sys/arch/hppa/spmath/sgl_float.h

59

#define Sgl_leftshiftby1_withextent(left,right,result) \

sys/arch/hppa/spmath/sgl_float.h

60

Shiftdouble(Sall(left),Extall(right),31,Sall(result))

sys/arch/hppa/spmath/sgl_float.h

62

#define Sgl_rightshiftby1_withextent(left,right,dst) \

sys/arch/hppa/spmath/sgl_float.h

63

Shiftdouble(Sall(left),Extall(right),1,Extall(right))

sys/arch/macppc/dev/aoa.c

133

aoa_set_volume(struct aoa_softc *sc, int left, int right)

sys/arch/macppc/dev/awacs.c

1036

awacs_set_speaker_volume(struct awacs_softc *sc, int left, int right)

sys/arch/macppc/dev/awacs.c

1039

int rval = 15 - (right & 0xff) / 16;

sys/arch/macppc/dev/awacs.c

1049

awacs_set_ext_volume(struct awacs_softc *sc, int left, int right)

sys/arch/macppc/dev/awacs.c

1052

int rval = 15 - (right & 0xff) / 16;

sys/arch/macppc/dev/daca.c

161

daca_set_volume(struct daca_softc *sc, int left, int right)

sys/arch/macppc/dev/daca.c

166

sc->sc_vol_r = right;

sys/arch/macppc/dev/daca.c

169

right >>= 2;

sys/arch/macppc/dev/daca.c

170

data = left << 8 | right;

sys/arch/macppc/dev/onyx.c

172

onyx_set_volume(struct onyx_softc *sc, int left, int right)

sys/arch/macppc/dev/onyx.c

177

sc->sc_vol_r = right;

sys/arch/macppc/dev/onyx.c

183

data = 128 + (right >> 1);

sys/arch/macppc/dev/snapper.c

487

snapper_set_volume(struct snapper_softc *sc, int left, int right)

sys/arch/macppc/dev/snapper.c

494

sc->sc_vol_r = right;

sys/arch/macppc/dev/snapper.c

497

r = nentries - (right * nentries / 256);

sys/arch/macppc/dev/snapper.c

501

right, r, nentries);

sys/arch/macppc/dev/tumbler.c

299

tumbler_set_volume(struct tumbler_softc *sc, int left, int right)

sys/arch/macppc/dev/tumbler.c

304

sc->sc_vol_r = right;

sys/arch/macppc/dev/tumbler.c

307

right <<= 6;

sys/arch/macppc/dev/tumbler.c

312

vol[3] = right >> 16;

sys/arch/macppc/dev/tumbler.c

313

vol[4] = right >> 8;

sys/arch/macppc/dev/tumbler.c

314

vol[5] = right;

sys/arch/sparc64/dev/ce4231var.h

52

u_int8_t right;

sys/dev/isa/ad1848.c

664

atten = ((AUDIO_MAX_GAIN - gp->right) * info->atten_bits) /

sys/dev/isa/ad1848.c

693

DPRINTF(("ad1848_set_rec_gain: %d:%d\n", gp->left, gp->right));

sys/dev/isa/ad1848.c

702

gain = (gp->right * GAIN_22_5) / AUDIO_MAX_GAIN;

sys/dev/isa/ad1848.c

755

gp->left = gp->right = AUDIO_MAX_GAIN;

sys/dev/isa/ad1848.c

757

gp->left = gp->right = AUDIO_MIN_GAIN;

sys/dev/isa/ad1848var.h

142

vol->left = vol->right = cp->un.value.level[AUDIO_MIXER_LEVEL_MONO];

sys/dev/isa/ad1848var.h

147

vol->right = cp->un.value.level[AUDIO_MIXER_LEVEL_RIGHT];

sys/dev/isa/ad1848var.h

162

cp->un.value.level[AUDIO_MIXER_LEVEL_RIGHT] = vol->right;

sys/dev/isa/ad1848var.h

44

u_char right;

sys/dev/isa/ess.c

2102

int gain, left, right;

sys/dev/isa/ess.c

2176

right = sc->gain[port][ESS_RIGHT];

sys/dev/isa/ess.c

2178

left = right = 0;

sys/dev/isa/ess.c

2182

gain = ESS_STEREO_GAIN(left, right);

sys/dev/isa/gus.c

2291

vol.left = vol.right = AUDIO_MAX_GAIN;

sys/dev/isa/gus.c

2293

vol.left = vol.right = AUDIO_MIN_GAIN;

sys/dev/isa/gus.c

2378

vol.right = ic->sc_setting[GUSMIX_CHAN_MASTER][ICSMIX_RIGHT];

sys/dev/isa/gus.c

2387

vol.right = ic->sc_setting[GUSMIX_CHAN_MIC][ICSMIX_RIGHT];

sys/dev/isa/gus.c

2396

vol.right = ic->sc_setting[GUSMIX_CHAN_LINE][ICSMIX_RIGHT];

sys/dev/isa/gus.c

2406

vol.right = ic->sc_setting[GUSMIX_CHAN_CD][ICSMIX_RIGHT];

sys/dev/isa/gus.c

2415

vol.right = ic->sc_setting[GUSMIX_CHAN_DAC][ICSMIX_RIGHT];

sys/dev/isa/gus.c

2582

vol.right);

sys/dev/isa/gus.c

2598

vol.right);

sys/dev/isa/gus.c

2614

vol.right);

sys/dev/isa/gus.c

2631

vol.right);

sys/dev/isa/gus.c

2647

vol.right);

sys/dev/isa/gusvar.h

217

u_char right;

sys/dev/isa/sbreg.h

150

#define SB_STEREO_GAIN(left, right) ((left) | ((right) >> 4))

sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c

4986

int left, right;

sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c

5005

right = caps->data_points - 1;

sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c

5006

while (left <= right) {

sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c

5007

int mid = left + (right - left) / 2;

sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c

5019

right = mid - 1;

sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c

5027

lower_signal = caps->luminance_data[right].input_signal;

sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c

5029

lower_lum = caps->luminance_data[right].luminance;

sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c

5033

if (right == left || !lower_lum)

sys/dev/pci/drm/amd/display/dc/inc/hw/transform.h

121

int right;

sys/dev/pci/drm/amd/display/modules/color/color_gamma.c

623

struct fixed31_32 left, right;

sys/dev/pci/drm/amd/display/modules/color/color_gamma.c

632

right = axis_x[i + 1].r;

sys/dev/pci/drm/amd/display/modules/color/color_gamma.c

634

right = axis_x[max_number - 1].r;

sys/dev/pci/drm/amd/display/modules/color/color_gamma.c

639

right = axis_x[i + 1].g;

sys/dev/pci/drm/amd/display/modules/color/color_gamma.c

641

right = axis_x[max_number - 1].g;

sys/dev/pci/drm/amd/display/modules/color/color_gamma.c

646

right = axis_x[i + 1].b;

sys/dev/pci/drm/amd/display/modules/color/color_gamma.c

648

right = axis_x[max_number - 1].b;

sys/dev/pci/drm/amd/display/modules/color/color_gamma.c

652

dc_fixpt_le(hw_point, right)) {

sys/dev/pci/drm/amd/display/modules/color/color_gamma.c

674

dc_fixpt_le(right, hw_point)) {

sys/dev/pci/drm/display/drm_hdmi_helper.c

160

frame->right_bar = conn_state->tv.margins.right;

sys/dev/pci/drm/drm_atomic_state_helper.c

494

state->tv.margins.right = cmdline->tv_margins.right;

sys/dev/pci/drm/drm_atomic_state_helper.c

608

old_conn_state->tv.margins.right != new_conn_state->tv.margins.right ||

sys/dev/pci/drm/drm_atomic_uapi.c

706

state->tv.margins.right = val;

sys/dev/pci/drm/drm_atomic_uapi.c

820

*val = state->tv.margins.right;

sys/dev/pci/drm/drm_buddy.c

185

return parent->right;

sys/dev/pci/drm/drm_buddy.c

450

block->right = drm_block_alloc(mm, block, block_order,

sys/dev/pci/drm/drm_buddy.c

452

if (!block->right) {

sys/dev/pci/drm/drm_buddy.c

461

mark_cleared(block->right);

sys/dev/pci/drm/drm_buddy.c

466

mark_free(mm, block->right);

sys/dev/pci/drm/drm_buddy.c

682

list_add(&block->right->tmp_link, &dfs);

sys/dev/pci/drm/drm_buddy.c

801

block = block->right;

sys/dev/pci/drm/drm_buddy.c

871

list_add(&block->right->tmp_link, dfs);

sys/dev/pci/drm/drm_modes.c

2217

mode->tv_margins.right = margin;

sys/dev/pci/drm/i915/display/intel_sdvo.c

141

struct drm_property *right;

sys/dev/pci/drm/i915/display/intel_sdvo.c

2397

property == intel_sdvo_connector->right)

sys/dev/pci/drm/i915/display/intel_sdvo.c

2454

property == intel_sdvo_connector->right)

sys/dev/pci/drm/i915/display/intel_sdvo.c

3165

intel_sdvo_connector->right =

sys/dev/pci/drm/i915/display/intel_sdvo.c

3167

if (!intel_sdvo_connector->right)

sys/dev/pci/drm/i915/display/intel_sdvo.c

3171

intel_sdvo_connector->right, 0);

sys/dev/pci/drm/i915/display/intel_tv.c

1341

conn_state->tv.margins.right);

sys/dev/pci/drm/i915/display/intel_tv.c

1558

conn_state->tv.margins.right);

sys/dev/pci/drm/i915/display/intel_tv.c

1865

old_state->tv.margins.right != new_state->tv.margins.right ||

sys/dev/pci/drm/i915/display/intel_tv.c

1897

conn_state->tv.margins.right = 46;

sys/dev/pci/drm/i915/display/intel_tv.c

1923

conn_state->tv.margins.right);

sys/dev/pci/drm/i915/display/intel_vbt_defs.h

1282

u8 right; /* 238+ */

sys/dev/pci/drm/i915/gvt/handlers.c

769

int left = 0, right = ARRAY_SIZE(force_nonpriv_white_list);

sys/dev/pci/drm/i915/gvt/handlers.c

772

while (left < right) {

sys/dev/pci/drm/i915/gvt/handlers.c

773

int mid = (left + right)/2;

sys/dev/pci/drm/i915/gvt/handlers.c

778

right = mid;

sys/dev/pci/drm/include/drm/drm_buddy.h

37

struct drm_buddy_block *right;

sys/dev/pci/drm/include/drm/drm_connector.h

890

unsigned int right;

sys/dev/sbus/cs4231.c

245

sc->sc_volume[CSPORT_SPEAKER].right = 192;

sys/dev/sbus/cs4231.c

398

rm |= ((~(sc->sc_volume[CSPORT_SPEAKER].right >> 2)) &

sys/dev/sbus/cs4231.c

447

rm |= pc | (sc->sc_adc.right >> 4);

sys/dev/sbus/cs4231.c

717

sc->sc_volume[CSPORT_SPEAKER].right =

sys/dev/sbus/cs4231.c

723

sc->sc_volume[CSPORT_SPEAKER].right =

sys/dev/sbus/cs4231.c

786

sc->sc_adc.right =

sys/dev/sbus/cs4231.c

791

sc->sc_adc.right =

sys/dev/sbus/cs4231.c

908

sc->sc_volume[CSPORT_SPEAKER].right;

sys/dev/sbus/cs4231.c

960

sc->sc_adc.right;

sys/dev/sbus/cs4231var.h

52

u_int8_t right;

sys/dev/wscons/wsdisplay.c

2944

u_int right;

sys/dev/wscons/wsdisplay.c

2963

right = skip_spc_right(scr, BORDER);

sys/dev/wscons/wsdisplay.c

2964

if (right)

sys/dev/wscons/wsdisplay.c

2979

u_int right;

sys/dev/wscons/wsdisplay.c

2992

right = skip_char_right(scr, scr->cpy_end);

sys/dev/wscons/wsdisplay.c

2995

right = skip_spc_right(scr, NO_BORDER);

sys/dev/wscons/wsdisplay.c

3000

scr->cpy_end += right;

sys/dev/wscons/wsdisplay.c

3076

u_int right;

sys/dev/wscons/wsdisplay.c

3085

right = skip_spc_right(scr, BORDER);

sys/dev/wscons/wsdisplay.c

3093

scr->cpy_start += (right + 1);

sys/dev/wscons/wsdisplay.c

3104

scr->orig_start += (right + 1);

sys/dev/wscons/wstpad.c

1658

tp->edge.right = (offset ? input->hw.x_max - offset : INT_MAX);

sys/dev/wscons/wstpad.c

186

int right;

sys/dev/wscons/wstpad.c

407

else if (x >= tp->edge.right)

sys/kern/subr_tree.c

604

_rb_set_right(const struct rb_type *t, void *node, void *right)

sys/kern/subr_tree.c

607

struct rb_entry *rbr = (right == NULL) ? NULL : rb_n2e(t, right);

sys/sys/tree.h

107

#define SPLAY_ASSEMBLE(head, node, left, right, field) do { \

sys/sys/tree.h

109

SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\

sys/sys/tree.h

915

_name##_RBT_SET_RIGHT(struct _type *elm, struct _type *right) \

sys/sys/tree.h

917

_rb_set_right(_name##_RBT_TYPE, elm, right); \

sys/uvm/uvm_map.c

692

struct vm_map_entry *left, *right;

sys/uvm/uvm_map.c

697

if ((right = RBT_RIGHT(uvm_map_addr, entry)) != NULL)

sys/uvm/uvm_map.c

698

augment = MAX(augment, right->fspace_augment);

usr.bin/awk/b.c

307

penter(right(p));

usr.bin/awk/b.c

309

parent(right(p)) = p;

usr.bin/awk/b.c

334

freetr(right(p));

usr.bin/awk/b.c

499

f->re[info(v)].lval.np = right(v);

usr.bin/awk/b.c

520

cfoll(f,right(v));

usr.bin/awk/b.c

549

if (type(p) == CCL && (*(int *) right(p)) == 0)

usr.bin/awk/b.c

561

if (first(left(p)) == 0 && first(right(p)) == 0) return(0);

usr.bin/awk/b.c

564

b = first(right(p));

usr.bin/awk/b.c

595

if (first(right(p)) == 0) {

usr.bin/awk/b.c

649

const gtte *left, *right;

usr.bin/awk/b.c

652

right = (const gtte *) r;

usr.bin/awk/b.c

654

return left->ch - right->ch;

usr.bin/cdio/cdio.c

1406

setvol(int left, int right)

usr.bin/cdio/cdio.c

1411

v.vol[1] = right;

usr.bin/ctags/ctags.h

53

*right; /* left and right sons */

usr.bin/ctags/print.c

107

if (node->right)

usr.bin/ctags/print.c

108

put_entries(node->right);

usr.bin/ctags/tree.c

117

else if (cur_node->right)

usr.bin/ctags/tree.c

118

add_node(node, cur_node->right);

usr.bin/ctags/tree.c

120

cur_node->right = node;

usr.bin/ctags/tree.c

128

free_tree(node->right);

usr.bin/ctags/tree.c

80

np->left = np->right = 0;

usr.bin/make/cond.c

568

double left, right;

usr.bin/make/cond.c

579

right = 0.0;

usr.bin/make/cond.c

581

if (!CondCvtArg(string, &right)) {

usr.bin/make/cond.c

592

if (!CondCvtArg(rhs, &right))

usr.bin/make/cond.c

603

right, op);

usr.bin/make/cond.c

610

t = left != right ? True : False;

usr.bin/make/cond.c

617

t = left == right ? True : False;

usr.bin/make/cond.c

621

t = left <= right ? True : False;

usr.bin/make/cond.c

623

t = left < right ? True : False;

usr.bin/make/cond.c

627

t = left >= right ? True : False;

usr.bin/make/cond.c

629

t = left > right ? True : False;

usr.bin/mandoc/eqn.c

496

free(bp->right);

usr.bin/mandoc/eqn.c

943

parent->right = mandoc_strdup("\\[rc]");

usr.bin/mandoc/eqn.c

945

parent->right = mandoc_strdup("\\[rf]");

usr.bin/mandoc/eqn.c

947

parent->right =

usr.bin/mandoc/eqn.h

62

char *right; /* Right-hand fence. */

usr.bin/mandoc/eqn_html.c

199

if (NULL != bp->left || NULL != bp->right)

usr.bin/mandoc/eqn_html.c

202

"close", bp->right == NULL ? "" : bp->right);

usr.bin/mandoc/eqn_term.c

168

term_word(p, bp->right != NULL ? bp->right : ")");

usr.bin/mandoc/tree.c

361

if (ep->right)

usr.bin/mandoc/tree.c

362

printf(" right=\"%s\"", ep->right);

usr.bin/mg/match.c

29

char left, right;

usr.bin/mg/match.c

78

for (i = 0; bal[i].right != '\0'; i++)

usr.bin/mg/match.c

79

if (bal[i].right == rbal) {

usr.bin/sdiff/edit.c

104

if (right == NULL)

usr.bin/sdiff/edit.c

108

if (asprintf(&text, "%s\n%s\n", left, right) == -1)

usr.bin/sdiff/edit.c

126

if (right == NULL)

usr.bin/sdiff/edit.c

129

if (asprintf(&text, "%s\n", right) == -1)

usr.bin/sdiff/edit.c

82

eparse(const char *cmd, const char *left, const char *right)

usr.bin/sdiff/sdiff.c

42

char *right;

usr.bin/sdiff/sdiff.c

797

enqueue(char *left, char div, char *right)

usr.bin/sdiff/sdiff.c

805

diffp->right = right;

usr.bin/sdiff/sdiff.c

816

free(diffp->right);

usr.bin/sdiff/sdiff.c

894

char divc, *left, *right;

usr.bin/sdiff/sdiff.c

904

right = NULL;

usr.bin/sdiff/sdiff.c

916

println(diffp->left, diffp->div, diffp->right);

usr.bin/sdiff/sdiff.c

921

if (diffp->right)

usr.bin/sdiff/sdiff.c

922

astrcat(&right, diffp->right);

usr.bin/sdiff/sdiff.c

939

prompt(left, right);

usr.bin/sdiff/sdiff.c

947

free(right);

usr.bin/tmux/format-draw.c

170

u_int ocy, struct screen *left, struct screen *centre, struct screen *right,

usr.bin/tmux/format-draw.c

177

width_right = right->cx;

usr.bin/tmux/format-draw.c

197

format_draw_put(octx, ocx, ocy, right, frs,

usr.bin/tmux/format-draw.c

199

right->cx - width_right,

usr.bin/tmux/format-draw.c

229

u_int ocy, struct screen *left, struct screen *centre, struct screen *right,

usr.bin/tmux/format-draw.c

240

width_right = right->cx;

usr.bin/tmux/format-draw.c

273

right, abs_centre, frs);

usr.bin/tmux/format-draw.c

281

format_draw_put(octx, ocx, ocy, right, frs,

usr.bin/tmux/format-draw.c

283

right->cx - width_right,

usr.bin/tmux/format-draw.c

332

u_int ocy, struct screen *left, struct screen *centre, struct screen *right,

usr.bin/tmux/format-draw.c

343

width_right = right->cx;

usr.bin/tmux/format-draw.c

376

right, abs_centre, frs);

usr.bin/tmux/format-draw.c

384

format_draw_put(octx, ocx, ocy, right, frs,

usr.bin/tmux/format-draw.c

386

right->cx - width_right,

usr.bin/tmux/format-draw.c

440

u_int ocy, struct screen *left, struct screen *centre, struct screen *right,

usr.bin/tmux/format-draw.c

451

width_right = right->cx;

usr.bin/tmux/format-draw.c

479

screen_write_start(&ctx, right);

usr.bin/tmux/format-draw.c

484

right, abs_centre, frs);

usr.bin/tmux/format-draw.c

501

format_draw_put(octx, ocx, ocy, right, frs,

usr.bin/tmux/format-draw.c

547

struct screen *right, struct screen *abs_centre, struct screen *list,

usr.bin/tmux/format-draw.c

556

width_right = right->cx;

usr.bin/tmux/format-draw.c

593

format_draw_put(octx, ocx, ocy, right, frs,

usr.bin/tmux/format-draw.c

595

right->cx - width_right,

usr.bin/tmux/format.c

4196

char **right, int expand)

usr.bin/tmux/format.c

4210

*right = format_expand1(es, right0);

usr.bin/tmux/format.c

4214

*right = right0;

usr.bin/tmux/format.c

4800

char *endch, *value, *left = NULL, *right = NULL;

usr.bin/tmux/format.c

4861

if (format_choose(es, copy, &left, &right, 1) != 0) {

usr.bin/tmux/format.c

4872

mright = strtod(right, &endch);

usr.bin/tmux/format.c

4874

format_log(es, "expression right side is invalid: %s", right);

usr.bin/tmux/format.c

4926

free(right);

usr.bin/tmux/format.c

4931

free(right);

usr.bin/tmux/format.c

4948

char *value, *left, *right;

usr.bin/tmux/format.c

5228

if (format_choose(es, copy, &left, &right, 1) != 0) {

usr.bin/tmux/format.c

5232

nrep = strtonum(right, 1, FORMAT_MAX_REPEAT, &errstr);

usr.bin/tmux/format.c

5243

free(right);

usr.bin/tmux/format.c

5257

if (format_choose(es, copy, &left, &right, 1) != 0) {

usr.bin/tmux/format.c

5263

format_log(es, "compare %s right is: %s", cmp->modifier, right);

usr.bin/tmux/format.c

5266

if (strcmp(left, right) == 0)

usr.bin/tmux/format.c

5271

if (strcmp(left, right) != 0)

usr.bin/tmux/format.c

5276

if (strcmp(left, right) < 0)

usr.bin/tmux/format.c

5281

if (strcmp(left, right) > 0)

usr.bin/tmux/format.c

5286

if (strcmp(left, right) <= 0)

usr.bin/tmux/format.c

5291

if (strcmp(left, right) >= 0)

usr.bin/tmux/format.c

5296

value = format_match(cmp, left, right);

usr.bin/tmux/format.c

5298

free(right);

usr.bin/tmux/format.c

5351

right = xstrndup(cp, cp2 - cp);

usr.bin/tmux/format.c

5352

value = format_expand1(es, right);

usr.bin/tmux/format.c

5353

free(right);

usr.bin/tmux/format.c

5412

right = format_expand1(es, sub[i]->argv[1]);

usr.bin/tmux/format.c

5413

new = format_sub(sub[i], value, left, right);

usr.bin/tmux/format.c

5414

format_log(es, "substitute '%s' to '%s': %s", left, right, new);

usr.bin/tmux/format.c

5417

free(right);

usr.bin/tmux/hyperlinks.c

105

struct hyperlinks_uri *right)

usr.bin/tmux/hyperlinks.c

107

return (left->inner - right->inner);

usr.bin/tmux/hyperlinks.c

76

hyperlinks_by_uri_cmp(struct hyperlinks_uri *left, struct hyperlinks_uri *right)

usr.bin/tmux/hyperlinks.c

80

if (*left->internal_id == '\0' || *right->internal_id == '\0') {

usr.bin/tmux/hyperlinks.c

88

if (*right->internal_id != '\0')

usr.bin/tmux/hyperlinks.c

90

return (left->inner - right->inner);

usr.bin/tmux/hyperlinks.c

93

r = strcmp(left->internal_id, right->internal_id);

usr.bin/tmux/hyperlinks.c

96

return (strcmp(left->uri, right->uri));

usr.bin/tmux/screen-redraw.c

344

u_int right, line;

usr.bin/tmux/screen-redraw.c

365

right = wp->xoff + 2 + wp->status_size - 1;

usr.bin/tmux/screen-redraw.c

367

if (py == line && px >= wp->xoff + 2 && px <= right)

usr.bin/tmux/screen-write.c

647

screen_write_hline(struct screen_write_ctx *ctx, u_int nx, int left, int right,

usr.bin/tmux/screen-write.c

673

if (right)

usr.bin/tmux/tty-keys.c

481

tkp = &tk->right;

usr.bin/tmux/tty-keys.c

560

if (tk->right != NULL)

usr.bin/tmux/tty-keys.c

561

tty_keys_free1(tk->right);

usr.bin/tmux/tty-keys.c

601

tk = tk->right;

usr.bin/tmux/tty-keys.c

70

struct tty_key *right;

usr.bin/tmux/window-tree.c

1169

if (data->right != -1 && x >= (u_int)data->right)

usr.bin/tmux/window-tree.c

129

int right;

usr.bin/tmux/window-tree.c

431

int colour, active_colour, left, right;

usr.bin/tmux/window-tree.c

473

right = (end != total);

usr.bin/tmux/window-tree.c

474

if (((left && right) && sx <= 6) || ((left || right) && sx <= 3))

usr.bin/tmux/window-tree.c

475

left = right = 0;

usr.bin/tmux/window-tree.c

476

if (left && right) {

usr.bin/tmux/window-tree.c

479

} else if (left || right) {

usr.bin/tmux/window-tree.c

497

if (right) {

usr.bin/tmux/window-tree.c

498

data->right = cx + sx - 3;

usr.bin/tmux/window-tree.c

504

data->right = -1;

usr.bin/tmux/window-tree.c

566

int colour, active_colour, left, right;

usr.bin/tmux/window-tree.c

608

right = (end != total);

usr.bin/tmux/window-tree.c

609

if (((left && right) && sx <= 6) || ((left || right) && sx <= 3))

usr.bin/tmux/window-tree.c

610

left = right = 0;

usr.bin/tmux/window-tree.c

611

if (left && right) {

usr.bin/tmux/window-tree.c

614

} else if (left || right) {

usr.bin/tmux/window-tree.c

632

if (right) {

usr.bin/tmux/window-tree.c

633

data->right = cx + sx - 3;

usr.bin/tmux/window-tree.c

639

data->right = -1;

usr.bin/tmux/window.c

1411

u_int edge, left, right, end, size;

usr.bin/tmux/window.c

1438

right = xoff + sx;

usr.bin/tmux/window.c

1449

if (xoff < left && end > right)

usr.bin/tmux/window.c

1451

else if (xoff >= left && xoff <= right)

usr.bin/tmux/window.c

1453

else if (end >= left && end <= right)

usr.bin/tmux/window.c

1472

u_int edge, left, right, end, size;

usr.bin/tmux/window.c

1499

right = wp->xoff + wp->sx;

usr.bin/tmux/window.c

1510

if (xoff < left && end > right)

usr.bin/tmux/window.c

1512

else if (xoff >= left && xoff <= right)

usr.bin/tmux/window.c

1514

else if (end >= left && end <= right)

usr.sbin/bgpd/chash.c

624

struct ch_group *left = NULL, *right = NULL;

usr.sbin/bgpd/chash.c

637

if (ch_sub_alloc(type, t, &right, &rightmeta) == -1)

usr.sbin/bgpd/chash.c

641

if (ch_sub_split(type, table, left, right,

usr.sbin/bgpd/chash.c

652

ch_table_fill(t, idx | 1, right, rightmeta);

usr.sbin/bgpd/chash.c

658

ch_sub_free(type, t, right, rightmeta);

usr.sbin/dhcpd/tree.c

112

tree_concat(struct tree *left, struct tree *right)

usr.sbin/dhcpd/tree.c

122

return right;

usr.sbin/dhcpd/tree.c

123

if (!right)

usr.sbin/dhcpd/tree.c

127

if (left->op == TREE_CONST && right->op == TREE_CONST) {

usr.sbin/dhcpd/tree.c

131

+ right->data.const_val.len);

usr.sbin/dhcpd/tree.c

138

right->data.const_val.data, right->data.const_val.len);

usr.sbin/dhcpd/tree.c

140

free(right->data.const_val.data);

usr.sbin/dhcpd/tree.c

142

left->data.const_val.len += right->data.const_val.len;

usr.sbin/dhcpd/tree.c

143

free(right);

usr.sbin/dhcpd/tree.c

153

nt->data.concat.right = right;

usr.sbin/dhcpd/tree.c

249

tree->data.concat.right);

usr.sbin/dhcpd/tree.h

60

struct tree *right;

usr.sbin/ifstated/ifstated.c

537

expression->right->truth;

usr.sbin/ifstated/ifstated.c

541

expression->right->truth;

usr.sbin/ifstated/ifstated.c

544

expression->truth = !expression->right->truth;

usr.sbin/ifstated/ifstated.c

746

if (expression->right != NULL)

usr.sbin/ifstated/ifstated.c

747

remove_expression(expression->right, state);

usr.sbin/ifstated/ifstated.h

86

struct ifsd_expression *right;

usr.sbin/ifstated/parse.y

302

$$->right = $2;

usr.sbin/ifstated/parse.y

312

$$->right = $3;

usr.sbin/ifstated/parse.y

322

$$->right = $3;

usr.sbin/ifstated/parse.y

909

if (expression->right != NULL)

usr.sbin/ifstated/parse.y

910

set_expression_depth(expression->right, depth + 1);

usr.sbin/map-mbone/mapper.c

116

n->left = n->right = 0;

usr.sbin/map-mbone/mapper.c

123

return find_node(addr, &(n->right));

usr.sbin/map-mbone/mapper.c

593

return retry_requests(node->right) || result;

usr.sbin/map-mbone/mapper.c

671

print_map(node->right);

usr.sbin/map-mbone/mapper.c

729

graph_edges(node->right);

usr.sbin/map-mbone/mapper.c

751

elide_aliases(node->right);

usr.sbin/map-mbone/mapper.c

77

struct node *left, *right;

usr.sbin/nsd/dname.c

291

dname_is_subdomain(const dname_type *left, const dname_type *right)

usr.sbin/nsd/dname.c

295

if (left->label_count < right->label_count)

usr.sbin/nsd/dname.c

298

for (i = 1; i < right->label_count; ++i) {

usr.sbin/nsd/dname.c

300

dname_label(right, i)) != 0)

usr.sbin/nsd/dname.c

314

const dname_type *left, *right;

usr.sbin/nsd/dname.c

317

right = b;

usr.sbin/nsd/dname.c

320

assert(right);

usr.sbin/nsd/dname.c

322

if (left == right) {

usr.sbin/nsd/dname.c

326

label_count = (left->label_count <= right->label_count

usr.sbin/nsd/dname.c

328

: right->label_count);

usr.sbin/nsd/dname.c

333

dname_label(right, i));

usr.sbin/nsd/dname.c

342

return (int) left->label_count - (int) right->label_count;

usr.sbin/nsd/dname.c

347

label_compare(const uint8_t *left, const uint8_t *right)

usr.sbin/nsd/dname.c

355

assert(right);

usr.sbin/nsd/dname.c

358

assert(label_is_normal(right));

usr.sbin/nsd/dname.c

361

right_length = label_length(right);

usr.sbin/nsd/dname.c

364

result = memcmp(label_data(left), label_data(right), size);

usr.sbin/nsd/dname.c

376

dname_label_match_count(const dname_type *left, const dname_type *right)

usr.sbin/nsd/dname.c

381

assert(right);

usr.sbin/nsd/dname.c

383

for (i = 1; i < left->label_count && i < right->label_count; ++i) {

usr.sbin/nsd/dname.c

385

dname_label(right, i)) != 0)

usr.sbin/nsd/dname.c

469

const dname_type *right)

usr.sbin/nsd/dname.c

473

assert(left->name_size + right->name_size - 1 <= MAXDOMAINLEN);

usr.sbin/nsd/dname.c

476

memcpy(temp + left->name_size - 1, dname_name(right), right->name_size);

usr.sbin/nsd/dname.h

124

int dname_is_subdomain(const dname_type *left, const dname_type *right);

usr.sbin/nsd/dname.h

186

int dname_compare(const void *left, const void *right);

usr.sbin/nsd/dname.h

199

int label_compare(const uint8_t *left, const uint8_t *right);

usr.sbin/nsd/dname.h

210

const dname_type *right);

usr.sbin/nsd/dname.h

379

const dname_type *right);

usr.sbin/nsd/ixfr.c

1485

ixfr_tree_del(node->right);

usr.sbin/nsd/options.c

849

delbucket(region, (struct zonelist_bucket*)b->node.right);

usr.sbin/nsd/rbtree.c

106

node->left = left->right;

usr.sbin/nsd/rbtree.c

107

if (left->right != RBTREE_NULL)

usr.sbin/nsd/rbtree.c

108

left->right->parent = node;

usr.sbin/nsd/rbtree.c

113

if (node == node->parent->right) {

usr.sbin/nsd/rbtree.c

114

node->parent->right = left;

usr.sbin/nsd/rbtree.c

121

left->right = node;

usr.sbin/nsd/rbtree.c

139

uncle = node->parent->parent->right;

usr.sbin/nsd/rbtree.c

154

if (node == node->parent->right) {

usr.sbin/nsd/rbtree.c

228

node = node->right;

usr.sbin/nsd/rbtree.c

234

data->left = data->right = RBTREE_NULL;

usr.sbin/nsd/rbtree.c

243

parent->right = data;

usr.sbin/nsd/rbtree.c

300

assert(parent->left == old || parent->right == old

usr.sbin/nsd/rbtree.c

301

|| parent->left == new || parent->right == new);

usr.sbin/nsd/rbtree.c

303

if(parent->right == old) parent->right = new;

usr.sbin/nsd/rbtree.c

327

if(to_delete->left != RBTREE_NULL && to_delete->right != RBTREE_NULL)

usr.sbin/nsd/rbtree.c

330

rbnode_type *smright = to_delete->right;

usr.sbin/nsd/rbtree.c

343

if(to_delete->right != smright)

usr.sbin/nsd/rbtree.c

349

change_child_ptr(smright->right, smright, to_delete);

usr.sbin/nsd/rbtree.c

350

change_child_ptr(smright->right, smright, to_delete);

usr.sbin/nsd/rbtree.c

352

if(to_delete->right != smright)

usr.sbin/nsd/rbtree.c

353

change_child_ptr(to_delete->right, to_delete, smright);

usr.sbin/nsd/rbtree.c

354

if(to_delete->right == smright)

usr.sbin/nsd/rbtree.c

357

to_delete->right = to_delete;

usr.sbin/nsd/rbtree.c

364

swap_np(&to_delete->right, &smright->right);

usr.sbin/nsd/rbtree.c

368

assert(to_delete->left == RBTREE_NULL || to_delete->right == RBTREE_NULL);

usr.sbin/nsd/rbtree.c

371

else child = to_delete->right;

usr.sbin/nsd/rbtree.c

391

to_delete->right = RBTREE_NULL;

usr.sbin/nsd/rbtree.c

407

if(child_parent->right == child) sibling = child_parent->left;

usr.sbin/nsd/rbtree.c

408

else sibling = child_parent->right;

usr.sbin/nsd/rbtree.c

422

if(child_parent->right == child)

usr.sbin/nsd/rbtree.c

426

if(child_parent->right == child) sibling = child_parent->left;

usr.sbin/nsd/rbtree.c

427

else sibling = child_parent->right;

usr.sbin/nsd/rbtree.c

433

&& sibling->right->color == BLACK)

usr.sbin/nsd/rbtree.c

441

if(child_parent->right == child) sibling = child_parent->left;

usr.sbin/nsd/rbtree.c

442

else sibling = child_parent->right;

usr.sbin/nsd/rbtree.c

450

&& sibling->right->color == BLACK)

usr.sbin/nsd/rbtree.c

462

if(child_parent->right == child

usr.sbin/nsd/rbtree.c

464

&& sibling->right->color == RED

usr.sbin/nsd/rbtree.c

468

sibling->right->color = BLACK;

usr.sbin/nsd/rbtree.c

471

if(child_parent->right == child) sibling = child_parent->left;

usr.sbin/nsd/rbtree.c

472

else sibling = child_parent->right;

usr.sbin/nsd/rbtree.c

477

&& sibling->right->color == BLACK)

usr.sbin/nsd/rbtree.c

483

if(child_parent->right == child) sibling = child_parent->left;

usr.sbin/nsd/rbtree.c

484

else sibling = child_parent->right;

usr.sbin/nsd/rbtree.c

490

if(child_parent->right == child)

usr.sbin/nsd/rbtree.c

498

assert(sibling->right->color == RED);

usr.sbin/nsd/rbtree.c

499

sibling->right->color = BLACK;

usr.sbin/nsd/rbtree.c

536

node = node->right;

usr.sbin/nsd/rbtree.c

570

for (node = rbtree->root; node->right != RBTREE_NULL; node = node->right);

usr.sbin/nsd/rbtree.c

583

if (node->right != RBTREE_NULL) {

usr.sbin/nsd/rbtree.c

585

for (node = node->right; node->left != RBTREE_NULL; node = node->left);

usr.sbin/nsd/rbtree.c

588

while (parent != RBTREE_NULL && node == parent->right) {

usr.sbin/nsd/rbtree.c

604

for (node = node->left; node->right != RBTREE_NULL; node = node->right);

usr.sbin/nsd/rbtree.c

66

rbnode_type *right;

usr.sbin/nsd/rbtree.c

72

right = node->right;

usr.sbin/nsd/rbtree.c

73

node->right = right->left;

usr.sbin/nsd/rbtree.c

74

if (right->left != RBTREE_NULL)

usr.sbin/nsd/rbtree.c

75

right->left->parent = node;

usr.sbin/nsd/rbtree.c

77

right->parent = node->parent;

usr.sbin/nsd/rbtree.c

81

node->parent->left = right;

usr.sbin/nsd/rbtree.c

83

node->parent->right = right;

usr.sbin/nsd/rbtree.c

86

rbtree->root = right;

usr.sbin/nsd/rbtree.c

88

right->left = node;

usr.sbin/nsd/rbtree.c

89

node->parent = right;

usr.sbin/nsd/rbtree.h

24

rbnode_type *right;

usr.sbin/nsd/simdzone/src/generic/types.h

2812

token_t left, right;

usr.sbin/nsd/simdzone/src/generic/types.h

2822

if (!(right.data = memchr(token->data, '.', token->length))) {

usr.sbin/nsd/simdzone/src/generic/types.h

2831

left.length = (size_t)(right.data - token->data);

usr.sbin/nsd/simdzone/src/generic/types.h

2832

right.code = token->code;

usr.sbin/nsd/simdzone/src/generic/types.h

2833

right.data += 1;

usr.sbin/nsd/simdzone/src/generic/types.h

2834

right.length = token->length - left.length - 1;

usr.sbin/nsd/simdzone/src/generic/types.h

2837

if ((code = parse_int32(parser, type, &fields[0], rdata, &right)) < 0)

usr.sbin/nsd/util.c

491

const struct timespec *right)

usr.sbin/nsd/util.c

494

if (left->tv_sec < right->tv_sec) {

usr.sbin/nsd/util.c

496

} else if (left->tv_sec > right->tv_sec) {

usr.sbin/nsd/util.c

500

if (left->tv_nsec < right->tv_nsec) {

usr.sbin/nsd/util.c

502

} else if (left->tv_nsec > right->tv_nsec) {

usr.sbin/nsd/util.c

516

const struct timespec *right)

usr.sbin/nsd/util.c

518

left->tv_sec += right->tv_sec;

usr.sbin/nsd/util.c

519

left->tv_nsec += right->tv_nsec;

usr.sbin/nsd/util.c

529

const struct timespec *right)

usr.sbin/nsd/util.c

531

left->tv_sec -= right->tv_sec;

usr.sbin/nsd/util.c

532

left->tv_nsec -= right->tv_nsec;

usr.sbin/nsd/util.h

314

int timespec_compare(const struct timespec *left, const struct timespec *right);

usr.sbin/nsd/util.h

315

void timespec_add(struct timespec *left, const struct timespec *right);

usr.sbin/nsd/util.h

316

void timespec_subtract(struct timespec *left, const struct timespec *right);

usr.sbin/nsd/util.h

320

const struct timeval *right)

usr.sbin/nsd/util.h

322

left->tv_sec = right->tv_sec;

usr.sbin/nsd/util.h

323

left->tv_nsec = 1000 * right->tv_usec;

usr.sbin/nsd/xfrd-catalog-zones.c

84

static int member_id_compare(const void *left, const void *right);

usr.sbin/nsd/xfrd-catalog-zones.c

899

static int member_id_compare(const void *left, const void *right)

usr.sbin/nsd/xfrd-catalog-zones.c

902

, ((struct catalog_member_zone*)right)->member_id);

usr.sbin/nsd/xfrd-tcp.c

345

clear_pipeline_entry(tp, node->right);

usr.sbin/nsd/xfrd-tcp.c

346

node->right = NULL;

usr.sbin/unbound/util/data/msgencode.c

132

prev = &p->right;

usr.sbin/unbound/util/data/msgencode.c

133

p = p->right;

usr.sbin/unbound/util/data/msgencode.c

189

n->right = 0;

usr.sbin/unbound/util/data/msgencode.c

235

newnode->right = prevnode;

usr.sbin/unbound/util/data/msgencode.c

85

struct compress_tree_node* right;

usr.sbin/unbound/util/rbtree.c

110

rbnode_type *right = node->right;

usr.sbin/unbound/util/rbtree.c

111

node->right = right->left;

usr.sbin/unbound/util/rbtree.c

112

if (right->left != RBTREE_NULL)

usr.sbin/unbound/util/rbtree.c

113

right->left->parent = node;

usr.sbin/unbound/util/rbtree.c

115

right->parent = node->parent;

usr.sbin/unbound/util/rbtree.c

119

node->parent->left = right;

usr.sbin/unbound/util/rbtree.c

121

node->parent->right = right;

usr.sbin/unbound/util/rbtree.c

124

rbtree->root = right;

usr.sbin/unbound/util/rbtree.c

126

right->left = node;

usr.sbin/unbound/util/rbtree.c

127

node->parent = right;

usr.sbin/unbound/util/rbtree.c

138

node->left = left->right;

usr.sbin/unbound/util/rbtree.c

139

if (left->right != RBTREE_NULL)

usr.sbin/unbound/util/rbtree.c

140

left->right->parent = node;

usr.sbin/unbound/util/rbtree.c

145

if (node == node->parent->right) {

usr.sbin/unbound/util/rbtree.c

146

node->parent->right = left;

usr.sbin/unbound/util/rbtree.c

153

left->right = node;

usr.sbin/unbound/util/rbtree.c

166

uncle = node->parent->parent->right;

usr.sbin/unbound/util/rbtree.c

181

if (node == node->parent->right) {

usr.sbin/unbound/util/rbtree.c

249

node = node->right;

usr.sbin/unbound/util/rbtree.c

255

data->left = data->right = RBTREE_NULL;

usr.sbin/unbound/util/rbtree.c

264

parent->right = data;

usr.sbin/unbound/util/rbtree.c

314

log_assert(parent->left == old || parent->right == old

usr.sbin/unbound/util/rbtree.c

315

|| parent->left == new || parent->right == new);

usr.sbin/unbound/util/rbtree.c

317

if(parent->right == old) parent->right = new;

usr.sbin/unbound/util/rbtree.c

337

if(to_delete->left != RBTREE_NULL && to_delete->right != RBTREE_NULL)

usr.sbin/unbound/util/rbtree.c

340

rbnode_type *smright = to_delete->right;

usr.sbin/unbound/util/rbtree.c

353

if(to_delete->right != smright)

usr.sbin/unbound/util/rbtree.c

359

change_child_ptr(smright->right, smright, to_delete);

usr.sbin/unbound/util/rbtree.c

360

change_child_ptr(smright->right, smright, to_delete);

usr.sbin/unbound/util/rbtree.c

362

if(to_delete->right != smright)

usr.sbin/unbound/util/rbtree.c

363

change_child_ptr(to_delete->right, to_delete, smright);

usr.sbin/unbound/util/rbtree.c

364

if(to_delete->right == smright)

usr.sbin/unbound/util/rbtree.c

367

to_delete->right = to_delete;

usr.sbin/unbound/util/rbtree.c

374

swap_np(&to_delete->right, &smright->right);

usr.sbin/unbound/util/rbtree.c

378

log_assert(to_delete->left == RBTREE_NULL || to_delete->right == RBTREE_NULL);

usr.sbin/unbound/util/rbtree.c

381

else child = to_delete->right;

usr.sbin/unbound/util/rbtree.c

401

to_delete->right = RBTREE_NULL;

usr.sbin/unbound/util/rbtree.c

413

if(child_parent->right == child) sibling = child_parent->left;

usr.sbin/unbound/util/rbtree.c

414

else sibling = child_parent->right;

usr.sbin/unbound/util/rbtree.c

428

if(child_parent->right == child)

usr.sbin/unbound/util/rbtree.c

432

if(child_parent->right == child) sibling = child_parent->left;

usr.sbin/unbound/util/rbtree.c

433

else sibling = child_parent->right;

usr.sbin/unbound/util/rbtree.c

439

&& sibling->right->color == BLACK)

usr.sbin/unbound/util/rbtree.c

447

if(child_parent->right == child) sibling = child_parent->left;

usr.sbin/unbound/util/rbtree.c

448

else sibling = child_parent->right;

usr.sbin/unbound/util/rbtree.c

456

&& sibling->right->color == BLACK)

usr.sbin/unbound/util/rbtree.c

468

if(child_parent->right == child

usr.sbin/unbound/util/rbtree.c

470

&& sibling->right->color == RED

usr.sbin/unbound/util/rbtree.c

474

sibling->right->color = BLACK;

usr.sbin/unbound/util/rbtree.c

477

if(child_parent->right == child) sibling = child_parent->left;

usr.sbin/unbound/util/rbtree.c

478

else sibling = child_parent->right;

usr.sbin/unbound/util/rbtree.c

483

&& sibling->right->color == BLACK)

usr.sbin/unbound/util/rbtree.c

489

if(child_parent->right == child) sibling = child_parent->left;

usr.sbin/unbound/util/rbtree.c

490

else sibling = child_parent->right;

usr.sbin/unbound/util/rbtree.c

496

if(child_parent->right == child)

usr.sbin/unbound/util/rbtree.c

504

log_assert(sibling->right->color == RED);

usr.sbin/unbound/util/rbtree.c

505

sibling->right->color = BLACK;

usr.sbin/unbound/util/rbtree.c

538

node = node->right;

usr.sbin/unbound/util/rbtree.c

562

for (node = rbtree->root; node->right != RBTREE_NULL; node = node->right);

usr.sbin/unbound/util/rbtree.c

575

if (node->right != RBTREE_NULL) {

usr.sbin/unbound/util/rbtree.c

577

for (node = node->right; node->left != RBTREE_NULL; node = node->left);

usr.sbin/unbound/util/rbtree.c

580

while (parent != RBTREE_NULL && node == parent->right) {

usr.sbin/unbound/util/rbtree.c

596

for (node = node->left; node->right != RBTREE_NULL; node = node->right);

usr.sbin/unbound/util/rbtree.c

616

traverse_post(func, arg, node->right);

usr.sbin/unbound/util/rbtree.h

61

rbnode_type *right;