| /bionic/libc/private/ |
| kernel_sigset_t.h | 25 // to the kernel, at the cost of not being able to refer to real-time signals.
|
| /development/ndk/platforms/android-21/include/linux/netfilter/ |
| xt_limit.h | 31 __u32 credit_cap, cost; member in struct:xt_rateinfo
|
| /development/ndk/platforms/android-21/include/linux/netfilter_bridge/ |
| ebt_limit.h | 31 __u32 credit_cap, cost; member in struct:ebt_limit_info
|
| /development/perftests/panorama/feature_stab/db_vlvm/ |
| db_robust.h | 43 double cost; member in struct:db_stat_struct
|
| /external/autotest/client/tests/unixbench/ |
| control | 21 - System Call Overhead - estimates the cost of entering and leaving the
|
| /external/ceres-solver/internal/ceres/ |
| autodiff_cost_function_test.cc | 46 T* cost) const {
47 cost[0] = x[0] * y[0] + x[1] * y[1] - T(a_);
105 T* cost) const {
106 cost[0] = *x0 + *x1 + *x2 + *x3 + *x4 + *x5 + *x6 + *x7 + *x8 + *x9;
|
| problem_impl.h | 138 double* cost,
179 double* cost,
204 // When removing residual and parameter blocks, cost/loss functions and
206 // problem to see if the cost/loss/parameterization is shared with other
|
| /external/clang/docs/ |
| LeakSanitizer.rst | 15 only, at a minimal performance cost.
|
| /external/compiler-rt/lib/builtins/ppc/ |
| floatditf.c | 26 * This could be avoided, but at some substantial cost.
|
| floatunditf.c | 32 /* This could be avoided, but at some substantial cost. */
|
| /external/eigen/doc/ |
| TopicLazyEvaluation.dox | 43 Eigen first evaluates <tt>matrix * matrix</tt> into a temporary matrix, and then copies it into the original \c matrix. This guarantees a correct result as we saw above that lazy evaluation gives wrong results with matrix products. It also doesn't cost much, as the cost of the matrix product itself is much higher.
57 <b>The third circumstance</b> in which Eigen chooses immediate evaluation, is when its cost model shows that the total cost of an operation is reduced if a sub-expression gets evaluated into a temporary. Indeed, in certain cases, an intermediate result is sufficiently costly to compute and is reused sufficiently many times, that is worth "caching". Here is an example:
|
| /external/iproute2/man/man8/ |
| tc-pfifo_fast.8 | 27 prioritize interactive traffic or penalize 'lowest cost' traffic.
|
| /external/liblzf/ |
| README | 4 save *some* space but not at the cost of speed. It is ideal for
|
| /external/libselinux/ |
| NOTICE | 16 lost profits, cost of cover, or other special, incidental,
|
| /external/llvm/test/Transforms/GVN/ |
| pre-no-cost-phi.ll | 2 ; This testcase tests insertion of no-cost phis. That is,
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| exit_value_test3.ll | 3 ; Check IndVarSimplify should replace exit value even if the expansion cost
|
| /external/llvm/test/Transforms/Inline/ |
| dynamic_alloca_test.ll | 8 ; FIXME: This test is xfailed because the inline cost rewrite disabled *all*
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ARM/ |
| 2012-06-15-lsr-noaddrmode.ll | 12 ;The chosen solution requires 4 regs, with addrec cost 1, plus 3 base adds, plus 2 setup cost:
25 ;The chosen solution requires 4 regs, with addrec cost 1, plus 1 base add, plus 2 setup cost:
|
| /external/llvm/test/Transforms/LoopVectorize/X86/ |
| vector-scalar-select-cost.ll | 25 ; A scalar select has a cost of 1 on core2
26 ; CHECK: cost of 1 for VF 2 {{.*}} select i1 %cond, i32 %6, i32 0
53 ; A vector select has a cost of 1 on core2
54 ; CHECK: cost of 1 for VF 2 {{.*}} select i1 %8, i32 %6, i32 0
|
| /external/opencv3/modules/calib3d/src/ |
| compat_stereo.cpp | 66 state->disp = state->cost = 0;
83 cvReleaseMat( &(*state)->cost );
121 cv::Mat disp = cv::cvarrToMat(_disp), cost = cv::cvarrToMat(_cost); local
122 cv::validateDisparity( disp, cost, minDisparity, numberOfDisparities, disp12MaxDiff );
|
| /external/selinux/libselinux/ |
| LICENSE | 16 lost profits, cost of cover, or other special, incidental,
|
| /external/v8/src/ia32/ |
| cpu-ia32.cc | 33 // performance cost. We can notify valgrind to invalidate its cache.
|
| /external/v8/src/x64/ |
| cpu-x64.cc | 33 // performance cost. We can notify valgrind to invalidate its cache.
|
| /external/v8/src/x87/ |
| cpu-x87.cc | 33 // performance cost. We can notify valgrind to invalidate its cache.
|
| /external/valgrind/callgrind/ |
| callgrind.h | 84 /* Dump current state of cost centers, and zero them afterwards */
89 /* Dump current state of cost centers, and zero them afterwards.
97 /* Zero cost centers */
105 by increment of counters in a cost center */
|
