Searched defs:distance (Results 76 - 100 of 146) sorted by relevance

123456

/external/llvm/include/llvm/CodeGen/
H A DSlotIndexes.h144 /// The default distance between instructions as returned by distance().
216 /// Return the distance from this index to the given one.
217 int distance(SlotIndex other) const { function in class:llvm::SlotIndex
221 /// Return the scaled distance from this index to the given one, where all
222 /// slots on the same instruction have zero distance.
/external/ltrace/
H A Doutput.c724 size_t distance; local
744 distance = (size_t) -1;
752 < distance)) {
753 distance = ip - lib->base;
/external/openfst/src/include/fst/
H A Dqueue.h303 NaturalShortestFirstQueue(const vector<W> &distance) : argument
304 ShortestFirstQueue<S, C>(C(distance, less_)) {}
539 // This constructor takes a state distance vector that, if non-null and if
541 // shortest-first queue using the natural order w.r.t to the distance.
543 AutoQueue(const Fst<Arc> &fst, const vector<typename Arc::Weight> *distance, argument
569 if (distance && (Weight::Properties() & kPath)) {
571 comp = new Compare(*distance, *less);
732 // an estimate of the shortest distance to the final states.
741 // shortest distance from the initial state, a Less comparison
743 // shortest distance t
778 NaturalAStarQueue(const vector<W> &distance, const E &estimate) argument
808 PruneQueue(const vector<Weight> &distance, Q *queue, L comp, const C &class_func, Weight threshold) argument
878 NaturalPruneQueue(const vector<W> &distance, Q *queue, const C &class_func_, Weight threshold) argument
[all...]
H A Drmepsilon.h42 #include <fst/shortest-distance.h>
78 vector<Weight> *distance,
80 : fst_(fst), distance_(distance), sd_state_(fst_, distance, opts, true),
135 // Shortest distance algorithm computation state.
224 // The vector 'distance' will be used to hold the shortest distances
229 vector<typename Arc::Weight> *distance,
292 rmeps_state(*fst, distance, opts);
358 vector<Weight> distance; local
359 AutoQueue<StateId> state_queue(*fst, &distance, EpsilonArcFilte
77 RmEpsilonState(const Fst<Arc> &fst, vector<Weight> *distance, const RmEpsilonOptions<Arc, Queue> &opts) argument
228 RmEpsilon(MutableFst<Arc> *fst, vector<typename Arc::Weight> *distance, const RmEpsilonOptions<Arc, Queue> &opts) argument
[all...]
/external/skia/src/pathops/
H A DSkPathOpsCubic.cpp224 double distance = lineParameters.controlPtDistance(*this, 1); local
225 if (!approximately_zero_when_compared_to(distance, largest)) {
228 distance = lineParameters.controlPtDistance(*this, 2);
229 return approximately_zero_when_compared_to(distance, largest);
/external/v8/src/ia32/
H A Dmacro-assembler-ia32.h106 Label::Distance distance = Label::kFar) {
107 InNewSpace(object, scratch, zero, branch, distance);
115 Label::Distance distance = Label::kFar) {
116 InNewSpace(object, scratch, not_zero, branch, distance);
143 Label::Distance distance);
374 Label::Distance distance = Label::kFar);
380 Label::Distance distance = Label::kFar);
386 Label::Distance distance = Label::kFar);
494 Label::Distance distance = Label::kFar) {
496 j(zero, smi_label, distance);
922 JumpIfNotUniqueNameInstanceType(Operand(reg), not_unique_name, distance); local
[all...]
/external/v8/src/x87/
H A Dmacro-assembler-x87.h105 Label::Distance distance = Label::kFar) {
106 InNewSpace(object, scratch, zero, branch, distance);
114 Label::Distance distance = Label::kFar) {
115 InNewSpace(object, scratch, not_zero, branch, distance);
142 Label::Distance distance);
346 Label::Distance distance = Label::kFar);
352 Label::Distance distance = Label::kFar);
358 Label::Distance distance = Label::kFar);
466 Label::Distance distance = Label::kFar) {
468 j(zero, smi_label, distance);
890 JumpIfNotUniqueNameInstanceType(Operand(reg), not_unique_name, distance); local
[all...]
H A Dassembler-x87.cc1343 void Assembler::jmp(Label* L, Label::Distance distance) { argument
1359 } else if (distance == Label::kNear) {
1397 void Assembler::j(Condition cc, Label* L, Label::Distance distance) { argument
1415 } else if (distance == Label::kNear) {
/external/jmonkeyengine/engine/src/core/com/jme3/input/
H A DChaseCamera.java59 protected float distance = 20; field in class:ChaseCamera
80 protected float targetDistance = distance;
270 float hDistance = (distance) * FastMath.sin((FastMath.PI / 2) - vRotation);
271 pos.set(hDistance * FastMath.cos(rotation), (distance) * FastMath.sin(vRotation), hDistance * FastMath.sin(rotation));
401 //linear interpolation of the distance while chasing
403 distance = temp.set(targetLocation).subtractLocal(cam.getLocation()).length();
405 distance = FastMath.interpolateLinear(distanceLerpFactor, distance, targetDistance);
406 if (targetDistance + 0.01f >= distance && targetDistance - 0.01f <= distance) {
[all...]
/external/libvpx/libvpx/vp8/encoder/
H A Dmcomp.c1331 int sad_per_bit, int distance,
1354 int row_min = ref_row - distance;
1355 int row_max = ref_row + distance;
1356 int col_min = ref_col - distance;
1357 int col_max = ref_col + distance;
1427 int sad_per_bit, int distance,
1450 int row_min = ref_row - distance;
1451 int row_max = ref_row + distance;
1452 int col_min = ref_col - distance;
1453 int col_max = ref_col + distance;
1330 vp8_full_search_sad_c(MACROBLOCK *x, BLOCK *b, BLOCKD *d, int_mv *ref_mv, int sad_per_bit, int distance, vp8_variance_fn_ptr_t *fn_ptr, int *mvcost[2], int_mv *center_mv) argument
1426 vp8_full_search_sadx3(MACROBLOCK *x, BLOCK *b, BLOCKD *d, int_mv *ref_mv, int sad_per_bit, int distance, vp8_variance_fn_ptr_t *fn_ptr, int *mvcost[2], int_mv *center_mv) argument
1560 vp8_full_search_sadx8(MACROBLOCK *x, BLOCK *b, BLOCKD *d, int_mv *ref_mv, int sad_per_bit, int distance, vp8_variance_fn_ptr_t *fn_ptr, int *mvcost[2], int_mv *center_mv) argument
[all...]
/external/lzma/C/
H A DLzmaDec.c230 UInt32 distance; local
236 distance = rep1;
245 distance = rep2;
250 distance = rep3;
256 rep0 = distance;
296 UInt32 distance; local
299 TREE_6_DECODE(prob, distance);
300 if (distance >= kStartPosModelIndex)
302 unsigned posSlot = (unsigned)distance;
303 int numDirectBits = (int)(((distance >>
[all...]
/external/openfst/src/include/fst/extensions/pdt/
H A Dshortest-path.h113 SearchData() : distance(Weight::Zero()),
118 Weight distance; // Distance to this state from PDT 'start' state member in struct:fst::PdtShortestPathData::SearchData
150 return data->distance;
155 return data->distance;
180 data->distance = w;
185 data->distance = w;
524 // Computes the shortest distance stored in a recursive way. Each
595 // shortest distance to them.
683 // since the shortest distance is stored recursively.
/external/pdfium/core/src/fpdfapi/fpdf_render/
H A Dfpdf_render_text.cpp58 FX_FLOAT distance = (FX_FLOAT)FXSYS_fabs(pos - (FX_FLOAT)blues[i]); local
59 if (distance < 1.0f * 80.0f / 100.0f && distance < min_distance) {
60 min_distance = distance;
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/xy/
H A DXYPlot.java601 * Returns the distance between x and y.
608 private double distance(double x, double y) { method in class:XYPlot
618 double maxXDelta = distance(calculatedMaxX.doubleValue(), origin);
619 double minXDelta = distance(calculatedMinX.doubleValue(), origin);
669 double maxYDelta = distance(calculatedMaxY.doubleValue(), origin);
670 double minYDelta = distance(calculatedMinY.doubleValue(), origin);
/external/e2fsprogs/misc/
H A De2image.c563 blk64_t distance = 0; local
589 divide the fs up into distance size chunks and write them
592 distance = (dest_offset - source_offset) / fs->blocksize;
593 if (distance < ext2fs_blocks_count(fs->super))
594 start = ext2fs_blocks_count(fs->super) - distance;
599 if (distance)
603 if (distance) {
605 if (distance >= ext2fs_blocks_count(fs->super) ||
606 start == ext2fs_blocks_count(fs->super) - distance)
685 if (distance
[all...]
/external/fio/
H A Dinit.c1918 int i, distance; local
1927 distance = string_distance(name, l_opts[i].name);
1928 if (distance < best_distance) {
1929 best_distance = distance;
H A Doptions.c3915 int i, distance; local
3931 distance = string_distance(name, fio_options[i].name);
3932 if (distance < best_distance) {
3933 best_distance = distance;
/external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/test/
H A DTestFmwk.java1701 private final void indent(int distance) { argument
1712 log.print(spaces.substring(0, distance * (idm ? 3 : 2)));
/external/libpng/
H A Dpngrtran.c737 png_bytep distance; local
748 distance = (png_bytep)png_malloc(png_ptr, (png_uint_32)(num_entries *
751 memset(distance, 0xff, num_entries * (sizeof (png_byte)));
783 if (d < (int)distance[d_index])
785 distance[d_index] = (png_byte)d;
793 png_free(png_ptr, distance);
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_mcomp.c1056 int sad_per_bit, int distance,
1063 const int row_min = MAX(ref_mv->row - distance, x->mv_row_min);
1064 const int row_max = MIN(ref_mv->row + distance, x->mv_row_max);
1065 const int col_min = MAX(ref_mv->col - distance, x->mv_col_min);
1066 const int col_max = MIN(ref_mv->col + distance, x->mv_col_max);
1089 int sad_per_bit, int distance,
1096 const int row_min = MAX(ref_mv->row - distance, x->mv_row_min);
1097 const int row_max = MIN(ref_mv->row + distance, x->mv_row_max);
1098 const int col_min = MAX(ref_mv->col - distance, x->mv_col_min);
1099 const int col_max = MIN(ref_mv->col + distance,
1055 vp9_full_search_sad_c(const MACROBLOCK *x, const MV *ref_mv, int sad_per_bit, int distance, const vp9_variance_fn_ptr_t *fn_ptr, const MV *center_mv, MV *best_mv) argument
1088 vp9_full_search_sadx3(const MACROBLOCK *x, const MV *ref_mv, int sad_per_bit, int distance, const vp9_variance_fn_ptr_t *fn_ptr, const MV *center_mv, MV *best_mv) argument
1153 vp9_full_search_sadx8(const MACROBLOCK *x, const MV *ref_mv, int sad_per_bit, int distance, const vp9_variance_fn_ptr_t *fn_ptr, const MV *center_mv, MV *best_mv) argument
[all...]
/external/linux-tools-perf/src/tools/perf/bench/
H A Dnuma.c893 int distance; local
964 distance = nr_max - nr_min;
966 tprintf(" [%2d/%-2d]", distance, process_groups);
/external/mesa3d/src/gallium/state_trackers/vega/
H A Dpath.c1873 static INLINE VGboolean point_on_current_segment(VGfloat distance, argument
1878 (((floatIsZero(distance) || distance < 0) && floatIsZero(length)) ||
1879 ((distance > length || floatsEqual(distance, length)) &&
1880 (floatsEqual(distance, length + segment_length) ||
1881 distance < (length + segment_length))));
1887 VGfloat distance,
1898 on_current_segment = point_on_current_segment(distance,
1902 VGfloat at = (distance
1884 path_point_segment(struct path_iter_data iter, struct path_iter_data prev_iter, VGfloat coords[8], VGfloat distance, VGfloat length, VGfloat *current_length, VGfloat *point, VGfloat *normal) argument
1968 path_point(struct path *p, VGint start_segment, VGint num_segments, VGfloat distance, VGfloat *point, VGfloat *normal) argument
[all...]
/external/opencv/cv/src/
H A DmycvHaarDetectObjects.cpp123 int distance = cvRound(r1->width*0.2); local
125 return r2->x <= r1->x + distance &&
126 r2->x >= r1->x - distance &&
127 r2->y <= r1->y + distance &&
128 r2->y >= r1->y - distance &&
1511 int distance = cvRound( r2.rect.width * 0.2 ); local
1514 r1.rect.x >= r2.rect.x - distance &&
1515 r1.rect.y >= r2.rect.y - distance &&
1516 r1.rect.x + r1.rect.width <= r2.rect.x + r2.rect.width + distance &&
1517 r1.rect.y + r1.rect.height <= r2.rect.y + r2.rect.height + distance
[all...]
/external/pdfium/samples/fx_lpng/lpng_v163/
H A Dfx_pngrtran.c736 png_bytep distance; local
747 distance = (png_bytep)png_malloc(png_ptr, (png_uint_32)(num_entries *
750 memset(distance, 0xff, num_entries * (sizeof (png_byte)));
782 if (d < (int)distance[d_index])
784 distance[d_index] = (png_byte)d;
792 png_free(png_ptr, distance);
/external/v8/benchmarks/
H A Draytrace.js162 distance : function(color) {
438 info.distance = (-B) - Math.sqrt(D);
443 info.distance
497 info.distance = t;
529 distance: null,
683 best.distance = 2000;
690 if(info.isHit && info.distance >= 0 && info.distance < best.distance){
749 if (refl.isHit && refl.distance >
[all...]

Completed in 1193 milliseconds

123456