| /src/external/gpl3/gcc/dist/libgcc/config/avr/libf7/ |
| f7-wraps.h | 7 ;; Software Foundation; either version 3, or (at your option) any later variable
|
| /src/external/gpl3/gcc.old/dist/libgcc/config/avr/libf7/ |
| f7-wraps.h | 7 ;; Software Foundation; either version 3, or (at your option) any later variable
|
| /src/usr.bin/make/unit-tests/ |
| var-op-expand.mk | 138 # assignment. The undefined variables are kept as-is and are later expanded
154 # the time of assignment but only later, when ${VAR} appears in the condition.
193 # The following test case demonstrates that the variable 'LATER' is preserved
194 # in the ':=' assignment since the variable 'LATER' is not yet defined.
195 # After the assignment to 'LATER', evaluating the variable 'INDIRECT'
196 # evaluates 'LATER' as well.
198 .undef LATER
199 INDIRECT:= ${LATER:S,value,replaced,}
203 LATER= late-value
211 .undef LATER
218 later= lowercase-value macro
280 later= lowercase-value macro
[all...] |
| /src/external/bsd/mdocml/dist/ |
| mdoc_macro.c | 547 struct roff_node *itblk; /* An It block starting later. */
548 struct roff_node *later; /* A sub-block starting later. */ local
588 endbody = itblk = later = NULL;
607 if (later != NULL)
625 if (later == NULL ||
639 roff_name[atok], roff_name[later->tok]);
664 if (later != NULL)
675 if (later == NULL)
676 later = n
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| lcm.cc | 8 Software Foundation; either version 3, or (at your option) any later
204 /* later(p,s) is dependent on the calculation of laterin(p).
205 laterin(p) is dependent on the calculation of later(p2,p).
208 later(ENTRY, succs(ENTRY)) are defined using laterin(ENTRY)
209 laterin(succs(ENTRY)) is defined by later(ENTRY, succs(ENTRY)).
212 in the work list, anytime we change later(bb), we need to add
222 We optimistically initialize LATER. That is the only time this routine
223 will compute LATER for an edge out of the entry block since the entry
235 sbitmap *antloc, sbitmap *later, sbitmap *laterin)
255 /* We want a maximal solution, so initially consider LATER true fo
376 sbitmap *later, *laterin; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| lcm.cc | 8 Software Foundation; either version 3, or (at your option) any later
202 /* later(p,s) is dependent on the calculation of laterin(p).
203 laterin(p) is dependent on the calculation of later(p2,p).
206 later(ENTRY, succs(ENTRY)) are defined using laterin(ENTRY)
207 laterin(succs(ENTRY)) is defined by later(ENTRY, succs(ENTRY)).
210 in the work list, anytime we change later(bb), we need to add
220 We optimistically initialize LATER. That is the only time this routine
221 will compute LATER for an edge out of the entry block since the entry
233 sbitmap *antloc, sbitmap *later, sbitmap *laterin)
253 /* We want a maximal solution, so initially consider LATER true fo
375 sbitmap *later, *laterin; local
[all...] |
| /src/external/cddl/osnet/dist/uts/common/dtrace/ |
| fasttrap.c | 471 int i, later = 0, rval; local
474 while (!fasttrap_cleanup_drain || later > 0) {
478 later = 0;
536 later += fp->ftp_marked;
554 if (later > 0 || fasttrap_cleanup_work ||
1983 * We later assume that each probe has exactly one tracepoint
2223 * table. Later, when the probe fires, we only remap the arguments
|
| /src/sys/dev/audio/ |
| audio.c | 2404 /* If audiobell, only sample_rate will be set later. */
5827 /* If this is the second or later, add it. */
5976 bool later = false; local
5979 later = true;
5985 if (later) {
|
