| /haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
| H A D | ssa-lim-11.c | 8 long accesses; member in struct:thread_param
15 long accesses = p->accesses; local
19 for (j=0; j<accesses; j++)
|
| /haiku-buildtools/binutils/gas/testsuite/gas/mmix/ |
| H A D | reloclab.s | 2 # Mix in different accesses to local labels to see that relaxing works for
|
| /haiku-buildtools/legacy/binutils/gas/testsuite/gas/mmix/ |
| H A D | reloclab.s | 2 # Mix in different accesses to local labels to see that relaxing works for
|
| /haiku-buildtools/binutils/ld/testsuite/ld-powerpc/ |
| H A D | tocopt4b.s | 8 # toc analysis only considers toc accesses from the current object file.
|
| /haiku-buildtools/gcc/gcc/testsuite/go.test/test/ |
| H A D | recover2.go | 10 // null pointer accesses
|
| H A D | nilptr.go | 18 // these nil pointer accesses, not just relying on the hardware.
|
| /haiku-buildtools/binutils/ld/testsuite/ld-mips-elf/ |
| H A D | mips16-pic-1.inc | 59 # called a_NAME and b_NAME. The former uses absolute accesses
60 # and the latter uses PIC accesses.
|
| /haiku-buildtools/isl/ |
| H A D | isl_flow.c | 333 /* Sort the must source accesses in their textual order.
368 * and one for the resulting may dependences. May accesses can
639 /* Given a shared_level between two accesses, return 1 if the
768 /* Given the must and may dependence relations for the must accesses
769 * for level sink_level, check if there are any accesses of may access j
771 * If some of these accesses are intermediate with respect to
824 /* Compute dependences for the case where all accesses are "may"
825 * accesses, which boils down to computing memory based dependences.
885 * add result to possible last accesses at level l of source w
889 * for all possible last accesses de
1181 isl_access_info *accesses; member in struct:isl_compute_flow_data
[all...] |
| /haiku-buildtools/gcc/gcc/ |
| H A D | tree-dump.c | 307 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (t); local
317 tree access = (accesses ? (*accesses)[ix] : access_public_node);
|
| H A D | graphite-interchange.c | 200 /* pdr->accesses: [P1..nb_param,I1..nb_domain]->[a,S1..nb_subscript]
210 isl_map_copy (pdr->accesses));
227 offset = 1 + isl_map_dim (pdr->accesses, isl_dim_out);
366 a maximization problem: first, we add to DR accesses the dimensions
|
| H A D | graphite-poly.c | 307 pdr->accesses = acc;
320 isl_map_free (pdr->accesses);
424 fprintf (file, "# data accesses (\n");
428 /* XXX isl dump accesses/subscripts */
|
| H A D | graphite-dependences.c | 114 /* Constrain pdr->accesses with pdr->extent and pbb->domain. */
119 isl_map *x = isl_map_intersect_range (isl_map_copy (pdr->accesses),
|
| H A D | dbxout.c | 2172 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo);
2185 tree access = (accesses ? (*accesses)[i] : access_public_node);
2164 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo); local
|
| H A D | graphite-poly.h | 128 "*p" accesses all of the object allocated with 'malloc'.
182 isl_map *accesses; member in struct:poly_dr
287 /* Return true when PDR1 and PDR2 are similar data accesses: they have
|
| H A D | dwarf2out.c | 19948 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo);
19954 (accesses ? (*accesses)[i] : access_public_node),
19930 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo); local
|
| /haiku-buildtools/gcc/gcc/cp/ |
| H A D | search.c | 655 vec<tree, va_gc> *accesses;
659 accesses = BINFO_BASE_ACCESSES (binfo);
662 tree base_access = (*accesses)[i];
653 vec<tree, va_gc> *accesses; local
|
| H A D | class.c | 5757 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo);
5765 if ((*accesses)[i] == access_public_node
5753 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo); local
|