Searched refs:between (Results 101 - 125 of 238) sorted by relevance

12345678910

/external/blktrace/btt/doc/
H A Dbtt.tex120 for a request. That occurs between the Q and G operations. You
133 amount of time between the queue trace and the merge trace.
154 \item \emph{Q2Q} which measures the time between queue traces
235 between consecutively \emph{received -- queued} and \emph{submitted
238 between IOs. Values provided include the number of seeks (number of IOs
239 submitted to lower level drivers), the \emph{mean} distance between
537 inactivity -- and one can gather a sense of deltas between the queueing
572 this, one can quickly discern some different characteristics between
754 \emph{closest} distance between the previous IO and this IO. The
761 between th
[all...]
/external/libunwind/doc/
H A Dlibunwind-setjmp.tex37 that exist between the points where \Func{setjmp}() and
H A Dunw_get_proc_name.tex33 between procedure names and ordinary labels. Furthermore, if symbol
H A Dunw_create_addr_space.tex144 routine to convert between the target's and the host's byte-order, if
163 responsibility of the call-back routine to convert between the
183 routine to convert between the target's and the host's byte-order, if
/external/mesa3d/docs/specs/
H A DMESA_drm_image.spec140 handles to a 2D array of pixels, which can be passed between
/external/mesa3d/docs/specs/OLD/
H A DMESA_packed_depth_stencil.spec41 1. Is this the right way to distinguish between 24/8 and 8/24
/external/skia/src/pathops/
H A DSkPathOpsCurve.h95 bool fOrdered; // cleared when a cubic's control point isn't between the sweep vectors
363 return between(0, roots[0], 1);
369 return between(0, roots[0], 1);
H A DSkPathOpsDebug.cpp1253 This checks the distance between start points; the distance between
1364 SkASSERT(!DEBUG_LIMIT_WIND_SUM || between(0, minSpan->windValue(), DEBUG_LIMIT_WIND_SUM));
1366 || between(-DEBUG_LIMIT_WIND_SUM, minSpan->oppValue(), DEBUG_LIMIT_WIND_SUM));
1510 if (!between(0, t, 1)) {
1580 coincident pair. If so, check for a new coincident span between B-end/A ptT loop
1725 SkASSERT(between(over1s->fT, tStart, over1e->fT));
1726 SkASSERT(between(over1s->fT, tEnd, over1e->fT));
1728 SkASSERT(between(over2s->fT, tStart, over2e->fT));
1729 SkASSERT(between(over2
[all...]
H A DSkPathOpsTSect.h467 SkASSERT(between(0, result, 1));
488 if (between(work->fStartT, t, work->fEndT)) {
697 if (between(test->fStartT, t, test->fEndT)) {
726 foundStart |= between(test->fStartT, fCoinStart.perpT(), test->fEndT);
727 foundEnd |= between(test->fStartT, fCoinEnd.perpT(), test->fEndT);
1063 if (between(test->fStartT, t, test->fEndT)) {
1265 if (between(0, oppStartT, 1) && between(0, oppEndT, 1)) {
1484 if (between(span->fStartT, oppRayI[0][closeIndex], span->fEndT)
1485 && between(oppSpa
[all...]
/external/skqp/src/pathops/
H A DSkPathOpsCurve.h95 bool fOrdered; // cleared when a cubic's control point isn't between the sweep vectors
363 return between(0, roots[0], 1);
369 return between(0, roots[0], 1);
H A DSkPathOpsDebug.cpp1253 This checks the distance between start points; the distance between
1364 SkASSERT(!DEBUG_LIMIT_WIND_SUM || between(0, minSpan->windValue(), DEBUG_LIMIT_WIND_SUM));
1366 || between(-DEBUG_LIMIT_WIND_SUM, minSpan->oppValue(), DEBUG_LIMIT_WIND_SUM));
1510 if (!between(0, t, 1)) {
1580 coincident pair. If so, check for a new coincident span between B-end/A ptT loop
1725 SkASSERT(between(over1s->fT, tStart, over1e->fT));
1726 SkASSERT(between(over1s->fT, tEnd, over1e->fT));
1728 SkASSERT(between(over2s->fT, tStart, over2e->fT));
1729 SkASSERT(between(over2
[all...]
H A DSkPathOpsTSect.h467 SkASSERT(between(0, result, 1));
488 if (between(work->fStartT, t, work->fEndT)) {
697 if (between(test->fStartT, t, test->fEndT)) {
726 foundStart |= between(test->fStartT, fCoinStart.perpT(), test->fEndT);
727 foundEnd |= between(test->fStartT, fCoinEnd.perpT(), test->fEndT);
1063 if (between(test->fStartT, t, test->fEndT)) {
1265 if (between(0, oppStartT, 1) && between(0, oppEndT, 1)) {
1484 if (between(span->fStartT, oppRayI[0][closeIndex], span->fEndT)
1485 && between(oppSpa
[all...]
/external/valgrind/gdbserver_tests/
H A Dmcblocklistsearch.stderrB.exp1 relaying data between gdb and process ....
H A Dmcleak.stderrB.exp1 relaying data between gdb and process ....
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Ruby/
H A DRuby.stg1018 look_<decisionNumber>_<stateNumber>.between?( <lower>, <upper> )
1022 @input.peek( <k> ).between?( <lower>, <upper> )
1267 * grammar rule that chooses between lexer rules.
/external/doclava/res/assets/templates-sdk/
H A Dmacros_override.cs77 if:tag.from && tag.to ?>Value is between <?cs var:tag.from ?> and <?cs var:tag.to ?> inclusive.<?cs
/external/libmpeg2/common/arm/
H A Dideint_cac_a9.s127 @ Compute absolute diff between top and bottom row sums
/external/llvm/lib/Support/
H A Dregengine.inc709 /* is there an EOL and/or BOL between lastc and c? */
792 /* is there an EOL and/or BOL between lastc and c? */
/external/llvm/test/MC/ARM/
H A Deh-directive-setfp.s6 @ The .setfp directive will track the offset between the frame pointer and
/external/swiftshader/third_party/LLVM/lib/Support/
H A Dregengine.inc709 /* is there an EOL and/or BOL between lastc and c? */
792 /* is there an EOL and/or BOL between lastc and c? */
/external/swiftshader/third_party/llvm-subzero/lib/Support/
H A Dregengine.inc709 /* is there an EOL and/or BOL between lastc and c? */
792 /* is there an EOL and/or BOL between lastc and c? */
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
H A Derror.rb383 A recognizer must choose between multiple possible recognition paths based
397 choose between all possible token rules. If raised by +tokens+, it means the
516 There is an inconsistency between the number of appearances of some symbol
/external/libjpeg-turbo/simd/
H A Djdsample-mmx.asm42 ; The upsampling algorithm is linear interpolation between pixel centers,
43 ; also known as a "triangle filter". This is a good compromise between
45 ; of the way between input pixel centers.
H A Djdsample-sse2-64.asm43 ; The upsampling algorithm is linear interpolation between pixel centers,
44 ; also known as a "triangle filter". This is a good compromise between
46 ; of the way between input pixel centers.
H A Djdsample-sse2.asm42 ; The upsampling algorithm is linear interpolation between pixel centers,
43 ; also known as a "triangle filter". This is a good compromise between
45 ; of the way between input pixel centers.

Completed in 1444 milliseconds

12345678910