Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
44 lines (35 loc) · 1.09 KB

File metadata and controls

44 lines (35 loc) · 1.09 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
/*
* Copyright (c) Facebook, Inc. and its affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include "llvh/Support/GenericDomTree.h"
#include "llvh/Support/GenericDomTreeConstruction.h"
#include "hermes/IR/CFG.h"
using namespace hermes;
template class llvh::DominatorTreeBase<BasicBlock, false>;
template class llvh::DomTreeNodeBase<BasicBlock>;
DominanceInfo::DominanceInfo(Function *F) : DominatorTreeBase() {
assert(F->begin() != F->end() && "Function is empty!");
recalculate(*F);
}
bool DominanceInfo::properlyDominates(
const Instruction *A,
const Instruction *B) const {
const BasicBlock *ABB = A->getParent();
const BasicBlock *BBB = B->getParent();
if (ABB != BBB)
return properlyDominates(ABB, BBB);
// Otherwise, they're in the same block, and we just need to check
// whether B comes after A.
auto ItA = A->getIterator();
auto ItB = B->getIterator();
auto E = ABB->begin();
while (ItB != E) {
--ItB;
if (ItA == ItB)
return true;
}
return false;
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.