Searched refs:BARRIER (Results 1 - 25 of 85) sorted by relevance

1234

/openbsd-current/gnu/usr.bin/gcc/gcc/
H A Dgraph.c306 if (GET_CODE (tmp_rtx) == BARRIER)
367 || GET_CODE (next_insn) != BARRIER)
379 || GET_CODE (next_insn) == BARRIER));
H A Dcfgbuild.c87 case BARRIER:
128 case BARRIER:
153 if ((GET_CODE (insn) == CODE_LABEL || GET_CODE (insn) == BARRIER)
495 if ((GET_CODE (insn) == CODE_LABEL || GET_CODE (insn) == BARRIER)
540 case BARRIER:
H A Demit-rtl.c2646 case BARRIER:
2773 case BARRIER:
3304 /* If we are splitting a JUMP_INSN, it might be followed by a BARRIER.
3306 if (after && GET_CODE (after) == BARRIER)
3536 INSN may be an INSN, JUMP_INSN, CALL_INSN, CODE_LABEL, BARRIER or NOTE. */
3595 if (GET_CODE (after) != BARRIER
3596 && GET_CODE (insn) != BARRIER
3606 && GET_CODE (insn) != BARRIER
3664 if (GET_CODE (before) != BARRIER
3665 && GET_CODE (insn) != BARRIER
[all...]
H A Djump.c99 /* Some old code expects exactly one BARRIER as the NEXT_INSN of a
101 may have crept in, or the BARRIER may be separated from the last
114 if (GET_CODE (insn) == BARRIER)
117 if (GET_CODE (prev) == BARRIER)
421 case BARRIER:
513 if (! copy || GET_CODE (copy) != BARRIER)
1388 && GET_CODE (next) == BARRIER);
1554 /* Verify INSN is a BARRIER and delete it. */
1560 if (GET_CODE (insn) != BARRIER)
1772 if (next != 0 && GET_CODE (next) == BARRIER)
[all...]
H A Dcfgrtl.c404 if (tmp && GET_CODE (tmp) == BARRIER)
465 if (GET_CODE (insn) != BARRIER)
614 else if (GET_CODE (NEXT_INSN (a_end)) == BARRIER)
778 if (!barrier || GET_CODE (barrier) != BARRIER)
1725 && GET_CODE (tmp_rtx) != BARRIER)
1961 if (GET_CODE (insn) == BARRIER
2041 for (insn = bb->end; !insn || GET_CODE (insn) != BARRIER;
2125 || GET_CODE (x) == BARRIER)
2171 case BARRIER:
2194 && ! (NEXT_INSN (x) && GET_CODE (NEXT_INSN (x)) == BARRIER))
[all...]
H A Dprint-rtl.c145 /* When printing in VCG format we write INSNs, NOTE, LABEL, and BARRIER
149 || GET_CODE (in_rtx) == CODE_LABEL || GET_CODE (in_rtx) == BARRIER))
599 || GET_CODE (in_rtx) == CODE_LABEL || GET_CODE (in_rtx) == BARRIER))
746 case BARRIER:
H A Dssa-dce.c384 case BARRIER:
718 by a BARRIER. delete_insn has the nasty habit of deleting barriers
726 if (!next || GET_CODE (next) != BARRIER)
H A Dra-debug.c359 if (INSN_P (x) || code == NOTE || code == CODE_LABEL || code == BARRIER)
364 if (code == BARRIER)
389 if (code == BARRIER)
590 if (GET_CODE (insn) == BARRIER)
H A Dunroll.c257 a JUMP_INSN (for conditional jumps) or a BARRIER (for unconditional
315 /* If the last instruction is not a BARRIER or a JUMP_INSN, then
318 if (GET_CODE (last_loop_insn) == BARRIER)
467 (or BARRIER), so that any NOTEs between the JUMP_INSN and the end of
472 if (GET_CODE (last_loop_insn) == BARRIER)
508 if (GET_CODE (last_loop_insn) == BARRIER)
541 if (GET_CODE (last_loop_insn) == BARRIER)
641 && GET_CODE (last_loop_insn) == BARRIER
1046 if (GET_CODE (last_loop_insn) == BARRIER)
1090 if (GET_CODE (last_loop_insn) == BARRIER)
[all...]
H A Dresource.c130 backwards toward a BARRIER where the live register information is
140 /* Scan backwards to the previous BARRIER. Then see if we can find a
143 insn && GET_CODE (insn) != BARRIER && search_limit != 0;
147 /* The closest BARRIER is too far away. */
485 case BARRIER:
663 case BARRIER:
871 We find the previous BARRIER and look at all immediately following labels
877 reg_renumber. (By starting at a label following a BARRIER, we are immune
H A Dcfglayout.c98 case BARRIER:
703 if (GET_CODE (insn) == BARRIER)
804 case BARRIER:
H A Dreorg.c256 case BARRIER:
365 if (GET_CODE (insn) == BARRIER
405 /* Otherwise, make a new label and emit a RETURN and BARRIER,
460 /* If INSN is followed by a BARRIER, delete the BARRIER since it will only
462 We will put the BARRIER back in later. */
463 if (NEXT_INSN (insn) && GET_CODE (NEXT_INSN (insn)) == BARRIER)
547 /* If there used to be a BARRIER, put it back. */
914 case BARRIER:
915 /* A BARRIER ca
[all...]
H A Dfinal.c669 case BARRIER:
1148 else if (GET_CODE (insn) == BARRIER)
1280 if (GET_CODE (insn) == NOTE || GET_CODE (insn) == BARRIER
2176 case BARRIER:
2223 if (barrier && GET_CODE (barrier) == BARRIER
H A Drtl.h156 1 in an INSN, CALL_INSN, JUMP_INSN, CODE_LABEL, BARRIER, or NOTE
224 || GET_CODE (X) == BARRIER \
265 #define BARRIER_P(X) (GET_CODE (X) == BARRIER)
568 JUMP_INSN, INSN_LIST, BARRIER, CODE_LABEL, CONST, \
574 JUMP_INSN, BARRIER, SET)->frame_related)
579 CODE_LABEL, BARRIER, NOTE)->volatil)
/openbsd-current/sbin/pfctl/
H A Dpfctl_optimize.c83 BARRIER, /* the presence of the field puts the rule in its own block */ enumerator in enum:__anon12
107 PF_RULE_FIELD(label, BARRIER),
108 PF_RULE_FIELD(prob, BARRIER),
109 PF_RULE_FIELD(max_states, BARRIER),
110 PF_RULE_FIELD(max_src_nodes, BARRIER),
111 PF_RULE_FIELD(max_src_states, BARRIER),
112 PF_RULE_FIELD(max_src_conn, BARRIER),
113 PF_RULE_FIELD(max_src_conn_rate, BARRIER),
114 PF_RULE_FIELD(anchor, BARRIER), /* for now */
1383 if (pf_rule_desc[i].prf_type == BARRIER) {
[all...]
/openbsd-current/gnu/gcc/gcc/
H A Dcfgbuild.c81 case BARRIER:
132 case BARRIER:
497 case BARRIER:
H A Demit-rtl.c2435 case BARRIER:
2541 case BARRIER:
2610 case BARRIER:
3139 /* If we are splitting a JUMP_INSN, it might be followed by a BARRIER.
3368 INSN may be an INSN, JUMP_INSN, CALL_INSN, CODE_LABEL, BARRIER or NOTE. */
3746 case BARRIER:
3789 case BARRIER:
3832 case BARRIER:
3859 /* Make an insn of code BARRIER
3865 rtx insn = rtx_alloc (BARRIER);
[all...]
H A Dresource.c129 backwards toward a BARRIER where the live register information is
137 /* Scan backwards to the previous BARRIER. Then see if we can find a
144 /* The closest BARRIER is too far away. */
470 case BARRIER:
645 case BARRIER:
865 We find the previous BARRIER and look at all immediately following labels
871 reg_renumber. (By starting at a label following a BARRIER, we are immune
H A Dcfglayout.c98 case BARRIER:
983 case BARRIER:
H A Dprint-rtl.c162 /* When printing in VCG format we write INSNs, NOTE, LABEL, and BARRIER
753 case BARRIER:
H A Dsched-vis.c674 case BARRIER:
/openbsd-current/gnu/gcc/gcc/config/arc/
H A Darc.c1285 /* If the last insn was a BARRIER, we don't have to write any code
1289 if (insn && GET_CODE (insn) == BARRIER)
2029 if (GET_CODE (start_insn) == BARRIER)
2044 if (GET_CODE (start_insn) == BARRIER)
2117 if (GET_CODE (this_insn) == BARRIER)
2146 case BARRIER:
2226 || (GET_CODE (this_insn) != BARRIER
/openbsd-current/gnu/usr.bin/gcc/gcc/config/arc/
H A Darc.c1254 /* If the last insn was a BARRIER, we don't have to write any code
1258 if (insn && GET_CODE (insn) == BARRIER)
2010 if (GET_CODE (start_insn) == BARRIER)
2025 if (GET_CODE (start_insn) == BARRIER)
2098 if (GET_CODE (this_insn) == BARRIER)
2127 case BARRIER:
2205 if (this_insn && (GET_CODE (this_insn) == BARRIER
/openbsd-current/gnu/gcc/gcc/config/m88k/
H A Dm88k.h1190 if (GET_CODE (RTX) == BARRIER \
/openbsd-current/gnu/usr.bin/gcc/gcc/config/arm/
H A Darm.c6008 if (GET_CODE (from) == BARRIER)
6221 if (GET_CODE (insn) == BARRIER)
6253 while (fix && GET_CODE (fix->insn) == BARRIER)
6264 if (GET_CODE (ftmp->insn) == BARRIER)
6323 if (GET_CODE (ftmp->insn) != BARRIER
6335 if (GET_CODE (this_fix->insn) != BARRIER)
9060 if (GET_CODE (start_insn) == BARRIER)
9075 if (GET_CODE (start_insn) == BARRIER)
9183 case BARRIER:
9213 if (this_insn && GET_CODE (this_insn) == BARRIER)
[all...]

Completed in 410 milliseconds

1234