rjw | 6c1fd8f | 2022-11-30 14:33:01 +0800 | [diff] [blame] | 1 | /***************************************************************************** |
| 2 | * Copyright Statement: |
| 3 | * -------------------- |
| 4 | * This software is protected by Copyright and the information contained |
| 5 | * herein is confidential. The software may not be copied and the information |
| 6 | * contained herein may not be used or disclosed except with the written |
| 7 | * permission of MediaTek Inc. (C) 2012 |
| 8 | * |
| 9 | * BY OPENING THIS FILE, BUYER HEREBY UNEQUIVOCALLY ACKNOWLEDGES AND AGREES |
| 10 | * THAT THE SOFTWARE/FIRMWARE AND ITS DOCUMENTATIONS ("MEDIATEK SOFTWARE") |
| 11 | * RECEIVED FROM MEDIATEK AND/OR ITS REPRESENTATIVES ARE PROVIDED TO BUYER ON |
| 12 | * AN "AS-IS" BASIS ONLY. MEDIATEK EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES, |
| 13 | * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE IMPLIED WARRANTIES OF |
| 14 | * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT. |
| 15 | * NEITHER DOES MEDIATEK PROVIDE ANY WARRANTY WHATSOEVER WITH RESPECT TO THE |
| 16 | * SOFTWARE OF ANY THIRD PARTY WHICH MAY BE USED BY, INCORPORATED IN, OR |
| 17 | * SUPPLIED WITH THE MEDIATEK SOFTWARE, AND BUYER AGREES TO LOOK ONLY TO SUCH |
| 18 | * THIRD PARTY FOR ANY WARRANTY CLAIM RELATING THERETO. MEDIATEK SHALL ALSO |
| 19 | * NOT BE RESPONSIBLE FOR ANY MEDIATEK SOFTWARE RELEASES MADE TO BUYER'S |
| 20 | * SPECIFICATION OR TO CONFORM TO A PARTICULAR STANDARD OR OPEN FORUM. |
| 21 | * |
| 22 | * BUYER'S SOLE AND EXCLUSIVE REMEDY AND MEDIATEK'S ENTIRE AND CUMULATIVE |
| 23 | * LIABILITY WITH RESPECT TO THE MEDIATEK SOFTWARE RELEASED HEREUNDER WILL BE, |
| 24 | * AT MEDIATEK'S OPTION, TO REVISE OR REPLACE THE MEDIATEK SOFTWARE AT ISSUE, |
| 25 | * OR REFUND ANY SOFTWARE LICENSE FEES OR SERVICE CHARGE PAID BY BUYER TO |
| 26 | * MEDIATEK FOR SUCH MEDIATEK SOFTWARE AT ISSUE. |
| 27 | * |
| 28 | * THE TRANSACTION CONTEMPLATED HEREUNDER SHALL BE CONSTRUED IN ACCORDANCE |
| 29 | * WITH THE LAWS OF THE STATE OF CALIFORNIA, USA, EXCLUDING ITS CONFLICT OF |
| 30 | * LAWS PRINCIPLES. ANY DISPUTES, CONTROVERSIES OR CLAIMS ARISING THEREOF AND |
| 31 | * RELATED THERETO SHALL BE SETTLED BY ARBITRATION IN SAN FRANCISCO, CA, UNDER |
| 32 | * THE RULES OF THE INTERNATIONAL CHAMBER OF COMMERCE (ICC). |
| 33 | * |
| 34 | *****************************************************************************/ |
| 35 | |
| 36 | /**************************************************************************** |
| 37 | * Filename: |
| 38 | * --------- |
| 39 | * @file L1Trc_array.h |
| 40 | * |
| 41 | * Description: |
| 42 | * ------------ |
| 43 | * @brief Interface of L1 trace array. |
| 44 | * @note This header is included in L1Trc.h, please do not include this header alone! |
| 45 | * |
| 46 | * ========================================================================== |
| 47 | * $Log$ |
| 48 | * |
| 49 | ****************************************************************************/ |
| 50 | |
| 51 | #ifndef _DHL_L1TRC_ARRAY_H |
| 52 | #define _DHL_L1TRC_ARRAY_H |
| 53 | |
| 54 | /******************************************** |
| 55 | * L1/L2 Array Type support |
| 56 | ********************************************/ |
| 57 | |
| 58 | #if defined(__USE_ULSP__) |
| 59 | |
| 60 | // shrink the arg_count to max count to avoid whole L1 Trace frame decode fail |
| 61 | |
| 62 | #define TRC_OUTPUT_ARRAY_IMPL(func_name, begin_trace_id, array_ptr, align, count, max_count) \ |
| 63 | do { \ |
| 64 | func_name(begin_trace_id, array_ptr, align, count < max_count ? count : max_count); \ |
| 65 | } while(0) |
| 66 | |
| 67 | |
| 68 | #define TRC_OUTPUT_ARRAY_L1(begin_trace_id, array_ptr, align, count, max_count) TRC_OUTPUT_ARRAY_IMPL(trc_output_array_l1, begin_trace_id, array_ptr, align, count, max_count) |
| 69 | #define TRC_OUTPUT_ARRAY_L2(begin_trace_id, array_ptr, align, count, max_count) TRC_OUTPUT_ARRAY_IMPL(trc_output_array_l2, begin_trace_id, array_ptr, align, count, max_count) |
| 70 | |
| 71 | // NON_SMP |
| 72 | #define TRC_OUTPUT_ARRAY_L1_NON_SMP TRC_OUTPUT_ARRAY_L1 |
| 73 | #define TRC_OUTPUT_ARRAY_L2_NON_SMP TRC_OUTPUT_ARRAY_L2 |
| 74 | |
| 75 | extern void trc_output_array_l1(kal_uint16 begin_trace_id, void *array_ptr, kal_uint8 align, kal_uint8 count); |
| 76 | extern void trc_output_array_l2(kal_uint16 begin_trace_id, void *array_ptr, kal_uint8 align, kal_uint8 count); |
| 77 | |
| 78 | #else // !defined(__USE_ULSP__) |
| 79 | |
| 80 | #define TRC_OUTPUT_ARRAY_L1(BEGIN_TRC_ID, FILTER_ARRAY, FILTER_ARRAY_INDEX, FILTER_CLASS, ARRAY_PTR, ALIGN, COUNT, MAX_COUNT) \ |
| 81 | do { \ |
| 82 | if(FILTER_CHECK(FILTER_ARRAY, FILTER_ARRAY_INDEX, FILTER_CLASS)) { \ |
| 83 | kal_uint32 oldmask=0; \ |
| 84 | kal_uint8 vpe_id = 0; \ |
| 85 | EXT_ASSERT(0 < COUNT && COUNT <= MAX_COUNT, COUNT, MAX_COUNT, 0); /* suppose SW solution is for internal use only, the assert should be accepted */ \ |
| 86 | DHL_LOCK_CPU_INTERRUPT(oldmask); \ |
| 87 | vpe_id = kal_get_current_vpe_id(); \ |
| 88 | TRC_SEND_ARRAY_DATA_cb[vpe_id](BEGIN_TRC_ID, ARRAY_PTR, ALIGN, COUNT); \ |
| 89 | DHL_UNLOCK_CPU_INTERRUPT(oldmask); \ |
| 90 | } \ |
| 91 | } while(0) |
| 92 | |
| 93 | #define TRC_OUTPUT_ARRAY_L2(L2_BUFFER_SETTING, BEGIN_TRC_ID, FILTER_ARRAY, FILTER_ARRAY_INDEX, FILTER_CLASS, ARRAY_PTR, ALIGN, COUNT, MAX_COUNT) \ |
| 94 | do { \ |
| 95 | if(FILTER_CHECK(FILTER_ARRAY, FILTER_ARRAY_INDEX, FILTER_CLASS)) { \ |
| 96 | EXT_ASSERT(0 < COUNT && COUNT <= MAX_COUNT, COUNT, MAX_COUNT, 0); /* suppose SW solution is for internal use only, the assert should be accepted */ \ |
| 97 | l2trc_send_array_cb[L2_BUFFER_SETTING](BEGIN_TRC_ID, ARRAY_PTR, ALIGN, COUNT); \ |
| 98 | } \ |
| 99 | } while(0) |
| 100 | |
| 101 | |
| 102 | typedef void (*TRC_SEND_ARRAY_DATA_cb_t)(kal_uint16 begin_trace_id, void *array_ptr, kal_uint8 align, kal_uint8 count); |
| 103 | |
| 104 | extern TRC_SEND_ARRAY_DATA_cb_t TRC_SEND_ARRAY_DATA_cb[6]; |
| 105 | extern TRC_SEND_ARRAY_DATA_cb_t l2trc_send_array_cb[3]; |
| 106 | |
| 107 | #endif // defined(__USE_ULSP__) |
| 108 | |
| 109 | #endif // _DHL_L1TRC_ARRAY_H |