| /external/llvm/include/llvm/Support/ |
| GenericDomTree.h | 261 std::vector<typename GraphT::NodeType *> PredBlocks;
267 PredBlocks.push_back(*PI);
269 assert(!PredBlocks.empty() && "No predblocks?");
288 for (i = 0; i < PredBlocks.size(); ++i)
289 if (DT.isReachableFromEntry(PredBlocks[i])) {
290 NewBBIDom = PredBlocks[i];
300 for (i = i + 1; i < PredBlocks.size(); ++i) {
301 if (DT.isReachableFromEntry(PredBlocks[i]))
302 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| Dominators.h | 234 std::vector<typename GraphT::NodeType*> PredBlocks;
239 PredBlocks.push_back(*PI);
241 assert(!PredBlocks.empty() && "No predblocks?");
259 for (i = 0; i < PredBlocks.size(); ++i)
260 if (DT.isReachableFromEntry(PredBlocks[i])) {
261 NewBBIDom = PredBlocks[i];
271 for (i = i + 1; i < PredBlocks.size(); ++i) {
272 if (DT.isReachableFromEntry(PredBlocks[i]))
273 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTree.h | 287 std::vector<typename GraphT::NodeRef> PredBlocks;
293 PredBlocks.push_back(*PI);
295 assert(!PredBlocks.empty() && "No predblocks?");
314 for (i = 0; i < PredBlocks.size(); ++i)
315 if (DT.isReachableFromEntry(PredBlocks[i])) {
316 NewBBIDom = PredBlocks[i];
326 for (i = i + 1; i < PredBlocks.size(); ++i) {
327 if (DT.isReachableFromEntry(PredBlocks[i]))
328 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Support/ |
| GenericDomTree.h | 288 std::vector<NodeRef> PredBlocks;
290 PredBlocks.push_back(Pred);
292 assert(!PredBlocks.empty() && "No predblocks?");
307 for (i = 0; i < PredBlocks.size(); ++i)
308 if (isReachableFromEntry(PredBlocks[i])) {
309 NewBBIDom = PredBlocks[i];
319 for (i = i + 1; i < PredBlocks.size(); ++i) {
320 if (isReachableFromEntry(PredBlocks[i]))
321 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Support/ |
| GenericDomTree.h | 288 std::vector<NodeRef> PredBlocks;
290 PredBlocks.push_back(Pred);
292 assert(!PredBlocks.empty() && "No predblocks?");
307 for (i = 0; i < PredBlocks.size(); ++i)
308 if (isReachableFromEntry(PredBlocks[i])) {
309 NewBBIDom = PredBlocks[i];
319 for (i = i + 1; i < PredBlocks.size(); ++i) {
320 if (isReachableFromEntry(PredBlocks[i]))
321 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Support/ |
| GenericDomTree.h | 779 std::vector<NodeRef> PredBlocks;
781 PredBlocks.push_back(Pred);
783 assert(!PredBlocks.empty() && "No predblocks?");
798 for (i = 0; i < PredBlocks.size(); ++i)
799 if (isReachableFromEntry(PredBlocks[i])) {
800 NewBBIDom = PredBlocks[i];
809 for (i = i + 1; i < PredBlocks.size(); ++i) {
810 if (isReachableFromEntry(PredBlocks[i]))
811 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Support/ |
| GenericDomTree.h | 779 std::vector<NodeRef> PredBlocks;
781 PredBlocks.push_back(Pred);
783 assert(!PredBlocks.empty() && "No predblocks?");
798 for (i = 0; i < PredBlocks.size(); ++i)
799 if (isReachableFromEntry(PredBlocks[i])) {
800 NewBBIDom = PredBlocks[i];
809 for (i = i + 1; i < PredBlocks.size(); ++i) {
810 if (isReachableFromEntry(PredBlocks[i]))
811 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Support/ |
| GenericDomTree.h | 779 std::vector<NodeRef> PredBlocks;
781 PredBlocks.push_back(Pred);
783 assert(!PredBlocks.empty() && "No predblocks?");
798 for (i = 0; i < PredBlocks.size(); ++i)
799 if (isReachableFromEntry(PredBlocks[i])) {
800 NewBBIDom = PredBlocks[i];
809 for (i = i + 1; i < PredBlocks.size(); ++i) {
810 if (isReachableFromEntry(PredBlocks[i]))
811 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Support/ |
| GenericDomTree.h | 779 std::vector<NodeRef> PredBlocks;
781 PredBlocks.push_back(Pred);
783 assert(!PredBlocks.empty() && "No predblocks?");
798 for (i = 0; i < PredBlocks.size(); ++i)
799 if (isReachableFromEntry(PredBlocks[i])) {
800 NewBBIDom = PredBlocks[i];
809 for (i = i + 1; i < PredBlocks.size(); ++i) {
810 if (isReachableFromEntry(PredBlocks[i]))
811 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTree.h | 287 std::vector<typename GraphT::NodeRef> PredBlocks;
293 PredBlocks.push_back(*PI);
295 assert(!PredBlocks.empty() && "No predblocks?");
314 for (i = 0; i < PredBlocks.size(); ++i)
315 if (DT.isReachableFromEntry(PredBlocks[i])) {
316 NewBBIDom = PredBlocks[i];
326 for (i = i + 1; i < PredBlocks.size(); ++i) {
327 if (DT.isReachableFromEntry(PredBlocks[i]))
328 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Support/ |
| GenericDomTree.h | 288 std::vector<NodeRef> PredBlocks;
290 PredBlocks.push_back(Pred);
292 assert(!PredBlocks.empty() && "No predblocks?");
307 for (i = 0; i < PredBlocks.size(); ++i)
308 if (isReachableFromEntry(PredBlocks[i])) {
309 NewBBIDom = PredBlocks[i];
319 for (i = i + 1; i < PredBlocks.size(); ++i) {
320 if (isReachableFromEntry(PredBlocks[i]))
321 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Support/ |
| GenericDomTree.h | 288 std::vector<NodeRef> PredBlocks;
290 PredBlocks.push_back(Pred);
292 assert(!PredBlocks.empty() && "No predblocks?");
307 for (i = 0; i < PredBlocks.size(); ++i)
308 if (isReachableFromEntry(PredBlocks[i])) {
309 NewBBIDom = PredBlocks[i];
319 for (i = i + 1; i < PredBlocks.size(); ++i) {
320 if (isReachableFromEntry(PredBlocks[i]))
321 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Support/ |
| GenericDomTree.h | 779 std::vector<NodeRef> PredBlocks;
781 PredBlocks.push_back(Pred);
783 assert(!PredBlocks.empty() && "No predblocks?");
798 for (i = 0; i < PredBlocks.size(); ++i)
799 if (isReachableFromEntry(PredBlocks[i])) {
800 NewBBIDom = PredBlocks[i];
809 for (i = i + 1; i < PredBlocks.size(); ++i) {
810 if (isReachableFromEntry(PredBlocks[i]))
811 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Support/ |
| GenericDomTree.h | 779 std::vector<NodeRef> PredBlocks;
781 PredBlocks.push_back(Pred);
783 assert(!PredBlocks.empty() && "No predblocks?");
798 for (i = 0; i < PredBlocks.size(); ++i)
799 if (isReachableFromEntry(PredBlocks[i])) {
800 NewBBIDom = PredBlocks[i];
809 for (i = i + 1; i < PredBlocks.size(); ++i) {
810 if (isReachableFromEntry(PredBlocks[i]))
811 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/ |
| GenericDomTree.h | 779 std::vector<NodeRef> PredBlocks;
781 PredBlocks.push_back(Pred);
783 assert(!PredBlocks.empty() && "No predblocks?");
798 for (i = 0; i < PredBlocks.size(); ++i)
799 if (isReachableFromEntry(PredBlocks[i])) {
800 NewBBIDom = PredBlocks[i];
809 for (i = i + 1; i < PredBlocks.size(); ++i) {
810 if (isReachableFromEntry(PredBlocks[i]))
811 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/ |
| GenericDomTree.h | 779 std::vector<NodeRef> PredBlocks;
781 PredBlocks.push_back(Pred);
783 assert(!PredBlocks.empty() && "No predblocks?");
798 for (i = 0; i < PredBlocks.size(); ++i)
799 if (isReachableFromEntry(PredBlocks[i])) {
800 NewBBIDom = PredBlocks[i];
809 for (i = i + 1; i < PredBlocks.size(); ++i) {
810 if (isReachableFromEntry(PredBlocks[i]))
811 NewBBIDom = findNearestCommonDominator(NewBBIDom, PredBlocks[i])
[all...] |
