/external/blktrace/btt/doc/ |
H A D | btt.tex | 316 how the larger number of data values for device (8,0) dominates in
|
/external/checkpolicy/ |
H A D | module_compiler.c | 292 (&dest_role->dominates, role->s.value - 1, 1)) { 909 (&role->dominates, role->s.value - 1, 1)) {
|
H A D | policy_define.c | 2098 if (ebitmap_or(&new->dominates, &r1->dominates, &r2->dominates)) { 2111 ebitmap_destroy(&r1->dominates); 2118 ebitmap_destroy(&r2->dominates); 2138 if (ebitmap_get_bit(&(rdatum->dominates), rdp->s.value - 1)) { 2145 /* raise types and dominates from dominated role */ 2146 ebitmap_for_each_bit(&rdp->dominates, node, i) { 2149 (&rdatum->dominates, i, TRUE)) 2226 if (ebitmap_set_bit(&role->dominates, rol [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_ssa.cpp | 38 bool dominates(BasicBlock *, BasicBlock *);
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
H A D | AMDILCFGStructurizer.cpp | 152 inline bool dominates(MachineDomTreeNode *A, MachineDomTreeNode *B) const { function in struct:llvm::MachinePostDominatorTree 153 return DT->dominates(A, B); 156 inline bool dominates(MachineBasicBlock *A, MachineBasicBlock *B) const { function in struct:llvm::MachinePostDominatorTree 157 return DT->dominates(A, B); 1211 if (//postDomTree->dominates(downBlk, falseBlk) && 2575 if (postDomTree->dominates(blk1, blk2)) { 2578 if (postDomTree->dominates(blk2, blk1)) { 2599 if (postDomTree->dominates(node1, node2)) {
|
/external/clang/include/clang/Analysis/Analyses/ |
H A D | Dominators.h | 107 /// \brief This method tests if one CFGBlock dominates the other. 108 /// The method return true if A dominates B, false otherwise. 109 /// Note a block always dominates itself. 111 inline bool dominates(const CFGBlock* A, const CFGBlock* B) const { function in class:clang::DominatorTree 112 return DT->dominates(A, B); 115 /// \brief This method tests if one CFGBlock properly dominates the other. 116 /// The method return true if A properly dominates B, false otherwise.
|
/external/libsepol/include/sepol/policydb/ |
H A D | policydb.h | 133 ebitmap_t dominates; /* set of roles dominated by this role */ member in struct:role_datum
|
/external/libsepol/src/ |
H A D | expand.c | 785 if (map_ebitmap(&role->dominates, &mapped_roles, state->rolemap)) 788 ebitmap_destroy(&role->dominates); 790 if (ebitmap_cpy(&role->dominates, &mapped_roles)) 931 /* The dominates bitmap is going to be wrong for the moment, 934 if (ebitmap_union(&new_role->dominates, &role->dominates)) { 3127 /* remap role dominates bitmaps */
|
H A D | genusers.c | 170 /* Set the role and every role it dominates */ 171 ebitmap_for_each_bit(&roldatum->dominates, rnode, bit) {
|
H A D | link.c | 389 /* new_role's dominates, types and roles field will be copied 1117 ebitmap_for_each_bit(&role->dominates, rnode, i) { 1126 if (ebitmap_union(&dest_role->dominates, &e_tmp)) {
|
H A D | policydb.c | 441 ebitmap_init(&x->dominates); 450 ebitmap_destroy(&x->dominates); 2202 if (ebitmap_read(&role->dominates, fp))
|
H A D | services.c | 506 s[++sp] = ebitmap_get_bit(&r1->dominates, val2 - 1); 511 s[++sp] = ebitmap_get_bit(&r2->dominates, val1 - 1); 516 s[++sp] = (!ebitmap_get_bit(&r1->dominates, val2 - 1) 517 && !ebitmap_get_bit(&r2->dominates, val1 - 1));
|
H A D | users.c | 169 /* Set the role and every role it dominates */ 170 ebitmap_for_each_bit(&roldatum->dominates, rnode, bit) {
|
H A D | write.c | 1045 if (ebitmap_write(&role->dominates, fp))
|
/external/libsepol/tests/ |
H A D | test-linker-roles.c | 36 * - dominates bitmap is correct 54 * value in its dominates ebitmap */ 61 ebitmap_for_each_bit(&role->dominates, tnode, i) { 96 /* and only dominates itself */ 117 /* and only dominates itself */ 127 /* and only dominates itself */ 141 /* and only dominates itself */ 154 /* and only dominates itself */ 166 /* and only dominates itself */ 178 /* and only dominates itsel [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | LoopInfoImpl.h | 517 // If Header dominates predBB, this is a new loop. Collect the backedges. 518 if (DomTree.dominates(Header, Backedge)
|
H A D | PostDominators.h | 57 inline bool dominates(DomTreeNode* A, DomTreeNode* B) const { function in struct:llvm::PostDominatorTree 58 return DT->dominates(A, B); 61 inline bool dominates(const BasicBlock* A, const BasicBlock* B) const { function in struct:llvm::PostDominatorTree 62 return DT->dominates(A, B);
|
H A D | ScalarEvolution.h | 186 DominatesBlock, ///< The SCEV dominates the block. 187 ProperlyDominatesBlock ///< The SCEV properly dominates the block. 885 /// dominates - Return true if elements that makes up the given SCEV 887 bool dominates(const SCEV *S, const BasicBlock *BB);
|
H A D | Trace.h | 79 bool dominates(const BasicBlock *B1, const BasicBlock *B2) const { function in class:llvm::Trace
|
/external/llvm/include/llvm/CodeGen/ |
H A D | LexicalScopes.h | 93 // If Parent dominates NewScope then do not close Parent's instruction 95 if (Parent && (!NewScope || !Parent->dominates(NewScope))) 99 /// dominates - Return true if current scope dominates given lexical scope. 100 bool dominates(const LexicalScope *S) const { function in class:llvm::LexicalScope 168 /// dominates - Return true if DebugLoc's lexical scope dominates at least one 170 bool dominates(DebugLoc DL, MachineBasicBlock *MBB);
|
H A D | MachineDominators.h | 71 inline bool dominates(const MachineDomTreeNode* A, function in class:llvm::MachineDominatorTree 73 return DT->dominates(A, B); 76 inline bool dominates(const MachineBasicBlock* A, function in class:llvm::MachineDominatorTree 78 return DT->dominates(A, B); 81 // dominates - Return true if A dominates B. This performs the 83 bool dominates(const MachineInstr *A, const MachineInstr *B) const { function in class:llvm::MachineDominatorTree 85 if (BBA != BBB) return DT->dominates(BBA, BBB); 93 // A dominates B if it is found first in the basic block. 96 // // A post-dominates [all...] |
H A D | MachinePostDominators.h | 56 bool dominates(const MachineDomTreeNode *A, function in struct:llvm::MachinePostDominatorTree 58 return DT->dominates(A, B); 61 bool dominates(const MachineBasicBlock *A, const MachineBasicBlock *B) const { function in struct:llvm::MachinePostDominatorTree 62 return DT->dominates(A, B);
|
/external/llvm/include/llvm/IR/ |
H A D | Dominators.h | 88 using Base::dominates; 90 /// \brief Return true if Def dominates a use in User. 94 bool dominates(const Instruction *Def, const Use &U) const; 95 bool dominates(const Instruction *Def, const Instruction *User) const; 96 bool dominates(const Instruction *Def, const BasicBlock *BB) const; 97 bool dominates(const BasicBlockEdge &BBE, const Use &U) const; 98 bool dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const;
|
/external/llvm/include/llvm/Support/ |
H A D | GenericDomTree.h | 254 if (ND != NewBB && !DT.dominates(NewBBSucc, ND) && 285 // If NewBB strictly dominates other blocks, then it is now the immediate 363 /// properlyDominates - Returns true iff A dominates B and A != B. 372 return dominates(A, B); 389 /// dominates - Returns true iff A dominates B. Note that this is not a 392 inline bool dominates(const DomTreeNodeBase<NodeT> *A, function in class:llvm::DominatorTreeBase 394 // A node trivially dominates itself. 402 // And dominates nothing. 428 bool dominates(cons 711 bool DominatorTreeBase<NodeT>::dominates(const NodeT *A, const NodeT *B) const { function in class:llvm::DominatorTreeBase [all...] |
/external/llvm/lib/Analysis/ |
H A D | AliasAnalysis.cpp | 405 // there is no need to explore the use if BeforeHere dominates use. 407 if (BeforeHere != I && DT->dominates(BeforeHere, I) && 419 if (BeforeHere != I && DT->dominates(BeforeHere, I) &&
|