Searched refs:samples (Results 1 - 25 of 685) sorted by path

1234567891011>>

/external/aac/libPCMutils/include/
H A Dlimiter.h166 * gain_delay: delay [samples] with which the gains in pGain shall be applied *
168 * samples: input/output buffer containing interleaved samples *
170 * nSamples: number of samples per channel *
174 INT_PCM* samples,
184 * returns: exact delay caused by the limiter in samples *
/external/aac/libPCMutils/src/
H A Dlimiter.cpp127 /* calc attack and release time in samples */
217 INT_PCM* samples,
281 tmp2 = (FIXP_PCM)samples[i * channels + j];
352 delayBuf[delayBufIdx * channels + j] = fMult((FIXP_PCM)samples[i * channels + j], additionalGain);
358 samples[i * channels + j] = FX_DBL2FX_PCM((FIXP_DBL)SATURATE_LEFT_SHIFT(tmp,TDL_GAIN_SCALING,DFRACT_BITS));
385 /* get delay in samples */
416 /* update attack and release time in samples */
452 /* calculate attack time in samples */
476 /* calculate release time in samples */
216 applyLimiter(TDLimiterPtr limiter, INT_PCM* samples, FIXP_DBL* pGain, const INT* gain_scale, const UINT gain_size, const UINT gain_delay, const UINT nSamples) argument
/external/aac/libSBRenc/include/
H A Dsbr_encoder.h185 INT sbrFrameSize; /*!< SBR frame size in samples. Will be calculated from core coder settings. */
363 * \param samples Time samples, always interleaved.
364 * \param timeInStride Channel stride factor of samples buffer.
370 INT_PCM *samples,
/external/aac/libSBRenc/src/
H A Dps_main.cpp465 INT_PCM *samples[2],
489 samples[psCh]+i*(hQmfAnalysis[psCh]->no_channels*timeInStride),
463 FDKsbrEnc_PSEnc_ParametricStereoProcessing( HANDLE_PARAMETRIC_STEREO hParametricStereo, INT_PCM *samples[2], UINT timeInStride, QMF_FILTER_BANK **hQmfAnalysis, FIXP_QMF **RESTRICT downmixedRealQmfData, FIXP_QMF **RESTRICT downmixedImagQmfData, INT_PCM *downsampledOutSignal, HANDLE_QMF_FILTER_BANK sbrSynthQmf, SCHAR *qmfScale, const int sendHeader ) argument
H A Dps_main.h226 * \param samples Pointer to 2 channel audio input signal.
242 INT_PCM *samples[2],
H A Dsbr_encoder.cpp850 INT_PCM *samples, /*!< time samples, always interleaved */
1006 samples + hSbrElement->elInfo.ChannelIndex[ch],
1033 o left and right time domain samples
1043 INT_PCM* pSamples[2] = {samples + hSbrElement->elInfo.ChannelIndex[0],samples + hSbrElement->elInfo.ChannelIndex[1]};
1050 samples + hSbrElement->elInfo.ChannelIndex[ch],
1132 samples + hSbrElement->elInfo.ChannelIndex[ch] + hEnvEncoder->bufferOffset,
1135 samples + hSbrElement->elInfo.ChannelIndex[ch],
1965 /* Do bitstream frame-wise delay balancing if we have more than SBR framelength samples dela
848 FDKsbrEnc_EnvEncodeFrame(HANDLE_SBR_ENCODER hEnvEncoder, int iElement, INT_PCM *samples, UINT timeInStride, UINT *sbrDataBits, UCHAR *sbrData, int clearOutput ) argument
2211 sbrEncoder_EncodeFrame( HANDLE_SBR_ENCODER hSbrEncoder, INT_PCM *samples, UINT timeInStride, UINT sbrDataBits[(8)], UCHAR sbrData[(8)][MAX_PAYLOAD_SIZE] ) argument
[all...]
/external/ceres-solver/internal/ceres/
H A Dline_search.cc149 // of the provided samples with valid values.
185 vector<FunctionSample> samples; local
186 samples.push_back(lowerbound);
191 samples.push_back(ValueSample(current.x, current.value));
196 samples.push_back(ValueSample(previous.x, previous.value));
200 samples.push_back(current);
205 samples.push_back(previous);
214 MinimizeInterpolatingPolynomial(samples, min_step_size, max_step_size,
H A Dpolynomial.cc332 Vector FindInterpolatingPolynomial(const vector<FunctionSample>& samples) { argument
333 const int num_samples = samples.size();
336 if (samples[i].value_is_valid) {
339 if (samples[i].gradient_is_valid) {
351 const FunctionSample& sample = samples[i];
372 void MinimizeInterpolatingPolynomial(const vector<FunctionSample>& samples, argument
377 const Vector polynomial = FindInterpolatingPolynomial(samples);
379 for (int i = 0; i < samples.size(); ++i) {
380 const FunctionSample& sample = samples[i];
H A Dpolynomial.h107 // Given a set of function value and/or gradient samples, find a
109 // in samples.
118 Vector FindInterpolatingPolynomial(const vector<FunctionSample>& samples);
120 // Interpolate the function described by samples with a polynomial,
122 // input samples, it is possible that the interpolation or the root
125 // considering the samples and the end points as possible solutions.
126 void MinimizeInterpolatingPolynomial(const vector<FunctionSample>& samples,
H A Dpolynomial_test.cc314 vector<FunctionSample> samples; local
319 samples.push_back(sample);
321 const Vector polynomial = FindInterpolatingPolynomial(samples);
330 vector<FunctionSample> samples; local
337 samples.push_back(sample);
339 const Vector polynomial = FindInterpolatingPolynomial(samples);
348 vector<FunctionSample> samples; local
356 samples.push_back(sample);
364 samples.push_back(sample);
367 Vector polynomial = FindInterpolatingPolynomial(samples);
376 vector<FunctionSample> samples; local
407 vector<FunctionSample> samples; local
450 vector<FunctionSample> samples; local
487 vector<FunctionSample> samples; local
[all...]
/external/chromium-trace/
H A Dscript.js29 b.prototype={__proto__:Object.prototype,toJSON:function(){for(var a={},c=Object.keys(this),e=0;e<c.length;e++){var f=c[e];"function"!=typeof this[f]&&(a[f]="parent"==f?this[f].guid:this[f])}return a},get length(){return this.timestamps_.length},get name(){return this.name_},get color(){return this.color_},get samples(){return this.samples_},get timestamps(){return this.timestamps_},getSample:function(a){return this.samples_[a]},getTimestamp:function(a){return this.timestamps_[a]},addSample:function(a,
145 },set seriesColors(b){throw Error("Bad counter API. No cookie.");},set samples(b){throw Error("Bad counter API. No cookie.");},addSeries:function(b){this.series_.push(b)},getSeries:function(b){return this.series_[b]},get series(){return this.series_},get numSeries(){return this.series_.length},get numSamples(){return 0===this.series_.length?0:this.series_[0].length},get timestamps(){return 0===this.series_.length?[]:this.series_[0].timestamps},getSampleStatistics:function(b){b.sort();var a=[];this.series_.forEach(function(c){a.push(c.getStatistics(b))});
190 c,d,b,e?e:{});this.samples_.push(a);return a},get samples(){return this.samples_},name:void 0,shiftTimestampsForward:function(a){this.sliceGroup.shiftTimestampsForward(a);if(this.cpuSlices)for(var c=0;c<this.cpuSlices.length;c++)this.cpuSlices[c].start+=a;if(this.samples_.length)for(c=0;c<this.samples_.length;c++)this.samples_[c].start+=a;this.kernelSliceGroup.shiftTimestampsForward(a);this.asyncSliceGroup.shiftTimestampsForward(a)},get isEmpty(){return this.sliceGroup.length||this.sliceGroup.openSliceCount||
455 ": ";this.tooltip=this.thread_.userFriendlyDetails;if(this.thread_.asyncSliceGroup.length){var b=new tracing.tracks.AsyncSliceGroupTrack(this.viewport);b.categoryFilter=this.categoryFilter;b.decorateHit=function(a){};b.group=this.thread_.asyncSliceGroup;b.hasVisibleContent&&this.appendChild(b)}this.thread_.samples.length&&(b=new tracing.tracks.SliceTrack(this.viewport),b.categoryFilter=b,b.group=this.thread_,b.slices=this.thread_.samples,b.decorateHit=function(a){a.thread=this.thread_},this.appendChild(b));
/external/chromium-trace/trace-viewer/src/tracing/analysis/
H A Danalyze_counters.js50 var samples = [];
52 samples.push(ctr.getSeries(i).getSample(sampleIndices[k]).value);
57 samples,
58 samples.length,
/external/chromium-trace/trace-viewer/src/tracing/importer/linux_perf/
H A Dbus_parser_test.js58 assertEquals(2, counters[0].series[0].samples.length);
H A Dclock_parser_test.js50 assertEquals(10, counters[0].series[0].samples.length);
H A Dexynos_parser_test.js44 assertEquals(3, c0.counters['INT Frequency'].series[0].samples.length);
45 assertEquals(1, c0.counters['MIF Frequency'].series[0].samples.length);
H A Dmali_parser_test.js214 assertEquals(2, c0.series[0].samples.length);
232 assertEquals(2, c0.series[0].samples.length);
250 assertEquals(2, c0.series[0].samples.length);
471 assertEquals(1, counter.series[0].samples.length);
H A Dpower_parser_test.js25 assertEquals(1, c0.counters['Clock Frequency'].series[0].samples.length);
29 assertEquals(2, c1.counters['Clock Frequency'].series[0].samples.length);
48 assertEquals(2, c0.counters['Clock Frequency'].series[0].samples.length);
52 assertEquals(2, c1.counters['Clock Frequency'].series[0].samples.length);
75 assertEquals(2, c0.counters['C-State'].series[0].samples.length);
79 assertEquals(4, c1.counters['C-State'].series[0].samples.length);
/external/chromium-trace/trace-viewer/src/tracing/importer/
H A Dtrace_event_importer_test.js505 var samples = [];
506 ctr.series[0].samples.forEach(function(sample) {
507 samples.push(sample.value);
509 assertArrayEquals([0, 10, 0], samples);
539 var samples = [];
540 ctr.series[0].samples.forEach(function(sample) {
541 samples.push(sample.value);
543 assertArrayEquals([0, 10], samples);
552 samples = [];
553 ctr.series[0].samples
[all...]
H A Dv8_log_importer_test.js21 assertEquals(1, t.samples.length);
22 assertEquals('/usr/lib/libc++.1.dylib', t.samples[0].title);
34 assertEquals(1, t.samples.length);
35 assertEquals('StringAddStub', t.samples[0].title);
47 assertEquals(1, t.samples.length);
48 assertEquals('UnknownCode', t.samples[0].title);
/external/chromium-trace/trace-viewer/src/tracing/trace_model/
H A Dcounter.js17 * Stores all the samples for a given counter.
70 set samples(arg) {
134 * Updates the bounds for this counter based on the samples it contains.
153 // Sum the samples at each timestamp.
H A Dcounter_series.js89 get samples() {
H A Dthread.js106 * Adds a new sample in the thread's samples.
133 * Returns the array of samples added to this thread. If no samples
136 * @return {Array<Sample>} array of samples.
138 get samples() {
/external/chromium-trace/trace-viewer/src/tracing/tracks/
H A Dcounter_track_test.js15 var runTest = function(timestamps, samples, testFn) {
20 var n = samples.length;
27 for (var i = 0; i < samples.length; ++i) {
29 ctr.series[i].addSample(timestamps[k], samples[i][k]);
66 var samples = [[0, 3, 1, 2, 3, 1, 3, 3.1],
68 for (var i = 0; i < samples.length; ++i) {
70 ctr.series[i].addSample(timestamps[k], samples[i][k]);
95 var samples = [[0, 3, 1, 2, 3, 1, 3, 3.1],
98 runTest.call(this, timestamps, samples, function(ctr, container, track) {
H A Dthread_track.js65 if (this.thread_.samples.length) {
69 samplesTrack.slices = this.thread_.samples;
/external/chromium_org/base/metrics/
H A Dhistogram.cc177 int Histogram::FindCorruption(const HistogramSamples& samples) const {
190 int64 delta64 = samples.redundant_count() - samples.TotalCount();
273 void Histogram::AddSamples(const HistogramSamples& samples) { argument
274 samples_->Add(samples);
369 scoped_ptr<SampleVector> samples(new SampleVector(bucket_ranges()));
370 samples->Add(*samples_);
371 return samples.Pass();
441 double Histogram::GetPeakBucketSize(const SampleVector& samples) const {
444 double current_size = GetBucketSize(samples
451 WriteAsciiHeader(const SampleVector& samples, Count sample_count, string* output) const argument
[all...]

Completed in 3777 milliseconds

1234567891011>>