Lines Matching defs:test
82 of simple bit test and branches instead. */
1066 /* We test the old body (obody) contents to avoid tripping
2172 nodes handled by this test, typically the number of bits
2238 struct case_bit_test test[MAX_CASE_BIT_TESTS];
2250 if (label == test[i].label)
2256 test[i].hi = 0;
2257 test[i].lo = 0;
2258 test[i].label = label;
2259 test[i].bits = 1;
2263 test[i].bits++;
2271 test[i].hi |= (HOST_WIDE_INT) 1 << (j - HOST_BITS_PER_INT);
2273 test[i].lo |= (HOST_WIDE_INT) 1 << j;
2276 qsort (test, count, sizeof(*test), case_bit_test_cmp);
2295 expr = immed_double_const (test[i].lo, test[i].hi, word_mode);
2299 word_mode, 1, test[i].label);
2317 Generate the code to test it and jump to the right place. */
2521 redundant test conditions at the same time.
2821 to see if a test for the lower bound of NODE would be redundant.
2828 span. Thus the test would be redundant. */
2837 we need not test it. */
2867 to see if a test for the upper bound of NODE would be redundant.
2874 span. Thus the test would be redundant. */
2882 /* If there is no upper bound, obviously no test is needed. */
2888 of the index expression, we need not test against it. */
2931 case-node binary tree NODE, whose nodes represent test conditions.
2939 Where the test conditions can be shown to be redundant we emit
2953 tests for the value 50, then this node need not test anything. */
3155 test for it first, since we can go straight there.