📄 quf.c
字号:
/*************************************************************************/
/* */
/* Copyright (c) 1993-1996 Accelerated Technology, Inc. */
/* */
/* PROPRIETARY RIGHTS of Accelerated Technology are involved in the */
/* subject matter of this material. All manufacturing, reproduction, */
/* use, and sales rights pertaining to this subject matter are governed */
/* by the license agreement. The recipient of this software implicitly */
/* accepts the terms of the license. */
/* */
/*************************************************************************/
/*************************************************************************/
/* */
/* FILE NAME VERSION */
/* */
/* quf.c PLUS 1.2a */
/* */
/* COMPONENT */
/* */
/* QU - Queue Management */
/* */
/* DESCRIPTION */
/* */
/* This file contains routines to obtain facts about the Queue */
/* management component. */
/* */
/* AUTHOR */
/* */
/* William E. Lamie, Accelerated Technology, Inc. */
/* */
/* DATA STRUCTURES */
/* */
/* None */
/* */
/* FUNCTIONS */
/* */
/* QUF_Established_Queues Number of created queues */
/* QUF_Queue_Information Retrieve queue information */
/* QUF_Queue_Pointers Build queue pointer list */
/* */
/* DEPENDENCIES */
/* */
/* cs_extr.h Common Service functions */
/* tc_extr.h Thread Control functions */
/* qu_extr.h Queue functions */
/* hi_extr.h History functions */
/* */
/* HISTORY */
/* */
/* NAME DATE REMARKS */
/* */
/* W. Lamie 03-01-1994 Initial version of queue fact */
/* service file, version 1.1 */
/* R. Pfaff - */
/* D. Lamie 03-18-1994 Verified version 1.1 */
/* M.Q. Qian 04-17-1996 updated to version 1.2 */
/* M. Trippi 11-18-1996 Protected Informational service */
/* from NULL Control Block pointers */
/* creating 1.2a. (SPR220) */
/* */
/*************************************************************************/
#define NU_SOURCE_FILE
#include "cs_extr.h" /* Common service functions */
#include "tc_extr.h" /* Thread control functions */
#include "qu_extr.h" /* Queue functions */
#include "hi_extr.h" /* History functions */
/* Define external inner-component global data references. */
extern CS_NODE *QUD_Created_Queues_List;
extern UNSIGNED QUD_Total_Queues;
extern TC_PROTECT QUD_List_Protect;
/*************************************************************************/
/* */
/* FUNCTION */
/* */
/* QUF_Established_Queues */
/* */
/* DESCRIPTION */
/* */
/* This function returns the current number of established */
/* queues. Queues previously deleted are no longer considered */
/* established. */
/* */
/* AUTHOR */
/* */
/* William E. Lamie, Accelerated Technology, Inc. */
/* */
/* CALLED BY */
/* */
/* Application */
/* */
/* CALLS */
/* */
/* [TCT_Check_Stack] Stack checking function */
/* */
/* INPUTS */
/* */
/* None */
/* */
/* OUTPUTS */
/* */
/* QUD_Total_Queues Number of established */
/* queues */
/* */
/* 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 Modified function interface, */
/* resulting in version 1.1 */
/* R. Pfaff - */
/* D. Lamie 03-18-1994 Verified version 1.1 */
/* */
/*************************************************************************/
UNSIGNED QUF_Established_Queues(VOID)
{
#ifdef NU_ENABLE_STACK_CHECK
/* Call stack checking function to check for an overflow condition. */
TCT_Check_Stack();
#endif
/* Return the number of established queues. */
return(QUD_Total_Queues);
}
/*************************************************************************/
/* */
/* FUNCTION */
/* */
/* QUF_Queue_Pointers */
/* */
/* DESCRIPTION */
/* */
/* This function builds a list of queue pointers, starting at the */
/* specified location. The number of queue pointers placed in the */
/* list is equivalent to the total number of queues or the maximum */
/* number of pointers specified in the call. */
/* */
/* AUTHOR */
/* */
/* William E. Lamie, Accelerated Technology, Inc. */
/* */
/* CALLED BY */
/* */
/* Application */
/* */
/* CALLS */
/* */
/* [TCT_Check_Stack] Stack checking function */
/* TCT_Protect Protect created list */
/* TCT_Unprotect Release protection */
/* */
/* INPUTS */
/* */
/* pointer_list Pointer to the list area */
/* maximum_pointers Maximum number of pointers */
/* */
/* OUTPUTS */
/* */
/* pointers Number of queue pointers */
/* placed in the 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 08-09-1993 Corrected pointer retrieval */
/* loop, resulting in version 1.0a */
/* D. Lamie 08-09-1993 Verified version 1.0a */
/* W. Lamie 03-01-1994 Modified function interface, */
/* resulting in version 1.1 */
/* R. Pfaff - */
/* D. Lamie 03-18-1994 Verified version 1.1 */
/* */
/*************************************************************************/
UNSIGNED QUF_Queue_Pointers(NU_QUEUE **pointer_list,UNSIGNED maximum_pointers)
{
CS_NODE *node_ptr; /* Pointer to each QCB */
UNSIGNED pointers; /* Number of pointers in list*/
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -