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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
|
/*****************************************************************************
* *
* PrimeSense PSCommon Library *
* Copyright (C) 2012 PrimeSense Ltd. *
* *
* This file is part of PSCommon. *
* *
* Licensed under the Apache License, Version 2.0 (the "License"); *
* you may not use this file except in compliance with the License. *
* You may obtain a copy of the License at *
* *
* http://www.apache.org/licenses/LICENSE-2.0 *
* *
* Unless required by applicable law or agreed to in writing, software *
* distributed under the License is distributed on an "AS IS" BASIS, *
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. *
* See the License for the specific language governing permissions and *
* limitations under the License. *
* *
*****************************************************************************/
//---------------------------------------------------------------------------
// Includes
//---------------------------------------------------------------------------
#include "XnFPSCalculator.h"
#include <XnOS.h>
//---------------------------------------------------------------------------
// Types
//---------------------------------------------------------------------------
struct XnFPSDataImpl
{
/** An array of the time of each frame. */
XnUInt64* anTimes;
/** The size of the array. */
XnUInt32 nArraySize;
/** Index of the next place to write to. */
XnUInt32 nCurrIndex;
};
typedef struct XnFPSDataImpl XnFPSDataImpl;
//---------------------------------------------------------------------------
// Code
//---------------------------------------------------------------------------
XnStatus xnFPSInit(XnFPSData* pFPS, XnUInt32 nSamplesCount)
{
XN_VALIDATE_OUTPUT_PTR(pFPS);
// Allocate struct
XN_VALIDATE_CALLOC(*pFPS, XnFPSDataImpl, 1);
XnFPSDataImpl* pData = *pFPS;
// Allocate array
XN_VALIDATE_ALIGNED_CALLOC(pData->anTimes, XnUInt64, nSamplesCount, XN_DEFAULT_MEM_ALIGN);
pData->nArraySize = nSamplesCount;
return XN_STATUS_OK;
}
XnStatus xnFPSMarkFrame(XnFPSData* pFPS, XnUInt64 nNow /* = 0 */)
{
XN_VALIDATE_INPUT_PTR(pFPS);
XnFPSDataImpl* pData = *pFPS;
if (nNow == 0)
xnOSGetHighResTimeStamp(&nNow);
// mark this time
pData->anTimes[pData->nCurrIndex] = nNow;
// increment array index
if (++pData->nCurrIndex == pData->nArraySize)
pData->nCurrIndex = 0;
return XN_STATUS_OK;
}
XnDouble xnFPSCalc(XnFPSData* pFPS, XnUInt32 nAverageOver /* = 3000 */, XnUInt64 nNow /* = 0 */)
{
XN_VALIDATE_INPUT_PTR(pFPS);
XnFPSDataImpl* pData = *pFPS;
if (nNow == 0)
xnOSGetHighResTimeStamp(&nNow);
XnUInt64 nSince = nNow - nAverageOver*1000;
// search for first index
XnUInt32 nFirst = pData->nCurrIndex;
XnUInt32 nLast = (pData->nCurrIndex + pData->nArraySize - 1) % pData->nArraySize;
// no valid samples
if (pData->anTimes[nLast] < nSince)
return 0.0;
// move first to the first sample BEFORE time 'since'.
while (nFirst != nLast && pData->anTimes[nFirst] < nSince)
nFirst = (nFirst + 1) % pData->nArraySize;
// calculate frames per second
XnUInt32 nFrames = ((nLast - nFirst + pData->nArraySize) % pData->nArraySize) + 1;
// if have no statistics...
if (nFrames <= 1)
return 0;
// number of frames received divided by amount of time passed
return (nFrames * 1e6 / (nNow - pData->anTimes[nFirst]));
}
XnStatus xnFPSFree(XnFPSData* pFPS)
{
XN_VALIDATE_INPUT_PTR(pFPS);
XnFPSDataImpl* pData = *pFPS;
if (pData != NULL)
{
if (pData->anTimes != NULL)
{
XN_ALIGNED_FREE_AND_NULL(pData->anTimes);
}
if (*pFPS != NULL)
{
XN_FREE_AND_NULL(*pFPS);
}
}
return XN_STATUS_OK;
}
|
