| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| tree-ssa-operands.h | 148 returning each operand as a 'tree' in the variable TREEVAR. ITER is an
150 #define FOR_EACH_SSA_TREE_OPERAND(TREEVAR, STMT, ITER, FLAGS) \
151 for (TREEVAR = op_iter_init_tree (&(ITER), STMT, FLAGS); \
152 !op_iter_done (&(ITER)); \
153 (void) (TREEVAR = op_iter_next_tree (&(ITER))))
157 ITER is an ssa_op_iter structure used to control the loop. */
158 #define FOR_EACH_SSA_USE_OPERAND(USEVAR, STMT, ITER, FLAGS) \
159 for (USEVAR = op_iter_init_use (&(ITER), STMT, FLAGS); \
160 !op_iter_done (&(ITER)); \
161 USEVAR = op_iter_next_use (&(ITER)))
[all...] |
| tree-flow.h | 109 /* Iterate through the elements of hashtable HTAB, using htab_iterator ITER,
111 #define FOR_EACH_HTAB_ELEMENT(HTAB, RESULT, TYPE, ITER) \
112 for (RESULT = (TYPE) first_htab_element (&(ITER), (HTAB)); \
113 !end_htab_p (&(ITER)); \
114 RESULT = (TYPE) next_htab_element (&(ITER)))
228 #define FOR_EACH_IMM_USE_FAST(DEST, ITER, SSAVAR) \
229 for ((DEST) = first_readonly_imm_use (&(ITER), (SSAVAR)); \
230 !end_readonly_imm_use_p (&(ITER)); \
231 (void) ((DEST) = next_readonly_imm_use (&(ITER))))
235 #define FOR_EACH_IMM_USE_STMT(STMT, ITER, SSAVAR)
[all...] |
| bitmap.h | 679 BITNUM to the bit number. ITER is a bitmap iterator. BITNUM
685 #define EXECUTE_IF_SET_IN_BITMAP(BITMAP, MIN, BITNUM, ITER) \
686 for (bmp_iter_set_init (&(ITER), (BITMAP), (MIN), &(BITNUM)); \
687 bmp_iter_set (&(ITER), &(BITNUM)); \
688 bmp_iter_next (&(ITER), &(BITNUM)))
692 and setting BITNUM to the bit number. ITER is a bitmap iterator.
696 #define EXECUTE_IF_AND_IN_BITMAP(BITMAP1, BITMAP2, MIN, BITNUM, ITER) \
697 for (bmp_iter_and_init (&(ITER), (BITMAP1), (BITMAP2), (MIN), \
699 bmp_iter_and (&(ITER), &(BITNUM)); \
700 bmp_iter_next (&(ITER), &(BITNUM))
[all...] |
| sbitmap.h | 203 iteration, N is set to the index of the bit being visited. ITER is
208 #define EXECUTE_IF_SET_IN_BITMAP(BITMAP, MIN, BITNUM, ITER) \
209 for (bmp_iter_set_init (&(ITER), (BITMAP), (MIN), &(BITNUM)); \
210 bmp_iter_set (&(ITER), &(BITNUM)); \
211 bmp_iter_next (&(ITER), &(BITNUM)))
|
| basic-block.h | 588 #define ei_start(iter) ei_start_1 (&(iter))
589 #define ei_last(iter) ei_last_1 (&(iter))
697 #define FOR_EACH_EDGE(EDGE,ITER,EDGE_VEC) \
698 for ((ITER) = ei_start ((EDGE_VEC)); \
699 ei_cond ((ITER), &(EDGE)); \
700 ei_next (&(ITER)))
[all...] |
| hard-reg-set.h | 513 hard_reg_set_iter_init (hard_reg_set_iterator *iter, HARD_REG_SET set,
517 iter->pelt = set;
518 iter->length = HARD_REG_SET_LONGS;
520 iter->pelt = &set;
521 iter->length = 1;
523 iter->word_no = min / HARD_REG_ELT_BITS;
524 if (iter->word_no < iter->length)
526 iter->bits = iter->pelt[iter->word_no]
[all...] |
| tree.h | [all...] |
| /external/bison/src/ |
| Sbitset.h | 84 #define SBITSET__FOR_EACH(SELF, NBITS, ITER, INDEX) \
85 for ((ITER) = (SELF); (ITER) < (SELF) + Sbitset__nbytes (NBITS); ++(ITER)) \
86 if (*(ITER) != 0) \
87 for ((INDEX) = ((ITER)-(SELF))*CHAR_BIT; \
88 (INDEX) < (NBITS) && (SELF)+(INDEX)/CHAR_BIT < (ITER)+1; \
90 if (((*ITER) & Sbitset__bit_mask (INDEX)) != 0)
|
| /external/bison/lib/ |
| bitset.h | 308 bitset_iterator iter;
310 BITSET_FOR_EACH (iter, src, i, 0)
315 #define BITSET_FOR_EACH(ITER, BSET, INDEX, MIN) \
316 for (ITER.next = (MIN), ITER.num = BITSET_LIST_SIZE; \
317 (ITER.num == BITSET_LIST_SIZE) \
318 && (ITER.num = bitset_list (BSET, ITER.list, \
319 BITSET_LIST_SIZE, &ITER.next));) \
320 for (ITER.i = 0;
[all...] |
| /external/deqp/modules/gles3/functional/ |
| es3fTransformFeedbackTests.cpp | 262 for (vector<string>::const_iterator iter = spec.getTransformFeedbackVaryings().begin(); iter != spec.getTransformFeedbackVaryings().end(); iter++)
264 const string& name = *iter;
305 for (glu::TypeComponentVector::const_iterator iter = path.begin(); iter != path.end(); iter++)
309 switch (iter->type)
319 str << prefix << iter->index;
504 for (glu::VectorTypeIterator iter = glu::VectorTypeIterator::begin(&output.type); iter != glu::VectorTypeIterator::end(&output.type) (…)
[all...] |
| /bionic/tests/ |
| string_test.cpp | 156 #define ITER 500
214 size_t len[ITER + 1];
229 for (size_t i = 1; i < ITER; ++i) {
230 size_t l = static_cast<size_t>(exp(log(static_cast<double>(MAX_LEN)) * i / ITER));
[all...] |
