blob: b68604dad83dfc84e0ea4936f65a45339f48db6a [file] [log] [blame]
Dileep Marchyaf9ba4852014-10-24 19:56:57 -07001/*
Ken Zhanga80bdd82015-01-07 10:55:46 -05002* Copyright (c) 2014 - 2015, The Linux Foundation. All rights reserved.
Dileep Marchyaf9ba4852014-10-24 19:56:57 -07003*
4* Redistribution and use in source and binary forms, with or without modification, are permitted
5* provided that the following conditions are met:
6* * Redistributions of source code must retain the above copyright notice, this list of
7* conditions and the following disclaimer.
8* * Redistributions in binary form must reproduce the above copyright notice, this list of
9* conditions and the following disclaimer in the documentation and/or other materials provided
10* with the distribution.
11* * Neither the name of The Linux Foundation nor the names of its contributors may be used to
12* endorse or promote products derived from this software without specific prior written
13* permission.
14*
15* THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
16* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
17* NON-INFRINGEMENT ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE
18* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
19* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
20* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
21* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
22* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
23*/
24
25#ifndef __CONSTANTS_H__
26#define __CONSTANTS_H__
27
Ramkumar Radhakrishnanbefbdbe2015-01-14 20:14:40 -080028#include <stdlib.h>
Dileep Marchyae2a59082015-05-21 13:29:05 -070029#include <inttypes.h>
30
31#ifndef PRIu64
32#define PRIu64 "llu"
33#endif
Ramkumar Radhakrishnanbefbdbe2015-01-14 20:14:40 -080034
Dileep Marchyaf9ba4852014-10-24 19:56:57 -070035#define INT(exp) static_cast<int>(exp)
36#define FLOAT(exp) static_cast<float>(exp)
Sushil Chauhan91caa992014-12-05 12:25:47 -080037#define UINT8(exp) static_cast<uint8_t>(exp)
Ken Zhangd9408eb2015-02-09 17:29:40 -050038#define UINT16(exp) static_cast<uint16_t>(exp)
Dileep Marchyaf9ba4852014-10-24 19:56:57 -070039#define UINT32(exp) static_cast<uint32_t>(exp)
40#define INT32(exp) static_cast<int32_t>(exp)
41
42#define STRUCT_VAR(struct_name, var_name) \
43 struct struct_name var_name; \
44 memset(&var_name, 0, sizeof(var_name));
45
46#define STRUCT_VAR_ARRAY(struct_name, var_name, num_var) \
47 struct struct_name var_name[num_var]; \
48 memset(&var_name[0], 0, sizeof(var_name));
49
50#define ROUND_UP(number, step) ((((number) + ((step) - 1)) / (step)) * (step))
51
Dileep Marchya1d1f3662014-12-05 18:42:15 -080052#define SET_BIT(value, bit) (value |= (1 << (bit)))
53#define CLEAR_BIT(value, bit) (value &= (~(1 << (bit))))
54#define IS_BIT_SET(value, bit) (value & (1 << (bit)))
Ramkumar Radhakrishnanbefbdbe2015-01-14 20:14:40 -080055
Sushil Chauhan91caa992014-12-05 12:25:47 -080056#define MAX(a, b) (((a) > (b)) ? (a) : (b))
Ramkumar Radhakrishnanbefbdbe2015-01-14 20:14:40 -080057#define MIN(a, b) (((a) < (b)) ? (a) : (b))
Ramkumar Radhakrishnanb36eee92014-11-03 19:39:11 -080058
Ken Zhange2605ea2015-02-02 10:17:45 -050059#define ROUND_UP_ALIGN_DOWN(value, a) FLOAT(FloorToMultipleOf(UINT32(value + 0.5f), UINT32(a)))
60#define ROUND_UP_ALIGN_UP(value, a) FLOAT(CeilToMultipleOf(UINT32(value + 0.5f), UINT32(a)))
61
Ramkumar Radhakrishnan8a4f1522015-03-04 18:35:02 -080062#define IDLE_TIMEOUT_DEFAULT_MS 70
63
Ken Zhang9b04f682015-03-25 16:34:50 -040064#define IS_RGB_FORMAT(format) (((format) < kFormatYCbCr420Planar) ? true: false)
65
Tatenda Chipeperekwa2ba97892015-02-10 12:18:34 -080066template <class T>
67inline void Swap(T &a, T &b) {
68 T c(a);
69 a = b;
70 b = c;
71}
72
73// factor value should be in powers of 2(eg: 1, 2, 4, 8)
74template <class T1, class T2>
75inline T1 FloorToMultipleOf(const T1 &value, const T2 &factor) {
76 return (T1)(value & (~(factor - 1)));
77}
78
79template <class T1, class T2>
80inline T1 CeilToMultipleOf(const T1 &value, const T2 &factor) {
81 return (T1)((value + (factor - 1)) & (~(factor - 1)));
82}
83
Dileep Marchya73d002e2015-05-08 18:58:33 -070084namespace sdm {
Dileep Marchyaf9ba4852014-10-24 19:56:57 -070085
Arun Kumar K.Redb8bc82014-11-03 19:28:21 -080086 const int kThreadPriorityUrgent = -9;
Ken Zhanga80bdd82015-01-07 10:55:46 -050087 const int kMaxRotatePerLayer = 2;
Arun Kumar K.Redb8bc82014-11-03 19:28:21 -080088
Dileep Marchyaf9ba4852014-10-24 19:56:57 -070089 typedef void * Handle;
90
Dileep Marchya73d002e2015-05-08 18:58:33 -070091} // namespace sdm
Dileep Marchyaf9ba4852014-10-24 19:56:57 -070092
93#endif // __CONSTANTS_H__
94