Fix spelling in comments
Should be non-functional, except for some error message strings.
This commit is contained in:
@@ -529,7 +529,7 @@ long dbProcess(dbCommon *precord)
|
||||
}
|
||||
}
|
||||
|
||||
/* If already active dont process */
|
||||
/* If already active don't process */
|
||||
if (precord->pact) {
|
||||
unsigned short monitor_mask;
|
||||
|
||||
@@ -931,7 +931,7 @@ long dbGet(DBADDR *paddr, short dbrType,
|
||||
no_elements = capacity = pfl->no_elements;
|
||||
}
|
||||
|
||||
/* Update field info from record (if neccessary);
|
||||
/* Update field info from record (if necessary);
|
||||
* may modify paddr->pfield.
|
||||
*/
|
||||
if (!dbfl_has_copy(pfl) &&
|
||||
|
||||
@@ -73,7 +73,7 @@ DBCORE_API extern int dbAccessDebugPUTF;
|
||||
* options has a bit set for each option that was accepted
|
||||
* number_elements is actual number of elements obtained
|
||||
*
|
||||
* The individual items can be refered to by the expressions::
|
||||
* The individual items can be referred to by the expressions::
|
||||
*
|
||||
* buffer.status
|
||||
* buffer.severity
|
||||
|
||||
@@ -97,7 +97,7 @@ static long FIND_CONT_NODE(
|
||||
* processing in that lockset to this task. The separate task is
|
||||
* used so that locksets that do not have breakpoints are isolated
|
||||
* from locksets that do. This allows the processing of other
|
||||
* locksets to continue uninterupted, even if they exist on the same
|
||||
* locksets to continue uninterrupted, even if they exist on the same
|
||||
* scan list as a lockset containing a breakpoint.
|
||||
*
|
||||
* An entrypoint is the first record that gets processed in a lockset.
|
||||
@@ -250,7 +250,7 @@ static long FIND_CONT_NODE(
|
||||
}
|
||||
|
||||
/*
|
||||
* Initialise the breakpoint stack
|
||||
* Initialize the breakpoint stack
|
||||
*/
|
||||
void dbBkptInit(void)
|
||||
{
|
||||
|
||||
@@ -63,7 +63,7 @@ cvt_st_ ## TYPE(const char *from, void *pfield, const dbAddr *paddr) { \
|
||||
return epicsParse##TYPE(from, to, 0, &end); \
|
||||
}
|
||||
|
||||
/* Instanciate for CHAR, UCHAR, SHORT, USHORT and LONG */
|
||||
/* Instantiate for CHAR, UCHAR, SHORT, USHORT and LONG */
|
||||
cvt_st_int(Int8)
|
||||
cvt_st_int(UInt8)
|
||||
cvt_st_int(Int16)
|
||||
@@ -99,7 +99,7 @@ static long cvt_st_UInt32(const char *from, void *pfield, const dbAddr *paddr)
|
||||
return status;
|
||||
}
|
||||
|
||||
/* Instanciate for INT64 and UINT64 */
|
||||
/* Instantiate for INT64 and UINT64 */
|
||||
cvt_st_int(Int64)
|
||||
cvt_st_int(UInt64)
|
||||
|
||||
@@ -117,7 +117,7 @@ cvt_st_ ## TYPE(const char *from, void *pfield, const dbAddr *paddr) { \
|
||||
return epicsParse##TYPE(from, to, &end); \
|
||||
}
|
||||
|
||||
/* Instanciate for FLOAT32 and FLOAT64 */
|
||||
/* Instantiate for FLOAT32 and FLOAT64 */
|
||||
cvt_st_float(Float32)
|
||||
cvt_st_float(Float64)
|
||||
|
||||
|
||||
@@ -9,7 +9,7 @@
|
||||
\*************************************************************************/
|
||||
|
||||
/*
|
||||
* Auther Jeff Hill
|
||||
* Author Jeff Hill
|
||||
*/
|
||||
|
||||
#include <stdlib.h>
|
||||
|
||||
@@ -16,7 +16,7 @@
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
/* This name should probably be changed to inclue "array" */
|
||||
/* This name should probably be changed to include "array" */
|
||||
DBCORE_API long dbPutConvertJSON(const char *json, short dbrType,
|
||||
void *pdest, long *psize);
|
||||
DBCORE_API long dbLSConvertJSON(const char *json, char *pdest,
|
||||
|
||||
@@ -90,7 +90,7 @@ struct event_user {
|
||||
void *extralabor_arg;/* parameter to above */
|
||||
|
||||
epicsThreadId taskid; /* event handler task id */
|
||||
struct evSubscrip *pSuicideEvent; /* event that is deleteing itself */
|
||||
struct evSubscrip *pSuicideEvent; /* event that is deleting itself */
|
||||
unsigned queovr; /* event que overflow count */
|
||||
unsigned char pendexit; /* exit pend task */
|
||||
unsigned char extra_labor; /* if set call extra labor func */
|
||||
@@ -102,7 +102,7 @@ struct event_user {
|
||||
|
||||
/*
|
||||
* Reliable intertask communication requires copying the current value of the
|
||||
* channel for later queing so 3 stepper motor steps of 10 each do not turn
|
||||
* channel for later queuing so 3 stepper motor steps of 10 each do not turn
|
||||
* into only 10 or 20 total steps part of the time.
|
||||
*/
|
||||
|
||||
@@ -585,7 +585,7 @@ void db_cancel_event (dbEventSubscription event)
|
||||
/*
|
||||
* flag the event as canceled by NULLing out the callback handler
|
||||
*
|
||||
* make certain that the event isnt being accessed while
|
||||
* make certain that the event isn't being accessed while
|
||||
* its call back changes
|
||||
*/
|
||||
LOCKEVQUE (pevent->ev_que);
|
||||
@@ -811,7 +811,7 @@ static void db_queue_event_log (evSubscrip *pevent, db_field_log *pLog)
|
||||
pevent->nreplace++;
|
||||
/*
|
||||
* the event task has already been notified about
|
||||
* this so we dont need to post the semaphore
|
||||
* this so we don't need to post the semaphore
|
||||
*/
|
||||
firstEventFlag = 0;
|
||||
}
|
||||
@@ -844,7 +844,7 @@ static void db_queue_event_log (evSubscrip *pevent, db_field_log *pLog)
|
||||
UNLOCKEVQUE (ev_que);
|
||||
|
||||
/*
|
||||
* its more efficent to notify the event handler
|
||||
* its more efficient to notify the event handler
|
||||
* only after the event is ready and the lock
|
||||
* is off in case it runs at a higher priority
|
||||
* than the caller here.
|
||||
@@ -974,7 +974,7 @@ static int event_read ( struct event_que *ev_que )
|
||||
* Next event pointer can be used by event tasks to determine
|
||||
* if more events are waiting in the queue
|
||||
*
|
||||
* Must remove the lock here so that we dont deadlock if
|
||||
* Must remove the lock here so that we don't deadlock if
|
||||
* this calls dbGetField() and blocks on the record lock,
|
||||
* dbPutField() is in progress in another task, it has the
|
||||
* record lock, and it is calling db_post_events() waiting
|
||||
|
||||
@@ -130,7 +130,7 @@ DBCORE_API int dbNotifyDump(void);
|
||||
* if a process request is issued and also calls the client callbacks.
|
||||
*
|
||||
* A process request is issued if any of the following is true.
|
||||
* 1) The requester has issued a processs request and record is passive.
|
||||
* 1) The requester has issued a process request and record is passive.
|
||||
* 2) The requester is doing a put, the record is passive, and either
|
||||
* a) The field description is process passive.
|
||||
* b) The field is PROC.
|
||||
@@ -156,7 +156,7 @@ DBCORE_API int dbNotifyDump(void);
|
||||
* As soon as a record completes processing the field is set NULL
|
||||
* ppnr pointer to processNotifyRecord, which is a private structure
|
||||
* owned by dbNotify.
|
||||
* dbNotify is reponsible for this structure.
|
||||
* dbNotify is responsible for this structure.
|
||||
*
|
||||
*/
|
||||
#ifdef __cplusplus
|
||||
|
||||
@@ -110,7 +110,7 @@ extern "C" void putNotifyCompletion ( processNotify *ppn )
|
||||
if ( pNtfy ) {
|
||||
pBlocker->pNotify = 0;
|
||||
// Its necessary to signal the initiators now before we call
|
||||
// the user callback. This is less efficent, and potentially
|
||||
// the user callback. This is less efficient, and potentially
|
||||
// causes more thread context switching, but its probably
|
||||
// unavoidable because its possible that the use callback
|
||||
// might destroy this object.
|
||||
|
||||
@@ -1300,7 +1300,7 @@ static void dbpr_insert_msg(TAB_BUFFER *pMsgBuff,size_t len,int tab_size)
|
||||
current_len = strlen(pMsgBuff->out_buff);
|
||||
tot_line = current_len + len;
|
||||
|
||||
/* flush buffer if overflow would occor */
|
||||
/* flush buffer if overflow would occur */
|
||||
if (tot_line > MAXLINE)
|
||||
dbpr_msg_flush(pMsgBuff, tab_size);
|
||||
|
||||
|
||||
@@ -7,7 +7,7 @@
|
||||
\*************************************************************************/
|
||||
|
||||
/** @file dbUnitTest.h
|
||||
* @brief Helpers for unitests of process database
|
||||
* @brief Helpers for unittests of process database
|
||||
* @author Michael Davidsaver, Ralph Lange
|
||||
*
|
||||
* @see @ref dbunittest
|
||||
@@ -149,7 +149,7 @@ DBCORE_API void testMonitorDestroy(testMonitor*);
|
||||
*/
|
||||
DBCORE_API void testMonitorWait(testMonitor*);
|
||||
/** Return the number of monitor events which have occured since create,
|
||||
* or a pervious reset (called reset=1).
|
||||
* or a previous reset (called reset=1).
|
||||
* Calling w/ reset=0 only returns the count.
|
||||
* Calling w/ reset=1 resets the count to zero and ensures that the next
|
||||
* wait will block unless subsequent events occur. Returns the previous
|
||||
|
||||
@@ -27,7 +27,7 @@ DBCORE_API extern volatile int interruptAccept;
|
||||
|
||||
|
||||
/*
|
||||
* Adaptors for db_access users
|
||||
* Adapters for db_access users
|
||||
*/
|
||||
DBCORE_API struct dbChannel * dbChannel_create(const char *pname);
|
||||
DBCORE_API int dbChannel_get(struct dbChannel *chan,
|
||||
|
||||
@@ -677,7 +677,7 @@ long dbAddPath(DBBASE *pdbbase,const char *path)
|
||||
if (!path) return(0); /* Empty path strings are ignored */
|
||||
/* care is taken to properly deal with white space
|
||||
* 1) preceding and trailing white space is removed from paths
|
||||
* 2) white space inbetween path separator counts as an empty name
|
||||
* 2) white space in between path separator counts as an empty name
|
||||
* (see below)
|
||||
*/
|
||||
expectingPath = FALSE;
|
||||
@@ -710,8 +710,8 @@ long dbAddPath(DBBASE *pdbbase,const char *path)
|
||||
|
||||
/*
|
||||
* len is always nonzero because we found something that
|
||||
* 1) isnt white space
|
||||
* 2) isnt a path separator
|
||||
* 1) isn't white space
|
||||
* 2) isn't a path separator
|
||||
*/
|
||||
len = (plast - path) + 1;
|
||||
if (dbAddOnePath (pdbbase, path, (unsigned) len)) return (-1);
|
||||
@@ -722,7 +722,7 @@ long dbAddPath(DBBASE *pdbbase,const char *path)
|
||||
}
|
||||
|
||||
/*
|
||||
* an empty name at beginning, middle, or end of a path string that isnt
|
||||
* an empty name at beginning, middle, or end of a path string that isn't
|
||||
* empty means current directory
|
||||
*/
|
||||
if (expectingPath||sawMissingPath) {
|
||||
@@ -2274,7 +2274,7 @@ long dbParseLink(const char *str, short ftype, dbLinkInfo *pinfo)
|
||||
len -= (parm - pstr);
|
||||
}
|
||||
|
||||
/* generalized extraction of ID charactor and integer pairs (eg. "#C15 S14") */
|
||||
/* generalized extraction of ID character and integer pairs (eg. "#C15 S14") */
|
||||
ret = sscanf(pinfo->target, "# %c%d %c%d %c%d %c%d %c%d %c",
|
||||
&pinfo->hwid[0], &pinfo->hwnums[0],
|
||||
&pinfo->hwid[1], &pinfo->hwnums[1],
|
||||
@@ -2333,11 +2333,11 @@ long dbParseLink(const char *str, short ftype, dbLinkInfo *pinfo)
|
||||
}
|
||||
|
||||
pinfo->ltype = PV_LINK;
|
||||
pstr = strchr(pstr, ' '); /* find start of link modifiers (can't be seperated by tabs) */
|
||||
pstr = strchr(pstr, ' '); /* find start of link modifiers (can't be separated by tabs) */
|
||||
if (pstr) {
|
||||
*pstr++ = '\0'; /* isolate modifiers. pinfo->target is PV name only for re-use in struct pv_link */
|
||||
|
||||
/* Space seperation of modifiers isn't required, and other chars are ignored.
|
||||
/* Space separation of modifiers isn't required, and other chars are ignored.
|
||||
* Order of comparisons resolves ambiguity by checking for
|
||||
* longer matches first.
|
||||
* eg. "QQCPPXMSITT" is pvlOptCPP|pvlOptMSI
|
||||
|
||||
@@ -77,7 +77,7 @@ typedef struct typed_dset {
|
||||
long (*init_record)(struct dbCommon *prec);
|
||||
/** Called when SCAN="I/O Intr" on startup, or after SCAN is changed.
|
||||
*
|
||||
* Caller must assign the third arguement (IOCSCANPVT*). eg.
|
||||
* Caller must assign the third argument (IOCSCANPVT*). eg.
|
||||
@code
|
||||
struct mpvt {
|
||||
IOSCANPVT drvlist;
|
||||
@@ -173,7 +173,7 @@ DBCORE_API void dbInitDevSup(struct devSup *pdevSup, dset *pdset);
|
||||
#define S_dev_badOutType (M_devSup| 9) /*Bad OUT link type*/
|
||||
#define S_dev_badInitRet (M_devSup|11) /*Bad init_rec return value */
|
||||
#define S_dev_badBus (M_devSup|13) /*Illegal bus type*/
|
||||
#define S_dev_badCard (M_devSup|15) /*Illegal or nonexistant module*/
|
||||
#define S_dev_badCard (M_devSup|15) /*Illegal or nonexistent module*/
|
||||
#define S_dev_badSignal (M_devSup|17) /*Illegal signal*/
|
||||
#define S_dev_NoInit (M_devSup|19) /*No init*/
|
||||
#define S_dev_Conflict (M_devSup|21) /*Multiple records accessing same signal*/
|
||||
|
||||
@@ -180,7 +180,7 @@ union value {
|
||||
struct vmeio vmeio; /* vme io point */
|
||||
struct camacio camacio; /* camac io point */
|
||||
struct rfio rfio; /* CEBAF RF buffer interface */
|
||||
struct abio abio; /* allen-bradley io point */
|
||||
struct abio abio; /* Allen-Bradley io point */
|
||||
struct gpibio gpibio;
|
||||
struct bitbusio bitbusio;
|
||||
struct instio instio; /* instrument io link */
|
||||
|
||||
@@ -21,14 +21,14 @@
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
/*NOTE Do NOT add aditional definitions with out modifying dbLexRoutines.c */
|
||||
/*NOTE Do NOT add additional definitions with out modifying dbLexRoutines.c */
|
||||
/* types 1-99 are global. Record specific must start with 100 */
|
||||
#define SPC_NOMOD 1 /*Field must not be modified*/
|
||||
#define SPC_DBADDR 2 /*db_name_to_addr must call cvt_dbaddr*/
|
||||
#define SPC_SCAN 3 /*A scan related field is being changed*/
|
||||
#define SPC_ALARMACK 5 /*Special Alarm Acknowledgement*/
|
||||
#define SPC_AS 6 /* Access Security*/
|
||||
#define SPC_ATTRIBUTE 7 /* psuedo field, i.e. attribute field*/
|
||||
#define SPC_ATTRIBUTE 7 /* pseudo field, i.e. attribute field*/
|
||||
/* useful when record support must be notified of a field changing value*/
|
||||
#define SPC_MOD 100
|
||||
/* used by all records that support a reset field*/
|
||||
|
||||
@@ -317,7 +317,7 @@ static void makeSubstitutions(inputData * const inputPvt,
|
||||
pstart = ++p;
|
||||
/*Look for end quote*/
|
||||
while (*p && (*p != '"')) {
|
||||
/*allow escape for embeded quote*/
|
||||
/*allow escape for embedded quote*/
|
||||
if ((p[0] == '\\') && p[1] == '"') {
|
||||
p += 2;
|
||||
continue;
|
||||
@@ -1028,7 +1028,7 @@ static tokenType subGetNextToken(subFile *psubFile)
|
||||
subFileErrPrint(psubFile, "Strings must be on single line\n");
|
||||
abortExit(1);
|
||||
}
|
||||
/*allow escape for embeded quote*/
|
||||
/*allow escape for embedded quote*/
|
||||
if ((p[0] == '\\') && p[1] == '"') {
|
||||
*pto++ = *p++;
|
||||
*pto++ = *p++;
|
||||
|
||||
@@ -97,7 +97,7 @@ typedef struct rsrv_put_notify {
|
||||
/*
|
||||
* casCalloc()
|
||||
*
|
||||
* (dont drop below some max block threshold)
|
||||
* (don't drop below some max block threshold)
|
||||
*/
|
||||
static void *casCalloc(size_t count, size_t size)
|
||||
{
|
||||
@@ -341,7 +341,7 @@ static int bad_tcp_cmd_action ( caHdrLargeArray *mp, void *pPayload,
|
||||
log_header ( pCtx, client, mp, pPayload, 0 );
|
||||
|
||||
/*
|
||||
* by default, clients dont recover
|
||||
* by default, clients don't recover
|
||||
* from this
|
||||
*/
|
||||
SEND_LOCK (client);
|
||||
@@ -503,7 +503,7 @@ static void read_reply ( void *pArg, struct dbChannel *dbch,
|
||||
cid = ECA_NORMAL;
|
||||
|
||||
/* If the client has requested a zero element count we interpret this as a
|
||||
* request for all avaiable elements. In this case we initialise the
|
||||
* request for all available elements. In this case we initialize the
|
||||
* header with the maximum element size specified by the database. */
|
||||
autosize = pevext->msg.m_count == 0;
|
||||
item_count =
|
||||
@@ -870,7 +870,7 @@ static int host_name_action ( caHdrLargeArray *mp, void *pPayload,
|
||||
}
|
||||
|
||||
/*
|
||||
* user name will not change if there isnt enough memory
|
||||
* user name will not change if there isn't enough memory
|
||||
*/
|
||||
pMalloc = malloc(size);
|
||||
if(!pMalloc){
|
||||
@@ -949,7 +949,7 @@ static int client_name_action ( caHdrLargeArray *mp, void *pPayload,
|
||||
}
|
||||
|
||||
/*
|
||||
* user name will not change if there isnt enough memory
|
||||
* user name will not change if there isn't enough memory
|
||||
*/
|
||||
pMalloc = malloc(size);
|
||||
if(!pMalloc){
|
||||
@@ -1016,7 +1016,7 @@ unsigned cid
|
||||
* NOTE: This detects the case where the PV id wraps
|
||||
* around and we attempt to have two resources on the same id.
|
||||
* The lock is applied here because on some architectures the
|
||||
* ++ operator isnt atomic.
|
||||
* ++ operator isn't atomic.
|
||||
*/
|
||||
LOCK_CLIENTQ;
|
||||
|
||||
@@ -1436,7 +1436,7 @@ static void write_notify_reply ( struct client * pClient )
|
||||
msgtmp.m_available, 0 );
|
||||
if ( localStatus != ECA_NORMAL ) {
|
||||
/*
|
||||
* inability to aquire buffer space
|
||||
* inability to acquire buffer space
|
||||
* Indicates corruption
|
||||
*/
|
||||
errlogPrintf("CA server corrupted - put call back(s) discarded\n");
|
||||
@@ -1570,7 +1570,7 @@ static int rsrvExpandPutNotify (
|
||||
|
||||
if ( sizeNeeded > pNotify->valueSize ) {
|
||||
/*
|
||||
* try to use the union embeded in the free list
|
||||
* try to use the union embedded in the free list
|
||||
* item, but allocate a random sized block if they
|
||||
* writing a vector.
|
||||
*/
|
||||
@@ -1625,7 +1625,7 @@ void rsrvFreePutNotify ( client *pClient,
|
||||
epicsMutexUnlock ( pClient->putNotifyLock );
|
||||
|
||||
/*
|
||||
* if any possiblity that the put notify is
|
||||
* if any possibility that the put notify is
|
||||
* outstanding then cancel it
|
||||
*/
|
||||
if ( busyTmp ) {
|
||||
@@ -1736,7 +1736,7 @@ static int write_notify_action ( caHdrLargeArray *mp, void *pPayload,
|
||||
if ( ! pciu->pPutNotify ) {
|
||||
/*
|
||||
* send error and go to next request
|
||||
* if there isnt enough memory left
|
||||
* if there isn't enough memory left
|
||||
*/
|
||||
log_header ( "no memory to initiate put notify",
|
||||
client, mp, pPayload, 0 );
|
||||
@@ -2144,7 +2144,7 @@ int rsrv_version_reply ( struct client *client )
|
||||
SEND_LOCK ( client );
|
||||
/*
|
||||
* sequence number is specified zero when we copy in the
|
||||
* header because we dont know it until we receive a datagram
|
||||
* header because we don't know it until we receive a datagram
|
||||
* from the client
|
||||
*/
|
||||
status = cas_copy_in_header ( client, CA_PROTO_VERSION,
|
||||
@@ -2210,7 +2210,7 @@ static int search_reply_udp ( caHdrLargeArray *mp, void *pPayload, struct client
|
||||
* starting with V4.4 the count field is used (abused)
|
||||
* to store the minor version number of the client.
|
||||
*
|
||||
* New versions dont alloc the channel in response
|
||||
* New versions don't alloc the channel in response
|
||||
* to a search request.
|
||||
* For these, allocation has been moved to claim_ciu_action().
|
||||
*
|
||||
@@ -2285,7 +2285,7 @@ static int search_reply_tcp (
|
||||
}
|
||||
|
||||
/*
|
||||
* stop further use of server if memory becomes scarse
|
||||
* stop further use of server if memory becomes scarce
|
||||
*/
|
||||
spaceAvailOnFreeList = freeListItemsAvail ( rsrvChanFreeList ) > 0
|
||||
&& freeListItemsAvail ( rsrvEventFreeList ) > reasonableMonitorSpace;
|
||||
@@ -2397,7 +2397,7 @@ int camessage ( struct client *client )
|
||||
|
||||
assert(pCaBucket);
|
||||
|
||||
/* drain remnents of large messages that will not fit */
|
||||
/* drain remnants of large messages that will not fit */
|
||||
if ( client->recvBytesToDrain ) {
|
||||
if ( client->recvBytesToDrain >= client->recv.cnt ) {
|
||||
client->recvBytesToDrain -= client->recv.cnt;
|
||||
@@ -2472,7 +2472,7 @@ int camessage ( struct client *client )
|
||||
}
|
||||
|
||||
/*
|
||||
* disconnect clients that dont send 8 byte
|
||||
* disconnect clients that don't send 8 byte
|
||||
* aligned payloads
|
||||
*/
|
||||
if ( msgsize & 0x7 ) {
|
||||
|
||||
@@ -50,7 +50,7 @@ void camsgtask ( void *pParm )
|
||||
int status;
|
||||
|
||||
/*
|
||||
* allow message to batch up if more are comming
|
||||
* allow message to batch up if more are coming
|
||||
*/
|
||||
status = socket_ioctl (client->sock, FIONREAD, &check_nchars);
|
||||
if (status < 0) {
|
||||
|
||||
@@ -545,7 +545,7 @@ void rsrv_init (void)
|
||||
beacon_startStopEvent = epicsEventMustCreate(epicsEventEmpty);
|
||||
castcp_ctl = ctlPause;
|
||||
|
||||
/* Thread priorites
|
||||
/* Thread priorities
|
||||
* Now starting per interface
|
||||
* TCP Listener: epicsThreadPriorityCAServerLow-2
|
||||
* Name receiver: epicsThreadPriorityCAServerLow-4
|
||||
@@ -1204,7 +1204,7 @@ void destroy_tcp_client ( struct client *client )
|
||||
assert ( ! status );
|
||||
|
||||
/*
|
||||
* wait for extra labor in progress to comple
|
||||
* wait for extra labor in progress to complete
|
||||
*/
|
||||
db_flush_extra_labor_event ( client->evuser );
|
||||
}
|
||||
@@ -1229,7 +1229,7 @@ struct client * create_client ( SOCKET sock, int proto )
|
||||
size_t spaceNeeded;
|
||||
|
||||
/*
|
||||
* stop further use of server if memory becomes scarse
|
||||
* stop further use of server if memory becomes scarce
|
||||
*/
|
||||
spaceAvailOnFreeList = freeListItemsAvail ( rsrvClientFreeList ) > 0
|
||||
&& freeListItemsAvail ( rsrvSmallBufFreeListTCP ) > 0;
|
||||
|
||||
@@ -16,7 +16,7 @@
|
||||
* Improvements
|
||||
* ------------
|
||||
* .01
|
||||
* Dont send channel found message unless there is memory, a task slot,
|
||||
* Don't send channel found message unless there is memory, a task slot,
|
||||
* and a TCP socket available. Send a diagnostic instead.
|
||||
* Or ... make the timeout shorter? This is only a problem if
|
||||
* they persist in trying to make a connection after getting no
|
||||
@@ -269,9 +269,9 @@ void cast_server(void *pParm)
|
||||
}
|
||||
|
||||
/*
|
||||
* allow messages to batch up if more are comming
|
||||
* allow messages to batch up if more are coming
|
||||
*/
|
||||
nchars = 0; /* supress purify warning */
|
||||
nchars = 0; /* suppress purify warning */
|
||||
status = socket_ioctl(recv_sock, FIONREAD, &nchars);
|
||||
if (status<0) {
|
||||
errlogPrintf ("CA cast server: Unable to fetch N characters pending\n");
|
||||
|
||||
@@ -239,7 +239,7 @@ void initializePutNotifyFreeList (void);
|
||||
unsigned rsrvSizeOfPutNotify ( struct rsrv_put_notify *pNotify );
|
||||
|
||||
/*
|
||||
* inclming protocol maintetnance
|
||||
* incoming protocol maintenance
|
||||
*/
|
||||
void casExpandRecvBuffer ( struct client *pClient, ca_uint32_t size );
|
||||
|
||||
|
||||
@@ -43,7 +43,7 @@ static long init_record(dbCommon *pcommon)
|
||||
{
|
||||
long status=0;
|
||||
|
||||
/* dont convert */
|
||||
/* don't convert */
|
||||
status=2;
|
||||
return status;
|
||||
|
||||
|
||||
@@ -162,7 +162,7 @@ static long process(struct dbCommon *pcommon)
|
||||
prec->udf = FALSE;
|
||||
|
||||
/* Update the timestamp before writing output values so it
|
||||
* will be uptodate if any downstream records fetch it via TSEL */
|
||||
* will be up to date if any downstream records fetch it via TSEL */
|
||||
recGblGetTimeStampSimm(prec, prec->simm, NULL);
|
||||
}
|
||||
|
||||
@@ -357,7 +357,7 @@ static long writeValue(aaoRecord *prec)
|
||||
case menuYesNoYES: {
|
||||
recGblSetSevr(prec, SIMM_ALARM, prec->sims);
|
||||
if (prec->pact || (prec->sdly < 0.)) {
|
||||
/* Device suport is responsible for buffer
|
||||
/* Device support is responsible for buffer
|
||||
which might be write-only so we may not be
|
||||
allowed to call dbPutLink on it.
|
||||
Maybe also device support has an advanced
|
||||
|
||||
@@ -43,7 +43,7 @@
|
||||
#undef GEN_SIZE_OFFSET
|
||||
#include "epicsExport.h"
|
||||
|
||||
/* Hysterisis for alarm filtering: 1-1/e */
|
||||
/* Hysteresis for alarm filtering: 1-1/e */
|
||||
#define THRESHOLD 0.6321
|
||||
|
||||
/* Create RSET - Record Support Entry Table*/
|
||||
|
||||
@@ -188,7 +188,7 @@ static long process(struct dbCommon *pcommon)
|
||||
if(!status) convert(prec, value);
|
||||
prec->udf = isnan(prec->val);
|
||||
/* Update the timestamp before writing output values so it
|
||||
* will be uptodate if any downstream records fetch it via TSEL */
|
||||
* will be up to date if any downstream records fetch it via TSEL */
|
||||
recGblGetTimeStampSimm(prec, prec->simm, NULL);
|
||||
}
|
||||
|
||||
|
||||
@@ -211,7 +211,7 @@ static long process(struct dbCommon *pcommon)
|
||||
} else prec->rval = (epicsUInt32)prec->val;
|
||||
|
||||
/* Update the timestamp before writing output values so it
|
||||
* will be uptodate if any downstream records fetch it via TSEL */
|
||||
* will be up to date if any downstream records fetch it via TSEL */
|
||||
recGblGetTimeStampSimm(prec, prec->simm, NULL);
|
||||
}
|
||||
|
||||
|
||||
@@ -37,7 +37,7 @@
|
||||
#undef GEN_SIZE_OFFSET
|
||||
#include "epicsExport.h"
|
||||
|
||||
/* Hysterisis for alarm filtering: 1-1/e */
|
||||
/* Hysteresis for alarm filtering: 1-1/e */
|
||||
#define THRESHOLD 0.6321
|
||||
|
||||
/* Create RSET - Record Support Entry Table */
|
||||
|
||||
@@ -245,7 +245,7 @@ static long process(struct dbCommon *pcommon)
|
||||
|
||||
if ( !pact ) {
|
||||
/* Update the timestamp before writing output values so it
|
||||
* will be uptodate if any downstream records fetch it via TSEL */
|
||||
* will be up to date if any downstream records fetch it via TSEL */
|
||||
recGblGetTimeStamp(prec);
|
||||
}
|
||||
/* check for output link execution */
|
||||
|
||||
@@ -160,7 +160,7 @@ static long init_record(struct dbCommon *pcommon, int pass)
|
||||
prec->bptr = calloc(prec->nelm, sizeof(epicsUInt32));
|
||||
}
|
||||
|
||||
/* calulate width of array element */
|
||||
/* calculate width of array element */
|
||||
prec->wdth = (prec->ulim - prec->llim) / prec->nelm;
|
||||
return 0;
|
||||
}
|
||||
|
||||
@@ -40,7 +40,7 @@
|
||||
#undef GEN_SIZE_OFFSET
|
||||
#include "epicsExport.h"
|
||||
|
||||
/* Hysterisis for alarm filtering: 1-1/e */
|
||||
/* Hysteresis for alarm filtering: 1-1/e */
|
||||
#define THRESHOLD 0.6321
|
||||
/* Create RSET - Record Support Entry Table*/
|
||||
#define report NULL
|
||||
|
||||
@@ -146,7 +146,7 @@ static long process(dbCommon *pcommon)
|
||||
if (!status) convert(prec,value);
|
||||
|
||||
/* Update the timestamp before writing output values so it
|
||||
* will be uptodate if any downstream records fetch it via TSEL */
|
||||
* will be up to date if any downstream records fetch it via TSEL */
|
||||
recGblGetTimeStampSimm(prec, prec->simm, NULL);
|
||||
}
|
||||
|
||||
|
||||
@@ -41,7 +41,7 @@
|
||||
#undef GEN_SIZE_OFFSET
|
||||
#include "epicsExport.h"
|
||||
|
||||
/* Hysterisis for alarm filtering: 1-1/e */
|
||||
/* Hysteresis for alarm filtering: 1-1/e */
|
||||
#define THRESHOLD 0.6321
|
||||
/* Create RSET - Record Support Entry Table*/
|
||||
#define report NULL
|
||||
|
||||
@@ -148,7 +148,7 @@ static long process(struct dbCommon *pcommon)
|
||||
if (!status) convert(prec,value);
|
||||
|
||||
/* Update the timestamp before writing output values so it
|
||||
* will be uptodate if any downstream records fetch it via TSEL */
|
||||
* will be up to date if any downstream records fetch it via TSEL */
|
||||
recGblGetTimeStampSimm(prec, prec->simm, NULL);
|
||||
}
|
||||
|
||||
|
||||
@@ -40,7 +40,7 @@
|
||||
#undef GEN_SIZE_OFFSET
|
||||
#include "epicsExport.h"
|
||||
|
||||
/* Hysterisis for alarm filtering: 1-1/e */
|
||||
/* Hysteresis for alarm filtering: 1-1/e */
|
||||
#define THRESHOLD 0.6321
|
||||
|
||||
/* Create RSET - Record Support Entry Table*/
|
||||
@@ -177,7 +177,7 @@ static long process(struct dbCommon *pcommon)
|
||||
|
||||
if (prec->sdef) {
|
||||
pstate_values = &(prec->zrvl);
|
||||
prec->val = 65535; /* Initalize to unknown state*/
|
||||
prec->val = 65535; /* Initialize to unknown state*/
|
||||
for (i = 0; i < 16; i++) {
|
||||
if (*pstate_values == rval) {
|
||||
prec->val = i;
|
||||
|
||||
@@ -196,7 +196,7 @@ static long process(struct dbCommon *pcommon)
|
||||
convert(prec);
|
||||
|
||||
/* Update the timestamp before writing output values so it
|
||||
* will be uptodate if any downstream records fetch it via TSEL */
|
||||
* will be up to date if any downstream records fetch it via TSEL */
|
||||
recGblGetTimeStampSimm(prec, prec->simm, NULL);
|
||||
}
|
||||
|
||||
|
||||
@@ -151,7 +151,7 @@ static long init_record(struct dbCommon *pcommon, int pass)
|
||||
epicsUInt32 *pstate_values = &prec->zrvl;
|
||||
int i;
|
||||
|
||||
prec->val = 65535; /* initalize to unknown state */
|
||||
prec->val = 65535; /* initialize to unknown state */
|
||||
for (i = 0; i < 16; i++) {
|
||||
if (*pstate_values == rval) {
|
||||
prec->val = i;
|
||||
@@ -217,7 +217,7 @@ static long process(struct dbCommon *pcommon)
|
||||
convert(prec);
|
||||
|
||||
/* Update the timestamp before writing output values so it
|
||||
* will be uptodate if any downstream records fetch it via TSEL */
|
||||
* will be up to date if any downstream records fetch it via TSEL */
|
||||
recGblGetTimeStampSimm(prec, prec->simm, NULL);
|
||||
}
|
||||
|
||||
|
||||
@@ -148,7 +148,7 @@ static long process(struct dbCommon *pcommon)
|
||||
}
|
||||
|
||||
/* Update the timestamp before writing output values so it
|
||||
* will be uptodate if any downstream records fetch it via TSEL */
|
||||
* will be up to date if any downstream records fetch it via TSEL */
|
||||
recGblGetTimeStampSimm(prec, prec->simm, NULL);
|
||||
|
||||
if (prec->nsev < INVALID_ALARM )
|
||||
|
||||
Reference in New Issue
Block a user