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 | * L1Trc_array.h |
| 40 | * |
| 41 | * Project: |
| 42 | * -------- |
| 43 | * UMOLYA |
| 44 | * |
| 45 | * Description: |
| 46 | * ------------ |
| 47 | * L1 trace array support interface |
| 48 | * NOTE: This header is included in L1Trc.h, please do not include this header alone!! |
| 49 | * |
| 50 | * Author: |
| 51 | * ------- |
| 52 | * ------- |
| 53 | * |
| 54 | * ========================================================================== |
| 55 | * $Log$ |
| 56 | * |
| 57 | * 06 22 2018 yancy.chien |
| 58 | * [MOLY00331449] [Gen97] DHL logging development |
| 59 | * Migration on UMOLYE. |
| 60 | * |
| 61 | * 03 19 2018 yancy.chien |
| 62 | * [MOLY00258174] [Gen95][DHL] logging development |
| 63 | * Remove ASSERT check in l1 array trace. |
| 64 | * |
| 65 | * |
| 66 | ****************************************************************************/ |
| 67 | |
| 68 | #ifndef _DHL_L1TRC_ARRAY_H |
| 69 | #define _DHL_L1TRC_ARRAY_H |
| 70 | /* Array Trace Examples, Macro & Function version are the same |
| 71 | |
| 72 | 1. normal |
| 73 | #define DHL_ARRAY_TEST_L1(array_ptr, count) do {\ |
| 74 | {\ |
| 75 | TRC_START_FILTER_CHECK_L1(DHL_L1_Trace_Filter, 1, 0x01);\ |
| 76 | TRC_START_FILL_L1();\ |
| 77 | TRC_OUTPUT_ARRAY_L1(0x2F00, array_ptr, 4, count, 31);\ |
| 78 | TRC_END_FILL_L1();\ |
| 79 | TRC_END_FILTER_CHECK_L1(DHL_L1_Trace_Filter, 1, 0x01);\ |
| 80 | }\ |
| 81 | } while(0) |
| 82 | |
| 83 | 2. force_l2 |
| 84 | #define DHL_ARRAY_TEST_L2(array_ptr, count) do {\ |
| 85 | {\ |
| 86 | TRC_START_FILTER_CHECK_L1_FORCE_L2(DHL_L1_Trace_Filter, 1, 0x01);\ |
| 87 | TRC_START_FILL_L1_FORCE_L2();\ |
| 88 | TRC_OUTPUT_ARRAY_L1_FORCE_L2(0x4E00, array_ptr, 4, count, 31);\ |
| 89 | TRC_END_FILL_L1_FORCE_L2();\ |
| 90 | TRC_END_FILTER_CHECK_L1_FORCE_L2(DHL_L1_Trace_Filter, 1, 0x01);\ |
| 91 | }\ |
| 92 | } while(0) |
| 93 | |
| 94 | */ |
| 95 | |
| 96 | /******************************************** |
| 97 | * L1/L2 Array Type support |
| 98 | ********************************************/ |
| 99 | |
| 100 | #if defined(__USE_ULSP__) || defined(__USE_ULSP_SW_SIMULATOR__) |
| 101 | |
| 102 | // shrink the arg_count to max count to avoid whole L1 Trace frame decode fail |
| 103 | |
| 104 | #define TRC_OUTPUT_ARRAY_IMPL(func_name, begin_trace_id, array_ptr, align, count, max_count) \ |
| 105 | do { \ |
| 106 | func_name(begin_trace_id, array_ptr, align, count < max_count ? count : max_count); \ |
| 107 | } while(0) |
| 108 | |
| 109 | |
| 110 | #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) |
| 111 | #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) |
| 112 | |
| 113 | #define TRC_OUTPUT_ARRAY_L1_FORCE_L2 TRC_OUTPUT_ARRAY_L2 |
| 114 | |
| 115 | // NON_SMP |
| 116 | #define TRC_OUTPUT_ARRAY_L1_NON_SMP TRC_OUTPUT_ARRAY_L1 |
| 117 | #define TRC_OUTPUT_ARRAY_L2_NON_SMP TRC_OUTPUT_ARRAY_L2 |
| 118 | |
| 119 | extern void trc_output_array_l1(kal_uint16 begin_trace_id, void* array_ptr, kal_uint8 align, kal_uint8 count); |
| 120 | extern void trc_output_array_l2(kal_uint16 begin_trace_id, void* array_ptr, kal_uint8 align, kal_uint8 count); |
| 121 | |
| 122 | #else // legacy SW logging |
| 123 | |
| 124 | #define TRC_OUTPUT_ARRAY_L1(BEGIN_TRC_ID, FILTER_ARRAY, FILTER_ARRAY_INDEX, FILTER_CLASS, ARRAY_PTR, ALIGN, COUNT, MAX_COUNT) \ |
| 125 | do { \ |
| 126 | if(FILTER_CHECK(FILTER_ARRAY, FILTER_ARRAY_INDEX, FILTER_CLASS)) { \ |
| 127 | kal_uint32 oldmask=0; \ |
| 128 | kal_uint8 vpe_id = 0; \ |
| 129 | EXT_ASSERT(0 < COUNT && COUNT <= MAX_COUNT, COUNT, MAX_COUNT, 0); /* suppose SW solution is for internal use only, the assert should be accepted */ \ |
| 130 | DHL_LOCK_CPU_INTERRUPT(oldmask); \ |
| 131 | vpe_id = kal_get_current_vpe_id(); \ |
| 132 | TRC_SEND_ARRAY_DATA_cb[vpe_id](BEGIN_TRC_ID, ARRAY_PTR, ALIGN, COUNT); \ |
| 133 | DHL_UNLOCK_CPU_INTERRUPT(oldmask); \ |
| 134 | } \ |
| 135 | } while(0) |
| 136 | |
| 137 | #define TRC_OUTPUT_ARRAY_L2(L2_BUFFER_SETTING, BEGIN_TRC_ID, FILTER_ARRAY, FILTER_ARRAY_INDEX, FILTER_CLASS, ARRAY_PTR, ALIGN, COUNT, MAX_COUNT) \ |
| 138 | do { \ |
| 139 | if(FILTER_CHECK(FILTER_ARRAY, FILTER_ARRAY_INDEX, FILTER_CLASS)) { \ |
| 140 | EXT_ASSERT(0 < COUNT && COUNT <= MAX_COUNT, COUNT, MAX_COUNT, 0); /* suppose SW solution is for internal use only, the assert should be accepted */ \ |
| 141 | l2trc_send_array_cb[L2_BUFFER_SETTING](BEGIN_TRC_ID, ARRAY_PTR, ALIGN, COUNT); \ |
| 142 | } \ |
| 143 | } while(0) |
| 144 | |
| 145 | |
| 146 | typedef void (*TRC_SEND_ARRAY_DATA_cb_t)(kal_uint16 begin_trace_id, void* array_ptr, kal_uint8 align, kal_uint8 count); |
| 147 | |
| 148 | extern TRC_SEND_ARRAY_DATA_cb_t TRC_SEND_ARRAY_DATA_cb[6]; |
| 149 | extern TRC_SEND_ARRAY_DATA_cb_t l2trc_send_array_cb[3]; |
| 150 | |
| 151 | #endif // defined(__USE_ULSP__) || defined(__USE_ULSP_SW_SIMULATOR__) |
| 152 | |
| 153 | #endif // _DHL_L1TRC_ARRAY_H |