1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
|
/*===========================================================================
FILE:
ProtocolServer.cpp
DESCRIPTION:
Generic protocol packet server
PUBLIC CLASSES AND METHODS:
cProtocolServer
Abstract base class for protocol servers
Copyright (c) 2012, Code Aurora Forum. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of Code Aurora Forum nor
the names of its contributors may be used to endorse or promote
products derived from this software without specific prior written
permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
===========================================================================*/
//---------------------------------------------------------------------------
// Include Files
//---------------------------------------------------------------------------
#include "StdAfx.h"
#include "ProtocolServer.h"
#include "ProtocolNotification.h"
#include <climits>
//---------------------------------------------------------------------------
// Definitions
//---------------------------------------------------------------------------
// Invalid request ID
const ULONG INVALID_REQUEST_ID = 0;
// Default activity timeout value
const ULONG DEFAULT_WAIT = 100;
// MTU (Maximum Transmission Unit) for auxiliary data (QC USB imposed)
const ULONG MAX_AUX_MTU_SIZE = 1024 * 256;
// USB's MaxPacketSize
const ULONG MAX_PACKET_SIZE = 512;
// Maximum amount of time to wait on external access synchronization object
#ifdef DEBUG
// For the sake of debugging do not be so quick to assume failure
const ULONG DEADLOCK_TIME = 180000;
#else
const ULONG DEADLOCK_TIME = 10000;
#endif
// Maximum amount of time to wait for the protocol server to process a command
const ULONG COMMAND_TIME = DEADLOCK_TIME;
/*=========================================================================*/
// Free Methods
/*=========================================================================*/
/*===========================================================================
METHOD:
ScheduleThread (Free Method)
DESCRIPTION:
Watch schedule for event to process or timeout
PARAMETERS:
pArg [ I ] - The protocol server object
RETURN VALUE:
void * - thread exit value (always NULL)
===========================================================================*/
void * ScheduleThread( PVOID pArg )
{
// Do we have a server?
cProtocolServer * pServer = (cProtocolServer *)pArg;
if (pServer == 0)
{
TRACE( "ScheduleThread started with empty pArg."
" Unable to locate cProtocolServer\n" );
ASSERT( 0 );
return NULL;
}
TRACE( "Schedule thread [%lu] started\n",
pthread_self() );
// Default wait event
timespec toTime = TimeIn( DEFAULT_WAIT );
// Return value checking
int nRet;
while (pServer->mbExiting == false)
{
DWORD nTemp;
nRet = pServer->mThreadScheduleEvent.Wait( TimeFromNow( toTime ), nTemp );
if (nRet != 0 && nRet != ETIME)
{
// Error condition
TRACE( "ScheduleThread [%lu] ScheduleThread wait error %d, %s\n",
pthread_self(),
nRet,
strerror( nRet ) );
break;
}
// Time to exit?
if (pServer->mbExiting == true)
{
break;
}
// Get Schedule Mutex (non-blocking)
nRet = pthread_mutex_trylock( &pServer->mScheduleMutex );
if (nRet == EBUSY)
{
// Not an error, we're just too slow
// Someone else got to the ScheduleMutex before us
// We'll wait for the signal again
toTime = TimeIn( DEFAULT_WAIT );
TRACE( "ScheduleThread [%lu] unable to lock ScheduleMutex\n",
pthread_self() );
continue;
}
else if (nRet != 0)
{
// Error condition
TRACE( "ScheduleThread [%lu] mScheduleMutex error %d, %s\n",
pthread_self(),
nRet,
strerror( nRet ) );
break;
}
// Verify time. In the rare event it does move backward
// it would simply place all our schedule items as due now
pServer->CheckSystemTime();
// Default next wait period
toTime = TimeIn( DEFAULT_WAIT );
timespec curTime = TimeIn( 0 );
if (pServer->mpActiveRequest != 0)
{
if (pServer->mpActiveRequest->mbWaitingForResponse == true)
{
// Waiting on a response, this takes priority over the next
// scheduled event
// Has timeout expired?
if (pServer->mActiveRequestTimeout <= curTime)
{
// Response timeout
// Note: This may clear mpActiveRequest
pServer->RxTimeout();
}
else
{
// Active response timer is not yet due to expire
// Default timeout again, or this response's timeout?
if (pServer->mActiveRequestTimeout <= toTime)
{
toTime = pServer->mActiveRequestTimeout;
}
}
}
else
{
// This should never happen
TRACE( "ScheduleThread() Sequencing error: "
"Active request %lu is not waiting for response ???\n",
pServer->mpActiveRequest->mID );
break;
}
}
if (pServer->mpActiveRequest == 0
&& pServer->mRequestSchedule.size() > 0)
{
// No response timer active, ready to start the next
// scheduled item if due
timespec scheduledItem = pServer->GetNextRequestTime();
// Is item due to be scheduled?
if (scheduledItem <= curTime)
{
// Process scheduled item
pServer->ProcessRequest();
}
else
{
// Scheduled item is not yet due to be processed
// Default timeout again, or this item's start time?
if (scheduledItem <= toTime)
{
toTime = scheduledItem;
}
}
}
/*TRACE( "Updated timer at %llu waiting %lu\n",
GetTickCount(),
TimeFromNow( toTime ) ); */
// Unlock schedule mutex
nRet = pthread_mutex_unlock( &pServer->mScheduleMutex );
if (nRet != 0)
{
TRACE( "ScheduleThread Unable to unlock schedule mutex."
" Error %d: %s\n",
nRet,
strerror( nRet ) );
return false;
}
}
TRACE( "Schedule thread [%lu] exited\n",
pthread_self() );
return NULL;
}
/*===========================================================================
METHOD:
TimeIn (Free Method)
DESCRIPTION:
Fill timespec with the time it will be in specified milliseconds
Relative time to Absolute time
PARAMETERS:
millis [ I ] - Milliseconds from current time
RETURN VALUE:
timespec - resulting time (from epoc)
NOTE: tv_sec of 0 is an error
===========================================================================*/
timespec TimeIn( ULONG millis )
{
timespec outTime;
int nRC = clock_gettime( CLOCK_REALTIME, &outTime );
if (nRC == 0)
{
// Add avoiding an overflow on (long)nsec
outTime.tv_sec += millis / 1000l;
outTime.tv_nsec += ( millis % 1000l ) * 1000000l;
// Check if we need to carry
if (outTime.tv_nsec >= 1000000000l)
{
outTime.tv_sec += outTime.tv_nsec / 1000000000l;
outTime.tv_nsec = outTime.tv_nsec % 1000000000l;
}
}
else
{
outTime.tv_sec = 0;
outTime.tv_nsec = 0;
}
return outTime;
}
/*===========================================================================
METHOD:
TimeFromNow (Free Method)
DESCRIPTION:
Find the milliseconds from current time this timespec will occur
Absolute time to Relative time
PARAMETERS:
time [ I ] - Absolute time
RETURN VALUE:
Milliseconds in which absolute time will occur
0 if time has passed or error has occured
===========================================================================*/
ULONG TimeFromNow( timespec time )
{
// Assume failure
ULONG nOutTime = 0;
timespec now;
int nRC = clock_gettime( CLOCK_REALTIME, &now );
if (nRC == -1)
{
TRACE( "Error %d with gettime, %s\n", errno, strerror( errno ) );
return nOutTime;
}
if (time <= now)
{
return nOutTime;
}
nOutTime = (time.tv_sec - now.tv_sec) * 1000l;
nOutTime += (time.tv_nsec - now.tv_nsec) / 1000000l;
return nOutTime;
}
/*===========================================================================
METHOD:
GetTickCount (Free Method)
DESCRIPTION:
Provide a number for sequencing reference, similar to the windows
::GetTickCount().
NOTE: This number is based on the time since epoc, not
uptime.
PARAMETERS:
RETURN VALUE:
ULONGLONG - Number of milliseconds system has been up
===========================================================================*/
ULONGLONG GetTickCount()
{
timespec curtime = TimeIn( 0 );
ULONGLONG outtime = curtime.tv_sec * 1000LL;
outtime += curtime.tv_nsec / 1000000LL;
return outtime;
}
/*=========================================================================*/
// cProtocolServerRxCallback Methods
/*=========================================================================*/
/*===========================================================================
METHOD:
IOComplete (Free Method)
DESCRIPTION:
The I/O has been completed, process the results
PARAMETERS:
status [ I ] - Status of operation
bytesReceived [ I ] - Bytes received during operation
RETURN VALUE:
None
===========================================================================*/
void cProtocolServerRxCallback::IOComplete(
DWORD status,
DWORD bytesReceived )
{
if (mpServer != 0)
{
mpServer->RxComplete( status, bytesReceived );
}
}
/*=========================================================================*/
// cProtocolServer::sProtocolReqRsp Methods
/*=========================================================================*/
/*===========================================================================
METHOD:
cProtocolServer::sProtocolReqRsp (Public Method)
DESCRIPTION:
Constructor
PARAMETERS:
requestInfo [ I ] - Underlying request object
requestID [ I ] - Request ID
auxDataMTU [ I ] - MTU (Maximum Transmission Unit) for auxiliary data
RETURN VALUE:
None
===========================================================================*/
cProtocolServer::sProtocolReqRsp::sProtocolReqRsp(
const sProtocolRequest & requestInfo,
ULONG requestID,
ULONG auxDataMTU )
: mRequest( requestInfo ),
mID( requestID ),
mAttempts( 0 ),
mEncodedSize( requestInfo.GetSize() ),
mRequiredAuxTxs( 0 ),
mCurrentAuxTx( 0 ),
mbWaitingForResponse( false )
{
ULONG auxDataSz = 0;
const BYTE * pAuxData = requestInfo.GetAuxiliaryData( auxDataSz );
// Compute the number of required auxiliary data transmissions?
if (auxDataMTU > 0 && pAuxData != 0 && auxDataSz > 0)
{
mRequiredAuxTxs = 1;
if (auxDataSz > auxDataMTU)
{
mRequiredAuxTxs = auxDataSz / auxDataMTU;
if ((auxDataSz % auxDataMTU) != 0)
{
mRequiredAuxTxs++;
}
}
}
}
/*===========================================================================
METHOD:
cProtocolServer::sProtocolReqRsp (Public Method)
DESCRIPTION:
Copy constructor
PARAMETERS:
reqRsp [ I ] - Object being copied
RETURN VALUE:
None
===========================================================================*/
cProtocolServer::sProtocolReqRsp::sProtocolReqRsp(
const sProtocolReqRsp & reqRsp )
: mRequest( reqRsp.mRequest ),
mID( reqRsp.mID ),
mAttempts( reqRsp.mAttempts ),
mEncodedSize( reqRsp.mEncodedSize ),
mRequiredAuxTxs( reqRsp.mRequiredAuxTxs ),
mCurrentAuxTx( reqRsp.mCurrentAuxTx ),
mbWaitingForResponse( reqRsp.mbWaitingForResponse )
{
// Nothing to do
};
/*=========================================================================*/
// cProtocolServer Methods
/*=========================================================================*/
/*===========================================================================
METHOD:
cProtocolServer (Public Method)
DESCRIPTION:
Constructor
PARAMETERS:
rxType [ I ] - Protocol type to assign to incoming data
txType [ I ] - Protocol type to verify for outgoing data
bufferSzRx [ I ] - Size of data buffer for incoming data
logSz [ I ] - Size of log (number of buffers)
SEQUENCING:
None (constructs sequencing objects)
RETURN VALUE:
None
===========================================================================*/
cProtocolServer::cProtocolServer(
eProtocolType rxType,
eProtocolType txType,
ULONG bufferSzRx,
ULONG logSz )
: mpConnection( 0 ),
mConnectionType( eConnectionType_Begin ),
mRxCallback(),
mScheduleThreadID( 0 ),
mThreadScheduleEvent(),
mbExiting( false ),
mpServerControl( 0 ),
mLastRequestID( 1 ),
mpActiveRequest( 0 ),
mpRxBuffer( 0 ),
mRxBufferSize( bufferSzRx ),
mRxType( rxType ),
mTxType( txType ),
mLog( logSz )
{
mLastTime = TimeIn( 0 );
// Allocate receive buffer?
if (mRxBufferSize > 0)
{
mpRxBuffer = new BYTE[mRxBufferSize];
}
// Before continuing verify receive buffer was allocated
if (mpRxBuffer != 0)
{
// Schedule mutex
int nRet = pthread_mutex_init( &mScheduleMutex, NULL );
if (nRet != 0)
{
TRACE( "Unable to init schedule mutex. Error %d: %s\n",
nRet,
strerror( nRet ) );
return;
}
}
}
/*===========================================================================
METHOD:
~cProtocolServer (Public Method)
DESCRIPTION:
Destructor
SEQUENCING:
None (destroys sequencing objects)
RETURN VALUE:
None
===========================================================================*/
cProtocolServer::~cProtocolServer()
{
// This should have already been called, but ...
Exit();
// Schedule mutex
int nRet = pthread_mutex_destroy( &mScheduleMutex );
if (nRet != 0)
{
TRACE( "Unable to destroy schedule mutex. Error %d: %s\n",
nRet,
strerror( nRet ) );
}
// Free receive buffer
if (mpRxBuffer != 0)
{
delete [] mpRxBuffer;
mpRxBuffer = 0;
}
}
/*===========================================================================
METHOD:
HandleRemoveRequest (Public Method)
DESCRIPTION:
Remove a previously added protocol request
Note: if a request is being processed, it cannot be inturrupted
PARAMETERS:
reqID [ I ] - Server assigned request ID
SEQUENCING:
Calling process must have lock on mScheduleMutex
RETURN VALUE:
bool
===========================================================================*/
bool cProtocolServer::HandleRemoveRequest( ULONG reqID )
{
// Assume failure
bool bRC = false;
// Find and erase request from request map
std::map <ULONG, sProtocolReqRsp *>::iterator pReqIter;
pReqIter = mRequestMap.find( reqID );
if (pReqIter != mRequestMap.end())
{
sProtocolReqRsp * pReqRsp = pReqIter->second;
if (pReqRsp != 0)
{
delete pReqRsp;
}
mRequestMap.erase( pReqIter );
// Success!
bRC = true;
// Find and erase request from schedule
bool bFound = false;
int entryIndex = -1;
std::set <tSchedule>::iterator pScheduleIter;
pScheduleIter = mRequestSchedule.begin();
while (pScheduleIter != mRequestSchedule.end())
{
entryIndex++;
tSchedule entry = *pScheduleIter;
if (entry.second == reqID)
{
bFound = true;
mRequestSchedule.erase( pScheduleIter );
break;
}
else
{
pScheduleIter++;
}
}
// Note: schedule will be updated when mutex is unlocked/signaled
}
else if (mpActiveRequest != 0 && mpActiveRequest->mID == reqID)
{
const sProtocolRequest & req = mpActiveRequest->mRequest;
const cProtocolNotification * pNotifier = req.GetNotifier();
// Cancel the response timer (when active)
if (mpActiveRequest->mbWaitingForResponse == true)
{
// Schedule will be updated when mutex is unlocked
// Failure to receive response, notify client
if (pNotifier != 0)
{
pNotifier->Notify( ePROTOCOL_EVT_RSP_ERR,
(DWORD)reqID,
ECANCELED );
}
}
else
{
// This is the active request, cancel the underlying transmit
// Note: Because ProcessRequest and RemoveRequest are both muxed
// with ScheduleMutex, it is impossible to for the write
// to actually be in progress when this code is reached.
if (mpConnection != 0)
{
mpConnection->CancelTx();
}
// Failure to send request, notify client
if (pNotifier != 0)
{
pNotifier->Notify( ePROTOCOL_EVT_REQ_ERR,
(DWORD)reqID,
ECANCELED );
}
}
// Now delete the request
delete mpActiveRequest;
mpActiveRequest = 0;
// Success!
bRC = true;
}
else
{
TRACE( "cProtocolServer::RemoveRequest( %lu ),"
" invalid request ID\n",
reqID );
}
return bRC;
}
/*===========================================================================
METHOD:
ScheduleRequest (Internal Method)
DESCRIPTION:
Schedule a request for transmission
PARAMETERS:
reqID [ I ] - ID of the request being scheduled this ID must exist
in the internal request/schedule maps
schedule [ I ] - Value in milliseconds that indicates the approximate
time from now that the request is to be sent out, the
actual time that the request is sent will be greater
than or equal to this value dependant on requests
scheduled before the request in question and
standard server processing time
SEQUENCING:
Calling process must have lock on mScheduleMutex
RETURN VALUE:
bool
===========================================================================*/
bool cProtocolServer::ScheduleRequest(
ULONG reqID,
ULONG schedule )
{
// Assume failure
bool bRC = false;
// Schedule adjust is in milliseconds
timespec schTimer = TimeIn( schedule );
// Create the schedule entry
tSchedule newEntry( schTimer, reqID );
// Fit this request into the schedule (ordered by scheduled time)
mRequestSchedule.insert( newEntry );
// Note: timer will be updated when mScheduleMutex is unlocked
return bRC;
}
/*===========================================================================
METHOD:
RescheduleActiveRequest (Internal Method)
DESCRIPTION:
Reschedule (or cleanup) the active request
SEQUENCING:
Calling process must have lock on mScheduleMutex
RETURN VALUE:
None
===========================================================================*/
void cProtocolServer::RescheduleActiveRequest()
{
// Are there more attempts to be made?
if (mpActiveRequest->mAttempts < mpActiveRequest->mRequest.GetRequests())
{
// Yes, first reset the request
mpActiveRequest->Reset();
// Now add it back to the request map
mRequestMap[mpActiveRequest->mID] = mpActiveRequest;
TRACE( "RescheduleActiveRequest(): req %lu rescheduled\n", mpActiveRequest->mID );
// Lastly reschedule the request
ScheduleRequest( mpActiveRequest->mID,
mpActiveRequest->mRequest.GetFrequency() );
}
else
{
TRACE( "RescheduleActiveRequest(): req %lu removed\n", mpActiveRequest->mID );
// No, we are through with this request
delete mpActiveRequest;
}
// There is no longer an active request
mpActiveRequest = 0;
}
/*===========================================================================
METHOD:
ProcessRequest (Internal Method)
DESCRIPTION:
Process a single outgoing protocol request, this consists of removing
the request ID from the head of the schedule, looking up the internal
request object in the request map, sending out the request, and setting
up the response timer (if a response is required)
SEQUENCING:
Calling process must have lock on mScheduleMutex
RETURN VALUE:
===========================================================================*/
void cProtocolServer::ProcessRequest()
{
// Is there already an active request?
if (mpActiveRequest != 0 || mpConnection == 0)
{
return;
}
// Grab request ID from the schedule
std::set <tSchedule>::iterator pScheduleIter;
pScheduleIter = mRequestSchedule.begin();
// Did we find the request?
if (pScheduleIter == mRequestSchedule.end())
{
// No
return;
}
// Yes, grab the request ID
ULONG reqID = pScheduleIter->second;
// Remove from schedule
mRequestSchedule.erase( pScheduleIter );
// Look up the internal request object
std::map <ULONG, sProtocolReqRsp *>::iterator pReqIter;
pReqIter = mRequestMap.find( reqID );
// Request not found around?
if (pReqIter == mRequestMap.end() || pReqIter->second == 0)
{
// No
return;
}
// Set this request as the active request
mpActiveRequest = pReqIter->second;
TRACE( "ProcessRequest(): req %lu started\n", mpActiveRequest->mID );
// Remove request from pending request map
mRequestMap.erase( pReqIter );
// Extract the underlying request
const sProtocolRequest & req = mpActiveRequest->mRequest;
// Increment attempt count?
if (req.GetRequests() != INFINITE_REQS)
{
// This request isn't an indefinite one, so keep track of each attempt
mpActiveRequest->mAttempts++;
}
bool bTxSuccess = false;
// Encode data for transmission?
bool bEncoded = false;
sSharedBuffer * pEncoded = 0;
pEncoded = EncodeTxData( req.GetSharedBuffer(), bEncoded );
if (bEncoded == false)
{
// Note: no longer asynchronus
// Send the request data
bTxSuccess = mpConnection->TxData( req.GetBuffer(),
req.GetSize() );
}
else if (bEncoded == true)
{
if (pEncoded != 0 && pEncoded->IsValid() == true)
{
// Note: no longer asynchronus
// Send the request data
mpActiveRequest->mEncodedSize = pEncoded->GetSize();
bTxSuccess = mpConnection->TxData( pEncoded->GetBuffer(),
pEncoded->GetSize() );
}
}
if (bTxSuccess == true)
{
TRACE( "ProcessRequest(): req %lu finished\n", mpActiveRequest->mID );
TxComplete();
}
else
{
TxError();
TRACE( "ProcessRequest(): req finished with a TxError\n" );
}
return;
}
/*===========================================================================
METHOD:
CheckSystemTime (Internal Method)
DESCRIPTION:
Check that system time hasn't moved backwards. Since we use the system
time for scheduling requests we need to periodically check that the
user (or system itself) hasn't reset system time backwards, if it has
then we reschedule everything to the current system time. This disrupts
the schedule but avoids stranding requests
Updates mLastTime
SEQUENCING:
Calling process must have lock on mScheduleMutex
RETURN VALUE:
bool: System time moved backwards?
===========================================================================*/
bool cProtocolServer::CheckSystemTime()
{
// Assume that time is still marching forward
bool bAdjust = false;
timespec curTime = TimeIn( 0 );
if (curTime < mLastTime)
{
// Looks like the system clock has been adjusted to an earlier
// value, go through the current schedule and adjust each timer
// to reflect the adjustment. This isn't an exact approach but
// it prevents requests from being stranded which is our goal
// Note: set iterators are constant. This means we need to
// create a set with the new data, we can't modify this one
std::set < tSchedule, std::less <tSchedule> > tempSchedule;
std::set <tSchedule>::iterator pScheduleIter;
pScheduleIter = mRequestSchedule.begin();
while (pScheduleIter != mRequestSchedule.end())
{
tSchedule entry = *pScheduleIter;
entry.first.tv_sec = curTime.tv_sec;
entry.first.tv_nsec = curTime.tv_nsec;
tempSchedule.insert( entry );
pScheduleIter++;
}
mRequestSchedule = tempSchedule;
// Update mActiveRequestTimeout
if ( (mpActiveRequest != 0)
&& (mpActiveRequest->mbWaitingForResponse == true) )
{
// Restart active request's timeout
ULONG mTimeout = mpActiveRequest->mRequest.GetTimeout();
mActiveRequestTimeout = TimeIn( mTimeout );
}
TRACE( "Time has moved backwards, schedule updated\n" );
// Indicate the change
bAdjust = true;
}
mLastTime.tv_sec = curTime.tv_sec;
mLastTime.tv_nsec = curTime.tv_nsec;
return bAdjust;
}
/*===========================================================================
METHOD:
RxComplete (Internal Method)
DESCRIPTION:
Handle completion of receive data operation
PARAMETERS:
status [ I ] - Status of operation
bytesReceived [ I ] - Number of bytes received
SEQUENCING:
This method is sequenced according to the schedule mutex
i.e. any other thread that needs to modify the schedule
will block until this method completes
RETURN VALUE:
None
===========================================================================*/
void cProtocolServer::RxComplete(
DWORD status,
DWORD bytesReceived )
{
if (status != NO_ERROR)
{
TRACE( "cProtocolServer::RxComplete() = %lu\n", status );
}
if (mpConnection == 0)
{
TRACE( "cProtocolServer::RxComplete() - Not initialized\n" );
return;
}
// Error with the read
if (status != NO_ERROR || bytesReceived == 0)
{
// Setup the next read
mpConnection->RxData( mpRxBuffer,
(ULONG)mRxBufferSize,
(cIOCallback *)&mRxCallback );
return;
}
// Get Schedule Mutex
if (GetScheduleMutex() == false)
{
TRACE( "RxComplete(), unable to get schedule Mutex\n" );
return;
}
TRACE( "RxComplete() - Entry at %llu\n", GetTickCount() );
// Decode data
bool bAbortTx = false;
ULONG rspIdx = INVALID_LOG_INDEX;
bool bRsp = DecodeRxData( bytesReceived, rspIdx, bAbortTx );
// Is there an active request that needs to be aborted
if (mpActiveRequest != 0 && bAbortTx == true)
{
// Yes, terminate the transmission and handle the error
mpConnection->CancelTx();
TxError();
}
// Is there an active request and a valid response?
else if (mpActiveRequest != 0 && bRsp == true)
{
const sProtocolRequest & req = mpActiveRequest->mRequest;
const cProtocolNotification * pNotifier = req.GetNotifier();
// Notify client that response was received
if (pNotifier != 0)
{
pNotifier->Notify( ePROTOCOL_EVT_RSP_RECV,
(DWORD)mpActiveRequest->mID,
(DWORD)rspIdx );
}
// Reschedule request as needed
RescheduleActiveRequest();
}
// Setup the next read
mpConnection->RxData( mpRxBuffer,
(ULONG)mRxBufferSize,
(cIOCallback *)&mRxCallback );
TRACE( "RxComplete() - Exit at %llu\n", GetTickCount() );
// Unlock schedule mutex
if (ReleaseScheduleMutex() == false)
{
// This should never happen
return;
}
return;
}
/*===========================================================================
METHOD:
RxTimeout (Internal Method)
DESCRIPTION:
Handle the response timer expiring
SEQUENCING:
Calling process must have lock on mScheduleMutex
RETURN VALUE:
None
===========================================================================*/
void cProtocolServer::RxTimeout()
{
// No active request?
if (mpActiveRequest == 0)
{
TRACE( "RxTimeout() with no active request\n" );
ASSERT( 0 );
}
TRACE( "RxTimeout() for req %lu\n", mpActiveRequest->mID );
const sProtocolRequest & req = mpActiveRequest->mRequest;
const cProtocolNotification * pNotifier = req.GetNotifier();
// Failure to receive response, notify client
if (pNotifier != 0)
{
pNotifier->Notify( ePROTOCOL_EVT_RSP_ERR,
(DWORD)mpActiveRequest->mID,
(DWORD)0 );
}
// Reschedule request as needed
RescheduleActiveRequest();
}
/*===========================================================================
METHOD:
TxComplete (Internal Method)
DESCRIPTION:
Handle completion of transmit data operation
PARAMETERS:
SEQUENCING:
Calling process must have lock on mScheduleMutex
RETURN VALUE:
None
===========================================================================*/
void cProtocolServer::TxComplete()
{
// No active request?
if (mpActiveRequest == 0 || mpConnection == 0)
{
TRACE( "TxComplete() called with no active request\n" );
ASSERT( 0 );
}
TRACE( "TxComplete() req %lu started\n", mpActiveRequest->mID );
ULONG reqID = mpActiveRequest->mID;
const sProtocolRequest & req = mpActiveRequest->mRequest;
const cProtocolNotification * pNotifier = req.GetNotifier();
// Notify client of auxiliary data being sent?
if (mpActiveRequest->mRequiredAuxTxs && mpActiveRequest->mCurrentAuxTx)
{
pNotifier->Notify( ePROTOCOL_EVT_AUX_TU_SENT,
(DWORD)reqID,
(DWORD)mpActiveRequest->mEncodedSize );
}
// Check for more auxiliary data to transmit
if (mpActiveRequest->mCurrentAuxTx < mpActiveRequest->mRequiredAuxTxs)
{
ULONG auxDataSz = 0;
const BYTE * pAuxData = req.GetAuxiliaryData( auxDataSz );
if (auxDataSz > 0 && pAuxData != 0)
{
bool bRC = false;
// Adjust for current MTU
pAuxData += (mpActiveRequest->mCurrentAuxTx * MAX_AUX_MTU_SIZE);
mpActiveRequest->mCurrentAuxTx++;
// Last MTU?
if (mpActiveRequest->mCurrentAuxTx == mpActiveRequest->mRequiredAuxTxs)
{
// More than one MTU?
if (mpActiveRequest->mRequiredAuxTxs > 1)
{
auxDataSz = (auxDataSz % MAX_AUX_MTU_SIZE);
if (auxDataSz == 0)
{
auxDataSz = MAX_AUX_MTU_SIZE;
}
}
if (auxDataSz % MAX_PACKET_SIZE == 0)
{
// If last write of unframed write request is divisible
// by 512, break off last byte and send seperatly.
TRACE( "TxComplete() Special case, break off last byte\n" );
bRC = mpConnection->TxData( pAuxData,
auxDataSz - 1 );
if (bRC == true)
{
bRC = mpConnection->TxData( pAuxData + auxDataSz -1,
1 );
}
}
else
{
bRC = mpConnection->TxData( pAuxData,
auxDataSz );
}
}
else if (mpActiveRequest->mRequiredAuxTxs > 1)
{
auxDataSz = MAX_AUX_MTU_SIZE;
bRC = mpConnection->TxData( pAuxData,
auxDataSz );
}
if (bRC == true)
{
mpActiveRequest->mEncodedSize = auxDataSz;
TxComplete();
}
else
{
TxError();
}
return;
}
}
// Another successful transmission, add the buffer to the log
ULONG reqIdx = INVALID_LOG_INDEX;
sProtocolBuffer pb( req.GetSharedBuffer() );
reqIdx = mLog.AddBuffer( pb );
// Notify client?
if (pNotifier != 0)
{
pNotifier->Notify( ePROTOCOL_EVT_REQ_SENT, (DWORD)reqID, (DWORD)reqIdx );
}
// Wait for a response?
if (mpActiveRequest->mRequest.IsTXOnly() == false)
{
// We now await the response
mpActiveRequest->mbWaitingForResponse = true;
mActiveRequestTimeout = TimeIn( mpActiveRequest->mRequest.GetTimeout() );
}
else
{
// Reschedule request as needed
RescheduleActiveRequest();
}
}
/*===========================================================================
METHOD:
TxError (Internal Method)
DESCRIPTION:
Handle transmit data operation error be either rescheduling the
request or cleaning it up
SEQUENCING:
Calling process must have lock on mScheduleMutex
RETURN VALUE:
None
===========================================================================*/
void cProtocolServer::TxError()
{
// No active request?
if (mpActiveRequest == 0)
{
return;
}
ULONG reqID = mpActiveRequest->mID;
const sProtocolRequest & req = mpActiveRequest->mRequest;
const cProtocolNotification * pNotifier = req.GetNotifier();
// Failure to send request, notify client
if (pNotifier != 0)
{
pNotifier->Notify( ePROTOCOL_EVT_REQ_ERR, (DWORD)reqID, (DWORD)0 );
}
// Reschedule request as needed
RescheduleActiveRequest();
}
/*===========================================================================
METHOD:
Initialize (Public Method)
DESCRIPTION:
Initialize the protocol server by starting up the schedule thread
SEQUENCING:
This method is sequenced according to the schedule mutex, i.e. any
other thread that needs to modify the schedule will block until
this method completes
RETURN VALUE:
bool
===========================================================================*/
bool cProtocolServer::Initialize()
{
// Assume failure
bool bRC = false;
mbExiting = false;
// Get mScheduleMutex
if (GetScheduleMutex() == true)
{
if (mScheduleThreadID == 0)
{
// Yes, start thread
int nRet = pthread_create( &mScheduleThreadID,
NULL,
ScheduleThread,
this );
if (nRet == 0)
{
// Success!
bRC = true;
}
}
}
else
{
TRACE( "cProtocolServer::Initialize(), unable to aquire ScheduleMutex\n" );
return false;
}
// Unlock schedule mutex
if (ReleaseScheduleMutex() == false)
{
// This should never happen
return false;
}
return bRC;
}
/*===========================================================================
METHOD:
Exit (Public Method)
DESCRIPTION:
Exit the protocol server by exiting the schedule thread (if necessary)
SEQUENCING:
This method is sequenced according to the schedule mutex, i.e. any
other thread that needs to modify the schedule will block until
this method completes
RETURN VALUE:
bool
===========================================================================*/
bool cProtocolServer::Exit()
{
// Assume failure
bool bRC = false;
if (mScheduleThreadID != 0)
{
if (GetScheduleMutex() == false)
{
// This should never happen
return false;
}
// Check that mScheduleTheadID is still not 0
if (mScheduleThreadID == 0)
{
printf( "mScheduleThreadID was zero!!!\n" );
ReleaseScheduleMutex( false );
return false;
}
// Set exit event
mbExiting = true;
// Signal a schedule update
if (mThreadScheduleEvent.Set( 1 ) != 0)
{
// This should never happen
return false;
}
TRACE( "Joining ScheduleThread %lu\n", mScheduleThreadID );
// Allow process to continue until it finishes
int nRet = pthread_join( mScheduleThreadID, NULL );
if (nRet == ESRCH)
{
TRACE( "ScheduleThread has exited already\n" );
}
else if (nRet != 0)
{
TRACE( "Unable to join ScheduleThread. Error %d: %s\n",
nRet,
strerror( nRet ) );
return false;
}
TRACE( "cProtocolServer::Exit(), completed thread %lu\n",
(ULONG)mScheduleThreadID );
bRC = true;
// Release "handle"
mScheduleThreadID = 0;
// Release mutex lock, don't signal ScheduleThread
if (ReleaseScheduleMutex( false ) == false)
{
// This should never happen
return false;
}
}
else
{
// No ScheduleThread
bRC = true;
}
// Free any allocated requests
std::map <ULONG, sProtocolReqRsp *>::iterator pReqIter;
pReqIter = mRequestMap.begin();
while (pReqIter != mRequestMap.end())
{
sProtocolReqRsp * pReqRsp = pReqIter->second;
if (pReqRsp != 0)
{
delete pReqRsp;
}
pReqIter++;
}
mRequestMap.clear();
// Free log
mLog.Clear();
return bRC;
}
/*===========================================================================
METHOD:
Connect (Public Method)
DESCRIPTION:
Connect to the given communications port
PARAMETERS:
pPort [ I ] - String pointer representing the device node to
connect to (IE: /dev/qcqmi0)
SEQUENCING:
None
RETURN VALUE:
bool
===========================================================================*/
bool cProtocolServer::Connect( LPCSTR pPort )
{
// Assume failure
bool bRC = false;
if (pPort == 0 || pPort[0] == 0 || mpConnection == 0)
{
return bRC;
}
// Connect to device
// Set callback
mRxCallback.SetServer( this );
// Override to initialize port with protocol specific options
bRC = mpConnection->Connect( pPort );
if (bRC == true)
{
bRC = InitializeComm();
if (bRC == true)
{
// Setup the initial read
mpConnection->RxData( mpRxBuffer,
(ULONG)mRxBufferSize,
(cIOCallback *)&mRxCallback );
}
}
return bRC;
}
/*===========================================================================
METHOD:
Disconnect (Public Method)
DESCRIPTION:
Disconnect from the current communications port
SEQUENCING:
None
RETURN VALUE:
bool
===========================================================================*/
bool cProtocolServer::Disconnect()
{
// Disconnect
if (mpConnection != 0)
{
// Cancel any outstanding I/O
mpConnection->CancelIO();
}
// Empty callback
mRxCallback.SetServer( 0 );
// Cleanup COM port
CleanupComm();
if (mpConnection != 0)
{
// Now disconnect
bool bDis = mpConnection->Disconnect();
delete mpConnection;
return bDis;
}
else
{
return true;
}
}
/*===========================================================================
METHOD:
IsConnected (Public Method)
DESCRIPTION:
Are we currently connected to a port?
SEQUENCING:
None
RETURN VALUE:
bool
===========================================================================*/
bool cProtocolServer::IsConnected()
{
return (mpConnection != 0 && mpConnection->IsConnected());
}
/*===========================================================================
METHOD:
AddRequest (Public Method)
DESCRIPTION:
Add an outgoing protocol request to the protocol server request queue
PARAMETERS:
req [ I ] - Request being added
SEQUENCING:
This method is sequenced according to the schedule mutex, i.e. any
other thread that needs to modify the schedule will block until
this method completes
RETURN VALUE:
ULONG - ID of scheduled request (INVALID_REQUEST_ID upon error)
===========================================================================*/
ULONG cProtocolServer::AddRequest( const sProtocolRequest & req )
{
// Assume failure
ULONG reqID = INVALID_REQUEST_ID;
// Server not configured for sending requests?
if (IsValid( mTxType ) == false)
{
return reqID;
}
// Request type not valid for server?
if (req.GetType() != mTxType)
{
return reqID;
}
// Invalide request?
if (ValidateRequest( req ) == false)
{
return reqID;
}
// Get mScheduleMutex
if (GetScheduleMutex() == true)
{
TRACE( "AddRequest() - Entry at %llu\n", GetTickCount() );
// Grab next available request ID
if (++mLastRequestID == 0)
{
mLastRequestID++;
}
reqID = mLastRequestID;
while (mRequestMap.find( reqID ) != mRequestMap.end())
{
reqID++;
}
// Wrap in our internal structure
sProtocolReqRsp * pReqRsp = 0;
pReqRsp = new sProtocolReqRsp( req, reqID, MAX_AUX_MTU_SIZE );
if (pReqRsp != 0)
{
// Add to request map
mRequestMap[reqID] = pReqRsp;
// ... and schedule
ScheduleRequest( reqID, req.GetSchedule() );
}
TRACE( "AddRequest() - Exit at %llu\n", GetTickCount() );
// Unlock schedule mutex
if (ReleaseScheduleMutex() == false)
{
// This should never happen
return INVALID_REQUEST_ID;
}
}
else
{
TRACE( "cProtocolServer::AddRequest(), unable to get schedule Mutex\n" );
}
return reqID;
}
/*===========================================================================
METHOD:
RemoveRequest (Public Method)
DESCRIPTION:
Remove a previously added protocol request
SEQUENCING:
This method is sequenced according to the schedule mutex, i.e. any
other thread that needs to modify the schedule will block until
this method completes
Note: If a request is being written, it cannot be inturrupted as
both ProcessRequest and RemoveRequest depend on the ScheduleMutex
and the write is synchronus. If the request has been written but
the read has not been triggered it can be removed.
PARAMETERS:
reqID [ I ] - ID of request being removed
RETURN VALUE:
bool
===========================================================================*/
bool cProtocolServer::RemoveRequest( ULONG reqID )
{
// Assume failure
bool bRC = false;
// Get Schedule Mutex
if (GetScheduleMutex() == true)
{
TRACE( "RemoveRequest() - Entry at %llu\n", GetTickCount() );
bRC = HandleRemoveRequest( reqID );
TRACE( "RemoveRequest() - Exit at %llu\n", GetTickCount() );
// Unlock schedule mutex
if (ReleaseScheduleMutex() == false)
{
// This should never happen
return false;
}
}
else
{
TRACE( "cProtocolServer::RemoveRequest(), unable to get mScheduleMutex\n" );
}
return bRC;
}
/*===========================================================================
METHOD:
GetScheduleMutex (Internal Method)
DESCRIPTION:
Get the schedule mutex. Additionally a check is applied to verify the
DEADLOCK_TIME was not exceeded
SEQUENCING:
This function will block until the mScheduleMutex is aquired
PARAMETERS:
RETURN VALUE:
bool
===========================================================================*/
bool cProtocolServer::GetScheduleMutex()
{
ULONGLONG nStart = GetTickCount();
//TRACE( "Locking Schedule mutex\n" );
int nRet = pthread_mutex_lock( &mScheduleMutex );
if (nRet != 0)
{
TRACE( "Unable to lock schedule mutex. Error %d: %s\n",
nRet,
strerror( nRet ) );
return false;
}
ULONGLONG nEnd = GetTickCount();
if (nEnd - nStart > DEADLOCK_TIME)
{
TRACE( "Deadlock time exceeded: took %llu ms\n", nEnd - nStart );
ReleaseScheduleMutex( true );
return false;
}
//TRACE( "Locked ScheduleMutex\n" );
return true;
}
/*===========================================================================
METHOD:
ReleaseScheduleMutex (Internal Method)
DESCRIPTION:
Release lock on the schedule mutex
SEQUENCING:
Calling process must have lock
PARAMETERS:
bSignalThread [ I ] - Signal Schedule thread as well?
RETURN VALUE:
bool
===========================================================================*/
bool cProtocolServer::ReleaseScheduleMutex( bool bSignalThread )
{
if (bSignalThread == true)
{
if (mThreadScheduleEvent.Set( 1 ) != 0)
{
return false;
}
}
int nRet = pthread_mutex_unlock( &mScheduleMutex );
if (nRet != 0)
{
TRACE( "Unable to unlock schedule mutex. Error %d: %s\n",
nRet,
strerror( nRet ) );
return false;
}
return true;
}
|