/dports/lang/gcc6-aux/gcc-6-20180516/gcc/ |
H A D | var-tracking.c | 3309 for (; s1node && s2node; in intersect_loc_chains() 3310 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3311 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3313 else if (s1node->loc == val) in intersect_loc_chains() 3317 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3321 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3323 if (s1node->loc == val) in intersect_loc_chains() 3330 MIN (s1node->init, found->init)); in intersect_loc_chains() 3334 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3335 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/lang/gcc48/gcc-4.8.5/gcc/ |
H A D | var-tracking.c | 3257 for (; s1node && s2node; in intersect_loc_chains() 3258 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3259 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3261 else if (s1node->loc == val) in intersect_loc_chains() 3265 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3269 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3271 if (s1node->loc == val) in intersect_loc_chains() 3278 MIN (s1node->init, found->init)); in intersect_loc_chains() 3282 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3283 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ |
H A D | var-tracking.c | 3322 for (; s1node && s2node; in intersect_loc_chains() 3323 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3324 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3326 else if (s1node->loc == val) in intersect_loc_chains() 3330 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3334 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3336 if (s1node->loc == val) in intersect_loc_chains() 3343 MIN (s1node->init, found->init)); in intersect_loc_chains() 3347 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3348 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
H A D | ChangeLog-2010 | 29842 with s1node chain as long as the locations are equal, don't
|
/dports/lang/gnat_util/gcc-6-20180516/gcc/ |
H A D | var-tracking.c | 3309 for (; s1node && s2node; in intersect_loc_chains() 3310 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3311 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3313 else if (s1node->loc == val) in intersect_loc_chains() 3317 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3321 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3323 if (s1node->loc == val) in intersect_loc_chains() 3330 MIN (s1node->init, found->init)); in intersect_loc_chains() 3334 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3335 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
H A D | ChangeLog-2010 | 29842 with s1node chain as long as the locations are equal, don't
|
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ |
H A D | var-tracking.c | 3280 for (; s1node && s2node; in intersect_loc_chains() 3281 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3282 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3284 else if (s1node->loc == val) in intersect_loc_chains() 3288 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3292 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3294 if (s1node->loc == val) in intersect_loc_chains() 3301 MIN (s1node->init, found->init)); in intersect_loc_chains() 3305 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3306 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/ |
H A D | var-tracking.c | 3363 for (; s1node && s2node; in intersect_loc_chains() 3364 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3365 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3367 else if (s1node->loc == val) in intersect_loc_chains() 3371 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3375 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3377 if (s1node->loc == val) in intersect_loc_chains() 3384 MIN (s1node->init, found->init)); in intersect_loc_chains() 3388 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3389 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/ |
H A D | var-tracking.c | 3362 for (; s1node && s2node; in intersect_loc_chains() 3363 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3364 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3366 else if (s1node->loc == val) in intersect_loc_chains() 3370 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3374 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3376 if (s1node->loc == val) in intersect_loc_chains() 3383 MIN (s1node->init, found->init)); in intersect_loc_chains() 3387 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3388 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/lang/gcc8/gcc-8.5.0/gcc/ |
H A D | var-tracking.c | 3354 for (; s1node && s2node; in intersect_loc_chains() 3355 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3356 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3358 else if (s1node->loc == val) in intersect_loc_chains() 3362 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3366 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3368 if (s1node->loc == val) in intersect_loc_chains() 3375 MIN (s1node->init, found->init)); in intersect_loc_chains() 3379 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3380 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/lang/gcc10/gcc-10.3.0/gcc/ |
H A D | var-tracking.c | 3355 for (; s1node && s2node; in intersect_loc_chains() 3356 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3357 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3359 else if (s1node->loc == val) in intersect_loc_chains() 3363 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3367 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3369 if (s1node->loc == val) in intersect_loc_chains() 3376 MIN (s1node->init, found->init)); in intersect_loc_chains() 3380 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3381 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ |
H A D | var-tracking.c | 3354 for (; s1node && s2node; in intersect_loc_chains() 3355 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3356 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3358 else if (s1node->loc == val) in intersect_loc_chains() 3362 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3366 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3368 if (s1node->loc == val) in intersect_loc_chains() 3375 MIN (s1node->init, found->init)); in intersect_loc_chains() 3379 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3380 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ |
H A D | var-tracking.c | 3354 for (; s1node && s2node; in intersect_loc_chains() 3355 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3356 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3358 else if (s1node->loc == val) in intersect_loc_chains() 3362 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3366 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3368 if (s1node->loc == val) in intersect_loc_chains() 3375 MIN (s1node->init, found->init)); in intersect_loc_chains() 3379 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3380 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
H A D | ChangeLog-2010 | 29842 with s1node chain as long as the locations are equal, don't
|
/dports/devel/avr-gcc/gcc-10.2.0/gcc/ |
H A D | var-tracking.c | 3355 for (; s1node && s2node; in intersect_loc_chains() 3356 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3357 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3359 else if (s1node->loc == val) in intersect_loc_chains() 3363 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3367 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3369 if (s1node->loc == val) in intersect_loc_chains() 3376 MIN (s1node->init, found->init)); in intersect_loc_chains() 3380 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3381 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/ |
H A D | var-tracking.c | 3354 for (; s1node && s2node; in intersect_loc_chains() 3355 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3356 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3358 else if (s1node->loc == val) in intersect_loc_chains() 3362 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3366 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3368 if (s1node->loc == val) in intersect_loc_chains() 3375 MIN (s1node->init, found->init)); in intersect_loc_chains() 3379 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3380 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
H A D | var-tracking.c | 3354 for (; s1node && s2node; in intersect_loc_chains() 3355 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3356 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3358 else if (s1node->loc == val) in intersect_loc_chains() 3362 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3366 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3368 if (s1node->loc == val) in intersect_loc_chains() 3375 MIN (s1node->init, found->init)); in intersect_loc_chains() 3379 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3380 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
H A D | var-tracking.c | 3354 for (; s1node && s2node; in intersect_loc_chains() 3355 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3356 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3358 else if (s1node->loc == val) in intersect_loc_chains() 3362 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3366 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3368 if (s1node->loc == val) in intersect_loc_chains() 3375 MIN (s1node->init, found->init)); in intersect_loc_chains() 3379 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3380 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
H A D | ChangeLog-2010 | 29842 with s1node chain as long as the locations are equal, don't
|
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ |
H A D | var-tracking.c | 3363 for (; s1node && s2node; in intersect_loc_chains() 3364 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3365 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3367 else if (s1node->loc == val) in intersect_loc_chains() 3371 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3375 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3377 if (s1node->loc == val) in intersect_loc_chains() 3384 MIN (s1node->init, found->init)); in intersect_loc_chains() 3388 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3389 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ |
H A D | var-tracking.c | 3354 for (; s1node && s2node; in intersect_loc_chains() 3355 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3356 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3358 else if (s1node->loc == val) in intersect_loc_chains() 3362 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3366 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3368 if (s1node->loc == val) in intersect_loc_chains() 3375 MIN (s1node->init, found->init)); in intersect_loc_chains() 3379 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3380 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/lang/gcc11/gcc-11.2.0/gcc/ |
H A D | var-tracking.c | 3363 for (; s1node && s2node; in intersect_loc_chains() 3364 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3365 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3367 else if (s1node->loc == val) in intersect_loc_chains() 3371 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3375 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3377 if (s1node->loc == val) in intersect_loc_chains() 3384 MIN (s1node->init, found->init)); in intersect_loc_chains() 3388 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3389 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/ |
H A D | var-tracking.c | 3355 for (; s1node && s2node; in intersect_loc_chains() 3356 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3357 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3359 else if (s1node->loc == val) in intersect_loc_chains() 3363 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3367 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3369 if (s1node->loc == val) in intersect_loc_chains() 3376 MIN (s1node->init, found->init)); in intersect_loc_chains() 3380 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3381 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/lang/gcc9/gcc-9.4.0/gcc/ |
H A D | var-tracking.c | 3354 for (; s1node && s2node; in intersect_loc_chains() 3355 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3356 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3358 else if (s1node->loc == val) in intersect_loc_chains() 3362 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3366 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3368 if (s1node->loc == val) in intersect_loc_chains() 3375 MIN (s1node->init, found->init)); in intersect_loc_chains() 3379 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3380 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/ |
H A D | var-tracking.c | 3354 for (; s1node && s2node; in intersect_loc_chains() 3355 s1node = s1node->next, s2node = s2node->next) in intersect_loc_chains() 3356 if (s1node->loc != s2node->loc) in intersect_loc_chains() 3358 else if (s1node->loc == val) in intersect_loc_chains() 3362 MIN (s1node->init, s2node->init)); in intersect_loc_chains() 3366 for (; s1node; s1node = s1node->next) in intersect_loc_chains() 3368 if (s1node->loc == val) in intersect_loc_chains() 3375 MIN (s1node->init, found->init)); in intersect_loc_chains() 3379 if (GET_CODE (s1node->loc) == VALUE in intersect_loc_chains() 3380 && !VALUE_RECURSED_INTO (s1node->loc)) in intersect_loc_chains() [all …]
|