| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567b/include/llvm/CodeGen/ |
| D | ReachingDefAnalysis.h | 1 //==--- llvm/CodeGen/ReachingDefAnalysis.h - Reaching Def Analysis -*- C++ -*---==//
9 /// \file Reaching Defs Analysis pass.
11 /// This pass tracks for each instruction what is the "closest" reaching def of
36 /// Thin wrapper around "int" used to store reaching definitions,
68 /// This class provides the reaching def analysis.
96 /// All reaching defs of a given RegUnit for a given MBB.
98 /// All reaching defs of all reg units for a given MBB
100 /// All reaching defs of all reg units for a all MBBs
140 /// Provides the instruction id of the closest reaching def instruction of
148 /// Return whether the reaching def for MI also is live out of its parent
[all …]
|
| D | RDFGraph.h | 21 // blocks, instructions, etc.), and based on the data flow (e.g. reaching
22 // definitions, reached uses, etc.). The single-reaching-definition principle
74 // Each def and use will contain the id of the reaching def, and also the
76 // The "next node sharing the same reaching def" is denoted as "sibling".
78 // - Def node contains: reaching def, sibling, first reached def, and first
80 // - Use node contains: reaching def and sibling.
87 // | | |Reaching |Reaching
129 // rd - reaching def,
138 // rd - reaching def,
172 // - Shadow: a reference that has duplicates holding additional reaching
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-16.0/llvm/include/llvm/CodeGen/ |
| H A D | ReachingDefAnalysis.h | 1 //==--- llvm/CodeGen/ReachingDefAnalysis.h - Reaching Def Analysis -*- C++ -*---==//
9 /// \file Reaching Defs Analysis pass.
11 /// This pass tracks for each instruction what is the "closest" reaching def of
36 /// Thin wrapper around "int" used to store reaching definitions,
68 /// This class provides the reaching def analysis.
96 /// All reaching defs of a given RegUnit for a given MBB.
98 /// All reaching defs of all reg units for a given MBB
100 /// All reaching defs of all reg units for a all MBBs
140 /// Provides the instruction id of the closest reaching def instruction of
148 /// Return whether the reaching def for MI also is live out of its parent
[all …]
|
| H A D | RDFGraph.h | 21 // blocks, instructions, etc.), and based on the data flow (e.g. reaching
22 // definitions, reached uses, etc.). The single-reaching-definition principle
74 // Each def and use will contain the id of the reaching def, and also the
76 // The "next node sharing the same reaching def" is denoted as "sibling".
78 // - Def node contains: reaching def, sibling, first reached def, and first
80 // - Use node contains: reaching def and sibling.
87 // | | |Reaching |Reaching
129 // rd - reaching def,
138 // rd - reaching def,
172 // - Shadow: a reference that has duplicates holding additional reaching
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/include/llvm/CodeGen/ |
| D | ReachingDefAnalysis.h | 1 //==--- llvm/CodeGen/ReachingDefAnalysis.h - Reaching Def Analysis -*- C++ -*---==//
9 /// \file Reaching Defs Analysis pass.
11 /// This pass tracks for each instruction what is the "closest" reaching def of
36 /// Thin wrapper around "int" used to store reaching definitions,
68 /// This class provides the reaching def analysis.
96 /// All reaching defs of a given RegUnit for a given MBB.
98 /// All reaching defs of all reg units for a given MBB
100 /// All reaching defs of all reg units for a all MBBs
140 /// Provides the instruction id of the closest reaching def instruction of
148 /// Return whether the reaching def for MI also is live out of its parent
[all …]
|
| D | RDFGraph.h | 21 // blocks, instructions, etc.), and based on the data flow (e.g. reaching
22 // definitions, reached uses, etc.). The single-reaching-definition principle
74 // Each def and use will contain the id of the reaching def, and also the
76 // The "next node sharing the same reaching def" is denoted as "sibling".
78 // - Def node contains: reaching def, sibling, first reached def, and first
80 // - Use node contains: reaching def and sibling.
87 // | | |Reaching |Reaching
129 // rd - reaching def,
138 // rd - reaching def,
172 // - Shadow: a reference that has duplicates holding additional reaching
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567/include/llvm/CodeGen/ |
| D | ReachingDefAnalysis.h | 1 //==--- llvm/CodeGen/ReachingDefAnalysis.h - Reaching Def Analysis -*- C++ -*---==//
9 /// \file Reaching Defs Analysis pass.
11 /// This pass tracks for each instruction what is the "closest" reaching def of
36 /// Thin wrapper around "int" used to store reaching definitions,
68 /// This class provides the reaching def analysis.
96 /// All reaching defs of a given RegUnit for a given MBB.
98 /// All reaching defs of all reg units for a given MBB
100 /// All reaching defs of all reg units for a all MBBs
140 /// Provides the instruction id of the closest reaching def instruction of
148 /// Return whether the reaching def for MI also is live out of its parent
[all …]
|
| D | RDFGraph.h | 21 // blocks, instructions, etc.), and based on the data flow (e.g. reaching
22 // definitions, reached uses, etc.). The single-reaching-definition principle
74 // Each def and use will contain the id of the reaching def, and also the
76 // The "next node sharing the same reaching def" is denoted as "sibling".
78 // - Def node contains: reaching def, sibling, first reached def, and first
80 // - Use node contains: reaching def and sibling.
87 // | | |Reaching |Reaching
129 // rd - reaching def,
138 // rd - reaching def,
172 // - Shadow: a reference that has duplicates holding additional reaching
[all …]
|
| /aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r522817/include/llvm/CodeGen/ |
| D | ReachingDefAnalysis.h | 1 //==--- llvm/CodeGen/ReachingDefAnalysis.h - Reaching Def Analysis -*- C++ -*---==//
9 /// \file Reaching Defs Analysis pass.
11 /// This pass tracks for each instruction what is the "closest" reaching def of
36 /// Thin wrapper around "int" used to store reaching definitions,
68 /// This class provides the reaching def analysis.
96 /// All reaching defs of a given RegUnit for a given MBB.
98 /// All reaching defs of all reg units for a given MBB
100 /// All reaching defs of all reg units for a all MBBs
140 /// Provides the instruction id of the closest reaching def instruction of
148 /// Return whether the reaching def for MI also is live out of its parent
[all …]
|
| D | RDFGraph.h | 21 // blocks, instructions, etc.), and based on the data flow (e.g. reaching
22 // definitions, reached uses, etc.). The single-reaching-definition principle
74 // Each def and use will contain the id of the reaching def, and also the
76 // The "next node sharing the same reaching def" is denoted as "sibling".
78 // - Def node contains: reaching def, sibling, first reached def, and first
80 // - Use node contains: reaching def and sibling.
87 // | | |Reaching |Reaching
129 // rd - reaching def,
138 // rd - reaching def,
172 // - Shadow: a reference that has duplicates holding additional reaching
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-16.0/llvm/lib/CodeGen/ |
| H A D | RDFLiveness.cpp | 80 // The order in the returned sequence is the order of reaching defs in the
83 // The list ends at a reaching phi def, or when the reference from RefA is
86 // (1) Returning the sequence of reaching defs for a particular reference
88 // (2) Returning a partial sequence of reaching defs, where the final goal
123 // The initial queue should not have reaching defs for shadows. The in getAllReachingDefs()
124 // whole point of a shadow is that it will have a reaching def that in getAllReachingDefs()
125 // is not aliased to the reaching defs of the related shadows. in getAllReachingDefs()
136 // Collect all the reaching defs, going up until a phi node is encountered, in getAllReachingDefs()
137 // or there are no more reaching defs. From this set, the actual set of in getAllReachingDefs()
138 // reaching defs will be selected. in getAllReachingDefs()
[all …]
|
| H A D | ReachingDefAnalysis.cpp | 1 //===---- ReachingDefAnalysis.cpp - Reaching Def Analysis ---*- C++ -*-----===//
19 #define DEBUG_TYPE "reaching-deps-analysis"
92 // Find the most recent reaching definition from a predecessor. in enterBasicBlock()
97 // Insert the most recent reaching definition we found. in enterBasicBlock()
159 // there is now a more recent incoming reaching definition from a predecessor. in reprocessBasicBlock()
178 // Update existing reaching def from predecessor to a more recent one. in reprocessBasicBlock()
181 // Insert new reaching def from predecessor. in reprocessBasicBlock()
185 // Update reaching def at end of of BB. Keep in mind that these are in reprocessBasicBlock()
216 LLVM_DEBUG(dbgs() << "********** REACHING DEFINITION ANALYSIS **********\n"); in runOnMachineFunction()
250 // Make sure reaching defs are sorted and unique. in traverse()
[all …]
|
| /aosp_15_r20/external/llvm/lib/Target/Hexagon/ |
| H A D | RDFLiveness.cpp | 59 // The order in the returned sequence is the order of reaching defs in the
62 // The list ends at a reaching phi def, or when the reference from RefA is
65 // (1) Returning the sequence of reaching defs for a particular reference
67 // (2) Returning a partial sequence of reaching defs, where the final goal
92 // The initial queue should not have reaching defs for shadows. The in getAllReachingDefs()
93 // whole point of a shadow is that it will have a reaching def that in getAllReachingDefs()
94 // is not aliased to the reaching defs of the related shadows. in getAllReachingDefs()
100 // Collect all the reaching defs, going up until a phi node is encountered, in getAllReachingDefs()
101 // or there are no more reaching defs. From this set, the actual set of in getAllReachingDefs()
102 // reaching defs will be selected. in getAllReachingDefs()
[all …]
|
| H A D | RDFGraph.h | 22 // blocks, instructions, etc.), and based on the data flow (e.g. reaching
23 // definitions, reached uses, etc.). The single-reaching-definition principle
75 // Each def and use will contain the id of the reaching def, and also the
77 // The "next node sharing the same reaching def" is denoted as "sibling".
79 // - Def node contains: reaching def, sibling, first reached def, and first
81 // - Use node contains: reaching def and sibling.
88 // | | |Reaching |Reaching
130 // rd - reaching def,
139 // rd - reaching def,
173 // - Shadow: a reference that has duplicates holding additional reaching
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| H A D | RDFLiveness.cpp | 78 // The order in the returned sequence is the order of reaching defs in the
81 // The list ends at a reaching phi def, or when the reference from RefA is
84 // (1) Returning the sequence of reaching defs for a particular reference
86 // (2) Returning a partial sequence of reaching defs, where the final goal
121 // The initial queue should not have reaching defs for shadows. The in getAllReachingDefs()
122 // whole point of a shadow is that it will have a reaching def that in getAllReachingDefs()
123 // is not aliased to the reaching defs of the related shadows. in getAllReachingDefs()
134 // Collect all the reaching defs, going up until a phi node is encountered, in getAllReachingDefs()
135 // or there are no more reaching defs. From this set, the actual set of in getAllReachingDefs()
136 // reaching defs will be selected. in getAllReachingDefs()
[all …]
|
| H A D | RDFGraph.h | 21 // blocks, instructions, etc.), and based on the data flow (e.g. reaching
22 // definitions, reached uses, etc.). The single-reaching-definition principle
74 // Each def and use will contain the id of the reaching def, and also the
76 // The "next node sharing the same reaching def" is denoted as "sibling".
78 // - Def node contains: reaching def, sibling, first reached def, and first
80 // - Use node contains: reaching def and sibling.
87 // | | |Reaching |Reaching
129 // rd - reaching def,
138 // rd - reaching def,
172 // - Shadow: a reference that has duplicates holding additional reaching
[all …]
|
| /aosp_15_r20/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
| H A D | ReachingDefAnalysis.h | 1 //==--- llvm/CodeGen/ReachingDefAnalysis.h - Reaching Def Analysis -*- C++ -*---==//
9 /// \file Reaching Defs Analysis pass.
11 /// This pass tracks for each instruction what is the "closest" reaching def of
35 /// This class provides the reaching def analysis.
62 /// All reaching defs of a given RegUnit for a given MBB.
64 /// All reaching defs of all reg units for a given MBB
66 /// All reaching defs of all reg units for a all MBBs
94 /// Provides the instruction id of the closest reaching def instruction of
98 /// Provides the instruction of the closest reaching def instruction of
109 /// Return whether the reaching def for MI also is live out of its parent
[all …]
|
| /aosp_15_r20/external/mesa3d/src/freedreno/ir3/ |
| H A D | ir3_ra_validate.c | 80 struct reaching_state reaching; member
253 return &ctx->reaching.shared; in ra_val_get_file()
255 return &ctx->reaching.predicate; in ra_val_get_file()
257 return &ctx->reaching.full; in ra_val_get_file()
259 return &ctx->reaching.half; in ra_val_get_file()
263 * def. In that case, we might end up two different defs legitimately reaching a
454 memcpy(state, &ctx->reaching.shared.regs[src_physreg], in propagate_spill()
460 memcpy(&ctx->reaching.shared.regs[dst_physreg], state, in propagate_spill()
488 ctx->reaching = ctx->block_reaching[block->index]; in propagate_block()
500 merge_state(ctx, &ctx->block_reaching[succ->index], &ctx->reaching); in propagate_block()
[all …]
|
| /aosp_15_r20/external/ltp/testcases/kernel/syscalls/setrlimit/ |
| H A D | setrlimit06.c | 10 * after reaching CPU time limit.
11 * 1) Process got SIGXCPU after reaching soft limit of CPU time.
12 * 2) Process got SIGKILL after reaching hard limit of CPU time.
86 "Got SIGXCPU then SIGKILL after reaching both limit"); in verify_setrlimit()
92 "Got only SIGKILL after reaching both limit"); in verify_setrlimit()
98 "Got only SIGXCPU after reaching both limit"); in verify_setrlimit()
104 "Got no signal after reaching both limit"); in verify_setrlimit()
|
| /aosp_15_r20/external/llvm/lib/Target/AArch64/ |
| H A D | AArch64CollectLOH.cpp | 276 /// Initialize the reaching definition algorithm:
389 /// Reaching def core algorithm:
438 /// Reaching definition algorithm.
440 /// \param[out] ColorOpToReachedUses will contain the result of the reaching
442 /// \param ADRPMode specify whether the reaching def algorithm should be tuned
477 /// print the result of the reaching definition algorithm.
557 /// Given the result of a reaching definition algorithm in ColorOpToReachedUses,
580 // if all the reaching defs are not adrp, this use will not be in reachedUsesToDefs()
592 // Do not consider self reaching as a simplifiable case for ADRP. in reachedUsesToDefs()
595 // If UsesIt has several reaching definitions, it is not in reachedUsesToDefs()
[all …]
|
| /aosp_15_r20/external/tensorflow/tensorflow/compiler/jit/ |
| H A D | resource_operation_safety_analysis.cc | 75 // node to the set of resource operation reaching that node. Since we visit
76 // producers before consumers, we can construct the set of reaching operations
77 // by taking the union of the operations reaching the input nodes. These
78 // "reaching resource operations" can then be used to create the pairs of
152 // A copy-on-write set used to store the set of ResourceOps reaching a node in a
273 // Merge the reaching resource operations for all the incoming edges to in ComputeIncompatibleResourceOperationPairs()
274 // create the set of all possible resource ops reaching `n`. in ComputeIncompatibleResourceOperationPairs()
|
| /aosp_15_r20/external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | ssa_rewrite_pass.cpp | 29 // When a target variable is loaded, it queries the variable's reaching
30 // definition. If the reaching definition is unknown at the current location,
197 // %39 to hold the unknown reaching def for %i. in AddPhiOperands()
199 // But then, when we go to complete %39 at the end. The reaching def in AddPhiOperands()
331 // Get the immediate reaching definition for |var_id|. in ProcessLoad()
333 // In the presence of variable pointers, the reaching definition may be in ProcessLoad()
358 // %13 = *%12, the type of %12's reaching definition is another float in ProcessLoad()
361 // When this happens, we need to continue looking up the reaching definition in ProcessLoad()
382 // If the reaching definition is a pointer type different than the type of in ProcessLoad()
387 // NOTE: if there is no reaching definition instruction, it means |val_id| in ProcessLoad()
|
| /aosp_15_r20/external/angle/third_party/spirv-tools/src/source/opt/ |
| H A D | ssa_rewrite_pass.cpp | 29 // When a target variable is loaded, it queries the variable's reaching
30 // definition. If the reaching definition is unknown at the current location,
197 // %39 to hold the unknown reaching def for %i. in AddPhiOperands()
199 // But then, when we go to complete %39 at the end. The reaching def in AddPhiOperands()
331 // Get the immediate reaching definition for |var_id|. in ProcessLoad()
333 // In the presence of variable pointers, the reaching definition may be in ProcessLoad()
358 // %13 = *%12, the type of %12's reaching definition is another float in ProcessLoad()
361 // When this happens, we need to continue looking up the reaching definition in ProcessLoad()
382 // If the reaching definition is a pointer type different than the type of in ProcessLoad()
387 // NOTE: if there is no reaching definition instruction, it means |val_id| in ProcessLoad()
|
| /aosp_15_r20/external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| H A D | ssa_rewrite_pass.cpp | 29 // When a target variable is loaded, it queries the variable's reaching
30 // definition. If the reaching definition is unknown at the current location,
197 // %39 to hold the unknown reaching def for %i. in AddPhiOperands()
199 // But then, when we go to complete %39 at the end. The reaching def in AddPhiOperands()
331 // Get the immediate reaching definition for |var_id|. in ProcessLoad()
333 // In the presence of variable pointers, the reaching definition may be in ProcessLoad()
358 // %13 = *%12, the type of %12's reaching definition is another float in ProcessLoad()
361 // When this happens, we need to continue looking up the reaching definition in ProcessLoad()
382 // If the reaching definition is a pointer type different than the type of in ProcessLoad()
387 // NOTE: if there is no reaching definition instruction, it means |val_id| in ProcessLoad()
|
| /aosp_15_r20/external/intel-media-driver/media_driver/agnostic/common/codec/hal/ |
| H A D | codechal_decode_vc1.h | 789 //! VC1 bitstream status, EOS if reaching end of stream, else bitstream value
800 //! VC1 bitstream status, EOS if reaching end of stream, else bitstream value
811 //! VC1 bitstream status, EOS if reaching end of stream, else bitstream value
822 //! VC1 bitstream status, EOS if reaching end of stream, else bitstream value
833 //! EOS if reaching end of stream, else bitstream value
840 //! EOS if reaching end of stream, else bitstream value
849 //! EOS if reaching end of stream, else bitstream value
858 //! EOS if reaching end of stream, else bitstream value
867 //! EOS if reaching end of stream, else bitstream value
|