FreeCalypso > hg > fc-tourmaline
view src/nucleus/csc.c @ 273:5caa86ee2cfa
enable L1_NEW_AEC in l1_confg.h (bold change)
The AEC function implemented in DSP ROM 3606 on the Calypso silicon
we work with is the one that corresponds to L1_NEW_AEC; the same holds
for DSP 34 and even for DSP 33 with more recent patch versions.
However, TI shipped their TCS211 reference fw with L1_NEW_AEC set to 0,
thus driving AEC the old way if anyone tried to enable it, either via
AT%Nxxxx or via the audio mode facility. As a result, the fw would
try to control features which no longer exist in the DSP (long vs short
echo and the old echo suppression level bits), while providing no way
to tune the 8 new parameter words added to the DSP's NDB page.
The only sensible solution is to bite the bullet and enable L1_NEW_AEC
in L1 config, with fallout propagating into RiViera Audio Service
T_AUDIO_AEC_CFG structure and into /aud/*.cfg binary file format.
The latter fallout will be addressed in further code changes.
| author | Mychaela Falconia <falcon@freecalypso.org> |
|---|---|
| date | Thu, 29 Jul 2021 18:32:40 +0000 |
| parents | 4e78acac3d88 |
| children |
line wrap: on
line source
/*************************************************************************/ /* */ /* Copyright Mentor Graphics Corporation 2002 */ /* All Rights Reserved. */ /* */ /* THIS WORK CONTAINS TRADE SECRET AND PROPRIETARY INFORMATION WHICH IS */ /* THE PROPERTY OF MENTOR GRAPHICS CORPORATION OR ITS LICENSORS AND IS */ /* SUBJECT TO LICENSE TERMS. */ /* */ /*************************************************************************/ /*************************************************************************/ /* */ /* FILE NAME VERSION */ /* */ /* csc.c Nucleus PLUS 1.14 */ /* */ /* COMPONENT */ /* */ /* CS - Common Services */ /* */ /* DESCRIPTION */ /* */ /* This file contains linked list manipulation facilities used */ /* throughout the Nucleus PLUS system. These facilities operate */ /* on doubly-linked circular lists. */ /* */ /* DATA STRUCTURES */ /* */ /* None */ /* */ /* FUNCTIONS */ /* */ /* CSC_Place_On_List Place node at the end of a */ /* list */ /* CSC_Priority_Place_On_List Place node in priority order */ /* on a list */ /* CSC_Remove_From_List Remove a node from a list */ /* */ /* DEPENDENCIES */ /* */ /* nucleus.h Nucleus PLUS constants */ /* cs_defs.h Common service definitions */ /* */ /* HISTORY */ /* */ /* DATE REMARKS */ /* */ /* 03-01-1993 Created initial version 1.0 */ /* 04-19-1993 Verified version 1.0 */ /* 03-01-1994 Changed void to VOID, removed */ /* clearing link pointers during */ /* removal of a node from a list, */ /* resulting in version 1.1 */ /* */ /* 03-18-1994 Verified version 1.1 */ /* 04-17-1996 updated to version 1.2 */ /* 03-24-1998 Released version 1.3. */ /* 03-26-1999 Released 1.11m (new release */ /* numbering scheme) */ /* 04-17-2002 Released version 1.13m */ /* 11-07-2002 Released version 1.14 */ /*************************************************************************/ #define NU_SOURCE_FILE #include "cs_defs.h" /* Include CS definitions */ #include "cs_extr.h" /* Common service functions */ /*************************************************************************/ /* */ /* FUNCTION */ /* */ /* CSC_Place_On_List */ /* */ /* DESCRIPTION */ /* */ /* This function places the specified node at the end of specified */ /* linked list. */ /* */ /* CALLED BY */ /* */ /* various components */ /* */ /* CALLS */ /* */ /* None */ /* */ /* INPUTS */ /* */ /* head Pointer to head pointer */ /* node Pointer to node to add */ /* */ /* OUTPUTS */ /* */ /* modified list */ /* */ /* HISTORY */ /* */ /* NAME DATE REMARKS */ /* */ /* W. Lamie 03-01-1993 Created initial version 1.0 */ /* D. Lamie 04-19-1993 Verified version 1.0 */ /* */ /*************************************************************************/ #ifndef NU_INLINE VOID CSC_Place_On_List(CS_NODE **head, CS_NODE *new_node) { NU_SUPERV_USER_VARIABLES /* Switch to supervisor mode */ NU_SUPERVISOR_MODE(); /* Determine if the list in non-empty. */ if (*head) { /* The list is not empty. Add the new node to the end of the list. */ new_node -> cs_previous = (*head) -> cs_previous; (new_node -> cs_previous) -> cs_next = new_node; new_node -> cs_next = (*head); (new_node -> cs_next) -> cs_previous = new_node; } else { /* The list is empty, setup the head and the new node. */ (*head) = new_node; new_node -> cs_previous = new_node; new_node -> cs_next = new_node; } /* Return to user mode */ NU_USER_MODE(); } #endif /*************************************************************************/ /* */ /* FUNCTION */ /* */ /* CSC_Priority_Place_On_List */ /* */ /* DESCRIPTION */ /* */ /* This function places the specified node after all other nodes on */ /* the list of equal or greater priority. Note that lower */ /* numerical values indicate greater priority. */ /* */ /* CALLED BY */ /* */ /* various components */ /* */ /* CALLS */ /* */ /* None */ /* */ /* INPUTS */ /* */ /* head Pointer to head pointer */ /* node Pointer to node to add */ /* */ /* OUTPUTS */ /* */ /* modified list */ /* */ /* HISTORY */ /* */ /* NAME DATE REMARKS */ /* */ /* W. Lamie 03-01-1993 Created initial version 1.0 */ /* D. Lamie 04-19-1993 Verified version 1.0 */ /* */ /*************************************************************************/ VOID CSC_Priority_Place_On_List(CS_NODE **head, CS_NODE *new_node) { CS_NODE *search_ptr; /* List search pointer */ NU_SUPERV_USER_VARIABLES /* Switch to supervisor mode */ NU_SUPERVISOR_MODE(); /* Determine if the list in non-empty. */ if (*head) { /* Search the list to find the proper place for the new node. */ search_ptr = (*head); /* Check for insertion before the first node on the list. */ if (search_ptr -> cs_priority > new_node -> cs_priority) { /* Update the head pointer to point at the new node. */ (*head) = new_node; } else { /* We know that the new node is not the highest priority and must be placed somewhere after the head pointer. */ /* Move search pointer up to the next node since we are trying to find the proper node to insert in front of. */ search_ptr = search_ptr -> cs_next; while ((search_ptr -> cs_priority <= new_node -> cs_priority) && (search_ptr != (*head))) { /* Move along to the next node. */ search_ptr = search_ptr -> cs_next; } } /* Insert before search pointer. */ new_node -> cs_previous = search_ptr -> cs_previous; (new_node -> cs_previous) -> cs_next = new_node; new_node -> cs_next = search_ptr; (new_node -> cs_next) -> cs_previous = new_node; } else { /* The list is empty, setup the head and the new node. */ (*head) = new_node; new_node -> cs_previous = new_node; new_node -> cs_next = new_node; } /* Return to user mode */ NU_USER_MODE(); } /*************************************************************************/ /* */ /* FUNCTION */ /* */ /* CSC_Remove_From_List */ /* */ /* DESCRIPTION */ /* */ /* This function removes the specified node from the specified */ /* linked list. */ /* */ /* CALLED BY */ /* */ /* various components */ /* */ /* CALLS */ /* */ /* None */ /* */ /* INPUTS */ /* */ /* head Pointer to head pointer */ /* node Pointer to node to add */ /* */ /* OUTPUTS */ /* */ /* modified list */ /* */ /* HISTORY */ /* */ /* NAME DATE REMARKS */ /* */ /* W. Lamie 03-01-1993 Created initial version 1.0 */ /* D. Lamie 04-19-1993 Verified version 1.0 */ /* W. Lamie 03-01-1994 Removed clearing link pointers */ /* during removal of a node from */ /* list, resulting in version 1.1 */ /* R. Pfaff - */ /* D. Lamie 03-18-1994 Verified version 1.1 */ /* */ /*************************************************************************/ #ifndef NU_INLINE VOID CSC_Remove_From_List(CS_NODE **head, CS_NODE *node) { NU_SUPERV_USER_VARIABLES /* Switch to supervisor mode */ NU_SUPERVISOR_MODE(); /* Determine if this is the only node in the system. */ if (node -> cs_previous == node) { /* Yes, this is the only node in the system. Clear the node's pointers and the head pointer. */ (*head) = NU_NULL; } else { /* Unlink the node from a multiple node list. */ (node -> cs_previous) -> cs_next = node -> cs_next; (node -> cs_next) -> cs_previous = node -> cs_previous; /* Check to see if the node to delete is at the head of the list. */ if (node == *head) /* Move the head pointer to the node after. */ *head = node -> cs_next; } /* Return to user mode */ NU_USER_MODE(); } #endif