| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| SyntheticCountsUtils.cpp | 24 // Given an SCC, propagate entry counts along the edge of the SCC nodes.
86 void SyntheticCountsUtils<CallGraphType>::propagate(const CallGraphType &CG, function in class:SyntheticCountsUtils
|
| LegacyDivergenceAnalysis.cpp | 102 void propagate();
267 void DivergencePropagator::propagate() { function in class:__anon4079::DivergencePropagator
349 DP.propagate();
|
| CFLAndersAliasAnalysis.cpp | 596 static void propagate(InstantiatedValue From, InstantiatedValue To, function
619 propagate(Edge.Other, Src, MatchState::FlowFromReadOnly, ReachSet,
621 propagate(Src, Edge.Other, MatchState::FlowToWriteOnly, ReachSet,
645 // TODO: propagate field offsets
657 propagate(*FromNodeBelow, *ToNodeBelow,
663 propagate(Src, *ToNodeBelow, ToState, ReachSet, WorkList);
685 propagate(FromNode, AssignEdge.Other, State, ReachSet, WorkList);
689 propagate(FromNode, RevAssignEdge.Other, State, ReachSet, WorkList);
694 propagate(FromNode, MemAlias, State, ReachSet, WorkList);
757 // Propagate attr on the same leve
[all...] |
| DependenceAnalysis.cpp | 21 // Currently, the implementation cannot propagate constraints between
3055 bool DependenceInfo::propagate(const SCEV *&Src, const SCEV *&Dst, function in class:DependenceInfo
3074 // Attempt to propagate a distance
3100 // Attempt to propagate a line
3177 // Attempt to propagate a point
3774 // propagate, possibly creating new SIVs and ZIVs
3781 if (propagate(Pair[SJ].Src, Pair[SJ].Dst, Pair[SJ].Loops,
3811 // test & propagate remaining RDIVs
3817 // I don't yet understand how to propagate RDIV results
4076 // propagate, possibly creating new SIVs and ZIV
[all...] |
| /src/sbin/fsck_ext2fs/ |
| dir.c | 112 * Propagate connected state through the tree.
115 propagate(void) function
|
| /src/sbin/fsck_lfs/ |
| dir.c | 92 * Propagate connected state through the tree.
95 propagate(void) function
|
| /src/external/ibm-public/postfix/dist/src/global/ |
| mail_addr_map.c | 11 /* ARGV *mail_addr_map_internal(path, address, propagate)
14 /* int propagate;
16 /* ARGV *mail_addr_map_opt(path, address, propagate, in_form,
20 /* int propagate;
110 ARGV *mail_addr_map_opt(MAPS *path, const char *address, int propagate,
147 * Prepend the original user to @otherdomain, but do not propagate
166 * Canonicalize the result, and propagate the unmatched extension to
169 argv = mail_addr_crunch_opt(string, propagate ? extension : 0,
252 int propagate; member in struct:__anon23098
504 result = mail_addr_map_opt(maps, test->address, test->propagate,
[all...] |
| /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/ |
| bitmap.h | 220 /* Propagate group state transitions up the tree. */
334 UNUSED bool propagate; local
341 propagate = (g == 0);
347 /* Propagate group state transitions up the tree. */
348 if (propagate) {
355 propagate = (g == 0);
360 if (!propagate) {
|
| /src/external/bsd/jemalloc.old/include/jemalloc/internal/ |
| bitmap.h | 220 /* Propagate group state transitions up the tree. */
334 UNUSED bool propagate; local
341 propagate = (g == 0);
347 /* Propagate group state transitions up the tree. */
348 if (propagate) {
355 propagate = (g == 0);
360 if (!propagate) {
|
| /src/external/bsd/jemalloc/dist/include/jemalloc/internal/ |
| bitmap.h | 229 /* Propagate group state transitions up the tree. */
347 UNUSED bool propagate; local
354 propagate = (g == 0);
360 /* Propagate group state transitions up the tree. */
361 if (propagate) {
368 propagate = (g == 0);
373 if (!propagate) {
|
| /src/external/bsd/jemalloc/include/jemalloc/internal/ |
| bitmap.h | 229 /* Propagate group state transitions up the tree. */
347 UNUSED bool propagate; local
354 propagate = (g == 0);
360 /* Propagate group state transitions up the tree. */
361 if (propagate) {
368 propagate = (g == 0);
373 if (!propagate) {
|
| /src/sbin/fsck_ffs/ |
| dir.c | 98 * Propagate connected state through the tree.
101 propagate(ino_t inumber) function
144 propagate(inumber);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| ipa-reference.cc | 401 /* Only look into nodes we can propagate something. */
757 propagate (void)
772 /* Propagate the local information through the call graph to produce
1311 unsigned int execute (function *) final override { return propagate (); }
755 propagate (void) function
|
| lower-subreg.cc | 449 auto_bitmap queue, propagate; local
457 bitmap_clear (propagate);
463 bitmap_ior_and_compl_into (propagate, b, non_decomposable_context);
466 bitmap_and_compl (queue, propagate, decomposable_context);
467 bitmap_ior_into (decomposable_context, propagate);
|
| ipa-modref.cc | 27 passes to propagate info downwards in the compilation order. IPA pass
968 void propagate ();
976 them in propagate. */
1848 /* Propagate load/stores across recursive calls. */
1851 modref_access_analysis::propagate () function in class:__anon13787::modref_access_analysis
1929 propagate ();
2009 to dynamically build dataflow graph to propagate on. */
2032 modref_eaf_analysis::propagate.
2235 for dataflow which is done by propagate call.
2245 void propagate ();
2749 modref_eaf_analysis::propagate () function in class:__anon13787::modref_eaf_analysis
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ipa-reference.cc | 401 /* Only look into nodes we can propagate something. */
757 propagate (void)
772 /* Propagate the local information through the call graph to produce
1311 virtual unsigned int execute (function *) { return propagate (); }
755 propagate (void) function
|
| lower-subreg.cc | 448 auto_bitmap queue, propagate; local
456 bitmap_clear (propagate);
462 bitmap_ior_and_compl_into (propagate, b, non_decomposable_context);
465 bitmap_and_compl (queue, propagate, decomposable_context);
466 bitmap_ior_into (decomposable_context, propagate);
|
| ipa-modref.cc | 27 passes to propagate info downwards in the compilation order. IPA pass
966 void propagate ();
974 them in propagate. */
1846 /* Propagate load/stores across recursive calls. */
1849 modref_access_analysis::propagate () function in class:__anon16217::modref_access_analysis
1927 propagate ();
2006 to dynamically build dataflow graph to propagate on. */
2029 modref_eaf_analysis::propagate.
2232 for dataflow which is done by propagate call.
2242 void propagate ();
2746 modref_eaf_analysis::propagate () function in class:__anon16217::modref_eaf_analysis
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonConstPropagation.cpp | 269 void propagate(MachineFunction &MF);
880 void MachineConstPropagator::propagate(MachineFunction &MF) { function in class:MachineConstPropagator
1072 propagate(MF);
|
| /src/external/mit/xorg/lib/libxcb/files/ |
| xinput.h | 4205 uint8_t propagate; member in struct:xcb_input_send_extension_event_request_t
9681 uint8_t propagate,
9699 uint8_t propagate,
|
| xproto.h | 1434 /**< The do-not-propagate-mask defines which events should not be propagated to
2113 uint8_t propagate; member in struct:xcb_send_event_request_t
7214 * @param propagate If \a propagate is true and no clients have selected any event on \a destination,
7217 * intervening window has that type in its do-not-propagate-mask. If no such
7231 * See \a destination and \a propagate.
7249 uint8_t propagate,
7258 * @param propagate If \a propagate is true and no clients have selected any event on \a destination,
7261 * intervening window has that type in its do-not-propagate-mask. If no suc
[all...] |
