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

/freebsd-11-stable/contrib/gcc/
H A Dtree-ssa-operands.h223 returning each operand as a 'tree' in the variable TREEVAR. ITER is an
225 #define FOR_EACH_SSA_TREE_OPERAND(TREEVAR, STMT, ITER, FLAGS) \
226 for (TREEVAR = op_iter_init_tree (&(ITER), STMT, FLAGS); \
227 !op_iter_done (&(ITER)); \
228 TREEVAR = op_iter_next_tree (&(ITER)))
232 ITER is an ssa_op_iter structure used to control the loop. */
233 #define FOR_EACH_SSA_USE_OPERAND(USEVAR, STMT, ITER, FLAGS) \
234 for (USEVAR = op_iter_init_use (&(ITER), STMT, FLAGS); \
235 !op_iter_done (&(ITER)); \
236 USEVAR = op_iter_next_use (&(ITER)))
[all...]
H A Dtree-flow.h52 /* Iterate through the elements of hashtable HTAB, using htab_iterator ITER,
54 #define FOR_EACH_HTAB_ELEMENT(HTAB, RESULT, TYPE, ITER) \
55 for (RESULT = (TYPE) first_htab_element (&(ITER), (HTAB)); \
56 !end_htab_p (&(ITER)); \
57 RESULT = (TYPE) next_htab_element (&(ITER)))
243 #define FOR_EACH_IMM_USE_FAST(DEST, ITER, SSAVAR) \
244 for ((DEST) = first_readonly_imm_use (&(ITER), (SSAVAR)); \
245 !end_readonly_imm_use_p (&(ITER)); \
246 (DEST) = next_readonly_imm_use (&(ITER)))
250 #define FOR_EACH_IMM_USE_STMT(STMT, ITER, SSAVA
[all...]
H A Dbitmap.h537 BITNUM to the bit number. ITER is a bitmap iterator. BITNUM
541 #define EXECUTE_IF_SET_IN_BITMAP(BITMAP, MIN, BITNUM, ITER) \
542 for (bmp_iter_set_init (&(ITER), (BITMAP), (MIN), &(BITNUM)); \
543 bmp_iter_set (&(ITER), &(BITNUM)); \
544 bmp_iter_next (&(ITER), &(BITNUM)))
547 and setting BITNUM to the bit number. ITER is a bitmap iterator.
551 #define EXECUTE_IF_AND_IN_BITMAP(BITMAP1, BITMAP2, MIN, BITNUM, ITER) \
552 for (bmp_iter_and_init (&(ITER), (BITMAP1), (BITMAP2), (MIN), \
554 bmp_iter_and (&(ITER), &(BITNUM)); \
555 bmp_iter_next (&(ITER),
[all...]
H A Dsbitmap.h132 iteration, N is set to the index of the bit being visited. ITER is
135 #define EXECUTE_IF_SET_IN_SBITMAP(SBITMAP, MIN, N, ITER) \
136 for (sbitmap_iter_init (&(ITER), (SBITMAP), (MIN)); \
137 sbitmap_iter_cond (&(ITER), &(N)); \
138 sbitmap_iter_next (&(ITER)))
H A Dbasic-block.h779 #define FOR_EACH_EDGE(EDGE,ITER,EDGE_VEC) \
780 for ((ITER) = ei_start ((EDGE_VEC)); \
781 ei_cond ((ITER), &(EDGE)); \
782 ei_next (&(ITER)))
/freebsd-11-stable/contrib/amd/fsinfo/
H A Dwr_dumpset.c54 ITER(dp, disk_fs, q) { function
79 ITER(hp, host, q) { function
H A Dwr_exportfs.c53 ITER(mp, fsi_mount, q) { function
70 ITER(dp, disk_fs, q) { function
88 ITER(hp, host, q) { function
H A Dwr_atab.c69 ITER(ap2, automount, ap->a_mount)
123 ITER(dd, dict_data, &de->de_q) {
186 ITER(dd, dict_data, &de->de_q) {
258 ITER(ap, automount, q) { function
304 ITER(ap, automount, q)
325 ITER(tp, auto_tree, q)
H A Dwr_bparam.c94 ITER(hp, host, q)
H A Dfsi_analyze.c179 ITER(mp, fsi_mount, q) { function
216 ITER(mp, fsi_mount, q) { function
258 ITER(mp, fsi_mount, q) { function
458 ITER(dp, disk_fs, q) { function
482 ITER(fp, fsmount, q) { function
512 ITER(dd, dict_data, &de->de_q) {
577 ITER(hp, host, q) { function
592 ITER(hp, host, q) { function
626 ITER(ap, automount, q) { function
666 ITER(t
[all...]
H A Dwr_fstab.c285 ITER(dp, disk_fs, q)
299 ITER(fp, fsmount, q)
315 ITER(hp, host, q) { function
H A Dfsinfo.h130 #define ITER(v, ty, q) for ((v) = AM_FIRST(ty,(q)); (v) != HEAD(ty,(q)); (v) = NEXT(ty,(v))) macro
/freebsd-11-stable/contrib/amd/amd/
H A Drpc_fwd.c98 ITER(p2, rpc_forward, &rpc_head) {
206 ITER(p, rpc_forward, &rpc_head) {
H A Dsrvr_nfs.c123 ITER(fs2, fserver, &nfs_srvr_list) {
192 ITER(fs, fserver, &nfs_srvr_list)
381 ITER(fs, fserver, &nfs_srvr_list) {
811 ITER(fs, fserver, &nfs_srvr_list) {
942 ITER(fs, fserver, &nfs_srvr_list) {
H A Damq_subr.c535 ITER(m, mnt_map, qhead) { function
545 ITER(m, mnt_map, qhead) { function
H A Dops_nfs.c154 ITER(fp, fh_cache, &fh_head) {
313 ITER(fp, fh_cache, &fh_head) {
356 ITER(fp, fh_cache, &fh_head) {
358 continue; /* skip to next ITER item */
430 } /* end of ITER loop */
1026 ITER(new_mf, mntfs, &mfhead) {
H A Dmntfs.c125 ITER(mf, mntfs, &mfhead) {
193 } /* end of ITER */
H A Dmapc.c817 ITER(m, mnt_map, &map_list_head)
1062 ITER(m, mnt_map, &map_list_head)
/freebsd-11-stable/contrib/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
/freebsd-11-stable/contrib/amd/include/
H A Dam_utils.h129 #define ITER(v, ty, q) \ macro

Completed in 187 milliseconds