/external/icu/icu4c/source/data/brkitr/ |
char.txt | 30 $LV = [\p{Grapheme_Cluster_Break = LV}]; 41 $L ($L | $V | $LV | $LVT); 42 ($LV | $V) ($V | $T); 57 ($L | $V | $LV | $LVT) $L; 58 ($V | $T) ($LV | $V);
|
/external/clang/lib/Analysis/ |
LiveVariables.cpp | 196 LiveVariablesImpl &LV; 205 : LV(im), val(Val), observer(Observer), currentBlock(CurrentBlock) {} 261 val.liveStmts = LV.SSetFact.remove(val.liveStmts, S); 278 AddLiveStmt(val.liveStmts, LV.SSetFact, ImplicitObj); 286 val.liveDecls = LV.DSetFact.add(val.liveDecls, 287 LV.analysisContext.getSelfDecl()); 295 AddLiveStmt(val.liveStmts, LV.SSetFact, VA->getSizeExpr()); 308 val.liveStmts = LV.SSetFact.add(val.liveStmts, child); 330 AddLiveStmt(val.liveStmts, LV.SSetFact, child); 336 if (!LV.killAtAssign [all...] |
/external/clang/lib/CodeGen/ |
CGExpr.cpp | 168 LValue LV = MakeAddrLValue(Location, E->getType()); 169 EmitStoreThroughLValue(RV, LV); 383 LValue LV = MakeAddrLValue(Object, E->getType()); 384 LV = EmitLValueForField(LV, Adjustment.Field); 385 assert(LV.isSimple() && 387 Object = LV.getAddress(); 406 LValue LV = EmitLValue(E); 407 assert(LV.isSimple()); 408 llvm::Value *Value = LV.getAddress() [all...] |
CGExprAgg.cpp | 180 LValue LV = CGF.EmitPseudoObjectLValue(E); 181 return EmitFinalDestCopy(E->getType(), LV); 207 LValue LV = CGF.EmitLValue(E); 210 if (LV.getType()->isAtomicType()) { 211 CGF.EmitAtomicLoad(LV, E->getExprLoc(), Dest); 215 EmitFinalDestCopy(E->getType(), LV); 568 LValue LV = CGF.EmitCheckedLValue(E->getSubExpr(), 571 if (LV.isSimple()) 572 CGF.EmitDynamicCast(LV.getAddress(), cast<CXXDynamicCastExpr>(E)); 772 LValue LV = CGF.EmitPointerToDataMemberBinaryExpr(E) 1087 CGF.EmitStoreThroughBitfieldLValue(RValue::get(null), lv); local [all...] |
CGValue.h | 439 static AggValueSlot forLValue(const LValue &LV, 444 return forAddr(LV.getAddress(), LV.getAlignment(), 445 LV.getQuals(), isDestructed, needsGC, isAliased, isZeroed);
|
CGExprComplex.cpp | 76 ComplexPairTy EmitLoadOfLValue(LValue LV, SourceLocation Loc); 80 void EmitStoreOfComplex(ComplexPairTy Val, LValue LV, bool isInit); 160 LValue LV = CGF.EmitLValue(E->getSubExpr()); 161 return CGF.EmitComplexPrePostIncDec(E, LV, isInc, isPre); 691 LValue LV = EmitCompoundAssignLValue(E, Func, Val); 698 if (!LV.isVolatileQualified()) 701 return EmitLoadOfLValue(LV, E->getExprLoc()); 726 LValue LV = EmitBinAssignLValue(E, Val); 733 if (!LV.isVolatileQualified()) 736 return EmitLoadOfLValue(LV, E->getExprLoc()) [all...] |
CGObjCRuntime.cpp | 100 LValue LV = CGF.MakeNaturalAlignAddrLValue(V, IvarTy); 101 LV.getQuals().addCVRQualifiers(CVRQualifiers); 102 return LV;
|
CGExprScalar.cpp | 90 Value *EmitLoadOfLValue(LValue LV, SourceLocation Loc) { 91 return CGF.EmitLoadOfLValue(LV, Loc).getScalarVal(); 255 LValue LV = CGF.EmitObjCIsaExpr(E); 256 Value *V = CGF.EmitLoadOfLValue(LV, E->getExprLoc()).getScalarVal(); 292 LValue LV = EmitLValue(E->getSubExpr()); 293 return EmitScalarPrePostIncDec(E, LV, false, false); 296 LValue LV = EmitLValue(E->getSubExpr()); 297 return EmitScalarPrePostIncDec(E, LV, true, false); 300 LValue LV = EmitLValue(E->getSubExpr()); 301 return EmitScalarPrePostIncDec(E, LV, false, true) [all...] |
/external/clang/lib/StaticAnalyzer/Checkers/ |
PointerArithChecker.cpp | 41 SVal LV = state->getSVal(B->getLHS(), LCtx); 44 const MemRegion *LR = LV.getAsRegion();
|
PointerSubChecker.cpp | 44 SVal LV = state->getSVal(B->getLHS(), LCtx); 47 const MemRegion *LR = LV.getAsRegion();
|
/external/clang/lib/AST/ |
APValue.cpp | 35 struct APValue::LV : LVBase { 47 LV() { PathLength = (unsigned)-1; } 48 ~LV() { resizePath(0); } 201 ((LV*)(char*)Data.buffer)->~LV(); 242 return reinterpret_cast<const LV *>(Data.buffer)->hasPathPtr(); 555 return ((const LV*)(const void*)Data.buffer)->BaseAndIsOnePastTheEnd.getPointer(); 560 return ((const LV*)(const void*)Data.buffer)->BaseAndIsOnePastTheEnd.getInt(); 565 return ((LV*)(void*)Data.buffer)->Offset; 570 return ((const LV*)(const char*)Data.buffer)->hasPath() [all...] |
Decl.cpp | 94 /// Kinds of LV computation. The linkage side of the computation is 98 /// Do an LV computation for, ultimately, a type. 103 /// Do an LV computation for, ultimately, a non-type declaration. 108 /// Do an LV computation for, ultimately, a type that already has 113 /// Do an LV computation for, ultimately, a non-type declaration 118 /// Do an LV computation when we only care about the linkage. 232 LinkageInfo LV; 248 LV.merge(getLVForType(*NTTP->getType(), computation)); 257 LV.merge(type->getLinkageAndVisibility()); 268 LV.merge(getLVForTemplateParameterList(TTP->getTemplateParameters() [all...] |
/external/llvm/lib/CodeGen/ |
PHIElimination.cpp | 52 LiveVariables *LV; 129 LV = getAnalysisIfAvailable<LiveVariables>(); 139 if (!DisableEdgeSplitting && (LV || LIS)) { 269 if (LV) { 273 LiveVariables::VarInfo &VI = LV->getVarInfo(IncomingReg); 276 LV->setPHIJoin(IncomingReg); 284 LV->removeVirtualRegisterKilled(IncomingReg, OldKill); 292 LV->addVirtualRegisterKilled(IncomingReg, PHICopy); 298 LV->removeVirtualRegistersKilled(MPhi); 300 // If the result is dead, update LV [all...] |
TwoAddressInstructionPass.cpp | 76 LiveVariables *LV; 291 // Update kill and LV information. 296 if (LV) 297 LV->replaceKillInstruction(SavedReg, KillMI, MI); 626 MachineInstr *NewMI = TII->convertToThreeAddress(MFI, mi, LV); 748 // Bail immediately if we don't have LV or LIS available. We use them to find 750 if (!LV && !LIS) 773 KillMI = LV->getVarInfo(Reg).findKill(MBB); 904 LV->removeVirtualRegisterKilled(Reg, KillMI) [all...] |
/external/llvm/lib/Analysis/ |
SparsePropagation.cpp | 57 LatticeVal LV; 61 LV = LatticeFunc->ComputeConstant(C); 63 LV = LatticeFunc->ComputeArgument(A); 66 LV = LatticeFunc->getOverdefinedVal(); 69 LV = LatticeFunc->getUndefVal(); 72 if (LV == LatticeFunc->getUntrackedVal()) 73 return LV; 74 return ValueState[V] = LV;
|
/external/chromium_org/third_party/skia/third_party/harfbuzz/src/ |
harfbuzz-hangul.c | 41 // LV or LVT. 46 // V, LV V, T 76 LV, 83 return hangul_isLV(uc) ? LV : LVT; 112 case LV:
|
/external/clang/lib/StaticAnalyzer/Core/ |
SimpleConstraintManager.cpp | 72 if (Optional<Loc> LV = Cond.getAs<Loc>()) { 75 const MemRegion *MR = LV->getAsRegion(); 81 Cond = SVB.evalCast(*LV, SVB.getContext().BoolTy, T).castAs<DefinedSVal>();
|
SValBuilder.cpp | 342 if (Optional<Loc> LV = lhs.getAs<Loc>()) { 344 return evalBinOpLL(state, op, *LV, *RV, type); 346 return evalBinOpLN(state, op, *LV, rhs.castAs<NonLoc>(), type); 440 if (Optional<nonloc::LocAsInteger> LV = val.getAs<nonloc::LocAsInteger>()) { 441 if (const MemRegion *R = LV->getLoc().getAsRegion()) { 446 return LV->getLoc();
|
SVals.cpp | 179 if (Optional<loc::ConcreteInt> LV = getAs<loc::ConcreteInt>()) 180 return LV->getValue() == I;
|
/external/llvm/include/llvm/Analysis/ |
SparsePropagation.h | 84 virtual Constant *GetConstant(LatticeVal LV, Value *Val, SparseSolver &SS) {
|
/external/llvm/lib/Transforms/Scalar/ |
SCCP.cpp | 373 LatticeVal &LV = I.first->second; 376 return LV; // Common case, already in the map. 381 LV.markConstant(C); // Constants are constant 385 return LV; 399 LatticeVal &LV = I.first->second; 402 return LV; // Common case, already in the map. 408 LV.markOverdefined(); // Unknown sort of constant. 412 LV.markConstant(Elt); // Constants are constant. 416 return LV; [all...] |
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
ProgramState.h | 217 ProgramStateRef killBinding(Loc LV) const; 281 SVal getSVal(Loc LV, QualType T = QualType()) const; 283 /// Returns the "raw" SVal bound to LV before any value simplfication. 284 SVal getRawSVal(Loc LV, QualType T= QualType()) const; 652 inline ProgramStateRef ProgramState::bindLoc(SVal LV, SVal V) const { 653 if (Optional<Loc> L = LV.getAs<Loc>()) 711 inline SVal ProgramState::getRawSVal(Loc LV, QualType T) const { 712 return getStateManager().StoreMgr->getBinding(getStore(), LV, T);
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
AMDGPUInstrInfo.cpp | 81 LiveVariables *LV) const {
|
AMDGPUInstrInfo.h | 70 LiveVariables *LV) const;
|
/external/llvm/lib/Target/R600/ |
AMDGPUInstrInfo.h | 74 LiveVariables *LV) const override;
|