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

/freebsd-9.3-release/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-9.3-release/contrib/amd/fsinfo/
H A Dwr_dumpset.c58 ITER(dp, disk_fs, q) { function
83 ITER(hp, host, q) { function
H A Dwr_exportfs.c57 ITER(mp, fsi_mount, q) { function
74 ITER(dp, disk_fs, q) { function
92 ITER(hp, host, q) { function
H A Dwr_atab.c73 ITER(ap2, automount, ap->a_mount)
127 ITER(dd, dict_data, &de->de_q) {
190 ITER(dd, dict_data, &de->de_q) {
262 ITER(ap, automount, q) { function
308 ITER(ap, automount, q)
329 ITER(tp, auto_tree, q)
H A Dwr_bparam.c98 ITER(hp, host, q)
H A Dfsi_analyze.c183 ITER(mp, fsi_mount, q) { function
220 ITER(mp, fsi_mount, q) { function
262 ITER(mp, fsi_mount, q) { function
462 ITER(dp, disk_fs, q) { function
486 ITER(fp, fsmount, q) { function
516 ITER(dd, dict_data, &de->de_q) {
581 ITER(hp, host, q) { function
596 ITER(hp, host, q) { function
630 ITER(ap, automount, q) { function
670 ITER(t
[all...]
H A Dwr_fstab.c289 ITER(dp, disk_fs, q)
303 ITER(fp, fsmount, q)
319 ITER(hp, host, q) { function
H A Dfsinfo.h134 #define ITER(v, ty, q) for ((v) = AM_FIRST(ty,(q)); (v) != HEAD(ty,(q)); (v) = NEXT(ty,(v))) macro
/freebsd-9.3-release/contrib/compiler-rt/lib/sparc64/
H A Ddivmod.m422 * ITER -- number of iterations of the main division loop which will
25 * V -- the current comparand -- initially divisor*2��(ITER*N-1)
39 define(ITER, `%o4')
138 mov 0,ITER
142 ! The total number of bits in the result here is N*ITER+SC, where
144 ! Compute ITER in an unorthodox manner: know we need to Shift V into
152 inc ITER
214 inccc ITER
216 dec ITER
225 deccc ITER
[all...]
/freebsd-9.3-release/contrib/amd/amd/
H A Drpc_fwd.c102 ITER(p2, rpc_forward, &rpc_head) {
210 ITER(p, rpc_forward, &rpc_head) {
H A Dsrvr_nfs.c124 ITER(fs2, fserver, &nfs_srvr_list) {
192 ITER(fs, fserver, &nfs_srvr_list)
372 ITER(fs, fserver, &nfs_srvr_list) {
793 ITER(fs, fserver, &nfs_srvr_list) {
922 ITER(fs, fserver, &nfs_srvr_list) {
H A Dops_nfs.c151 ITER(fp, fh_cache, &fh_head) {
306 ITER(fp, fh_cache, &fh_head) {
350 ITER(fp, fh_cache, &fh_head) {
352 continue; /* skip to next ITER item */
424 } /* end of ITER loop */
976 ITER(new_mf, mntfs, &mfhead) {
H A Dmapc.c751 ITER(m, mnt_map, &map_list_head)
996 ITER(m, mnt_map, &map_list_head)
H A Dmntfs.c116 ITER(mf, mntfs, &mfhead) {
184 } /* end of ITER */
/freebsd-9.3-release/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-9.3-release/contrib/amd/include/
H A Dam_utils.h127 #define ITER(v, ty, q) \ macro

Completed in 218 milliseconds