Searched refs:ITER (Results 1 - 20 of 20) sorted by relevance

/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/
H A Dpr46755.f5 INTEGER I,ITER,ITMX,LENCM variable
15 DO WHILE(ITER.LT.ITMX)
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/debug/
H A Dpr46756.f15 DO WHILE((CVGMX.GT.TOLDIM).AND.(ITER.LT.ITMX))
/haiku-buildtools/gcc/gcc/
H A Drtl-iter.h271 /* Use ITER to iterate over const_rtx X and its recursive subrtxes,
277 #define FOR_EACH_SUBRTX(ITER, ARRAY, X, TYPE) \
278 for (subrtx_iterator ITER (ARRAY, X, TYPE##_BOUNDS); !ITER.at_end (); \
279 ITER.next ())
282 #define FOR_EACH_SUBRTX_VAR(ITER, ARRAY, X, TYPE) \
283 for (subrtx_var_iterator ITER (ARRAY, X, TYPE##_BOUNDS); !ITER.at_end (); \
284 ITER.next ())
289 #define FOR_EACH_SUBRTX_PTR(ITER, ARRA
[all...]
H A Dssa-iterators.h75 #define FOR_EACH_IMM_USE_FAST(DEST, ITER, SSAVAR) \
76 for ((DEST) = first_readonly_imm_use (&(ITER), (SSAVAR)); \
77 !end_readonly_imm_use_p (&(ITER)); \
78 (void) ((DEST) = next_readonly_imm_use (&(ITER))))
82 #define FOR_EACH_IMM_USE_STMT(STMT, ITER, SSAVAR) \
83 for ((STMT) = first_imm_use_stmt (&(ITER), (SSAVAR)); \
84 !end_imm_use_stmt_p (&(ITER)); \
85 (void) ((STMT) = next_imm_use_stmt (&(ITER))))
90 #define BREAK_FROM_IMM_USE_STMT(ITER) \
92 end_imm_use_stmt_traverse (&(ITER)); \
[all...]
H A Ddf.h770 #define FOR_EACH_INSN_INFO_DEF(ITER, INSN) \
771 for (ITER = DF_INSN_INFO_DEFS (INSN); ITER; ITER = DF_REF_NEXT_LOC (ITER))
773 #define FOR_EACH_INSN_INFO_USE(ITER, INSN) \
774 for (ITER = DF_INSN_INFO_USES (INSN); ITER; ITER = DF_REF_NEXT_LOC (ITER))
[all...]
H A Dbitmap.h681 BITNUM to the bit number. ITER is a bitmap iterator. BITNUM
687 #define EXECUTE_IF_SET_IN_BITMAP(BITMAP, MIN, BITNUM, ITER) \
688 for (bmp_iter_set_init (&(ITER), (BITMAP), (MIN), &(BITNUM)); \
689 bmp_iter_set (&(ITER), &(BITNUM)); \
690 bmp_iter_next (&(ITER), &(BITNUM)))
694 and setting BITNUM to the bit number. ITER is a bitmap iterator.
698 #define EXECUTE_IF_AND_IN_BITMAP(BITMAP1, BITMAP2, MIN, BITNUM, ITER) \
699 for (bmp_iter_and_init (&(ITER), (BITMAP1), (BITMAP2), (MIN), \
701 bmp_iter_and (&(ITER), &(BITNUM)); \
702 bmp_iter_next (&(ITER),
[all...]
H A Dsbitmap.h203 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)))
H A Dira-int.h774 is set to the number of next allocno. ITER is an instance of
776 #define FOR_EACH_BIT_IN_MINMAX_SET(VEC, MIN, MAX, N, ITER) \
777 for (minmax_set_iter_init (&(ITER), (VEC), (MIN), (MAX)); \
778 minmax_set_iter_cond (&(ITER), &(N)); \
779 minmax_set_iter_next (&(ITER)))
1132 allocno. ITER is an instance of ira_allocno_iterator used to iterate
1134 #define FOR_EACH_ALLOCNO(A, ITER) \
1135 for (ira_allocno_iter_init (&(ITER)); \
1136 ira_allocno_iter_cond (&(ITER), &(A));)
1170 object. ITER i
[all...]
H A Dsparseset.h213 #define EXECUTE_IF_SET_IN_SPARSESET(SPARSESET, ITER) \
216 && (((ITER) = sparseset_iter_elm (SPARSESET)) || 1); \
H A Dbasic-block.h507 #define FOR_EACH_EDGE(EDGE,ITER,EDGE_VEC) \
508 for ((ITER) = ei_start ((EDGE_VEC)); \
509 ei_cond ((ITER), &(EDGE)); \
510 ei_next (&(ITER)))
H A Dhard-reg-set.h603 #define EXECUTE_IF_SET_IN_HARD_REG_SET(SET, MIN, REGNUM, ITER) \
604 for (hard_reg_set_iter_init (&(ITER), (SET), (MIN), &(REGNUM)); \
605 hard_reg_set_iter_set (&(ITER), &(REGNUM)); \
606 hard_reg_set_iter_next (&(ITER), &(REGNUM)))
H A Dsel-sched-ir.h1480 #define FOR_EACH_SUCC_1(SUCC, ITER, INSN, FLAGS) \
1481 for ((ITER) = _succ_iter_start (&(SUCC), (INSN), (FLAGS)); \
1482 _succ_iter_cond (&(ITER), &(SUCC), (INSN), _eligible_successor_edge_p); \
1483 _succ_iter_next (&(ITER)))
1485 #define FOR_EACH_SUCC(SUCC, ITER, INSN) \
1486 FOR_EACH_SUCC_1 (SUCC, ITER, INSN, SUCCS_NORMAL)
1489 #define SUCC_ITER_EDGE(ITER) ((ITER)->e1)
H A Dsched-int.h1644 #define FOR_EACH_DEP(INSN, LIST_TYPES, ITER, DEP) \
1645 for ((ITER) = sd_iterator_start ((INSN), (LIST_TYPES)); \
1646 sd_iterator_cond (&(ITER), &(DEP)); \
1647 sd_iterator_next (&(ITER)))
H A Dhash-table.h1687 using hash_table <....>::iterator ITER,
1690 #define FOR_EACH_HASH_TABLE_ELEMENT(HTAB, RESULT, TYPE, ITER) \
1691 for ((ITER) = (HTAB).begin (); \
1692 (ITER) != (HTAB).end () ? (RESULT = *(ITER) , true) : false; \
1693 ++(ITER))
H A Dtree-ssa-coalesce.c396 /* Iterate over CL using ITER, returning values in PAIR. */
398 #define FOR_EACH_PARTITION_PAIR(PAIR, ITER, CL) \
399 FOR_EACH_HASH_TABLE_ELEMENT (*(CL)->list, (PAIR), coalesce_pair_p, (ITER))
H A Dtree.h4338 to point to the next tree element. ITER is an instance of
4340 #define FOREACH_FUNCTION_ARGS_PTR(FNTYPE, PTR, ITER) \
4341 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4342 (PTR = function_args_iter_cond_ptr (&(ITER))) != NULL; \
4343 function_args_iter_next (&(ITER)))
4346 to the next tree element. ITER is an instance of function_args_iterator
4348 #define FOREACH_FUNCTION_ARGS(FNTYPE, TREE, ITER) \
4349 for (function_args_iter_init (&(ITER), (FNTYPE)); \
4350 (TREE = function_args_iter_cond (&(ITER))) != NULL_TREE; \
4351 function_args_iter_next (&(ITER)))
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/g77/
H A D20010519-1.f643 INTEGER ITER,IPAR1,IPAR2,NFSAV,PINBCM,PJNBCM,PDD1CM,LENCMP local in subroutine:NMDIMB
645 COMMON /DIMBI/ ITER,IPAR1,IPAR2,NFSAV,PINBCM,PJNBCM,LENCMP local in subroutine:NMDIMB
699 ITER=0
856 WRITE(OUTU,521) ITER
888 IF(ITER.EQ.ITMX) THEN
963 IF(ITER.EQ.0) LWDINI=.TRUE.
965 ITMX=ITMX+ITER
967 WRITE(OUTU,543) ITER,ITMX
1001 ITER=0
1015 DO WHILE((CVGMX.GT.TOLDIM).AND.(ITER
[all...]
/haiku-buildtools/legacy/gcc/gcc/config/sparc/
H A Dlb1spc.asm106 * ITER number of main division loop iterations required;
109 * V the current comparand, initially divisor*2^(ITER*N-1)
169 ! The number of bits in the result here is N*ITER+SC, where SC <= N.
170 ! Compute ITER in an unorthodox manner: know we need to shift V into
455 * ITER number of main division loop iterations required;
458 * V the current comparand, initially divisor*2^(ITER*N-1)
516 ! The number of bits in the result here is N*ITER+SC, where SC <= N.
517 ! Compute ITER in an unorthodox manner: know we need to shift V into
/haiku-buildtools/gcc/libgcc/config/sparc/
H A Dlb1spc.S106 * ITER number of main division loop iterations required;
109 * V the current comparand, initially divisor*2^(ITER*N-1)
169 ! The number of bits in the result here is N*ITER+SC, where SC <= N.
170 ! Compute ITER in an unorthodox manner: know we need to shift V into
455 * ITER number of main division loop iterations required;
458 * V the current comparand, initially divisor*2^(ITER*N-1)
516 ! The number of bits in the result here is N*ITER+SC, where SC <= N.
517 ! Compute ITER in an unorthodox manner: know we need to shift V into
/haiku-buildtools/gcc/mpfr/tests/
H A Dtget_str.c1202 #define ITER 1000 macro
1221 for (i = 0; i < ITER; i++)
1229 for (i = 0; i < ITER; i++)

Completed in 471 milliseconds