| /external/clang/lib/StaticAnalyzer/Checkers/ |
| AttrNonNullChecker.cpp | 53 DefinedSVal *DV = dyn_cast<DefinedSVal>(&V);
56 if (!DV)
59 if (!isa<Loc>(*DV)) {
71 if (nonloc::CompoundVal *CSV = dyn_cast<nonloc::CompoundVal>(DV)) {
75 DV = dyn_cast<DefinedSVal>(&V);
77 if (!DV)
87 llvm::tie(stateNotNull, stateNull) = CM.assumeDual(state, *DV);
|
| DivZeroChecker.cpp | 61 const DefinedSVal *DV = dyn_cast<DefinedSVal>(&Denom);
65 if (!DV)
71 llvm::tie(stateNotZero, stateZero) = CM.assumeDual(C.getState(), *DV);
79 bool TaintedD = C.getState()->isTainted(*DV);
|
| BoolAssignmentChecker.cpp | 72 const DefinedSVal *DV = dyn_cast<DefinedSVal>(&val);
73 if (!DV)
86 svalBuilder.evalBinOp(state, BO_GE, *DV, zeroVal,
122 svalBuilder.evalBinOp(state, BO_LE, *DV, OneVal,
|
| StreamChecker.cpp | 352 const DefinedSVal *DV = dyn_cast<DefinedSVal>(&SV);
353 if (!DV)
358 llvm::tie(stateNotNull, stateNull) = CM.assumeDual(state, *DV);
|
| BasicObjCFoundationChecks.cpp | 739 if (DefinedOrUnknownSVal *DV = dyn_cast<DefinedOrUnknownSVal>(&Val))
740 return State->assume(*DV, true);
|
| /external/clang/test/Analysis/ |
| derived-to-base.cpp | 46 class DV : virtual public B, public C {};
54 DV dv; local
55 dv.setX();
56 clang_analyzer_eval(dv.getX() == 42); // expected-warning{{TRUE}}
131 class DV : virtual public B, virtual public C {};
134 DV d;
|
| /external/llvm/lib/CodeGen/ |
| ExecutionDepsFix.cpp | 168 DomainValue *retain(DomainValue *DV) {
169 if (DV) ++DV->Refs;
170 return DV;
176 void setLiveReg(int rx, DomainValue *DV);
179 void collapse(DomainValue *dv, unsigned domain);
201 DomainValue *dv = Avail.empty() ?
205 dv->addDomain(domain);
206 assert(dv->Refs == 0 && "Reference count wasn't cleared");
207 assert(!dv->Next && "Chained DomainValue shouldn't have been recycled")
599 DomainValue *dv = 0; local
[all...] |
| LiveDebugVariables.cpp | 351 DIVariable DV(variable);
353 DV.printExtendedName(OS);
[all...] |
| MachineInstr.cpp | [all...] |
| /external/clang/test/Sema/ |
| ms_class_layout.cpp | 138 struct DV : BV {
140 struct EV : CV, DV {
463 // CHECK: 0 | struct DV
470 // CHECK: %struct.DV = type { %struct.BV }
475 // CHECK-NEXT: 0 | struct DV (primary base)
486 // CHECK: %struct.EV = type { %struct.DV, %struct.CV.base, [4 x i8], %struct.BV }
487 // CHECK: %struct.EV.base = type { %struct.DV, %struct.CV.base }
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfCompileUnit.cpp | 236 void CompileUnit::addVariableAddress(DbgVariable *&DV, DIE *Die,
238 if (DV->variableHasComplexAddress())
239 addComplexAddress(DV, Die, dwarf::DW_AT_location, Location);
240 else if (DV->isBlockByrefVariable())
241 addBlockByrefAddress(DV, Die, dwarf::DW_AT_location, Location);
296 void CompileUnit::addComplexAddress(DbgVariable *&DV, DIE *Die,
300 unsigned N = DV->getNumAddrElements();
303 if (N >= 2 && DV->getAddrElement(0) == DIBuilder::OpPlus) {
306 addRegisterOffset(Block, Location.getReg(), DV->getAddrElement(1));
315 uint64_t Element = DV->getAddrElement(i)
[all...] |
| DwarfDebug.cpp | 800 DIVariable DV(Variables.getElement(vi));
801 if (!DV.Verify()) continue;
802 DbgVariable *NewVar = new DbgVariable(DV, NULL);
[all...] |
| DwarfCompileUnit.h | 247 void addComplexAddress(DbgVariable *&DV, DIE *Die, unsigned Attribute,
257 void addBlockByrefAddress(DbgVariable *&DV, DIE *Die, unsigned Attribute,
262 void addVariableAddress(DbgVariable *&DV, DIE *Die, MachineLocation Location);
326 DIE *constructVariableDIE(DbgVariable *DV, bool isScopeAbstract);
|
| /external/llvm/lib/VMCore/ |
| DebugInfo.cpp | 719 /// @param DV Current Variable.
721 DIVariable llvm::createInlinedVariable(MDNode *DV, MDNode *InlinedScope,
725 for (unsigned i = 0, e = DV->getNumOperands(); i != e; ++i)
727 Elts.push_back(DV->getOperand(i));
732 DIVariable llvm::cleanseInlinedVariable(MDNode *DV, LLVMContext &VMContext) {
735 for (unsigned i = 0, e = DV->getNumOperands(); i != e; ++i)
738 Elts.push_back(DV->getOperand(i));
924 DIDescriptor DV(N);
925 if (!DV.isVariable())
928 if (!NodesSeen.insert(DV))
[all...] |
| /external/llvm/include/llvm/ |
| DebugInfo.h | 817 /// @param DV Current Variable.
819 DIVariable createInlinedVariable(MDNode *DV, MDNode *InlinedScope,
823 DIVariable cleanseInlinedVariable(MDNode *DV, LLVMContext &VMContext);
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| BugReporterVisitors.cpp | 562 const DefinedOrUnknownSVal *DV = dyn_cast<DefinedOrUnknownSVal>(&V);
563 if (!DV)
565 state = state->assume(*DV, true);
[all...] |
| /frameworks/compile/slang/ |
| slang_rs_object_ref_count.cpp | [all...] |
| /bionic/libc/upstream-dlmalloc/ |
| malloc.c | 2585 mchunkptr dv; member in struct:malloc_state
[all...] |
| /external/clang/lib/CodeGen/ |
| CGObjC.cpp | [all...] |
| /external/libffi/src/ |
| dlmalloc.c | 2018 mchunkptr dv; member in struct:malloc_state
[all...] |
| /external/qemu/distrib/sdl-1.2.15/src/stdlib/ |
| SDL_malloc.c | 2028 mchunkptr dv; member in struct:malloc_state
[all...] |
| /cts/suite/pts/hostTests/browser/browserlauncher/assets/octane/ |
| crypto.js | 189 // (protected) set from integer value x, -DV <= x < DV
195 else if(x < -1) this_array[0] = x+DV;
548 // last step - calculate inverse mod DV directly;
551 // we really want the negative inverse, and -DV < y < DV
588 // faster way of calculating u0 = x[i]*mp mod DV
703 // (protected) return x s.t. r^x < DV
992 // (protected) this *= n, this >= 0, 1 < n < DV
[all...] |
| /external/v8/benchmarks/ |
| crypto.js | 189 // (protected) set from integer value x, -DV <= x < DV
195 else if(x < -1) this_array[0] = x+DV;
548 // last step - calculate inverse mod DV directly;
551 // we really want the negative inverse, and -DV < y < DV
588 // faster way of calculating u0 = x[i]*mp mod DV
703 // (protected) return x s.t. r^x < DV
992 // (protected) this *= n, this >= 0, 1 < n < DV
[all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
| v8-crypto.js | 181 // (protected) set from integer value x, -DV <= x < DV
187 else if(x < -1) this_array[0] = x+DV;
540 // last step - calculate inverse mod DV directly;
543 // we really want the negative inverse, and -DV < y < DV
580 // faster way of calculating u0 = x[i]*mp mod DV
695 // (protected) return x s.t. r^x < DV
984 // (protected) this *= n, this >= 0, 1 < n < DV
[all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
| v8-crypto.js | 181 // (protected) set from integer value x, -DV <= x < DV
187 else if(x < -1) this_array[0] = x+DV;
540 // last step - calculate inverse mod DV directly;
543 // we really want the negative inverse, and -DV < y < DV
580 // faster way of calculating u0 = x[i]*mp mod DV
695 // (protected) return x s.t. r^x < DV
984 // (protected) this *= n, this >= 0, 1 < n < DV
[all...] |
