| /external/compiler-rt/lib/profile/ |
| GCDAProfiling.c | 328 uint32_t pred; local
330 pred = *predecessor;
331 if (pred == 0xffffffff)
333 counter = counters[pred];
335 /* Don't crash if the pred# is out of sync. This can happen due to threads,
342 "llvmgcda: increment_indirect_counter counters=%08llx, pred=%u\n",
|
| /external/libvpx/config/arm-neon/ |
| vp8_rtcd.h | 61 void vp8_dc_only_idct_add_c(short input, unsigned char *pred, int pred_stride, unsigned char *dst, int dst_stride);
62 void vp8_dc_only_idct_add_neon(short input, unsigned char *pred, int pred_stride, unsigned char *dst, int dst_stride);
151 void vp8_short_idct4x4llm_c(short *input, unsigned char *pred, int pitch, unsigned char *dst, int dst_stride);
152 void vp8_short_idct4x4llm_neon(short *input, unsigned char *pred, int pitch, unsigned char *dst, int dst_stride);
|
| /external/libvpx/config/arm64/ |
| vp8_rtcd.h | 61 void vp8_dc_only_idct_add_c(short input, unsigned char *pred, int pred_stride, unsigned char *dst, int dst_stride);
62 void vp8_dc_only_idct_add_neon(short input, unsigned char *pred, int pred_stride, unsigned char *dst, int dst_stride);
151 void vp8_short_idct4x4llm_c(short *input, unsigned char *pred, int pitch, unsigned char *dst, int dst_stride);
152 void vp8_short_idct4x4llm_neon(short *input, unsigned char *pred, int pitch, unsigned char *dst, int dst_stride);
|
| /external/libvpx/config/mips32-msa/ |
| vp8_rtcd.h | 62 void vp8_dc_only_idct_add_c(short input, unsigned char *pred, int pred_stride, unsigned char *dst, int dst_stride);
63 void vp8_dc_only_idct_add_msa(short input, unsigned char *pred, int pred_stride, unsigned char *dst, int dst_stride);
157 void vp8_short_idct4x4llm_c(short *input, unsigned char *pred, int pitch, unsigned char *dst, int dst_stride);
158 void vp8_short_idct4x4llm_msa(short *input, unsigned char *pred, int pitch, unsigned char *dst, int dst_stride);
|
| /external/libvpx/config/mips64-msa/ |
| vp8_rtcd.h | 62 void vp8_dc_only_idct_add_c(short input, unsigned char *pred, int pred_stride, unsigned char *dst, int dst_stride);
63 void vp8_dc_only_idct_add_msa(short input, unsigned char *pred, int pred_stride, unsigned char *dst, int dst_stride);
157 void vp8_short_idct4x4llm_c(short *input, unsigned char *pred, int pitch, unsigned char *dst, int dst_stride);
158 void vp8_short_idct4x4llm_msa(short *input, unsigned char *pred, int pitch, unsigned char *dst, int dst_stride);
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| brw_ir_fs.h | 379 set_predicate_inv(enum brw_predicate pred, bool inverse,
382 inst->predicate = pred;
391 set_predicate(enum brw_predicate pred, fs_inst *inst)
393 return set_predicate_inv(pred, false, inst);
|
| brw_ir_vec4.h | 340 set_predicate_inv(enum brw_predicate pred, bool inverse,
343 inst->predicate = pred;
352 set_predicate(enum brw_predicate pred, vec4_instruction *inst)
354 return set_predicate_inv(pred, false, inst);
|
| /external/testng/src/main/java/org/testng/internal/ |
| Graph.java | 278 for (T pred : m_predecessors.values()) {
279 result.addPredecessor(pred);
299 T pred = m_predecessors.get(o); local
300 if (null != pred) {
303 ppp(" REMOVED PRED " + o + " FROM NODE " + m_object);
306 ppp(" FAILED TO REMOVE PRED " + o + " FROM NODE " + m_object);
316 sb.append(" pred:");
|
| /external/webp/src/dsp/ |
| filters_mips_dsp_r2.c | 109 #define DO_PREDICT_LINE_VERTICAL(SRC, PRED, DST, LENGTH, INVERSE) do { \
111 const uint8_t* ppred = (uint8_t*)(PRED); \
123 "ulw %[temp2], 0(%[pred]) \n\t" \
125 "ulw %[temp4], 4(%[pred]) \n\t" \
134 "addiu %[pred], %[pred], 8 \n\t" \
145 "lbu %[temp2], 0(%[pred]) \n\t" \
147 "addiu %[pred], %[pred], 1 \n\t" \
161 [temp6]"=&r"(temp6), [temp7]"=&r"(temp7), [pred]"+&r"(ppred),
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| print.go | 49 pred := e.b
50 fmt.Fprintf(p.w, " b%d", pred.ID)
|
| /prebuilts/go/darwin-x86/src/go/types/ |
| initorder.go | 45 for p := range n.pred {
91 for p := range n.pred {
177 // Each node p in n.pred represents an edge p->n, and each node
182 pred, succ nodeSet // consumers and dependencies of this node (lazily initialized)
219 d.pred.add(n)
234 for p := range n.pred {
243 s.pred.add(p)
244 delete(s.pred, n) // remove edge to n
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| print.go | 49 pred := e.b
50 fmt.Fprintf(p.w, " b%d", pred.ID)
|
| /prebuilts/go/linux-x86/src/go/types/ |
| initorder.go | 45 for p := range n.pred {
91 for p := range n.pred {
177 // Each node p in n.pred represents an edge p->n, and each node
182 pred, succ nodeSet // consumers and dependencies of this node (lazily initialized)
219 d.pred.add(n)
234 for p := range n.pred {
243 s.pred.add(p)
244 delete(s.pred, n) // remove edge to n
|
| /system/security/keystore/ |
| auth_token_table.cpp | 61 typename Container::iterator find_if(Container& container, Predicate pred) {
62 return std::find_if(container.begin(), container.end(), pred);
66 typename Container::iterator remove_if(Container& container, Predicate pred) {
67 return std::remove_if(container.begin(), container.end(), pred);
|
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/ |
| fset2.c | 908 Predicate *pred=p->guardpred;
local
910 if (pred == NULL) {
915 if (pred->k == 1) {
917 dif=set_dif(*constrain,pred->scontext[1]);
925 if (MR_tree_matches_constraints(k,constrain,pred->tcontext)) {
945 Predicate *pred=p->ampersandPred;
local
949 if (k <= pred->k) {
969 if (pred->k == 1) {
971 set_andin(constrain,pred->scontext[1]);
978 if (! MR_tree_matches_constraints(pred->k,constrain,pred->tcontext)) {
1589 Predicate *pred = NULL; local
[all...] |
| /build/blueprint/ |
| singleton_ctx.go | 56 VisitAllModulesIf(pred func(Module) bool, visit func(Module))
58 VisitDepsDepthFirstIf(module Module, pred func(Module) bool,
210 func (s *singletonContext) VisitAllModulesIf(pred func(Module) bool,
213 s.context.VisitAllModulesIf(pred, visit)
223 pred func(Module) bool, visit func(Module)) {
225 s.context.VisitDepsDepthFirstIf(module, pred, visit)
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| UnreachableCodeChecker.cpp | 220 const CFGBlock *pred = *CB->pred_begin(); local
221 if (!pred)
225 const Stmt *cond = pred->getTerminatorCondition();
|
| /external/iproute2/misc/ |
| ssfilter.y | 16 static struct ssfilter * alloc_node(int type, void *pred)
22 n->pred = pred;
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
| inplace_merge_comp.pass.cpp | 76 binary_counting_predicate<std::greater<value_type>, value_type, value_type> pred((std::greater<value_type>()));
77 std::inplace_merge(Iter(ia), Iter(ia+M), Iter(ia+N), std::ref(pred));
83 assert(pred.count() <= (N-1));
|
| /external/mesa3d/src/gallium/drivers/freedreno/ir3/ |
| ir3_nir_lower_if_else.c | 274 assert(src->pred == then_block || src->pred == else_block);
277 unsigned idx = src->pred == then_block ? 1 : 2;
|
| /external/tensorflow/tensorflow/python/keras/_impl/keras/applications/ |
| imagenet_utils.py | 222 ValueError: In case of invalid shape of the `pred` array
240 for pred in preds:
241 top_indices = pred.argsort()[-top:][::-1]
242 result = [tuple(CLASS_INDEX[str(i)]) + (pred[i],) for i in top_indices]
|
| /external/tensorflow/tensorflow/python/training/ |
| adadelta_test.py | 152 pred = math_ops.matmul(embedding_ops.embedding_lookup([var0], [0]), x)
153 loss = pred * pred
|
| adagrad_da_test.py | 89 pred = math_ops.matmul(embedding_ops.embedding_lookup([var0], [0]), x)
90 loss = pred * pred
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/lld/Core/ |
| Simple.h | 78 void removeDefinedAtomsIf(std::function<bool(const DefinedAtom *)> pred) {
81 [&pred](OwningAtomPtr<DefinedAtom> &p) {
82 return pred(p.get());
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/lld/Core/ |
| Simple.h | 78 void removeDefinedAtomsIf(std::function<bool(const DefinedAtom *)> pred) {
81 [&pred](OwningAtomPtr<DefinedAtom> &p) {
82 return pred(p.get());
|
