| /external/google-breakpad/src/testing/gtest/scripts/ |
| gen_gtest_pred_impl.py | 138 // ASSERT_PRED1(pred, v1)
139 // ASSERT_PRED2(pred, v1, v2)
142 // where pred is an n-ary function or functor that returns bool,
221 template <typename Pred""" % DEFS
233 Pred pred"""
239 if (pred(%(vs)s)) return AssertionSuccess();
264 #define GTEST_PRED%(n)s_(pred, %(vs)s, on_failure)\\
265 GTEST_ASSERT_(::testing::AssertPred%(n)sHelper(#pred""" % DEFS
271 pred"""
[all...] |
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyCFGStackify.cpp | 86 for (MachineBasicBlock *Pred : MBB->predecessors()) {
87 if (InSet.count(Pred))
231 for (auto Pred : MBB.predecessors())
233 (Pred->getNumber() < MBB.getNumber() || Loop->contains(Pred)) &&
238 for (auto Pred : MBB.predecessors())
239 assert(Pred->getNumber() < MBB.getNumber() &&
254 /// Test whether Pred has any terminators explicitly branching to MBB, as
259 static bool ExplicitlyBranchesTo(MachineBasicBlock *Pred, MachineBasicBlock *MBB) {
260 for (MachineInstr &MI : Pred->terminators()
[all...] |
| /external/protobuf/gtest/scripts/ |
| gen_gtest_pred_impl.py | 138 // ASSERT_PRED1(pred, v1)
139 // ASSERT_PRED2(pred, v1, v2)
142 // where pred is an n-ary function or functor that returns bool,
221 template <typename Pred""" % DEFS
233 Pred pred"""
239 if (pred(%(vs)s)) return AssertionSuccess();
266 #define GTEST_PRED%(n)s_(pred, %(vs)s, on_failure)\\
267 GTEST_ASSERT_(::testing::AssertPred%(n)sHelper(#pred""" % DEFS
273 pred"""
[all...] |
| /external/vulkan-validation-layers/tests/gtest-1.7.0/scripts/ |
| gen_gtest_pred_impl.py | 138 // ASSERT_PRED1(pred, v1)
139 // ASSERT_PRED2(pred, v1, v2)
142 // where pred is an n-ary function or functor that returns bool,
221 template <typename Pred""" % DEFS
233 Pred pred"""
239 if (pred(%(vs)s)) return AssertionSuccess();
264 #define GTEST_PRED%(n)s_(pred, %(vs)s, on_failure)\\
265 GTEST_ASSERT_(::testing::AssertPred%(n)sHelper(#pred""" % DEFS
271 pred"""
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolution.h | 638 /// Return an ExitLimit for a loop whose backedge is guarded by `LHS Pred
642 ICmpInst::Predicate Pred);
676 /// Test whether the condition described by Pred, LHS, and RHS is true
678 bool isImpliedCond(ICmpInst::Predicate Pred,
683 /// Test whether the condition described by Pred, LHS, and RHS is true
686 bool isImpliedCond(ICmpInst::Predicate Pred, const SCEV *LHS,
690 /// Test whether the condition described by Pred, LHS, and RHS is true
691 /// whenever the condition described by Pred, FoundLHS, and FoundRHS is
693 bool isImpliedCondOperands(ICmpInst::Predicate Pred,
697 /// Test whether the condition described by Pred, LHS, and RHS is tru
[all...] |
| /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| plive.go | 51 pred []*BasicBlock // predecessors; if none, probably start of CFG
116 result.pred = make([]*BasicBlock, 0, 2)
138 to.pred = append(to.pred, from)
183 for _, pred := range bb.pred {
184 fmt.Printf(" %d", pred.rpo)
366 pred := selectgo
368 if len(pred.pred) == 0
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
| plive.go | 48 pred []*BasicBlock // predecessors; if none, probably start of CFG
113 result.pred = make([]*BasicBlock, 0, 2)
135 to.pred = append(to.pred, from)
180 for _, pred := range bb.pred {
181 fmt.Printf(" %d", pred.rpo)
363 pred := selectgo
365 if len(pred.pred) == 0
[all...] |
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| plive.go | 51 pred []*BasicBlock // predecessors; if none, probably start of CFG
116 result.pred = make([]*BasicBlock, 0, 2)
138 to.pred = append(to.pred, from)
183 for _, pred := range bb.pred {
184 fmt.Printf(" %d", pred.rpo)
366 pred := selectgo
368 if len(pred.pred) == 0
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| plive.go | 48 pred []*BasicBlock // predecessors; if none, probably start of CFG
113 result.pred = make([]*BasicBlock, 0, 2)
135 to.pred = append(to.pred, from)
180 for _, pred := range bb.pred {
181 fmt.Printf(" %d", pred.rpo)
363 pred := selectgo
365 if len(pred.pred) == 0
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BasicBlockUtils.cpp | 152 // Make all PHI nodes that referred to BB now refer to Pred as their
249 // single pred. Split the block.
251 // If the successor only has a single pred, split the top of the successor
336 BasicBlock *Pred = *i;
341 if (Loop *PL = LI->getLoopFor(Pred))
349 if (L->contains(Pred))
367 BasicBlock *Pred = *i;
368 if (Loop *PredLoop = LI->getLoopFor(Pred)) {
585 BasicBlock *Pred = *i++;
586 if (Pred == NewBB1) continue
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| LL1Analyzer.java | 51 /** 1 if we found a nonautobacktracking pred */
53 /** 2 if we didn't find such a pred */
282 /** Is there a non-syn-pred predicate visible from s that is not in
284 * and lets ANTLR do a simple LL(1)+pred computation.
325 //System.out.println("pred "+transition0.label);
335 System.out.println("pred "+transition0.label);
338 // if a non-syn-pred found not in enclosingRule, say we found one
342 System.out.println("found pred "+p+" not in "+enclosingRule.name);
426 //System.out.println("pred "+transition0.label);
|
| /external/apache-xml/src/main/java/org/apache/xpath/patterns/ |
| StepPattern.java | 457 XObject pred = m_predicates[i].execute(xctxt); local
461 if (XObject.CLASS_NUMBER == pred.getType())
465 else if (!pred.boolWithSideEffects())
474 pred.detach();
556 XObject pred = m_predicates[i].execute(xctxt); local
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 = m_predicates[i].execute(xctxt) local
[all...] |
| /external/opencv3/modules/core/include/opencv2/core/cuda/ |
| functional.hpp | 635 explicit __host__ __device__ __forceinline__ unary_negate(const Predicate& p) : pred(p) {}
639 return !pred(x);
643 __host__ __device__ __forceinline__ unary_negate(const unary_negate& other) : pred(other.pred) {}
645 Predicate pred; member in struct:cv::cuda::device::unary_negate
648 template <typename Predicate> __host__ __device__ __forceinline__ unary_negate<Predicate> not1(const Predicate& pred)
650 return unary_negate<Predicate>(pred);
655 explicit __host__ __device__ __forceinline__ binary_negate(const Predicate& p) : pred(p) {}
660 return !pred(x,y);
664 __host__ __device__ __forceinline__ binary_negate(const binary_negate& other) : pred(other.pred) {
666 Predicate pred; member in struct:cv::cuda::device::binary_negate
[all...] |
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| PolynomialSolver.h | 83 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 ) )
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
| merge_comp.pass.cpp | 45 binary_counting_predicate<std::greater<int>, int, int> pred((std::greater<int>()));
47 InIter2(ib), InIter2(ib+N), OutIter(ic), pred);
52 assert(pred.count() <= (N + N - 1));
69 binary_counting_predicate<std::greater<int>, int, int> pred((std::greater<int>()));
71 InIter2(ib), InIter2(ib+N), OutIter(ic), pred);
76 assert(pred.count() <= (N + N - 1));
|
| /external/libvpx/config/arm-neon/ |
| vp8_rtcd.h | 69 void vp8_dc_only_idct_add_c(short input, unsigned char *pred, int pred_stride, unsigned char *dst, int dst_stride);
70 void vp8_dc_only_idct_add_v6(short input, unsigned char *pred, int pred_stride, unsigned char *dst, int dst_stride);
71 void vp8_dc_only_idct_add_neon(short input, unsigned char *pred, int pred_stride, unsigned char *dst, int dst_stride);
174 void vp8_short_idct4x4llm_c(short *input, unsigned char *pred, int pitch, unsigned char *dst, int dst_stride);
175 void vp8_short_idct4x4llm_v6_dual(short *input, unsigned char *pred, int pitch, unsigned char *dst, int dst_stride);
176 void vp8_short_idct4x4llm_neon(short *input, unsigned char *pred, int pitch, unsigned char *dst, int dst_stride);
|
| /external/opencv3/3rdparty/libwebp/utils/ |
| filters.c | 33 static WEBP_INLINE void PredictLine(const uint8_t* src, const uint8_t* pred,
37 for (i = 0; i < length; ++i) dst[i] = src[i] + pred[i];
39 for (i = 0; i < length; ++i) dst[i] = src[i] - pred[i];
139 const int pred = GradientPredictor(preds[w - 1], local
142 out[w] = in[w] + (inverse ? pred : -pred);
|
| /external/v8/src/compiler/ |
| move-optimizer.cc | 213 const InstructionBlock* pred = code()->InstructionBlockAt(pred_index); local
215 code()->instructions()[pred->last_instruction_index()];
229 const InstructionBlock* pred = code()->InstructionBlockAt(pred_index); local
230 const Instruction* instr = LastInstruction(pred);
273 const InstructionBlock* pred = code()->InstructionBlockAt(pred_index); local
274 for (MoveOperands* move : *LastInstruction(pred)->parallel_moves()[0]) {
|
| /external/webp/src/dsp/ |
| filters.c | 31 static WEBP_INLINE void PredictLine(const uint8_t* src, const uint8_t* pred,
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];
152 const int pred = GradientPredictor(preds[w - 1], local
155 out[w] = in[w] + (inverse ? pred : -pred);
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/ |
| reconintra4x4.c | 62 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/llvm/lib/CodeGen/ |
| MachineTraceMetrics.cpp | 170 if (!TBI->Pred) {
180 unsigned PredNum = TBI->Pred->getNumber();
183 const FixedBlockInfo *PredFBI = MTM.getResources(TBI->Pred);
323 for (const MachineBasicBlock *Pred : MBB->predecessors()) {
325 getDepthResources(Pred);
332 Best = Pred, BestDepth = Depth;
463 DEBUG(dbgs() << " pred for BB#" << I->getNumber() << ": ");
466 TBI.Pred = pickTracePred(I);
468 if (TBI.Pred)
469 dbgs() << "BB#" << TBI.Pred->getNumber() << '\n'
[all...] |
| /frameworks/minikin/tools/ |
| mk_hyb_file.py | 64 self.pred = []
68 this = len(self.pred)
69 self.pred.append(self.last)
88 while ix >= len(self.pred):
90 return self.pred[ix] != -1
93 if self.pred[ix] is None:
96 self.succ[self.pred[ix]] = self.succ[ix]
98 self.last = self.pred[ix]
100 self.pred[self.succ[ix]] = self.pred[ix
[all...] |
| /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/ |
| block_idct.cpp | 123 static void idctrow(int16 *blk, uint8 *pred, uint8 *dst, int width);
322 /* 08/04/05, no residue, just copy from pred to output */
323 void Copy_Blk_to_Vop(uint8 *dst, uint8 *pred, int width)
327 *((uint32*)dst) = *((uint32*)pred);
328 *((uint32*)(dst += 4)) = *((uint32*)(pred += 4));
329 *((uint32*)(dst += width)) = *((uint32*)(pred += 12));
330 *((uint32*)(dst += 4)) = *((uint32*)(pred += 4));
331 *((uint32*)(dst += width)) = *((uint32*)(pred += 12));
332 *((uint32*)(dst += 4)) = *((uint32*)(pred += 4));
333 *((uint32*)(dst += width)) = *((uint32*)(pred += 12))
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| PredicatedNodeTest.java | 342 XObject pred = m_predicates[i].execute(xctxt); local
344 // System.out.println("pred.getType(): "+pred.getType());
345 if (XObject.CLASS_NUMBER == pred.getType())
354 System.out.println("pred.num(): " + pred.num());
358 int predIndex = (int) pred.num();
390 else if (!pred.bool())
|
| /external/clang/lib/Analysis/ |
| ThreadSafetyTIL.cpp | 56 unsigned BasicBlock::addPredecessor(BasicBlock *Pred) {
59 Predecessors.push_back(Pred);
198 for (auto *Pred : Predecessors)
199 ID = Pred->topologicalFinalSort(Blocks, ID);
212 for (auto *Pred : Predecessors) {
214 if (Pred->BlockID >= BlockID) continue;
217 Candidate = Pred;
221 auto *Alternate = Pred;
|
