/external/libvpx/libvpx/vp8/common/ |
quant_common.h | 17 extern int vp8_dc_quant(int QIndex, int Delta); 18 extern int vp8_dc2quant(int QIndex, int Delta); 19 extern int vp8_ac2quant(int QIndex, int Delta); 20 extern int vp8_dc_uv_quant(int QIndex, int Delta); 21 extern int vp8_ac_uv_quant(int QIndex, int Delta);
|
quant_common.c | 39 int vp8_dc_quant(int QIndex, int Delta) 43 QIndex = QIndex + Delta; 54 int vp8_dc2quant(int QIndex, int Delta) 58 QIndex = QIndex + Delta; 69 int vp8_dc_uv_quant(int QIndex, int Delta) 73 QIndex = QIndex + Delta; 101 int vp8_ac2quant(int QIndex, int Delta) 105 QIndex = QIndex + Delta; 122 int vp8_ac_uv_quant(int QIndex, int Delta) 126 QIndex = QIndex + Delta; [all...] |
/frameworks/av/media/libeffects/lvm/lib/Common/src/ |
LVC_Mixer_SetTimeConstant.c | 29 /* Delta=(2147483647*4*1000)/(NumChannels*SampleRate*Tc_millisec) */ 41 /* Delta - the step change for fractional gain per 4 samples */ 63 LVM_INT32 Delta=DeltaTable[Fs]; 64 Delta=Delta>>(NumChannels-1); 67 Delta=0x7FFFFFFF; 69 Delta=Delta/Tc_millisec; 71 if(Delta==0) 72 Delta=1; // If Time Constant is so large that Delta is 0, assign minimum value to Delt [all...] |
LVC_Mixer_VarSlope_SetTimeConstant.c | 30 /* Delta=(2147483647*4*1000)/(NumChannels*SampleRate*Tc_millisec) */ 42 /* Delta - the step change for fractional gain per 4 samples */ 64 LVM_INT32 Delta=DeltaTable[Fs]; 69 Delta=Delta>>(NumChannels-1); 81 Delta=0x7FFFFFFF; 83 Delta=Delta/Tc_millisec; 85 if(Delta==0) 86 Delta=1; // If Time Constant is so large that Delta is 0, assign minimum value to Delt [all...] |
LVC_Core_MixInSoft_D16C31_SAT.c | 40 LVM_INT32 Delta=pInstance->Delta; 50 ADD2_SAT_32x32(Current,Delta,Temp); /* Q31 + Q31 into Q31*/ 69 ADD2_SAT_32x32(Current,Delta,Temp); /* Q31 + Q31 into Q31*/ 89 Current -= Delta; /* Q31 + Q31 into Q31*/ 107 Current -= Delta; /* Q31 + Q31 into Q31*/
|
LVC_Core_MixSoft_1St_D16C31_WRA.c | 40 LVM_INT32 Delta=pInstance->Delta; 50 ADD2_SAT_32x32(Current,Delta,Temp); /* Q31 + Q31 into Q31*/ 63 ADD2_SAT_32x32(Current,Delta,Temp); /* Q31 + Q31 into Q31*/ 78 Current -= Delta; /* Q31 + Q31 into Q31*/ 90 Current -= Delta; /* Q31 + Q31 into Q31*/
|
LVC_MixSoft_1St_2i_D16C31_SAT.c | 54 if(pInstance1->Delta == 0x7FFFFFFF) 60 else if (Abs_32(pInstance1->Current-pInstance1->Target) < pInstance1->Delta) 74 if(pInstance2->Delta == 0x7FFFFFFF) 80 else if (Abs_32(pInstance2->Current-pInstance2->Target) < pInstance2->Delta) 124 if (Abs_32(pInstance1->Current-pInstance1->Target) < pInstance1->Delta) 138 if (Abs_32(pInstance2->Current-pInstance2->Target) < pInstance2->Delta)
|
LVC_MixInSoft_D16C31_SAT.c | 53 if(pInstance->Delta == 0x7FFFFFFF){ 57 }else if (Abs_32(pInstance->Current-pInstance->Target) < pInstance->Delta){ 99 if (Abs_32(pInstance->Current-pInstance->Target) < pInstance->Delta){
|
LVC_MixSoft_1St_D16C31_SAT.c | 53 if(pInstance->Delta == 0x7FFFFFFF){ 57 }else if (Abs_32(pInstance->Current-pInstance->Target) < pInstance->Delta){ 99 if (Abs_32(pInstance->Current-pInstance->Target) < pInstance->Delta){
|
LVC_Core_MixSoft_1St_2i_D16C31_WRA.c | 44 LVM_INT32 DeltaL=pInstanceL->Delta; 48 LVM_INT32 DeltaR=pInstanceR->Delta;
|
LVC_Mixer_Private.h | 35 LVM_INT32 Delta; /* 32 bit number specifying the fractional value of Delta Gain */
|
/external/clang/include/clang/Rewrite/Core/ |
DeltaTree.h | 1 //===--- DeltaTree.h - B-Tree for Rewrite Delta tracking --------*- C++ -*-===// 24 /// implements a key/value mapping from index to delta, and allows fast lookup 26 /// efficiently tell us the full accumulated delta for a specific file offset 38 /// getDeltaAt - Return the accumulated delta at the specified file offset. 44 /// this method is used to record that info. It inserts a delta of 'Delta' 46 void AddDelta(unsigned FileIndex, int Delta);
|
/external/clang/lib/Rewrite/Core/ |
DeltaTree.cpp | 1 //===--- DeltaTree.cpp - B-Tree for Rewrite Delta tracking ----------------===// 24 /// DeltaTree implements a key/value mapping from FileIndex to Delta, allowing 26 /// can also efficiently tell us the full accumulated delta for a specific 31 /// former and adds children pointers. Each node knows the full delta of all 33 /// full delta implied by a whole subtree in constant time. 41 int Delta; 44 SourceDelta Delta; 45 Delta.FileLoc = Loc; 46 Delta.Delta = D [all...] |
/external/llvm/lib/Support/ |
DeltaAlgorithm.cpp | 44 DeltaAlgorithm::Delta(const changeset_ty &Changes, 66 return Delta(Changes, SplitSets); 79 Res = Delta(*it, Sets); 95 Res = Delta(Complement, ComplementSets); 109 // Otherwise run the real delta algorithm. 113 return Delta(Changes, Sets);
|
/external/llvm/include/llvm/ADT/ |
DeltaAlgorithm.h | 17 /// DeltaAlgorithm - Implements the delta debugging algorithm (A. Zeller '99) 58 /// Delta - Minimize a set of \p Changes which has been partioned into 60 changeset_ty Delta(const changeset_ty &Changes,
|
/external/llvm/include/llvm/CodeGen/ |
RegisterPressure.h | 259 RegPressureDelta &Delta, 268 RegPressureDelta &Delta, 275 void getMaxPressureDelta(const MachineInstr *MI, RegPressureDelta &Delta, 279 return getMaxDownwardPressureDelta(MI, Delta, CriticalPSets, 283 return getMaxUpwardPressureDelta(MI, Delta, CriticalPSets,
|
/external/llvm/lib/Analysis/ |
DependenceAnalysis.cpp | 96 STATISTIC(DeltaApplications, "Delta applications"); 97 STATISTIC(DeltaSuccesses, "Delta successes"); 98 STATISTIC(DeltaIndependence, "Delta independence"); 99 STATISTIC(DeltaPropagations, "Delta propagations"); 899 const SCEV *Delta = SE->getMinusSCEV(X, Y); 902 return Delta->isZero(); 904 return SE->isKnownNonZero(Delta); 906 return SE->isKnownNonNegative(Delta); 908 return SE->isKnownNonPositive(Delta); 910 return SE->isKnownPositive(Delta); [all...] |
/external/llvm/lib/CodeGen/ |
RegisterPressure.cpp | 535 RegPressureDelta &Delta, 561 Delta.Excess.PSetID = PSetID; 562 Delta.Excess.UnitIncrease = ExcessUnits; 575 RegPressureDelta &Delta) { 576 Delta.CriticalMax = PressureElement(); 577 Delta.CurrentMax = PressureElement(); 591 if (PDiff > Delta.CriticalMax.UnitIncrease) { 592 Delta.CriticalMax.PSetID = i; 593 Delta.CriticalMax.UnitIncrease = PDiff; 600 if (MDiff > Delta.CurrentMax.UnitIncrease) [all...] |
InterferenceCache.h | 108 void addRef(int Delta) { RefCount += Delta; }
|
/external/smack/src/org/xbill/DNS/ |
ZoneTransferIn.java | 69 public static class Delta { 74 /** The starting serial number of this delta. */ 77 /** The ending serial number of this delta. */ 87 Delta() { 140 Delta delta = new Delta(); local 141 delta.deletes.add(soa); 142 delta.start = getSOASerial(soa); 143 ixfr.add(delta); 147 Delta delta = (Delta) ixfr.get(ixfr.size() - 1); local 155 Delta delta = (Delta) ixfr.get(ixfr.size() - 1); local 407 Delta delta; local [all...] |
/external/ceres-solver/docs/ |
solving.tex | 15 The general strategy when solving non-linear optimization problems is to solve a sequence of approximations to the original problem~\cite{nocedal2000numerical}. At each iteration, the approximation is solved to determine a correction $\Delta x$ to the vector $x$. For non-linear least squares, an approximation can be constructed by using the linearization $F(x+\Delta x) \approx F(x) + J(x)\Delta x$, which leads to the following linear least squares problem: 17 \min_{\Delta x} \frac{1}{2}\|J(x)\Delta x + F(x)\|^2 21 updating $x \leftarrow x+ \Delta x$ leads to an algorithm that may not 23 of the step $\Delta x$. And this is where the idea of a trust-region 31 \STATE{Solve $\arg \min_{\Delta x} \frac{1}{2}\|J(x)\Delta x + F(x)\|^2$ s.t. $\|D(x)\Delta x\|^2 \le \mu$ [all...] |
modeling.tex | 303 a sphere is to optimize over two dimensional vector $\Delta x$ in the 305 the point $x + \Delta x$, where the move operation involves projecting 311 x' = \boxplus(x, \Delta x), 313 where $x'$ has the same size as $x$, and $\Delta x$ is of size less 320 Instances of \texttt{LocalParameterization} implement the $\boxplus$ operation and its derivative with respect to $\Delta x$ at $\Delta x = 0$. 327 const double* delta, 335 \texttt{GlobalSize} is the dimension of the ambient space in which the parameter block $x$ lives. \texttt{LocalSize} is the size of the tangent space that $\Delta x$ lives in. \texttt{Plus} implements $\boxplus(x,\Delta x)$ and $\texttt{ComputeJacobian}$ computes the Jacobian matrix 337 J = \left . \frac{\partial }{\partial \Delta x} \boxplus(x,\Delta x)\right|_{\Delta x = 0 [all...] |
/external/smack/src/org/xbill/DNS/tests/ |
xfrin.java | 91 ZoneTransferIn.Delta delta; local 92 delta = (ZoneTransferIn.Delta) it.next(); 93 System.out.println("delta from " + delta.start + 94 " to " + delta.end); 96 Iterator it2 = delta.deletes.iterator(); 100 it2 = delta.adds.iterator();
|
/external/clang/test/Misc/ |
diag-template-diffing.cpp | 121 class Delta{}; 136 void set5(Alpha<Beta<Gamma<Delta<int, int>, int>, int>, int>); 141 // CHECK-ELIDE-NOTREE: candidate function not viable: no known conversion from 'Alpha<Beta<Gamma<void, void>, double>, double>' to 'Alpha<Beta<Gamma<Delta<int, int>, int>, int>, int>' for 1st argument 143 // CHECK-NOELIDE-NOTREE: candidate function not viable: no known conversion from 'Alpha<Beta<Gamma<void, void>, double>, double>' to 'Alpha<Beta<Gamma<Delta<int, int>, int>, int>, int>' for 1st argument 149 // CHECK-ELIDE-TREE: [void != Delta<int, int>], 158 // CHECK-NOELIDE-TREE: [void != Delta<int, int>], 164 set5(Alpha<Beta<Delta<int, int>, int>, int>()); 167 // CHECK-ELIDE-NOTREE: candidate function not viable: no known conversion from 'Alpha<Beta<Delta<int, int>, [...]>, [...]>' to 'Alpha<Beta<Gamma<Delta<int, int>, int>, [...]>, [...]>' for 1st argument 169 // CHECK-NOELIDE-NOTREE: candidate function not viable: no known conversion from 'Alpha<Beta<Delta<int, int>, int>, int>' to 'Alpha<Beta<Gamma<Delta<int, int>, int>, int>, int>' for 1st argumen [all...] |
/external/freetype/src/pshinter/ |
pshglob.c | 155 FT_Int reference, delta; local 166 delta = read[0] - reference; 175 delta = read[1] - reference; 196 if ( delta < 0 ) 198 if ( delta < delta0 ) 199 zone->org_delta = delta; 203 if ( delta > delta0 ) 204 zone->org_delta = delta; 214 zone->org_delta = delta; 279 FT_Int delta; local 302 FT_Int delta; local 319 FT_Int dim, top, bot, delta; local 533 FT_Pos delta; local [all...] |