summaryrefslogtreecommitdiff
path: root/tests/usr.bin/indent/token_binary_op.c
blob: 88826b9fce72224e2fbb1c96b2da14d106f3735d (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
/* $NetBSD: token_binary_op.c,v 1.9 2021/11/20 16:54:17 rillig Exp $ */
/* $FreeBSD$ */

/*
 * Tests for binary operators like '+', '&&' and several others.
 *
 * Several binary operators can be used as unary operators as well, or in
 * other contexts.  An example for such an operator is '*', which can be a
 * multiplication, or pointer dereference, or pointer type declaration.
 */

/* TODO: split into separate tests */

/* See C99 6.4.6 */
#indent input
void
punctuators(void)
{
	int brackets = array[subscript];
	int parentheses = function(argument);
	int braces = { initializer };
	int period = structure.member;
	int arrow = structure->member;

	++prefix_increment;
	postfix_increment++;
	--prefix_decrement;
	postfix_decrement--;
	int *address = &lvalue;
	int bitwise_and = value & mask;
	int product = factor * factor;
	int dereferenced = *address;
	int positive = +number;
	int sum = number + number;
	int negative = -number;
	int difference = number - number;
	bool negated = !condition;

	int quotient = number / number;
	int modulo = number % number;
	int shifted_left = number << number;
	int shifted_right = number >> number;
	bool less_than = number < number;
	bool greater_than = number > number;
	bool less_equal = number <= number;
	bool greater_equal = number >= number;
	bool equal = number == number;
	bool unequal = number != number;
	int bitwise_exclusive_or = number ^ number;
	int bitwise_or = number | number;
	bool logical_and = condition && condition;
	bool logical_or = condition || condition;

	int conditional = condition ? number : number;

	/* combined assignment operators */
	number = (expression);
	number *= number;
	number /= number;
	number %= number;
	number += number;
	number -= number;
	number <<= number;
	number >>= number;
	number &= number;
	number ^= number;
	number |= number;

	number = function(argument1, argument2);
	number = function(argument), number;

	/* digraphs */
	number = array<:subscript:>;
	number = (int)<% initializer %>;
}
#indent end

#indent run -ldi0
void
punctuators(void)
{
	int brackets = array[subscript];
	int parentheses = function(argument);
/* $ XXX: The spaces around the initializer are gone. */
	int braces = {initializer};
	int period = structure.member;
	int arrow = structure->member;

	++prefix_increment;
	postfix_increment++;
	--prefix_decrement;
	postfix_decrement--;
	int *address = &lvalue;
	int bitwise_and = value & mask;
	int product = factor * factor;
	int dereferenced = *address;
	int positive = +number;
	int sum = number + number;
	int negative = -number;
	int difference = number - number;
	bool negated = !condition;

	int quotient = number / number;
	int modulo = number % number;
	int shifted_left = number << number;
	int shifted_right = number >> number;
	bool less_than = number < number;
	bool greater_than = number > number;
	bool less_equal = number <= number;
	bool greater_equal = number >= number;
	bool equal = number == number;
	bool unequal = number != number;
	int bitwise_exclusive_or = number ^ number;
	int bitwise_or = number | number;
	bool logical_and = condition && condition;
	bool logical_or = condition || condition;

	int conditional = condition ? number : number;

	/* combined assignment operators */
	number = (expression);
	number *= number;
	number /= number;
	number %= number;
	number += number;
	number -= number;
	number <<= number;
	number >>= number;
	number &= number;
	number ^= number;
	number |= number;

	number = function(argument1, argument2);
	number = function(argument), number;

	/* digraphs */
/* $ XXX: indent is confused by the digraphs for '[' and ']'. */
/* $ This probably doesn't matter since digraphs are not used in practice. */
number = array <:subscript:>;
	number = (int)<%initializer % >;
}
#indent end
/* TODO: move digraphs into separate test */
/* TODO: test trigraphs, which are as unusual as digraphs */
/* TODO: test digraphs and trigraphs in string literals, just for fun */


/*
 * When indent tokenizes some of the operators, it allows for
 * arbitrary repetitions of the operator character, followed by an
 * arbitrary amount of '='.  This is used for operators like '&&' or
 * '|||==='.
 *
 * Before 2021-03-07 22:11:01, the comment '//' was treated as an
 * operator as well, and so was the comment '/////', leading to
 * unexpected results.
 *
 * See lexi.c, lexi, "default:".
 */
#indent input
void
long_run_of_operators(void)
{
	if (a &&&&&&& b)
		return;
	if (a |||=== b)
		return;
}
#indent end

#indent run-equals-input


/*
 * For '+' and '-', this does not work since the lexer has to
 * distinguish between '++' and '+' early.  The following sequence is
 * thus tokenized as:
 *
 *	word		"a"
 *	postfix_op	"++"
 *	binary_op	"++"
 *	unary_op	"++"
 *	unary_op	"+"
 *	word		"b"
 *
 * See lexi.c, lexi, "case '+':".
 */
#indent input
void
joined_unary_and_binary_operators(void)
{
	if (a +++++++ b)
		return;
}
#indent end

#indent run
void
joined_unary_and_binary_operators(void)
{
	if (a++ ++ ++ +b)
		return;
}
#indent end


/*
 * Before NetBSD indent.c 1.178 from 2021-10-29, indent removed the blank
 * before the '=', in the second and third of these function pointer
 * declarations. This was because indent interpreted the prototype parameters
 * 'int' and 'int, int' as type casts, which doesn't make sense at all. Fixing
 * this properly requires large style changes since indent is based on simple
 * heuristics all over. This didn't change in indent.c 1.178; instead, the
 * rule for inserting a blank before a binary operator was changed to always
 * insert a blank, except at the beginning of a line.
 */
#indent input
char *(*fn)() = NULL;
char *(*fn)(int) = NULL;
char *(*fn)(int, int) = NULL;
#indent end

/* XXX: The parameter '(int)' is wrongly interpreted as a type cast. */
/* XXX: The parameter '(int, int)' is wrongly interpreted as a type cast. */
#indent run-equals-input -di0


/*
 * Ensure that the result of the indentation does not depend on whether a
 * token from the input starts in column 1 or 9.
 *
 * See process_binary_op, ps.curr_col_1.
 */
#indent input
int col_1 //
= //
1;

int col_9 //
	= //
	9;
#indent end

#indent run
int		col_1		//
=				//
1;

int		col_9		//
=				//
9;
#indent end