Searched refs:pred (Results 26 - 50 of 297) sorted by relevance

1234567891011>>

/external/libvpx/libvpx/vp8/common/
H A Dreconintra.c114 int pred = yleft_col[r] + yabove_row[ c] - ytop_left; local
116 if (pred < 0)
117 pred = 0;
119 if (pred > 255)
120 pred = 255;
122 ypred_ptr[c] = pred;
H A Dreconintra4x4.c62 int pred = Above[c] - top_left + Left[r]; local
64 if (pred < 0)
65 pred = 0;
67 if (pred > 255)
68 pred = 255;
70 dst[c] = pred;
/external/libvpx/libvpx/vp8/encoder/ppc/
H A Dcsystemdependent.c47 void (*vp8_subtract_mby)(short *diff, unsigned char *src, unsigned char *pred, int stride);
48 void (*vp8_subtract_mbuv)(short *diff, unsigned char *usrc, unsigned char *vsrc, unsigned char *pred, int stride);
64 extern void subtract_mby_c(short *diff, unsigned char *src, unsigned char *pred, int stride);
65 extern void subtract_mbuv_c(short *diff, unsigned char *usrc, unsigned char *vsrc, unsigned char *pred, int stride);
96 extern void vp8_subtract_mby_ppc(short *diff, unsigned char *src, unsigned char *pred, int stride);
97 extern void vp8_subtract_mbuv_ppc(short *diff, unsigned char *usrc, unsigned char *vsrc, unsigned char *pred, int stride);
H A Dencodemb_altivec.asm18 ;# r6 unsigned char *pred
39 lvx v2, 0, r6 ;# pred
47 vmrghb v4, v0, v2 ;# unpack high pred to short
61 vmrglb v4, v0, v2 ;# unpack high pred to short
76 lvx v2, 0, r6 ;# pred
84 vmrghb v4, v0, v2 ;# unpack high pred to short
98 vmrglb v4, v0, v2 ;# unpack high pred to short
114 ;# r5 unsigned char *pred
128 lvx v2, 0, r5 ;# pred
134 vmrghb v4, v0, v2 ;# unpack high pred t
[all...]
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
H A Dtraverse_math.js227 * @param {function(!Node):boolean} pred Predicate deciding what a leaf is.
230 cvox.TraverseMath.prototype.nextLeaf = function(reverse, pred) {
232 var next = pred(this.activeNode) ?
234 this.activeNode, this.activeMath, reverse, pred) :
235 cvox.DomUtil.directedFindFirstNode(this.activeNode, reverse, pred);
257 * @param {function(!Node):boolean} pred Predicate deciding what a subtree is.
260 cvox.TraverseMath.prototype.nextSubtree = function(reverse, pred) {
266 this.activeNode, reverse, pred);
271 this.activeNode, this.activeMath, reverse, pred);
279 this.activeNode, reverse, pred);
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/ppc/
H A Dencodemb_altivec.asm18 ;# r6 unsigned char *pred
39 lvx v2, 0, r6 ;# pred
47 vmrghb v4, v0, v2 ;# unpack high pred to short
61 vmrglb v4, v0, v2 ;# unpack high pred to short
76 lvx v2, 0, r6 ;# pred
84 vmrghb v4, v0, v2 ;# unpack high pred to short
98 vmrglb v4, v0, v2 ;# unpack high pred to short
114 ;# r5 unsigned char *pred
128 lvx v2, 0, r5 ;# pred
134 vmrghb v4, v0, v2 ;# unpack high pred t
[all...]
/external/llvm/lib/IR/
H A DConstantFold.cpp1030 // cmp pred ^ true -> cmp !pred
1032 CmpInst::Predicate pred = (CmpInst::Predicate)CE1->getPredicate(); local
1033 pred = CmpInst::getInversePredicate(pred);
1034 return ConstantExpr::getCompare(pred, CE1->getOperand(0),
1371 ICmpInst::Predicate pred = ICmpInst::ICMP_EQ; local
1372 R = dyn_cast<ConstantInt>(ConstantExpr::getICmp(pred, V1, V2));
1374 return pred;
1375 pred
1599 ConstantFoldCompareInstruction(unsigned short pred, Constant *C1, Constant *C2) argument
[all...]
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/
H A DST.stg110 <if(alt.pred)>
111 if <alt.pred>:
123 <if(alt.pred)>if <alt.pred>:
/external/chromium_org/tools/telemetry/telemetry/web_components/
H A Dweb_components_project.py11 def _FindAllFilesRecursive(source_paths, pred):
19 if pred(x):
/external/libcxx/test/algorithms/alg.modifying.operations/alg.remove/
H A Dremove_if.pass.cpp16 // remove_if(Iter first, Iter last, Pred pred);
45 struct pred struct
65 Iter r = std::remove_if(Iter(ia), Iter(ia+sa), pred());
/external/apache-xml/src/main/java/org/apache/xpath/patterns/
H A DStepPattern.java457 XObject pred = m_predicates[i].execute(xctxt);
461 if (XObject.CLASS_NUMBER == pred.getType())
465 else if (!pred.boolWithSideEffects())
474 pred.detach();
556 XObject pred = m_predicates[i].execute(xctxt);
560 if (XObject.CLASS_NUMBER == pred.getType())
562 if ((pos + 1) != (int) pred.numWithSideEffects())
569 else if (!pred.boolWithSideEffects())
578 pred.detach();
727 XObject pred
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/arm/neon/
H A Dsubtract_neon.c64 unsigned char *pred,
75 q1u8 = vld1q_u8(pred);
76 pred += pred_stride;
77 q3u8 = vld1q_u8(pred);
78 pred += pred_stride;
60 vp8_subtract_mby_neon( int16_t *diff, unsigned char *src, int src_stride, unsigned char *pred, int pred_stride) argument
/external/dexmaker/src/dx/java/com/android/dx/ssa/
H A DDomFront.java85 System.out.println("pred[" + i + "]: "
175 BitSet pred = nb.getPredecessors();
177 if (pred.cardinality() > 1) {
178 for (int i = pred.nextSetBit(0); i >= 0;
179 i = pred.nextSetBit(i + 1)) {
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/
H A DLeftRecursiveRules.stg79 recRuleAlt(alt, pred) ::= "{<pred>}?=> <alt>"
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/
H A Dvp9_variance.h98 void vp9_comp_avg_pred(uint8_t *comp_pred, const uint8_t *pred, int width,
102 void vp9_high_comp_avg_pred(uint16_t *comp_pred, const uint8_t *pred, int width,
/external/eigen/unsupported/Eigen/src/Polynomials/
H A DPolynomialSolver.h83 inline const RootType& selectComplexRoot_withRespectToNorm( squaredNormBinaryPredicate& pred ) const
90 if( pred( currNorm2, norm2 ) ){
118 squaredRealPartBinaryPredicate& pred,
140 if( pred( currAbs2, abs2 ) )
159 RealPartBinaryPredicate& pred,
181 if( pred( curr, val ) )
117 selectRealRoot_withRespectToAbsRealPart( squaredRealPartBinaryPredicate& pred, bool& hasArealRoot, const RealScalar& absImaginaryThreshold = NumTraits<Scalar>::dummy_precision() ) const argument
158 selectRealRoot_withRespectToRealPart( RealPartBinaryPredicate& pred, bool& hasArealRoot, const RealScalar& absImaginaryThreshold = NumTraits<Scalar>::dummy_precision() ) const argument
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/arm/armv6/
H A Didct_v6.asm17 ; void vp8_short_idct4x4llm_c(short *input, unsigned char *pred, int pitch,
20 ; r1 unsigned char* pred
135 ldrb r0, [r1] ; pred p0
136 ldrb r11, [r1, #1] ; pred p1
137 ldrb r12, [r1, #2] ; pred p2
149 ldrb r11, [r1, #3] ; pred p3
165 ldrb r12, [r1, r2]! ; pred p4
167 ldrb r11, [r1, #1] ; pred p5
175 ldrb r7, [r1, #2] ; pred p6
176 ldrb r10, [r1, #3] ; pred p
[all...]
/external/libvpx/libvpx/vp8/common/arm/armv6/
H A Didct_v6.asm17 ; void vp8_short_idct4x4llm_c(short *input, unsigned char *pred, int pitch,
20 ; r1 unsigned char* pred
135 ldrb r0, [r1] ; pred p0
136 ldrb r11, [r1, #1] ; pred p1
137 ldrb r12, [r1, #2] ; pred p2
149 ldrb r11, [r1, #3] ; pred p3
165 ldrb r12, [r1, r2]! ; pred p4
167 ldrb r11, [r1, #1] ; pred p5
175 ldrb r7, [r1, #2] ; pred p6
176 ldrb r10, [r1, #3] ; pred p
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/x86/
H A Dtemporal_filter_apply_sse2.asm96 punpcklbw xmm2, xmm7 ; pred[ 0- 7]
97 punpckhbw xmm3, xmm7 ; pred[ 8-15]
100 psubw xmm0, xmm2 ; src - pred[ 0- 7]
101 psubw xmm1, xmm3 ; src - pred[ 8-15]
144 lea rdx, [rdx + 16*1] ; pred += 16*(sizeof(char))
146 punpcklbw xmm0, xmm7 ; pred[ 0- 7]
147 punpckhbw xmm1, xmm7 ; pred[ 8-15]
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/encoder/x86/
H A Dvp9_temporal_filter_apply_sse2.asm101 punpcklbw xmm2, xmm7 ; pred[ 0- 7]
102 punpckhbw xmm3, xmm7 ; pred[ 8-15]
105 psubw xmm0, xmm2 ; src - pred[ 0- 7]
106 psubw xmm1, xmm3 ; src - pred[ 8-15]
149 lea rdx, [rdx + 16*1] ; pred += 16*(sizeof(char))
151 punpcklbw xmm0, xmm7 ; pred[ 0- 7]
152 punpckhbw xmm1, xmm7 ; pred[ 8-15]
/external/libvpx/libvpx/vp8/encoder/x86/
H A Dtemporal_filter_apply_sse2.asm96 punpcklbw xmm2, xmm7 ; pred[ 0- 7]
97 punpckhbw xmm3, xmm7 ; pred[ 8-15]
100 psubw xmm0, xmm2 ; src - pred[ 0- 7]
101 psubw xmm1, xmm3 ; src - pred[ 8-15]
144 lea rdx, [rdx + 16*1] ; pred += 16*(sizeof(char))
146 punpcklbw xmm0, xmm7 ; pred[ 0- 7]
147 punpckhbw xmm1, xmm7 ; pred[ 8-15]
/external/libvpx/libvpx/vp9/encoder/x86/
H A Dvp9_temporal_filter_apply_sse2.asm96 punpcklbw xmm2, xmm7 ; pred[ 0- 7]
97 punpckhbw xmm3, xmm7 ; pred[ 8-15]
100 psubw xmm0, xmm2 ; src - pred[ 0- 7]
101 psubw xmm1, xmm3 ; src - pred[ 8-15]
144 lea rdx, [rdx + 16*1] ; pred += 16*(sizeof(char))
146 punpcklbw xmm0, xmm7 ; pred[ 0- 7]
147 punpckhbw xmm1, xmm7 ; pred[ 8-15]
/external/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp102 const ExplodedNode *pred = *(node->pred_begin()); local
103 if (pred->succ_size() != 1)
126 ProgramStateRef pred_state = pred->getState();
128 progPoint.getLocationContext() != pred->getLocationContext())
170 ExplodedNode *pred = *(node->pred_begin()); local
172 pred->replaceSuccessor(succ);
173 succ->replacePredecessor(pred);
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/
H A Dreconintra4x4.c62 int pred = Above[c] - top_left + Left[r]; local
64 if (pred < 0)
65 pred = 0;
67 if (pred > 255)
68 pred = 255;
70 dst[c] = pred;
/external/chromium_org/third_party/libwebp/utils/
H A Dfilters.c31 static WEBP_INLINE void PredictLine(const uint8_t* src, const uint8_t* pred, argument
35 for (i = 0; i < length; ++i) dst[i] = src[i] + pred[i];
37 for (i = 0; i < length; ++i) dst[i] = src[i] - pred[i];
172 const int pred = GradientPredictor(preds[w - 1], local
175 out[w] = in[w] + (inverse ? pred : -pred);

Completed in 742 milliseconds

1234567891011>>