File: gvUtil.c

package info (click to toggle)
openmohaa 0.82.1%2Bdfsg-1
  • links: PTS, VCS
  • area: contrib
  • in suites: forky, sid
  • size: 34,192 kB
  • sloc: cpp: 315,720; ansic: 275,789; sh: 312; xml: 246; asm: 141; makefile: 7
file content (78 lines) | stat: -rw-r--r-- 1,363 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#include "gvUtil.h"
#include <math.h>
#include <limits.h>

GVScalar gviGetSamplesVolume(const GVSample * samplesPtr, int numSamples)
{
	GVSample value;
	GVSample max = 0;
	int i;

	for(i = 0 ; i < numSamples ; i++)
	{
		value = samplesPtr[i];
		if(value < 0)
			value = (GVSample)(-value);
		if(value > max)
			max = value;
	}

	return ((GVScalar)max / -SHRT_MIN);
}

GVBool gviIsOverThreshold(const GVSample * samplesPtr, int numSamples, GVScalar threshold)
{
	int i;

	if(threshold == (GVScalar)0.0)
		return GVTrue;

	for(i = 0 ; i < numSamples ; i++)
	{
		if(labs(samplesPtr[i]) > (threshold * SHRT_MAX))
			return GVTrue;
	}

	return GVFalse;
}

int gviRoundUpToNearestMultiple(int value, int base)
{
	int remainder;

	remainder = (value % base);
	if(remainder)
		value += (base - remainder);

	return value;
}

int gviRoundDownToNearestMultiple(int value, int base)
{
	value -= (value % base);

	return value;
}

int gviRoundToNearestMultiple(int value, int base)
{
	int remainder;

	remainder = (value % base);
	if(remainder < (base / 2))
		value -= remainder;
	else
		value += (base - remainder);

	return value;
}

int gviMultiplyByBytesPerMillisecond(int value)
{
	return (int)(value * GVISampleRate * GV_BYTES_PER_SAMPLE / 1000);
}

int gviDivideByBytesPerMillisecond(int value)
{
	return (int)(value * 1000 / (GVISampleRate * GV_BYTES_PER_SAMPLE));
}