/external/clang/test/Sema/ |
H A D | usual-float.c | 7 const float PI = 3.142; local 10 float ang = (float) tindex * (-dir*2.0f*PI/n);
|
/external/v8/test/mjsunit/regress/ |
H A D | regress-925537.js | 38 assertClose( Math.PI / 4, Math.atan2(pinf, pinf)); 39 assertClose(-Math.PI / 4, Math.atan2(ninf, pinf)); 40 assertClose( 3 * Math.PI / 4, Math.atan2(pinf, ninf)); 41 assertClose(-3 * Math.PI / 4, Math.atan2(ninf, ninf));
|
/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Math/ |
H A D | 15.8.2.5.js | 54 array[item++] = new TestCase( SECTION, "Math.atan2(1, 0)", Math.PI/2, Math.atan2(1,0) ); 55 array[item++] = new TestCase( SECTION, "Math.atan2(1,-0)", Math.PI/2, Math.atan2(1,-0) ); 58 array[item++] = new TestCase( SECTION, "Math.atan2(0, -0)", Math.PI, Math.atan2(0,-0) ); 59 array[item++] = new TestCase( SECTION, "Math.atan2(0, -1)", Math.PI, Math.atan2(0, -1) ); 65 array[item++] = new TestCase( SECTION, "Math.atan2(-0, -0)", -Math.PI, Math.atan2(-0, -0) ); 66 array[item++] = new TestCase( SECTION, "Math.atan2(-0, -1)", -Math.PI, Math.atan2(-0, -1) ); 67 array[item++] = new TestCase( SECTION, "Math.atan2(-1, 0)", -Math.PI/2, Math.atan2(-1, 0) ); 68 array[item++] = new TestCase( SECTION, "Math.atan2(-1, -0)", -Math.PI/2, Math.atan2(-1, -0) ); 70 array[item++] = new TestCase( SECTION, "Math.atan2(1,-Infinity)", Math.PI, Math.atan2(1, Number.NEGATIVE_INFINITY) ); 75 array[item++] = new TestCase( SECTION, "Math.atan2(-1,-Infinity)", -Math.PI, Mat [all...] |
H A D | 15.8.2.2.js | 27 range is from +0 to +PI. special cases: 53 array[item++] = new TestCase( SECTION, "Math.acos(null)", Math.PI/2, Math.acos(null) ); 57 array[item++] = new TestCase( SECTION, "Math.acos('0')", Math.PI/2, Math.acos('0') ); 59 array[item++] = new TestCase( SECTION, "Math.acos('-1')", Math.PI, Math.acos('-1') ); 64 array[item++] = new TestCase( SECTION, "Math.acos(-1)", Math.PI, Math.acos(-1) ); 65 array[item++] = new TestCase( SECTION, "Math.acos(0)", Math.PI/2, Math.acos(0) ); 66 array[item++] = new TestCase( SECTION, "Math.acos(-0)", Math.PI/2, Math.acos(-0) ); 67 array[item++] = new TestCase( SECTION, "Math.acos(Math.SQRT1_2)", Math.PI/4, Math.acos(Math.SQRT1_2)); 68 array[item++] = new TestCase( SECTION, "Math.acos(-Math.SQRT1_2)", Math.PI/4*3, Math.acos(-Math.SQRT1_2)); 69 array[item++] = new TestCase( SECTION, "Math.acos(0.9999619230642)", Math.PI/36 [all...] |
H A D | 15.8.2.7.js | 69 array[item++] = new TestCase( SECTION, "Math.cos(Math.PI*2)", 1, Math.cos(Math.PI*2) ); 70 array[item++] = new TestCase( SECTION, "Math.cos(Math.PI/4)", Math.SQRT2/2, Math.cos(Math.PI/4) ); 71 array[item++] = new TestCase( SECTION, "Math.cos(Math.PI/2)", 0, Math.cos(Math.PI/2) ); 72 array[item++] = new TestCase( SECTION, "Math.cos(3*Math.PI/4)", -Math.SQRT2/2, Math.cos(3*Math.PI/4) ); 73 array[item++] = new TestCase( SECTION, "Math.cos(Math.PI)", -1, Math.cos(Math.PI) ); [all...] |
H A D | 15.8.2.3.js | 27 range is from -PI/2 to +PI/2. special cases: 58 array[item++] = new TestCase( SECTION, "Math.asin('1')", Math.PI/2, Math.asin("1") ); 59 array[item++] = new TestCase( SECTION, "Math.asin('-1')", -Math.PI/2, Math.asin("-1") ); 60 array[item++] = new TestCase( SECTION, "Math.asin(Math.SQRT1_2+'')", Math.PI/4, Math.asin(Math.SQRT1_2+'') ); 61 array[item++] = new TestCase( SECTION, "Math.asin(-Math.SQRT1_2+'')", -Math.PI/4, Math.asin(-Math.SQRT1_2+'') ); 70 array[item++] = new TestCase( SECTION, "Math.asin(1)", Math.PI/2, Math.asin(1) ); 71 array[item++] = new TestCase( SECTION, "Math.asin(-1)", -Math.PI/2, Math.asin(-1) ); 72 array[item++] = new TestCase( SECTION, "Math.asin(Math.SQRT1_2))", Math.PI/4, Math.asin(Math.SQRT1_2) ); 73 array[item++] = new TestCase( SECTION, "Math.asin(-Math.SQRT1_2))", -Math.PI/ [all...] |
H A D | 15.8.2.4.js | 27 range is from -PI/2 to +PI/2. special cases: 31 - if x == +Infinity, the result is approximately +PI/2 32 - if x == -Infinity, the result is approximately -PI/2 62 array[item++] = new TestCase( SECTION, "Math.atan('1')", Math.PI/4, Math.atan('1') ); 63 array[item++] = new TestCase( SECTION, "Math.atan('-1')", -Math.PI/4, Math.atan('-1') ); 64 array[item++] = new TestCase( SECTION, "Math.atan('Infinity)", Math.PI/2, Math.atan('Infinity') ); 65 array[item++] = new TestCase( SECTION, "Math.atan('-Infinity)", -Math.PI/2, Math.atan('-Infinity') ); 70 array[item++] = new TestCase( SECTION, "Math.atan(Infinity)", Math.PI/2, Math.atan(Number.POSITIVE_INFINITY) ); 71 array[item++] = new TestCase( SECTION, "Math.atan(-Infinity)", -Math.PI/ [all...] |
H A D | 15.8.2.18.js | 63 array[item++] = new TestCase( SECTION, "Math.tan(Math.PI/4)", 1, Math.tan(Math.PI/4)); 64 array[item++] = new TestCase( SECTION, "Math.tan(3*Math.PI/4)", -1, Math.tan(3*Math.PI/4)); 65 array[item++] = new TestCase( SECTION, "Math.tan(Math.PI)", -0, Math.tan(Math.PI)); 66 array[item++] = new TestCase( SECTION, "Math.tan(5*Math.PI/4)", 1, Math.tan(5*Math.PI/4)); 67 array[item++] = new TestCase( SECTION, "Math.tan(7*Math.PI/4)", -1, Math.tan(7*Math.PI/ [all...] |
/external/v8/test/mjsunit/ |
H A D | sin-cos.js | 32 assertEquals(1, Math.sin(Math.PI / 2)); 37 assertEquals(-1, Math.cos(Math.PI));
|
/external/llvm/include/llvm/ |
H A D | PassAnalysisSupport.h | 130 // Find pass that is implementing PI. 131 Pass *findImplPass(AnalysisID PI) { argument 134 if (AnalysisImpls[i].first == PI) { 142 // Find pass that is implementing PI. Initialize pass for Function F. 143 Pass *findImplPass(Pass *P, AnalysisID PI, Function &F); 145 void addAnalysisImplsPair(AnalysisID PI, Pass *P) { argument 146 if (findImplPass(PI) == P) 148 std::pair<AnalysisID, Pass*> pir = std::make_pair(PI,P); 182 const void *PI = &AnalysisType::ID; local 184 Pass *ResultPass = Resolver->getAnalysisIfAvailable(PI, tru 235 getAnalysisID(AnalysisID PI, Function &F) argument [all...] |
H A D | PassRegistry.h | 56 void registerPass(const PassInfo &PI, bool ShouldFree = false); 60 void unregisterPass(const PassInfo &PI);
|
/external/webkit/LayoutTests/fast/xpath/4XPath/Core/ |
H A D | test.js | 33 PI = DOM.firstChild; 34 while (PI.nodeType != Node.PROCESSING_INSTRUCTION_NODE) 35 PI = PI.nextSibling;
|
/external/llvm/lib/CodeGen/ |
H A D | EarlyIfConversion.cpp | 410 PHIInfo &PI = PHIs.back(); local 412 for (unsigned i = 1; i != PI.PHI->getNumOperands(); i += 2) { 413 if (PI.PHI->getOperand(i+1).getMBB() == TPred) 414 PI.TReg = PI.PHI->getOperand(i).getReg(); 415 if (PI.PHI->getOperand(i+1).getMBB() == FPred) 416 PI.FReg = PI.PHI->getOperand(i).getReg(); 418 assert(TargetRegisterInfo::isVirtualRegister(PI.TReg) && "Bad PHI"); 419 assert(TargetRegisterInfo::isVirtualRegister(PI 460 PHIInfo &PI = PHIs[i]; local 481 PHIInfo &PI = PHIs[i]; local 718 SSAIfConv::PHIInfo &PI = IfConv.PHIs[i]; local [all...] |
/external/proguard/src/proguard/gui/splash/ |
H A D | SineTiming.java | 51 return 0.5 + 0.5 * Math.sin(2.0 * Math.PI * (time + phase) / period);
|
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
H A D | 3d-morph.js | 31 var PI2nx = Math.PI * 8/nx 33 var f30 = -(50 * sin(f*Math.PI*2))
|
/external/webkit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
H A D | 3d-morph.js | 31 var PI2nx = Math.PI * 8/nx 33 var f30 = -(50 * sin(f*Math.PI*2))
|
/external/llvm/lib/VMCore/ |
H A D | Pass.cpp | 60 const PassInfo *PI = PassRegistry::getPassRegistry()->getPassInfo(AID); local 61 if (PI) 62 return PI->getPassName(); 193 const PassInfo *PI = PassRegistry::getPassRegistry()->getPassInfo(ID); local 194 if (!PI) 196 return PI->createPass(); 277 const PassInfo *PI = Pass::lookupPassInfo(Arg); local 279 if (PI) Preserved.push_back(PI->getTypeInfo());
|
H A D | BasicBlock.cpp | 184 pred_iterator PI = pred_begin(this), E = pred_end(this); local 185 if (PI == E) return 0; // No preds. 186 BasicBlock *ThePred = *PI; 187 ++PI; 188 return (PI == E) ? ThePred : 0 /*multiple preds*/; 197 pred_iterator PI = pred_begin(this), E = pred_end(this); local 198 if (PI == E) return 0; // No preds. 199 BasicBlock *PredBB = *PI; 200 ++PI; 201 for (;PI ! [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | BlockFrequencyImpl.h | 157 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), local 160 if (PI == PE) 163 BlockT *Pred = *PI; 165 ++PI; 166 if (PI != PE) 194 PI = GraphTraits< Inverse<BlockT *> >::child_begin(BB), 196 PI != PE; ++PI) { 197 BlockT *Pred = *PI; 238 PI [all...] |
/external/icu4c/i18n/ |
H A D | astro.cpp | 22 #if defined (PI) 23 #undef PI macro 202 const double CalendarAstronomer::PI = 3.14159265358979323846; member in class:CalendarAstronomer 204 #define CalendarAstronomer_PI2 (CalendarAstronomer::PI*2.0) 205 #define RAD_HOUR ( 12 / CalendarAstronomer::PI ) // radians -> hours 206 #define DEG_RAD ( CalendarAstronomer::PI / 180 ) // degrees -> radians 207 #define RAD_DEG ( 180 / CalendarAstronomer::PI ) // radians -> degrees 223 return normalize(angle, CalendarAstronomer::PI * 2.0); 227 * Normalize an angle into the range -PI - PI [all...] |
/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Expressions/ |
H A D | 11.4.1.js | 56 array[item++] = new TestCase( SECTION, "delete(Math.PI)", false, delete(Math.PI) ); 94 this.prop8 = Math.PI;
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | BasicBlockPlacement.cpp | 56 /// PI - The profile information that is guiding us. 58 ProfileInfo *PI; member in struct:__anon9076::BlockPlacement 88 PI = &getAnalysis<ProfileInfo>(); 134 double MaxExecutionCount = PI->getExecutionCount(*SI); 140 double Count = PI->getExecutionCount(*SI);
|
H A D | CorrelatedValuePropagation.cpp | 152 pred_iterator PI = pred_begin(C->getParent()), PE = pred_end(C->getParent()); 153 if (PI == PE) return false; 156 C->getOperand(0), Op1, *PI, C->getParent()); 159 ++PI; 160 while (PI != PE) { 162 C->getOperand(0), Op1, *PI, C->getParent()); 164 ++PI; 209 for (pred_iterator PI = PB; PI != PE; ++PI) { [all...] |
/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_2/Statements/ |
H A D | try-004.js | 21 TryToCatch( "Math.PI", Math.PI );
|
H A D | try-005.js | 23 TryToCatch( "Math.PI", Math.PI );
|