FreeCalypso > hg > fc-tourmaline
view src/nucleus/csc.c @ 265:e57bfdadf49a
mmiIcons.c: fix bogus icnType in incoming_call_animate[]
The incoming call animation icons are actually drawn in 256-color format,
but they were incorrectly declared as BMP_FORMAT_32BIT_COLOUR in the
incoming_call_animate[] array. Why were they still getting displayed
correctly despite this bogosity? Answer: because the
mmi_dialogs_animation_new_CB() function overrides the icon bitmap
type to 0x02, which means 256-color format. Needless to say, the
icon format should be made correct at the source of the data, and
at some later point we may need to remove the override from the
animation display function.
| author | Mychaela Falconia <falcon@freecalypso.org> |
|---|---|
| date | Mon, 17 May 2021 07:18:36 +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