Home
last modified time | relevance | path

Searched refs:from_index (Results 1 – 11 of 11) sorted by relevance

/external/valgrind/perf/
Dfbench.c287 static double from_index; variable
625 rang_sin = (from_index / to_index) * in transit_surface()
635 object_distance = object_distance * (to_index / from_index); in transit_surface()
636 axis_slope_angle = axis_slope_angle * (from_index / to_index); in transit_surface()
650 rang_sin = (from_index / to_index) * in transit_surface()
663 rang = -asin((from_index / to_index) * in transit_surface()
666 cos(-rang)) / (from_index * in transit_surface()
681 from_index = 1.0;
692 from_index = to_index;
/external/valgrind/memcheck/tests/
Dvcpu_fbench.c291 static double from_index; variable
629 rang_sin = (from_index / to_index) * in transit_surface()
639 object_distance = object_distance * (to_index / from_index); in transit_surface()
640 axis_slope_angle = axis_slope_angle * (from_index / to_index); in transit_surface()
654 rang_sin = (from_index / to_index) * in transit_surface()
667 rang = -asin((from_index / to_index) * in transit_surface()
670 cos(-rang)) / (from_index * in transit_surface()
685 from_index = 1.0;
696 from_index = to_index;
/external/v8/src/profiler/
Dheap-snapshot-generator-inl.h15 return &snapshot()->entries()[from_index()]; in from()
Dheap-snapshot-generator.h57 int from_index() const { return FromIndexField::decode(bit_field_); } in from_index() function
/external/v8/src/debug/
Ddebug.js1817 var from_index = 0;
1823 from_index = request.arguments.fromFrame;
1829 var tmp_index = total_frames - from_index;
1830 from_index = total_frames - to_index;
1833 if (from_index < 0 || to_index < 0) {
1841 if (to_index <= from_index) {
1848 for (var i = from_index; i < to_index; i++) {
1852 fromFrame: from_index,
Dmirrors.js1112 var from_index = opt_from_index || 0;
1114 if (from_index > to_index) return new GlobalArray();
1115 var values = new GlobalArray(to_index - from_index + 1);
1116 for (var i = from_index; i <= to_index; i++) {
1124 values[i - from_index] = value;
/external/v8/src/js/
Darray.js384 var from_index = i + del_count - 1;
386 if (HAS_INDEX(array, from_index, is_array)) {
387 array[to_index] = array[from_index];
394 var from_index = i + del_count;
396 if (HAS_INDEX(array, from_index, is_array)) {
397 array[to_index] = array[from_index];
/external/v8/test/cctest/compiler/
Dtest-simplified-lowering.cc429 void RunCopyElement(int from_index, int to_index) { in RunCopyElement() argument
432 BoundsCheck(from_index); in RunCopyElement()
438 Node* load = t.LoadElement(access, ptr, t.Int32Constant(from_index)); in RunCopyElement()
450 void RunCopyField(int from_index, int to_index) { in RunCopyField() argument
451 BoundsCheck(from_index); in RunCopyField()
453 FieldAccess from_access = GetFieldAccess(from_index); in RunCopyField()
/external/v8/src/regexp/
Djsregexp.h411 void Merge(QuickCheckDetails* other, int from_index);
Djsregexp.cc2697 void QuickCheckDetails::Merge(QuickCheckDetails* other, int from_index) { in Merge() argument
2706 for (int i = from_index; i < characters_; i++) { in Merge()
/external/v8/src/
Dobjects.cc17142 uint32_t from_index = EntryToIndex(i); in Rehash() local
17143 Object* k = this->get(from_index); in Rehash()
17149 new_table->set(insertion_index + j, get(from_index + j), mode); in Rehash()