| /src/external/gpl3/gcc/dist/gcc/ |
| graphite.h | 123 "*p" accesses all of the object allocated with 'malloc'.
177 isl_map *accesses; member in struct:poly_dr
|
| ipa-modref-tree.h | 32 2) Ref: this level represent ref alias set and links to accesses unless
35 3) Access: this level represent info about individual accesses. Presently
59 /* Modref record accesses relative to function parameters.
62 Accesses can be collected to boundedly sized arrays using
98 /* Return true if both accesses are the same. */
110 /* Insert A into vector ACCESSES. Limit size of vector to MAX_ACCESSES and
113 static int insert (vec <modref_access_node, va_gc> *&accesses,
149 vec <modref_access_node, va_gc> *accesses; variable
154 accesses (NULL)
160 vec_free (accesses);
[all...] |
| tree-dump.cc | 275 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (t); local
285 tree access = (accesses ? (*accesses)[ix] : access_public_node);
|
| ipa-sra.cc | 33 accessed. We differentiate between accesses done as a part of a call
100 /* Structure describing accesses to a specific portion of an aggregate
101 parameter, as given by the offset and size. Any smaller accesses that occur
103 cannot analyze parameters with only partially overlapping accesses. */
172 vec <param_access *, va_gc> *accesses; variable
203 a chunk of memory large enough to contain all accesses. */
214 gensum_param_access *accesses; member in struct:gensum_param_desc
215 /* Number of accesses in the access tree rooted in field accesses. */
226 /* Sum of sizes of nonarg accesses. *
[all...] |
| tree-ssa-sccvn.cc | 5640 auto_vec<ao_ref, accesses_limit> accesses; local
5652 if (accesses.length () >= accesses_limit - load_accesses)
5657 accesses.quick_grow (accesses.length () + 1);
5658 ao_ref_init (&accesses.last (), arg);
5670 else for (auto access_node : ref_node->accesses)
5672 accesses.quick_grow (accesses.length () + 1);
5673 ao_ref *r = &accesses.last ();
5706 / (accesses.length () + 1)))
[all...] |
| dwarf2out.cc | 25898 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo);
25904 (accesses ? (*accesses)[i] : access_public_node),
25880 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo); local
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| graphite.h | 123 "*p" accesses all of the object allocated with 'malloc'.
177 isl_map *accesses; member in struct:poly_dr
|
| ipa-modref-tree.h | 32 2) Ref: this level represent ref alias set and links to accesses unless
35 3) Access: this level represent info about individual accesses. Presently
59 /* Modref record accesses relative to function parameters.
62 Accesses can be collected to boundedly sized arrays using
98 /* Return true if both accesses are the same. */
110 /* Insert A into vector ACCESSES. Limit size of vector to MAX_ACCESSES and
113 static int insert (vec <modref_access_node, va_gc> *&accesses,
149 vec <modref_access_node, va_gc> *accesses; variable
154 accesses (NULL)
160 vec_free (accesses);
[all...] |
| tree-dump.cc | 275 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (t); local
285 tree access = (accesses ? (*accesses)[ix] : access_public_node);
|
| dbxout.cc | 2216 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo);
2229 tree access = (accesses ? (*accesses)[i] : access_public_node);
2208 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo); local
|
| ipa-sra.cc | 33 accessed. We differentiate between accesses done as a part of a call
97 /* Structure describing accesses to a specific portion of an aggregate
98 parameter, as given by the offset and size. Any smaller accesses that occur
100 cannot analyze parameters with only partially overlapping accesses. */
167 vec <param_access *, va_gc> *accesses; variable
188 gensum_param_access *accesses; member in struct:gensum_param_desc
189 /* Number of accesses in the access tree rooted in field accesses. */
199 /* Sum of sizes of nonarg accesses. */
219 /* Properly deallocate accesses of DESC. TODO: Since this data structure i
[all...] |
| tree-ssa-sccvn.cc | 5224 auto_vec<ao_ref, accesses_limit> accesses; local
5236 if (accesses.length () >= accesses_limit - load_accesses)
5241 accesses.quick_grow (accesses.length () + 1);
5242 ao_ref_init (&accesses.last (), arg);
5254 else for (auto access_node : ref_node->accesses)
5256 accesses.quick_grow (accesses.length () + 1);
5257 ao_ref *r = &accesses.last ();
5290 / (accesses.length () + 1)))
[all...] |
| dwarf2out.cc | 25760 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo);
25766 (accesses ? (*accesses)[i] : access_public_node),
25742 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo); local
|
| /src/external/gpl3/gcc.old/dist/gcc/rtl-ssa/ |
| changes.cc | 82 // Return a copy of access_array ACCESSES, allocating it on the
85 function_info::temp_access_array (access_array accesses)
87 if (accesses.empty ())
88 return accesses;
91 obstack_grow (&m_temp_obstack, accesses.begin (), accesses.size_bytes ());
93 accesses.size () };
439 access_array accesses = temp_access_array (m_temp_defs); local
440 change.new_defs = def_array (accesses);
657 // Finalize the new list of accesses for the change. Don't instal
[all...] |
| /src/external/gpl3/gdb/dist/sim/frv/ |
| cache.h | 155 unsigned long accesses; /* number of cache accesses. */ member in struct:__anon19349
|
| profile.c | 1959 unsigned accesses; local
1962 accesses = cache->statistics.accesses;
1963 sim_io_printf (sd, " Total accesses: %s\n", COMMAS (accesses));
1964 if (accesses != 0)
1969 rate = (float)hits / accesses;
|
| /src/external/gpl3/gdb.old/dist/sim/frv/ |
| cache.h | 155 unsigned long accesses; /* number of cache accesses. */ member in struct:__anon22088
|
| profile.c | 1959 unsigned accesses; local
1962 accesses = cache->statistics.accesses;
1963 sim_io_printf (sd, " Total accesses: %s\n", COMMAS (accesses));
1964 if (accesses != 0)
1969 rate = (float)hits / accesses;
|
| /src/external/gpl3/gcc/dist/gcc/cp/ |
| search.cc | 614 vec<tree, va_gc> *accesses;
618 accesses = BINFO_BASE_ACCESSES (binfo);
621 tree base_access = (*accesses)[i];
613 vec<tree, va_gc> *accesses; local
|
| class.cc | 6427 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo);
6435 if ((*accesses)[i] == access_public_node
6423 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo); local
|
| /src/external/gpl3/gcc.old/dist/gcc/cp/ |
| search.cc | 575 vec<tree, va_gc> *accesses;
579 accesses = BINFO_BASE_ACCESSES (binfo);
582 tree base_access = (*accesses)[i];
574 vec<tree, va_gc> *accesses; local
|
| class.cc | 6124 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo);
6132 if ((*accesses)[i] == access_public_node
6120 vec<tree, va_gc> *accesses = BINFO_BASE_ACCESSES (binfo); local
|
| /src/external/mit/isl/dist/ |
| isl_flow.c | 373 /* Sort the must source accesses in their textual order.
424 * and one for the resulting may dependences. May accesses can
699 /* Given a shared_level between two accesses, return 1 if the
839 /* Given the must and may dependence relations for the must accesses
840 * for level sink_level, check if there are any accesses of may access j
842 * If some of these accesses are intermediate with respect to
1051 /* Compute dependences for the case where all accesses are "may"
1052 * accesses, which boils down to computing memory based dependences.
1120 * add result to possible last accesses at level l of source w
1124 * for all possible last accesses dep of w at
2345 isl_access_info *accesses; member in struct:isl_compute_flow_data
[all...] |
