blob: ffa8d12b37d6d453ffca7267cad08545701c1c02 [file] [log] [blame]
Dileep Marchyaf9ba4852014-10-24 19:56:57 -07001/*
Varun Arora7c8ee542018-05-01 20:58:16 -07002* Copyright (c) 2014 - 2018, 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
Varun Arora7c8ee542018-05-01 20:58:16 -070035#ifndef PRIu32
36#define PRIu32 "lu"
37#endif
38
Dileep Marchyaf9ba4852014-10-24 19:56:57 -070039#define INT(exp) static_cast<int>(exp)
40#define FLOAT(exp) static_cast<float>(exp)
Sushil Chauhan91caa992014-12-05 12:25:47 -080041#define UINT8(exp) static_cast<uint8_t>(exp)
Ken Zhangd9408eb2015-02-09 17:29:40 -050042#define UINT16(exp) static_cast<uint16_t>(exp)
Dileep Marchyaf9ba4852014-10-24 19:56:57 -070043#define UINT32(exp) static_cast<uint32_t>(exp)
44#define INT32(exp) static_cast<int32_t>(exp)
Naseer Ahmedb3b0a332015-06-05 19:14:32 -040045#define UINT64(exp) static_cast<uint64_t>(exp)
Dileep Marchyaf9ba4852014-10-24 19:56:57 -070046
Dileep Marchyaf9ba4852014-10-24 19:56:57 -070047#define ROUND_UP(number, step) ((((number) + ((step) - 1)) / (step)) * (step))
48
Lei Zhou1866f982015-05-14 13:50:36 -040049#define BITMAP(bit) (1 << (bit))
50
Ken Zhange2605ea2015-02-02 10:17:45 -050051#define ROUND_UP_ALIGN_DOWN(value, a) FLOAT(FloorToMultipleOf(UINT32(value + 0.5f), UINT32(a)))
52#define ROUND_UP_ALIGN_UP(value, a) FLOAT(CeilToMultipleOf(UINT32(value + 0.5f), UINT32(a)))
53
Ramkumar Radhakrishnan8a4f1522015-03-04 18:35:02 -080054#define IDLE_TIMEOUT_DEFAULT_MS 70
Dileep Marchyab06308d2017-02-13 09:45:01 +053055#define IDLE_TIMEOUT_ACTIVE_MS IDLE_TIMEOUT_DEFAULT_MS
56#define IDLE_TIMEOUT_INACTIVE_MS 520
Ramkumar Radhakrishnan8a4f1522015-03-04 18:35:02 -080057
Ken Zhang9b04f682015-03-25 16:34:50 -040058#define IS_RGB_FORMAT(format) (((format) < kFormatYCbCr420Planar) ? true: false)
59
Ramkumar Radhakrishnaneb97bc92016-01-21 14:29:36 -080060#define BITS_PER_BYTE 8
61#define BITS_TO_BYTES(x) (((x) + (BITS_PER_BYTE - 1)) / (BITS_PER_BYTE))
62
Tatenda Chipeperekwa2ba97892015-02-10 12:18:34 -080063// factor value should be in powers of 2(eg: 1, 2, 4, 8)
64template <class T1, class T2>
65inline T1 FloorToMultipleOf(const T1 &value, const T2 &factor) {
66 return (T1)(value & (~(factor - 1)));
67}
68
69template <class T1, class T2>
70inline T1 CeilToMultipleOf(const T1 &value, const T2 &factor) {
71 return (T1)((value + (factor - 1)) & (~(factor - 1)));
72}
73
Dileep Marchya73d002e2015-05-08 18:58:33 -070074namespace sdm {
Dileep Marchyaf9ba4852014-10-24 19:56:57 -070075
Arun Kumar K.Redb8bc82014-11-03 19:28:21 -080076 const int kThreadPriorityUrgent = -9;
Ken Zhanga80bdd82015-01-07 10:55:46 -050077 const int kMaxRotatePerLayer = 2;
Arun Kumar K.R3d92caf2014-12-23 18:22:05 -080078 const uint32_t kMaxBlitTargetLayers = 2;
Dileep Marchyad7133ee2015-07-06 18:06:59 -070079 const int kPageSize = 4096;
Arun Kumar K.Rbf2b25c2016-11-09 01:32:25 -080080 const uint32_t kGridSize = 129; // size used for non-linear transformation before Tone-mapping
81 const uint32_t kLutDim = 17; // Dim of the 3d LUT for tone-mapping.
Arun Kumar K.Redb8bc82014-11-03 19:28:21 -080082
Dileep Marchyaf9ba4852014-10-24 19:56:57 -070083 typedef void * Handle;
84
Dileep Marchya73d002e2015-05-08 18:58:33 -070085} // namespace sdm
Dileep Marchyaf9ba4852014-10-24 19:56:57 -070086
87#endif // __CONSTANTS_H__
88