| /external/webrtc/webrtc/modules/video_coding/ |
| media_opt_util.cc | 388 // Generally there is a rate mis-match between the FEC cost estimated
389 // in mediaOpt and the actual FEC cost sent out in RTP module.
404 // We reduce cost factor (which will reduce overhead for FEC and
|
| /frameworks/base/core/java/android/os/ |
| Message.java | 42 * arg1 and arg2 are lower-cost alternatives to using
49 * arg1 and arg2 are lower-cost alternatives to using
403 * as a lower cost way to send a few simple integer values, if you can.
|
| /frameworks/base/docs/html/training/efficient-downloads/ |
| efficient-network-access.jd | 84 <p>How aggressively you prefetch depends on the size of the data being downloaded and the likelihood of it being used. As a rough guide, based on the state machine described above, for data that has a 50% chance of being used within the current user session, you can typically prefetch for around 6 seconds (approximately 1-2 Mb) before the potential cost of downloading unused data matches the potential savings of not downloading that data to begin with.</p>
116 <p>An app that pings the server every 20 seconds, just to acknowledge that the app is running and visible to the user, will keep the radio powered on indefinitely, resulting in a significant battery cost for almost no actual data transfer.</p>
130 <p>Any time-sensitive or on-demand transfer—such as downloading a full-sized image—should preempt regularly scheduled updates. The planned update should be executed at the same time as the on-demand transfer, with the next update scheduled to occur after the set interval. This approach mitigates the cost of performing a regular update by piggy-backing on the necessary time-sensitive photo download.</p>
|
| /external/llvm/lib/Transforms/Scalar/ |
| RewriteStatepointsForGC.cpp | 60 // Cost threshold measuring when it is profitable to rematerialize value instead
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| BBVectorize.cpp | 547 // Returns the cost of the provided instruction using TTI.
557 // We mark this instruction as zero-cost because scalar GEPs are usually
[all...] |
| /external/ceres-solver/docs/source/ |
| version_history.rst | 171 differentiated cost functions whose sizing is determined at run
394 NULL, /* No cost */
405 NULL, /* No cost */
578 #. Add support for cost functions with 10 parameter blocks in
653 #. Change the slop handling around zero for model cost changes to use
|
| building.rst | 166 iter cost cost_change |gradient| |step| tr_ratio tr_radius ls_iter iter_time total_time
194 Cost:
214 Termination: CONVERGENCE (Function tolerance reached. |cost_change|/cost: 1.769766e-09 <= 1.000000e-06)
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonEarlyIfConv.cpp | 435 unsigned Cost = 0;
443 Cost++;
449 Cost++;
451 return Cost;
519 // they aren't always adding extra cost.
[all...] |
| /external/deqp/modules/gles2/performance/ |
| es2pShaderOperatorTests.cpp | 162 * eliminate this cost, we actually do the stuff described in the above
165 * theory) compute the cost of just one operation in a subclass-dependent
171 * fragments in a draw call, we get the time cost of one operation.
253 //! Computes the cost of a single operation, given the workload costs per program.
[all...] |
| /external/deqp/modules/gles3/performance/ |
| es3pShaderOperatorTests.cpp | 162 * eliminate this cost, we actually do the stuff described in the above
165 * theory) compute the cost of just one operation in a subclass-dependent
171 * fragments in a draw call, we get the time cost of one operation.
253 //! Computes the cost of a single operation, given the workload costs per program.
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| rtl.h | [all...] |
| /external/libavc/encoder/ |
| ih264e_process.c | [all...] |
| ih264e_core_coding.c | [all...] |
| /external/opencv3/modules/stitching/src/ |
| seam_finders.cpp | 827 Mat_<float> cost = Mat::zeros(roi.size(), CV_32F);
830 cost(src) = 0.f;
848 steps[nsteps++] = std::make_pair(cost(y, x-1) + costH(y, x-1), 1);
850 steps[nsteps++] = std::make_pair(cost(y-1, x-1) + costH(y-1, x-1) + costV(y-1, x), 2);
852 steps[nsteps++] = std::make_pair(cost(y+1, x-1) + costH(y+1, x-1) + costV(y, x), 3);
858 cost(y, x) = opt.first;
878 steps[nsteps++] = std::make_pair(cost(y-1, x) + costV(y-1, x), 1);
880 steps[nsteps++] = std::make_pair(cost(y-1, x-1) + costV(y-1, x-1) + costH(y, x-1), 2);
882 steps[nsteps++] = std::make_pair(cost(y-1, x+1) + costV(y-1, x+1) + costH(y, x), 3);
888 cost(y, x) = opt.first
[all...] |
| /external/valgrind/coregrind/ |
| m_mallocfree.c | 77 cost center (OPTIONAL) (VG_MIN_MALLOC_SZB bytes, only when h-p enabled)
86 cost center (OPTIONAL) (VG_MIN_MALLOC_SZB bytes, only when h-p enabled)
132 The heap-profile cost-center field is 8 bytes even on 32 bit
135 HChar*, which is the cost center name. On 32-bit platforms, the
434 // Set and get the cost-center field of a block.
505 !!! Currently, we do not mark the cost center and szB fields unaccessible
[all...] |
| /external/llvm/include/llvm/Target/ |
| TargetLowering.h | 16 /// 3. Cost thresholds for alternative implementations of certain operations.
315 /// \p Cost[out] gives the cost of that transformation when this is true.
317 unsigned &Cost) const {
398 /// Return the cost of the 'representative' register class for the specified
[all...] |
| /external/pdfium/third_party/lpng_v163/ |
| pngwrite.c | [all...] |
| /docs/source.android.com/src/source/ |
| faqs.jd | 251 <h3 id="how-much-does-compatibility-certification-cost">How much does compatibility certification cost?</h3>
252 <p>There is no cost to obtain Android compatibility for a device. The
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/transform/ |
| FastFourierTransformer.java | 847 final double cosT = FastMath.cos(t);
857 omegaReal[i-1] * cosT + omegaImaginaryForward[i-1] * sinT;
859 omegaImaginaryForward[i-1] * cosT - omegaReal[i-1] * sinT;
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocPBQP.cpp | 410 // Scan the machine function and add a coalescing cost whenever CoalescerPair
614 // Tweak cost of callee saved registers, as using then force spilling and
639 DEBUG(dbgs() << "VREG " << PrintReg(VReg, &TRI) << " -> SPILLED (Cost: "
|
| /frameworks/av/services/camera/libcameraservice/ |
| CameraService.h | 398 int32_t cost, const std::set<String8>& conflictingKeys, int32_t priority,
424 * Make a new CameraState and set the ID, cost, and conflicting devices using the values
427 CameraState(const String8& id, int cost, const std::set<String8>& conflicting);
[all...] |
| /frameworks/base/docs/html/distribute/tools/ |
| localization-checklist.jd | 504 get an idea of cost and turnaround time. Make sure to include multiple
505 iterations in the cost. You can find translation vendors online or use
822 budget you can support, but in general it's cost-effective and productive to
|
| /art/runtime/ |
| scoped_thread_state_change.h | 209 // amortize the cost of working out the current thread. Additionally it lets us check (and repair)
|
| /device/linaro/hikey/self-extractors/linaro/ |
| LICENSE | 76 ENTIRE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
| /external/aac/libAACenc/src/ |
| line_pe.cpp | 188 /* provide for cost of scale factor for Intensity */
|
