HomeSort by relevance Sort by last modified time
    Searched refs:C1 (Results 226 - 250 of 463) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/clang/lib/Format/
WhitespaceManager.cpp 22 operator()(const Change &C1, const Change &C2) const {
24 C1.OriginalWhitespaceRange.getBegin(),
  /external/libgdx/gdx/src/com/badlogic/gdx/maps/tiled/renderers/
OrthoCachedTiledMapRenderer.java 262 vertices[C1] = color;
377 vertices[C1] = color;
HexagonalTiledMapRenderer.java 193 vertices[C1] = color;
IsometricTiledMapRenderer.java 139 vertices[C1] = color;
  /external/llvm/lib/Transforms/Utils/
LowerSwitch.cpp 95 bool operator () (const LowerSwitch::CaseRange& C1,
98 const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low);
  /external/webp/src/dsp/
enc_mips32.c 302 #define VERTICAL_PASS(A, B, C, D, A1, B1, C1, D1, E, F, G, H) \
304 "lw %[temp1], " #C1 "(%[tmp]) \n\t" \
    [all...]
enc_neon.c 86 // a0 a1 a2 a3 | b0 b1 b2 b3 => a0 b0 c0 d0 | a1 b1 c1 d1
87 // c0 c1 c2 c3 | d0 d1 d2 d3 a2 b2 c2 d2 | a3 b3 c3 d3
88 const int16x8x2_t tmp0 = vzipq_s16(in0, in1); // a0 c0 a1 c1 a2 c2 ...
100 // C1 = kC2 * in4 | kC2 * in12
102 const int16x8_t C1 = vqdmulhq_n_s16(B1, kC2);
109 const int16x4_t c = vqsub_s16(vget_low_s16(C1), vget_high_s16(C0));
110 const int16x4_t d = vqadd_s16(vget_low_s16(C0), vget_high_s16(C1));
437 "vsub.s16 d6, d1, d2 \n" // c1 = ip[4] - ip[8]
452 "vmlal.s16 q11, d6, d17 \n" // c1*2217 + d1*5352 + 12000
453 "vmlsl.s16 q12, d6, d16 \n" // d1*2217 - c1*5352 + 5100
838 const uint16x8_t c1 = vminq_u16(c0, vdupq_n_u16(MAX_LEVEL)); local
    [all...]
  /prebuilts/gdb/darwin-x86/lib/python2.7/test/
test_class.py 542 class C1:
545 self.assertRaises(TypeError, hash, C1())
  /prebuilts/gdb/linux-x86/lib/python2.7/test/
test_class.py 542 class C1:
545 self.assertRaises(TypeError, hash, C1())
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_class.py 542 class C1:
545 self.assertRaises(TypeError, hash, C1())
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_class.py 542 class C1:
545 self.assertRaises(TypeError, hash, C1())
  /external/clang/lib/CodeGen/
CoverageMappingGen.cpp 355 Counter addCounters(Counter C1, Counter C2, Counter C3) {
356 return addCounters(addCounters(C1, C2), C3);
359 Counter addCounters(Counter C1, Counter C2, Counter C3, Counter C4) {
360 return addCounters(addCounters(C1, C2, C3), C4);
    [all...]
  /external/clang/test/Sema/
warn-documentation.cpp 1066 @class C1
1068 class C1;
    [all...]
  /external/llvm/lib/Analysis/
InstructionSimplify.cpp     [all...]
ConstantFolding.cpp 664 // (&GV+C1) - (&GV+C2) -> C1-C2, pointer arithmetic cannot overflow.
    [all...]
  /external/libvpx/libvpx/test/
dct16x16_test.cc 43 const double C1 = 0.995184726672197;
105 temp2 = step[12] * C1;
108 temp1 = step[11] * C1;
  /external/llvm/lib/Transforms/InstCombine/
InstCombineShifts.cpp 122 // We can always fold shl(c1)+shl(c2) -> shl(c1+c2).
130 // We can turn shl(c1)+shr(c2) -> shl(c3)+and(c4), but it isn't
147 // We can always fold lshr(c1)+lshr(c2) -> lshr(c1+c2).
155 // We can always turn lshr(c1)+shl(c2) -> lshr(c3)+and(c4), but it isn't
225 // We can always fold shl(c1)+shl(c2) -> shl(c1+c2).
251 // We turn shl(c1)+shr(c2) -> shl(c3)+and(c4), but only when we know that
266 // We can always fold lshr(c1)+lshr(c2) -> lshr(c1+c2)
    [all...]
InstructionCombining.cpp 187 /// 6. Transform: "(A op C1) op (B op C2)" ==> "(A op B) op (C1 op C2)"
188 /// if C1 and C2 are constants.
296 // Transform: "(A op C1) op (B op C2)" ==> "(A op B) op (C1 op C2)"
297 // if C1 and C2 are constants.
304 Constant *C1 = cast<Constant>(Op0->getOperand(1));
308 Constant *Folded = ConstantExpr::get(Opcode, C1, C2);
    [all...]
  /external/llvm/lib/Transforms/Scalar/
MemCpyOptimizer.cpp     [all...]
  /external/mesa3d/src/mesa/drivers/dri/i965/
brw_wm_fp.c 780 CONST C1 = { 1.596, -0.813, 2.018, -.391 }
785 RGB.xyz = MAD UYV.zzx, C1, UYV.y
787 RGB.xyz = MAD UYV.xxz, C1, UYV.y
788 RGB.y = MAD UYV.z, C1.w, RGB.y
793 struct prog_src_register C1 = search_or_add_const4f( c, 1.596, -0.813, 2.018, -.391 );
831 * RGB.xyz = MAD YUV.zzx, C1, YUV.y
833 * RGB.xyz = MAD YUV.xxz, C1, YUV.y
841 C1,
844 /* RGB.y = MAD YUV.z, C1.w, RGB.y
851 src_swizzle1(C1, W)
    [all...]
  /external/clang/lib/Analysis/
ThreadSafety.cpp 535 Context intersectContexts(Context C1, Context C2);
537 void intersectBackEdge(Context C1, Context C2);
609 LocalVariableMap::intersectContexts(Context C1, Context C2) {
610 Context Result = C1;
611 for (const auto &P : C1) {
632 // This routine also takes the intersection of C1 and C2, but it does so by
633 // altering the VarDefinitions. C1 must be the result of an earlier call to
635 void LocalVariableMap::intersectBackEdge(Context C1, Context C2) {
636 for (const auto &P : C1) {
    [all...]
  /external/v8/src/third_party/fdlibm/
fdlibm.js 186 // cos(x) ~ 1 - x*x/2 + C1*x + ... + C6*x
190 // |ieee_cos(x)-(1-.5*x +C1*x +C2*x +C3*x +C4*x +C5*x +C6*x )| <= 2
194 // 3. let r = C1*x +C2*x +C3*x +C4*x +C5*x +C6*x , then
208 define C1 = 4.16666666666666019037e-02;
218 var r = z * (C1 + z * (C2 + z * (C3 + z * (C4 + z * (C5 + z * C6)))));
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/
adogpool.h     [all...]
  /external/opencv3/modules/imgproc/src/
min_enclosing_triangle.cpp 120 static bool areIdenticalLines(double a1, double b1, double c1, double a2, double b2, double c2);
238 static bool lineIntersection(double a1, double b1, double c1, double a2, double b2, double c2,
1456 double a1, b1, c1; local
    [all...]
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/io/
SerializationStressTest1.java 218 // MultipleClassBasedReplacementWhenDumping -> C1 -> C2 -> C3 -> FOO
221 private static class C1 implements java.io.Serializable {
244 return new C1();
    [all...]

Completed in 1029 milliseconds

1 2 3 4 5 6 7 8 91011>>