| /external/llvm/lib/Target/Hexagon/ |
| HexagonCommonGEP.cpp | 582 GepNode *Min = *std::min_element(S.begin(), S.end(), NodeOrder);
583 std::pair<ProjMap::iterator,bool> Ins = PM.insert(std::make_pair(&S, Min));
587 // Update the min element's flags, and user list.
589 UseSet &MinUs = Uses[Min];
594 // original values of Min.
600 Uses.erase(Min);
602 // The collected flags should include all the flags from the min element.
603 assert((Min->Flags & Flags) == Min->Flags);
604 Min->Flags = Flags
[all...] |
| /external/compiler-rt/lib/lsan/ |
| lsan_common.cc | 253 uptr intersection_end = Min(end, root_end);
362 stack.size = Min(stack.size, resolution);
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_win.cc | 640 size = CaptureStackBackTrace(2, Min(max_depth, kStackTraceMax),
673 size < Min(max_depth, kStackTraceMax)) {
|
| sanitizer_libc.cc | 262 return (s64)(Min((u64)INT64_MAX, res));
|
| /external/webrtc/webrtc/modules/video_coding/test/ |
| plotReceiveTrace.m | 75 [p, count] = sscanf(message, 'Render frame %lu at %lu. Render delay %lu, required delay %lu, max decode time %lu, min total delay %lu');
212 legend('Render delay', 'Jitter delay', 'Decode delay', 'Extra delay', 'Min total delay');
|
| /art/runtime/base/ |
| histogram-inl.h | 107 min_value_added_ = std::min(val, min_value_added_);
128 max_value_added_ = std::numeric_limits<Value>::min();
207 << PrettySize(Max()) << " Min: " << PrettySize(Min()) << "\n";
|
| /external/chromium-trace/catapult/third_party/pipeline/pipeline/ |
| common.py | 115 class Min(pipeline.Pipeline):
116 """Returns the min value."""
120 raise TypeError('min expected at least 1 argument, got 0')
124 return min(args)
|
| /external/compiler-rt/lib/asan/ |
| asan_thread.cc | 142 Min(stack_size_log, static_cast<uptr>(flags()->max_uar_stack_size_log));
|
| asan_allocator.cc | 295 return Min(Max(rz_log, RZSize2Log(min_rz)), RZSize2Log(max_rz));
447 uptr fill_size = Min(size, (uptr)fl.max_malloc_fill_size);
545 uptr memcpy_size = Min(new_size, m->UsedSize());
|
| asan_interceptors.cc | 518 uptr copy_length = Min(size, from_length + 1);
602 uptr from_size = Min(size, MaybeRealStrnlen(from, size) + 1);
617 ASAN_READ_RANGE(ctx, s, Min(length + 1, maxlen));
|
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_platform_linux.cc | 190 internal_mmap(p, Min<uptr>(marker.size(), shadow_end - p),
|
| /external/eigen/Eigen/src/Geometry/ |
| AlignedBox.h | 46 Min=0, Max=1,
105 inline const VectorType& (min)() const { return m_min; } function in class:Eigen::AlignedBox
107 inline VectorType& (min)() { return m_min; } function in class:Eigen::AlignedBox
190 { return (m_min.array()<=(b.min)().array()).all() && ((b.max)().array()<=m_max.array()).all(); }
195 { return (m_min.array()<=(b.max)().array()).all() && ((b.min)().array()<=m_max.array()).all(); }
294 m_min = (other.min)().template cast<Scalar>();
|
| /external/v8/src/crankshaft/ |
| unique.h | 239 Min(this->size_, that->size_), zone);
|
| lithium-allocator.cc | 18 static inline LifetimePosition Min(LifetimePosition a, LifetimePosition b) {
414 first_interval_->start_ = Min(start, first_interval_->start_);
[all...] |
| /external/v8/src/heap/ |
| slot-set.h | 327 return Min(kMaxBufferSize, capacity * 2);
|
| incremental-marking.cc | 204 Min(object_size, start_offset + kProgressBarScanningChunk);
211 end_offset = Min(object_size, end_offset + kProgressBarScanningChunk);
[all...] |
| /external/v8/src/ |
| layout-descriptor.cc | 173 *out_sequence_length = Min(sequence_length, max_sequence_length);
|
| /external/v8/src/regexp/ |
| regexp-ast.cc | 247 os_ << "(# " << that->min() << " ";
306 min_match_ = Min(min_match_, alternative->min_match());
|
| /external/v8/src/runtime/ |
| runtime-simd.cc | 30 return from >= static_cast<double>(std::numeric_limits<T>::min()) &&
106 const T min = std::numeric_limits<T>::min(); local
109 if (result < min) return min;
118 const T min = std::numeric_limits<T>::min(); local
121 if (result < min) return min;
126 inline float Min(float a, float b)
[all...] |
| /external/v8/test/cctest/ |
| test-constantpool.cc | 104 Min(dblReach / kDoubleSize, ptrReach / (kDoubleSize + kPointerSize));
|
| test-types.cc | 356 double min = (*i)->Number(); local
358 if (min > max) std::swap(min, max);
359 Type* type = T.Range(min, max);
367 double min = (*i)->Number(); local
369 if (min > max) std::swap(min, max);
370 Type* type = T.Range(min, max);
371 CHECK(min == type->AsRange()->Min());
901 double min = type2->AsRange()->Min(); local
[all...] |
| /external/clang/lib/Frontend/ |
| InitPreprocessor.cpp | 132 const char *DenormMin, *Epsilon, *Max, *Min;
148 Min = PickFP(Sem, "1.17549435e-38", "2.2250738585072014e-308",
177 Builder.defineMacro(DefPrefix + "MIN__", Twine(Min)+Ext);
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| ProgramState.cpp | 312 // This is the same as Idx + MIN < UpperBound + MIN, if overflow is allowed.
323 nonloc::ConcreteInt Min(BVF.getMinValue(indexTy));
327 Idx.castAs<NonLoc>(), Min, indexTy);
334 Min, indexTy);
|
| /external/opencv3/modules/ts/misc/ |
| table_formatter.py | 130 for j in range(i+1, min(len(row.cells), i + colspan)):
141 for j in range(r+1, min(len(self.rows), r + rowspan)):
419 for q in range(r+1, min(r+rowspan, len(rows))):
458 <script type="text/javascript" src="https://ajax.googleapis.com/ajax/libs/jquery/1.6.4/jquery.min.js"></script>
655 "min": ("Min", lambda test,test0,units: test.get("min", units)),
662 "min%": ("Min (relative)", lambda test,test0,units: getRelativeVal(test, test0, "min")),
[all...] |
| /external/v8/src/compiler/ |
| register-allocator.cc | [all...] |
