Dileep Marchya | f9ba485 | 2014-10-24 19:56:57 -0700 | [diff] [blame] | 1 | /* |
Ken Zhang | a80bdd8 | 2015-01-07 10:55:46 -0500 | [diff] [blame] | 2 | * Copyright (c) 2014 - 2015, The Linux Foundation. All rights reserved. |
Dileep Marchya | f9ba485 | 2014-10-24 19:56:57 -0700 | [diff] [blame] | 3 | * |
| 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 Radhakrishnan | befbdbe | 2015-01-14 20:14:40 -0800 | [diff] [blame] | 28 | #include <stdlib.h> |
| 29 | |
Dileep Marchya | f9ba485 | 2014-10-24 19:56:57 -0700 | [diff] [blame] | 30 | #define LIKELY(exp) __builtin_expect((exp) != 0, true) |
| 31 | #define UNLIKELY(exp) __builtin_expect((exp) != 0, false) |
| 32 | |
| 33 | #define INT(exp) static_cast<int>(exp) |
| 34 | #define FLOAT(exp) static_cast<float>(exp) |
Sushil Chauhan | 91caa99 | 2014-12-05 12:25:47 -0800 | [diff] [blame] | 35 | #define UINT8(exp) static_cast<uint8_t>(exp) |
Dileep Marchya | f9ba485 | 2014-10-24 19:56:57 -0700 | [diff] [blame] | 36 | #define UINT32(exp) static_cast<uint32_t>(exp) |
| 37 | #define INT32(exp) static_cast<int32_t>(exp) |
| 38 | |
| 39 | #define STRUCT_VAR(struct_name, var_name) \ |
| 40 | struct struct_name var_name; \ |
| 41 | memset(&var_name, 0, sizeof(var_name)); |
| 42 | |
| 43 | #define STRUCT_VAR_ARRAY(struct_name, var_name, num_var) \ |
| 44 | struct struct_name var_name[num_var]; \ |
| 45 | memset(&var_name[0], 0, sizeof(var_name)); |
| 46 | |
| 47 | #define ROUND_UP(number, step) ((((number) + ((step) - 1)) / (step)) * (step)) |
| 48 | |
Dileep Marchya | 1d1f366 | 2014-12-05 18:42:15 -0800 | [diff] [blame] | 49 | #define SET_BIT(value, bit) (value |= (1 << (bit))) |
| 50 | #define CLEAR_BIT(value, bit) (value &= (~(1 << (bit)))) |
| 51 | #define IS_BIT_SET(value, bit) (value & (1 << (bit))) |
Ramkumar Radhakrishnan | befbdbe | 2015-01-14 20:14:40 -0800 | [diff] [blame] | 52 | |
Sushil Chauhan | 91caa99 | 2014-12-05 12:25:47 -0800 | [diff] [blame] | 53 | #define MAX(a, b) (((a) > (b)) ? (a) : (b)) |
Ramkumar Radhakrishnan | befbdbe | 2015-01-14 20:14:40 -0800 | [diff] [blame] | 54 | #define MIN(a, b) (((a) < (b)) ? (a) : (b)) |
Ramkumar Radhakrishnan | b36eee9 | 2014-11-03 19:39:11 -0800 | [diff] [blame] | 55 | |
Tatenda Chipeperekwa | 2ba9789 | 2015-02-10 12:18:34 -0800 | [diff] [blame^] | 56 | template <class T> |
| 57 | inline void Swap(T &a, T &b) { |
| 58 | T c(a); |
| 59 | a = b; |
| 60 | b = c; |
| 61 | } |
| 62 | |
| 63 | // factor value should be in powers of 2(eg: 1, 2, 4, 8) |
| 64 | template <class T1, class T2> |
| 65 | inline T1 FloorToMultipleOf(const T1 &value, const T2 &factor) { |
| 66 | return (T1)(value & (~(factor - 1))); |
| 67 | } |
| 68 | |
| 69 | template <class T1, class T2> |
| 70 | inline T1 CeilToMultipleOf(const T1 &value, const T2 &factor) { |
| 71 | return (T1)((value + (factor - 1)) & (~(factor - 1))); |
| 72 | } |
| 73 | |
Dileep Marchya | f9ba485 | 2014-10-24 19:56:57 -0700 | [diff] [blame] | 74 | namespace sde { |
| 75 | |
Arun Kumar K.R | edb8bc8 | 2014-11-03 19:28:21 -0800 | [diff] [blame] | 76 | const int kThreadPriorityUrgent = -9; |
Ken Zhang | a80bdd8 | 2015-01-07 10:55:46 -0500 | [diff] [blame] | 77 | const int kMaxRotatePerLayer = 2; |
Arun Kumar K.R | edb8bc8 | 2014-11-03 19:28:21 -0800 | [diff] [blame] | 78 | |
Dileep Marchya | f9ba485 | 2014-10-24 19:56:57 -0700 | [diff] [blame] | 79 | typedef void * Handle; |
| 80 | |
| 81 | } // namespace sde |
| 82 | |
| 83 | #endif // __CONSTANTS_H__ |
| 84 | |