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
|
// $Id$
#include "ace/Select_Reactor_Base.h"
#include "ace/Reactor.h"
#include "ace/Thread.h"
#include "ace/SOCK_Acceptor.h"
#include "ace/SOCK_Connector.h"
#include "ace/Timer_Queue.h"
#include "ace/Log_Msg.h"
#include "ace/Signal.h"
#include "ace/OS_NS_fcntl.h"
#if !defined (__ACE_INLINE__)
#include "ace/Select_Reactor_Base.inl"
#endif /* __ACE_INLINE__ */
ACE_RCSID (ace,
Select_Reactor_Base,
"$Id$")
ACE_BEGIN_VERSIONED_NAMESPACE_DECL
#if defined (ACE_WIN32)
#define ACE_SELECT_REACTOR_HANDLE(H) (this->event_handlers_[(H)].handle_)
#define ACE_SELECT_REACTOR_EVENT_HANDLER(THIS,H) ((THIS)->event_handlers_[(H)].event_handler_)
#else
#define ACE_SELECT_REACTOR_HANDLE(H) (H)
#define ACE_SELECT_REACTOR_EVENT_HANDLER(THIS,H) ((THIS)->event_handlers_[(H)])
#endif /* ACE_WIN32 */
// Performs sanity checking on the ACE_HANDLE.
int
ACE_Select_Reactor_Handler_Repository::invalid_handle (ACE_HANDLE handle)
{
ACE_TRACE ("ACE_Select_Reactor_Handler_Repository::invalid_handle");
#if defined (ACE_WIN32)
// It's too expensive to perform more exhaustive validity checks on
// Win32 due to the way that they implement SOCKET HANDLEs.
if (handle == ACE_INVALID_HANDLE)
#else /* !ACE_WIN32 */
if (handle < 0 || handle >= this->max_size_)
#endif /* ACE_WIN32 */
{
errno = EINVAL;
return 1;
}
else
return 0;
}
// Performs sanity checking on the ACE_HANDLE.
int
ACE_Select_Reactor_Handler_Repository::handle_in_range (ACE_HANDLE handle)
{
ACE_TRACE ("ACE_Select_Reactor_Handler_Repository::handle_in_range");
#if defined (ACE_WIN32)
// It's too expensive to perform more exhaustive validity checks on
// Win32 due to the way that they implement SOCKET HANDLEs.
if (handle != ACE_INVALID_HANDLE)
#else /* !ACE_WIN32 */
if (handle >= 0 && handle < this->max_handlep1_)
#endif /* ACE_WIN32 */
return 1;
else
{
errno = EINVAL;
return 0;
}
}
size_t
ACE_Select_Reactor_Handler_Repository::max_handlep1 (void)
{
ACE_TRACE ("ACE_Select_Reactor_Handler_Repository::max_handlep1");
return this->max_handlep1_;
}
int
ACE_Select_Reactor_Handler_Repository::open (size_t size)
{
ACE_TRACE ("ACE_Select_Reactor_Handler_Repository::open");
this->max_size_ = size;
this->max_handlep1_ = 0;
#if defined (ACE_WIN32)
// Try to allocate the memory.
ACE_NEW_RETURN (this->event_handlers_,
ACE_Event_Tuple[size],
-1);
// Initialize the ACE_Event_Handler * to { ACE_INVALID_HANDLE, 0 }.
for (size_t h = 0; h < size; ++h)
{
ACE_SELECT_REACTOR_HANDLE (h) = ACE_INVALID_HANDLE;
ACE_SELECT_REACTOR_EVENT_HANDLER (this, h) = 0;
}
#else
// Try to allocate the memory.
ACE_NEW_RETURN (this->event_handlers_,
ACE_Event_Handler *[size],
-1);
// Initialize the ACE_Event_Handler * to NULL.
for (size_t h = 0; h < size; ++h)
ACE_SELECT_REACTOR_EVENT_HANDLER (this, h) = 0;
#endif /* ACE_WIN32 */
// Try to increase the number of handles if <size> is greater than
// the current limit.
return ACE::set_handle_limit (static_cast<int> (size), 1);
}
// Initialize a repository of the appropriate <size>.
ACE_Select_Reactor_Handler_Repository::ACE_Select_Reactor_Handler_Repository (ACE_Select_Reactor_Impl &select_reactor)
: select_reactor_ (select_reactor),
max_size_ (0),
max_handlep1_ (0),
event_handlers_ (0)
{
ACE_TRACE ("ACE_Select_Reactor_Handler_Repository::ACE_Select_Reactor_Handler_Repository");
}
int
ACE_Select_Reactor_Handler_Repository::unbind_all (void)
{
// Unbind all of the <handle, ACE_Event_Handler>s.
for (int slot = 0;
slot < this->max_handlep1_;
++slot)
this->unbind (ACE_SELECT_REACTOR_HANDLE (slot),
ACE_Event_Handler::ALL_EVENTS_MASK);
return 0;
}
int
ACE_Select_Reactor_Handler_Repository::close (void)
{
ACE_TRACE ("ACE_Select_Reactor_Handler_Repository::close");
if (this->event_handlers_ != 0)
{
this->unbind_all ();
delete [] this->event_handlers_;
this->event_handlers_ = 0;
}
return 0;
}
// Return the <ACE_Event_Handler *> associated with the <handle>.
ACE_Event_Handler *
ACE_Select_Reactor_Handler_Repository::find (ACE_HANDLE handle,
size_t *index_p)
{
ACE_TRACE ("ACE_Select_Reactor_Handler_Repository::find");
ACE_Event_Handler *eh = 0;
ssize_t i;
// Only bother to search for the <handle> if it's in range.
if (this->handle_in_range (handle))
{
#if defined (ACE_WIN32)
i = 0;
for (; i < this->max_handlep1_; ++i)
if (ACE_SELECT_REACTOR_HANDLE (i) == handle)
{
eh = ACE_SELECT_REACTOR_EVENT_HANDLER (this, i);
break;
}
#else
i = handle;
eh = ACE_SELECT_REACTOR_EVENT_HANDLER (this, handle);
#endif /* ACE_WIN32 */
}
else
// g++ can't figure out that <i> won't be used below if the handle
// is out of range, so keep it happy by defining <i> here . . .
i = 0;
if (eh != 0)
{
if (index_p != 0)
*index_p = i;
}
else
errno = ENOENT;
return eh;
}
// Bind the <ACE_Event_Handler *> to the <ACE_HANDLE>.
int
ACE_Select_Reactor_Handler_Repository::bind (ACE_HANDLE handle,
ACE_Event_Handler *event_handler,
ACE_Reactor_Mask mask)
{
ACE_TRACE ("ACE_Select_Reactor_Handler_Repository::bind");
if (handle == ACE_INVALID_HANDLE)
handle = event_handler->get_handle ();
if (this->invalid_handle (handle))
return -1;
// Is this handle already in the Reactor?
int existing_handle = 0;
#if defined (ACE_WIN32)
ssize_t assigned_slot = -1;
for (ssize_t i = 0; i < this->max_handlep1_; ++i)
{
// If handle is already registered.
if (ACE_SELECT_REACTOR_HANDLE (i) == handle)
{
// Cannot use a different handler for an existing handle.
if (ACE_SELECT_REACTOR_EVENT_HANDLER (this, i) !=
event_handler)
return -1;
// Remember location.
assigned_slot = i;
// Remember that this handle is already registered in the
// Reactor.
existing_handle = 1;
// We can stop looking now.
break;
}
else
// Here's the first free slot, so let's take it.
if (ACE_SELECT_REACTOR_HANDLE (i) == ACE_INVALID_HANDLE &&
assigned_slot == -1)
{
assigned_slot = i;
}
}
if (assigned_slot > -1)
// We found a spot.
{
ACE_SELECT_REACTOR_HANDLE (assigned_slot) = handle;
ACE_SELECT_REACTOR_EVENT_HANDLER (this, assigned_slot) = event_handler;
}
else if (this->max_handlep1_ < this->max_size_)
{
// Insert at the end of the active portion.
ACE_SELECT_REACTOR_HANDLE (this->max_handlep1_) = handle;
ACE_SELECT_REACTOR_EVENT_HANDLER (this, this->max_handlep1_) = event_handler;
++this->max_handlep1_;
}
else
{
// No more room at the inn!
errno = ENOMEM;
return -1;
}
#else
// Check if this handle is already registered.
ACE_Event_Handler *current_handler =
ACE_SELECT_REACTOR_EVENT_HANDLER (this, handle);
if (current_handler)
{
// Cannot use a different handler for an existing handle.
if (current_handler != event_handler)
return -1;
// Remember that this handle is already registered in the
// Reactor.
existing_handle = 1;
}
ACE_SELECT_REACTOR_EVENT_HANDLER (this, handle) = event_handler;
if (this->max_handlep1_ < handle + 1)
this->max_handlep1_ = handle + 1;
#endif /* ACE_WIN32 */
if (this->select_reactor_.is_suspended_i (handle))
{
this->select_reactor_.bit_ops (handle,
mask,
this->select_reactor_.suspend_set_,
ACE_Reactor::ADD_MASK);
}
else
{
this->select_reactor_.bit_ops (handle,
mask,
this->select_reactor_.wait_set_,
ACE_Reactor::ADD_MASK);
// Note the fact that we've changed the state of the <wait_set_>,
// which is used by the dispatching loop to determine whether it can
// keep going or if it needs to reconsult select().
// this->select_reactor_.state_changed_ = 1;
}
// If new entry, call add_reference() if needed.
if (!existing_handle)
event_handler->add_reference ();
return 0;
}
// Remove the binding of <ACE_HANDLE>.
int
ACE_Select_Reactor_Handler_Repository::unbind (ACE_HANDLE handle,
ACE_Reactor_Mask mask)
{
ACE_TRACE ("ACE_Select_Reactor_Handler_Repository::unbind");
size_t slot = 0;
ACE_Event_Handler *event_handler = this->find (handle, &slot);
if (event_handler == 0)
return -1;
// Clear out the <mask> bits in the Select_Reactor's wait_set.
this->select_reactor_.bit_ops (handle,
mask,
this->select_reactor_.wait_set_,
ACE_Reactor::CLR_MASK);
// And suspend_set.
this->select_reactor_.bit_ops (handle,
mask,
this->select_reactor_.suspend_set_,
ACE_Reactor::CLR_MASK);
// Note the fact that we've changed the state of the <wait_set_>,
// which is used by the dispatching loop to determine whether it can
// keep going or if it needs to reconsult select().
// this->select_reactor_.state_changed_ = 1;
// If there are no longer any outstanding events on this <handle>
// then we can totally shut down the Event_Handler.
int has_any_wait_mask =
(this->select_reactor_.wait_set_.rd_mask_.is_set (handle)
|| this->select_reactor_.wait_set_.wr_mask_.is_set (handle)
|| this->select_reactor_.wait_set_.ex_mask_.is_set (handle));
int has_any_suspend_mask =
(this->select_reactor_.suspend_set_.rd_mask_.is_set (handle)
|| this->select_reactor_.suspend_set_.wr_mask_.is_set (handle)
|| this->select_reactor_.suspend_set_.ex_mask_.is_set (handle));
int complete_removal = 0;
if (!has_any_wait_mask && !has_any_suspend_mask)
{
// The handle has been completed removed.
complete_removal = 1;
ACE_SELECT_REACTOR_EVENT_HANDLER (this, slot) = 0;
#if defined (ACE_WIN32)
ACE_SELECT_REACTOR_HANDLE (slot) = ACE_INVALID_HANDLE;
if (this->max_handlep1_ == (int) slot + 1)
{
// We've deleted the last entry (i.e., i + 1 == the current
// size of the array), so we need to figure out the last
// valid place in the array that we should consider in
// subsequent searches.
int i;
for (i = this->max_handlep1_ - 1;
i >= 0 && ACE_SELECT_REACTOR_HANDLE (i) == ACE_INVALID_HANDLE;
--i)
continue;
this->max_handlep1_ = i + 1;
}
#else
if (this->max_handlep1_ == handle + 1)
{
// We've deleted the last entry, so we need to figure out
// the last valid place in the array that is worth looking
// at.
ACE_HANDLE wait_rd_max =
this->select_reactor_.wait_set_.rd_mask_.max_set ();
ACE_HANDLE wait_wr_max =
this->select_reactor_.wait_set_.wr_mask_.max_set ();
ACE_HANDLE wait_ex_max =
this->select_reactor_.wait_set_.ex_mask_.max_set ();
ACE_HANDLE suspend_rd_max =
this->select_reactor_.suspend_set_.rd_mask_.max_set ();
ACE_HANDLE suspend_wr_max =
this->select_reactor_.suspend_set_.wr_mask_.max_set ();
ACE_HANDLE suspend_ex_max =
this->select_reactor_.suspend_set_.ex_mask_.max_set ();
// Compute the maximum of six values.
this->max_handlep1_ = wait_rd_max;
if (this->max_handlep1_ < wait_wr_max)
this->max_handlep1_ = wait_wr_max;
if (this->max_handlep1_ < wait_ex_max)
this->max_handlep1_ = wait_ex_max;
if (this->max_handlep1_ < suspend_rd_max)
this->max_handlep1_ = suspend_rd_max;
if (this->max_handlep1_ < suspend_wr_max)
this->max_handlep1_ = suspend_wr_max;
if (this->max_handlep1_ < suspend_ex_max)
this->max_handlep1_ = suspend_ex_max;
++this->max_handlep1_;
}
#endif /* ACE_WIN32 */
}
int requires_reference_counting =
event_handler->reference_counting_policy ().value () ==
ACE_Event_Handler::Reference_Counting_Policy::ENABLED;
// Close down the <Event_Handler> unless we've been instructed not
// to.
if (ACE_BIT_ENABLED (mask, ACE_Event_Handler::DONT_CALL) == 0)
event_handler->handle_close (handle, mask);
// Call remove_reference() if the removal is complete and reference
// counting is needed.
if (complete_removal && requires_reference_counting)
{
event_handler->remove_reference ();
}
return 0;
}
ACE_Select_Reactor_Handler_Repository_Iterator::ACE_Select_Reactor_Handler_Repository_Iterator
(const ACE_Select_Reactor_Handler_Repository *s)
: rep_ (s),
current_ (-1)
{
this->advance ();
}
// Pass back the <next_item> that hasn't been seen in the Set.
// Returns 0 when all items have been seen, else 1.
int
ACE_Select_Reactor_Handler_Repository_Iterator::next (ACE_Event_Handler *&next_item)
{
int result = 1;
if (this->current_ >= this->rep_->max_handlep1_)
result = 0;
else
next_item = ACE_SELECT_REACTOR_EVENT_HANDLER (this->rep_,
this->current_);
return result;
}
int
ACE_Select_Reactor_Handler_Repository_Iterator::done (void) const
{
return this->current_ >= this->rep_->max_handlep1_;
}
// Move forward by one element in the set.
int
ACE_Select_Reactor_Handler_Repository_Iterator::advance (void)
{
if (this->current_ < this->rep_->max_handlep1_)
++this->current_;
while (this->current_ < this->rep_->max_handlep1_)
if (ACE_SELECT_REACTOR_EVENT_HANDLER (this->rep_, this->current_) != 0)
return 1;
else
++this->current_;
return this->current_ < this->rep_->max_handlep1_;
}
// Dump the state of an object.
void
ACE_Select_Reactor_Handler_Repository_Iterator::dump (void) const
{
#if defined (ACE_HAS_DUMP)
ACE_TRACE ("ACE_Select_Reactor_Handler_Repository_Iterator::dump");
ACE_DEBUG ((LM_DEBUG, ACE_BEGIN_DUMP, this));
ACE_DEBUG ((LM_DEBUG, ACE_LIB_TEXT ("rep_ = %u"), this->rep_));
ACE_DEBUG ((LM_DEBUG, ACE_LIB_TEXT ("current_ = %d"), this->current_));
ACE_DEBUG ((LM_DEBUG, ACE_END_DUMP));
#endif /* ACE_HAS_DUMP */
}
void
ACE_Select_Reactor_Handler_Repository::dump (void) const
{
#if defined (ACE_HAS_DUMP)
ACE_TRACE ("ACE_Select_Reactor_Handler_Repository::dump");
ACE_DEBUG ((LM_DEBUG, ACE_BEGIN_DUMP, this));
ACE_DEBUG ((LM_DEBUG,
ACE_LIB_TEXT ("max_handlep1_ = %d, max_size_ = %d\n"),
this->max_handlep1_, this->max_size_));
ACE_DEBUG ((LM_DEBUG, ACE_LIB_TEXT ("[")));
ACE_Event_Handler *event_handler = 0;
for (ACE_Select_Reactor_Handler_Repository_Iterator iter (this);
iter.next (event_handler) != 0;
iter.advance ())
ACE_DEBUG ((LM_DEBUG, ACE_LIB_TEXT (" (event_handler = %x, event_handler->handle_ = %d)\n"),
event_handler, event_handler->get_handle ()));
ACE_DEBUG ((LM_DEBUG, ACE_LIB_TEXT (" ]\n")));
ACE_DEBUG ((LM_DEBUG, ACE_END_DUMP));
#endif /* ACE_HAS_DUMP */
}
ACE_ALLOC_HOOK_DEFINE(ACE_Select_Reactor_Handler_Repository_Iterator)
ACE_Select_Reactor_Notify::ACE_Select_Reactor_Notify (void)
: max_notify_iterations_ (-1)
{
}
ACE_Select_Reactor_Notify::~ACE_Select_Reactor_Notify (void)
{
}
void
ACE_Select_Reactor_Notify::max_notify_iterations (int iterations)
{
// Must always be > 0 or < 0 to optimize the loop exit condition.
if (iterations == 0)
iterations = 1;
this->max_notify_iterations_ = iterations;
}
int
ACE_Select_Reactor_Notify::max_notify_iterations (void)
{
return this->max_notify_iterations_;
}
// purge_pending_notifications
// Removes all entries from the notify_queue_ and each one that
// matches <eh> is put on the free_queue_. The rest are saved on a
// local queue and copied back to the notify_queue_ at the end.
// Returns the number of entries removed. Returns -1 on error.
// ACE_NOTSUP_RETURN if ACE_HAS_REACTOR_NOTIFICATION_QUEUE is not defined.
int
ACE_Select_Reactor_Notify::purge_pending_notifications (ACE_Event_Handler *eh,
ACE_Reactor_Mask mask )
{
ACE_TRACE ("ACE_Select_Reactor_Notify::purge_pending_notifications");
#if defined (ACE_HAS_REACTOR_NOTIFICATION_QUEUE)
ACE_GUARD_RETURN (ACE_SYNCH_MUTEX, mon, this->notify_queue_lock_, -1);
if (this->notify_queue_.is_empty ())
return 0;
ACE_Notification_Buffer *temp = 0;
ACE_Unbounded_Queue <ACE_Notification_Buffer *> local_queue;
size_t queue_size = this->notify_queue_.size ();
int number_purged = 0;
size_t i;
for (i = 0; i < queue_size; ++i)
{
if (-1 == this->notify_queue_.dequeue_head (temp))
ACE_ERROR_RETURN ((LM_ERROR,
ACE_LIB_TEXT ("%p\n"),
ACE_LIB_TEXT ("dequeue_head")),
-1);
// If this is not a Reactor notify (it is for a particular handler),
// and it matches the specified handler (or purging all),
// and applying the mask would totally eliminate the notification, then
// release it and count the number purged.
if ((0 != temp->eh_) &&
(0 == eh || eh == temp->eh_) &&
ACE_BIT_DISABLED (temp->mask_, ~mask)) // the existing notificationmask
// is left with nothing when
// applying the mask
{
if (-1 == this->free_queue_.enqueue_head (temp))
ACE_ERROR_RETURN ((LM_ERROR,
ACE_LIB_TEXT ("%p\n"),
ACE_LIB_TEXT ("enqueue_head")),
-1);
ACE_Event_Handler *event_handler = temp->eh_;
event_handler->remove_reference ();
++number_purged;
}
else
{
// To preserve it, move it to the local_queue.
// But first, if this is not a Reactor notify (it is for a particularhandler),
// and it matches the specified handler (or purging all), then
// apply the mask
if ((0 != temp->eh_) &&
(0 == eh || eh == temp->eh_))
ACE_CLR_BITS(temp->mask_, mask);
if (-1 == local_queue.enqueue_head (temp))
return -1;
}
}
if (this->notify_queue_.size ())
{ // should be empty!
ACE_ASSERT (0);
return -1;
}
// now put it back in the notify queue
queue_size = local_queue.size ();
for (i = 0; i < queue_size; ++i)
{
if (-1 == local_queue.dequeue_head (temp))
ACE_ERROR_RETURN ((LM_ERROR,
ACE_LIB_TEXT ("%p\n"),
ACE_LIB_TEXT ("dequeue_head")),
-1);
if (-1 == this->notify_queue_.enqueue_head (temp))
ACE_ERROR_RETURN ((LM_ERROR,
ACE_LIB_TEXT ("%p\n"),
ACE_LIB_TEXT ("enqueue_head")),
-1);
}
return number_purged;
#else /* defined (ACE_HAS_REACTOR_NOTIFICATION_QUEUE) */
ACE_UNUSED_ARG (eh);
ACE_UNUSED_ARG (mask);
ACE_NOTSUP_RETURN (-1);
#endif /* defined (ACE_HAS_REACTOR_NOTIFICATION_QUEUE) */
}
void
ACE_Select_Reactor_Notify::dump (void) const
{
#if defined (ACE_HAS_DUMP)
ACE_TRACE ("ACE_Select_Reactor_Notify::dump");
ACE_DEBUG ((LM_DEBUG, ACE_BEGIN_DUMP, this));
ACE_DEBUG ((LM_DEBUG, ACE_LIB_TEXT ("select_reactor_ = %x"), this->select_reactor_));
this->notification_pipe_.dump ();
ACE_DEBUG ((LM_DEBUG, ACE_END_DUMP));
#endif /* ACE_HAS_DUMP */
}
int
ACE_Select_Reactor_Notify::open (ACE_Reactor_Impl *r,
ACE_Timer_Queue *,
int disable_notify_pipe)
{
ACE_TRACE ("ACE_Select_Reactor_Notify::open");
if (disable_notify_pipe == 0)
{
this->select_reactor_ =
dynamic_cast<ACE_Select_Reactor_Impl *> (r);
if (select_reactor_ == 0)
{
errno = EINVAL;
return -1;
}
if (this->notification_pipe_.open () == -1)
return -1;
#if defined (F_SETFD)
ACE_OS::fcntl (this->notification_pipe_.read_handle (), F_SETFD, 1);
ACE_OS::fcntl (this->notification_pipe_.write_handle (), F_SETFD, 1);
#endif /* F_SETFD */
#if defined (ACE_HAS_REACTOR_NOTIFICATION_QUEUE)
ACE_Notification_Buffer *temp = 0;
ACE_NEW_RETURN (temp,
ACE_Notification_Buffer[ACE_REACTOR_NOTIFICATION_ARRAY_SIZE],
-1);
if (this->alloc_queue_.enqueue_head (temp) == -1)
{
delete [] temp;
return -1;
}
for (size_t i = 0; i < ACE_REACTOR_NOTIFICATION_ARRAY_SIZE; ++i)
if (free_queue_.enqueue_head (temp + i) == -1)
return -1;
#endif /* ACE_HAS_REACTOR_NOTIFICATION_QUEUE */
// There seems to be a Win32 bug with this... Set this into
// non-blocking mode.
if (ACE::set_flags (this->notification_pipe_.read_handle (),
ACE_NONBLOCK) == -1)
return -1;
else
return this->select_reactor_->register_handler
(this->notification_pipe_.read_handle (),
this,
ACE_Event_Handler::READ_MASK);
}
else
{
this->select_reactor_ = 0;
return 0;
}
}
int
ACE_Select_Reactor_Notify::close (void)
{
ACE_TRACE ("ACE_Select_Reactor_Notify::close");
#if defined (ACE_HAS_REACTOR_NOTIFICATION_QUEUE)
// Free up the dynamically allocated resources.
ACE_Notification_Buffer **b = 0;
for (ACE_Unbounded_Queue_Iterator<ACE_Notification_Buffer *> alloc_iter (this->alloc_queue_);
alloc_iter.next (b) != 0;
alloc_iter.advance ())
{
delete [] *b;
*b = 0;
}
this->alloc_queue_.reset ();
this->notify_queue_.reset ();
this->free_queue_.reset ();
#endif /* ACE_HAS_REACTOR_NOTIFICATION_QUEUE */
return this->notification_pipe_.close ();
}
int
ACE_Select_Reactor_Notify::notify (ACE_Event_Handler *event_handler,
ACE_Reactor_Mask mask,
ACE_Time_Value *timeout)
{
ACE_TRACE ("ACE_Select_Reactor_Notify::notify");
// Just consider this method a "no-op" if there's no
// <ACE_Select_Reactor> configured.
if (this->select_reactor_ == 0)
return 0;
ACE_Event_Handler_var safe_handler (event_handler);
if (event_handler)
event_handler->add_reference ();
ACE_Notification_Buffer buffer (event_handler, mask);
#if defined (ACE_HAS_REACTOR_NOTIFICATION_QUEUE)
// Artificial scope to limit the duration of the mutex.
{
bool notification_required = false;
ACE_GUARD_RETURN (ACE_SYNCH_MUTEX, mon, this->notify_queue_lock_, -1);
// No pending notifications.
if (this->notify_queue_.is_empty ())
notification_required = true;
ACE_Notification_Buffer *temp = 0;
if (free_queue_.dequeue_head (temp) == -1)
{
// Grow the queue of available buffers.
ACE_Notification_Buffer *temp1 = 0;
ACE_NEW_RETURN (temp1,
ACE_Notification_Buffer[ACE_REACTOR_NOTIFICATION_ARRAY_SIZE],
-1);
if (this->alloc_queue_.enqueue_head (temp1) == -1)
{
delete [] temp1;
return -1;
}
// Start at 1 and enqueue only
// (ACE_REACTOR_NOTIFICATION_ARRAY_SIZE - 1) elements since
// the first one will be used right now.
for (size_t i = 1;
i < ACE_REACTOR_NOTIFICATION_ARRAY_SIZE;
++i)
this->free_queue_.enqueue_head (temp1 + i);
temp = temp1;
}
ACE_ASSERT (temp != 0);
*temp = buffer;
if (notify_queue_.enqueue_tail (temp) == -1)
return -1;
if (!notification_required)
{
// No failures.
safe_handler.release ();
return 0;
}
}
#endif /* ACE_HAS_REACTOR_NOTIFICATION_QUEUE */
ssize_t n = ACE::send (this->notification_pipe_.write_handle (),
(char *) &buffer,
sizeof buffer,
timeout);
if (n == -1)
return -1;
// No failures.
safe_handler.release ();
return 0;
}
// Handles pending threads (if any) that are waiting to unblock the
// Select_Reactor.
int
ACE_Select_Reactor_Notify::dispatch_notifications (int &number_of_active_handles,
ACE_Handle_Set &rd_mask)
{
ACE_TRACE ("ACE_Select_Reactor_Notify::dispatch_notifications");
ACE_HANDLE read_handle =
this->notification_pipe_.read_handle ();
if (read_handle != ACE_INVALID_HANDLE
&& rd_mask.is_set (read_handle))
{
--number_of_active_handles;
rd_mask.clr_bit (read_handle);
return this->handle_input (read_handle);
}
else
return 0;
}
ACE_HANDLE
ACE_Select_Reactor_Notify::notify_handle (void)
{
ACE_TRACE ("ACE_Select_Reactor_Notify::notify_handle");
return this->notification_pipe_.read_handle ();
}
int
ACE_Select_Reactor_Notify::is_dispatchable (ACE_Notification_Buffer &buffer)
{
#if defined (ACE_HAS_REACTOR_NOTIFICATION_QUEUE)
ACE_UNUSED_ARG(buffer);
return 1;
#else
// If eh == 0 then another thread is unblocking the
// <ACE_Select_Reactor> to update the <ACE_Select_Reactor>'s
// internal structures. Otherwise, we need to dispatch the
// appropriate handle_* method on the <ACE_Event_Handler>
// pointer we've been passed.
if (buffer.eh_ != 0)
return 1;
#endif /*ACE_HAS_REACTOR_NOTIFICATION_QUEUE */
// has no dispatchable buffer
return 0;
}
int
ACE_Select_Reactor_Notify::dispatch_notify (ACE_Notification_Buffer &buffer)
{
int result = 0;
#if defined (ACE_HAS_REACTOR_NOTIFICATION_QUEUE)
// Dispatch one message from the notify queue, and put another in
// the pipe if one is available. Remember, the idea is to keep
// exactly one message in the pipe at a time.
{
// We acquire the lock in a block to make sure we're not
// holding the lock while delivering callbacks...
ACE_GUARD_RETURN (ACE_SYNCH_MUTEX, mon, this->notify_queue_lock_, -1);
ACE_Notification_Buffer *temp = 0;
if (notify_queue_.is_empty ())
return 0;
else if (notify_queue_.dequeue_head (temp) == -1)
ACE_ERROR_RETURN ((LM_ERROR,
ACE_LIB_TEXT ("%p\n"),
ACE_LIB_TEXT ("dequeue_head")),
-1);
buffer = *temp;
if (free_queue_.enqueue_head (temp) == -1)
ACE_ERROR_RETURN ((LM_ERROR,
ACE_LIB_TEXT ("%p\n"),
ACE_LIB_TEXT ("enqueue_head")),
-1);
bool write_next_buffer = false;
ACE_Notification_Buffer ** next = 0;
if(!this->notify_queue_.is_empty())
{
// The queue is not empty, need to queue another message.
this->notify_queue_.get (next, 0);
write_next_buffer = true;
}
if(write_next_buffer)
{
(void) ACE::send(
this->notification_pipe_.write_handle(),
(char *)*next, sizeof(ACE_Notification_Buffer));
}
}
#endif /* ACE_HAS_REACTOR_NOTIFICATION_QUEUE */
// If eh == 0 then another thread is unblocking the
// <ACE_Select_Reactor> to update the <ACE_Select_Reactor>'s
// internal structures. Otherwise, we need to dispatch the
// appropriate handle_* method on the <ACE_Event_Handler> pointer
// we've been passed.
if (buffer.eh_ != 0)
{
ACE_Event_Handler *event_handler =
buffer.eh_;
int requires_reference_counting =
event_handler->reference_counting_policy ().value () ==
ACE_Event_Handler::Reference_Counting_Policy::ENABLED;
switch (buffer.mask_)
{
case ACE_Event_Handler::READ_MASK:
case ACE_Event_Handler::ACCEPT_MASK:
result = event_handler->handle_input (ACE_INVALID_HANDLE);
break;
case ACE_Event_Handler::WRITE_MASK:
result = event_handler->handle_output (ACE_INVALID_HANDLE);
break;
case ACE_Event_Handler::EXCEPT_MASK:
result = event_handler->handle_exception (ACE_INVALID_HANDLE);
break;
case ACE_Event_Handler::QOS_MASK:
result = event_handler->handle_qos (ACE_INVALID_HANDLE);
break;
case ACE_Event_Handler::GROUP_QOS_MASK:
result = event_handler->handle_group_qos (ACE_INVALID_HANDLE);
break;
default:
// Should we bail out if we get an invalid mask?
ACE_ERROR ((LM_ERROR,
ACE_LIB_TEXT ("invalid mask = %d\n"),
buffer.mask_));
}
if (result == -1)
event_handler->handle_close (ACE_INVALID_HANDLE,
ACE_Event_Handler::EXCEPT_MASK);
if (requires_reference_counting)
{
event_handler->remove_reference ();
}
}
return 1;
}
int
ACE_Select_Reactor_Notify::read_notify_pipe (ACE_HANDLE handle,
ACE_Notification_Buffer &buffer)
{
ACE_TRACE ("ACE_Select_Reactor_Notify::read_notify_pipe");
ssize_t n = ACE::recv (handle, (char *) &buffer, sizeof buffer);
if (n > 0)
{
// Check to see if we've got a short read.
if (n != sizeof buffer)
{
ssize_t remainder = sizeof buffer - n;
// If so, try to recover by reading the remainder. If this
// doesn't work we're in big trouble since the input stream
// won't be aligned correctly. I'm not sure quite what to
// do at this point. It's probably best just to return -1.
if (ACE::recv (handle,
((char *) &buffer) + n,
remainder) != remainder)
return -1;
}
return 1;
}
// Return -1 if things have gone seriously wrong.
if (n <= 0 && (errno != EWOULDBLOCK && errno != EAGAIN))
return -1;
return 0;
}
int
ACE_Select_Reactor_Notify::handle_input (ACE_HANDLE handle)
{
ACE_TRACE ("ACE_Select_Reactor_Notify::handle_input");
// Precondition: this->select_reactor_.token_.current_owner () ==
// ACE_Thread::self ();
int number_dispatched = 0;
int result = 0;
ACE_Notification_Buffer buffer;
while ((result = this->read_notify_pipe (handle, buffer)) > 0)
{
// Dispatch the buffer
// NOTE: We count only if we made any dispatches ie. upcalls.
if (this->dispatch_notify (buffer) > 0)
++number_dispatched;
// Bail out if we've reached the <notify_threshold_>. Note that
// by default <notify_threshold_> is -1, so we'll loop until all
// the notifications in the pipe have been dispatched.
if (number_dispatched == this->max_notify_iterations_)
break;
}
// Reassign number_dispatched to -1 if things have gone seriously
// wrong.
if (result < 0)
number_dispatched = -1;
// Enqueue ourselves into the list of waiting threads. When we
// reacquire the token we'll be off and running again with ownership
// of the token. The postcondition of this call is that
// <select_reactor_.token_.current_owner> == <ACE_Thread::self>.
this->select_reactor_->renew ();
return number_dispatched;
}
// -------------------------------------------
int
ACE_Select_Reactor_Impl::purge_pending_notifications (ACE_Event_Handler *eh,
ACE_Reactor_Mask mask)
{
if (this->notify_handler_ == 0)
return 0;
else
return this->notify_handler_->purge_pending_notifications (eh, mask);
}
// Perform GET, CLR, SET, and ADD operations on the Handle_Sets.
//
// GET = 1, Retrieve current value
// SET = 2, Set value of bits to new mask (changes the entire mask)
// ADD = 3, Bitwise "or" the value into the mask (only changes
// enabled bits)
// CLR = 4 Bitwise "and" the negation of the value out of the mask
// (only changes enabled bits)
//
// Returns the original mask. Must be called with locks held.
int
ACE_Select_Reactor_Impl::bit_ops (ACE_HANDLE handle,
ACE_Reactor_Mask mask,
ACE_Select_Reactor_Handle_Set &handle_set,
int ops)
{
ACE_TRACE ("ACE_Select_Reactor_Impl::bit_ops");
if (this->handler_rep_.handle_in_range (handle) == 0)
return -1;
#if !defined (ACE_WIN32)
ACE_Sig_Guard sb (0,
this->mask_signals_); // Block out all signals until method returns.
#endif /* ACE_WIN32 */
ACE_FDS_PTMF ptmf = &ACE_Handle_Set::set_bit;
u_long omask = ACE_Event_Handler::NULL_MASK;
// Find the old reactor masks. This automatically does the work of
// the GET_MASK operation.
if (handle_set.rd_mask_.is_set (handle))
ACE_SET_BITS (omask, ACE_Event_Handler::READ_MASK);
if (handle_set.wr_mask_.is_set (handle))
ACE_SET_BITS (omask, ACE_Event_Handler::WRITE_MASK);
if (handle_set.ex_mask_.is_set (handle))
ACE_SET_BITS (omask, ACE_Event_Handler::EXCEPT_MASK);
switch (ops)
{
case ACE_Reactor::GET_MASK:
// The work for this operation is done in all cases at the
// begining of the function.
break;
case ACE_Reactor::CLR_MASK:
ptmf = &ACE_Handle_Set::clr_bit;
// State was changed. we need to reflect that change in the
// dispatch_mask I assume that only ACE_Reactor::CLR_MASK should
// be treated here which means we need to clear the handle|mask
// from the current dispatch handler
this->clear_dispatch_mask (handle, mask);
/* FALLTHRU */
case ACE_Reactor::SET_MASK:
/* FALLTHRU */
case ACE_Reactor::ADD_MASK:
// The following code is rather subtle... Note that if we are
// doing a ACE_Reactor::SET_MASK then if the bit is not enabled
// in the mask we need to clear the bit from the ACE_Handle_Set.
// On the other hand, if we are doing a ACE_Reactor::CLR_MASK or
// a ACE_Reactor::ADD_MASK we just carry out the operations
// specified by the mask.
// READ, ACCEPT, and CONNECT flag will place the handle in the
// read set.
if (ACE_BIT_ENABLED (mask, ACE_Event_Handler::READ_MASK)
|| ACE_BIT_ENABLED (mask, ACE_Event_Handler::ACCEPT_MASK)
|| ACE_BIT_ENABLED (mask, ACE_Event_Handler::CONNECT_MASK))
{
(handle_set.rd_mask_.*ptmf) (handle);
}
else if (ops == ACE_Reactor::SET_MASK)
handle_set.rd_mask_.clr_bit (handle);
// WRITE and CONNECT flag will place the handle in the write set
if (ACE_BIT_ENABLED (mask,
ACE_Event_Handler::WRITE_MASK)
|| ACE_BIT_ENABLED (mask,
ACE_Event_Handler::CONNECT_MASK))
{
(handle_set.wr_mask_.*ptmf) (handle);
}
else if (ops == ACE_Reactor::SET_MASK)
handle_set.wr_mask_.clr_bit (handle);
// EXCEPT (and CONNECT on Win32) flag will place the handle in
// the except set.
if (ACE_BIT_ENABLED (mask, ACE_Event_Handler::EXCEPT_MASK)
#if defined (ACE_WIN32)
|| ACE_BIT_ENABLED (mask, ACE_Event_Handler::CONNECT_MASK)
#endif /* ACE_WIN32 */
)
{
(handle_set.ex_mask_.*ptmf) (handle);
}
else if (ops == ACE_Reactor::SET_MASK)
handle_set.ex_mask_.clr_bit (handle);
break;
default:
return -1;
}
return omask;
}
void
ACE_Select_Reactor_Impl::clear_dispatch_mask (ACE_HANDLE handle,
ACE_Reactor_Mask mask)
{
ACE_TRACE ("ACE_Select_Reactor_Impl::clear_dispatch_mask");
// Use handle and mask in order to modify the sets
// (wait/suspend/ready/dispatch), that way, the dispatch_io_set loop
// will not be interrupt, and there will no reason to rescan the
// wait_set and re-calling select function, which is *very*
// expensive. It seems that wait/suspend/ready sets are getting
// updated in register/remove bind/unbind etc functions. The only
// thing need to be updated is the dispatch_set (also can be found
// in that file code as dispatch_mask). Because of that, we need
// that dispatch_set to be member of the ACE_Select_Reactor_impl in
// Select_Reactor_Base.h file That way we will have access to that
// member in that function.
// We kind of invalidate the iterator in dispatch_io_set because its
// an array and index built from the original dispatch-set. Take a
// look at dispatch_io_set for more details.
// We only need to clr_bit, because we are interested in clearing the
// handles that was removed, so no dispatching to these handles will
// occur.
if (ACE_BIT_ENABLED (mask, ACE_Event_Handler::READ_MASK) ||
ACE_BIT_ENABLED (mask, ACE_Event_Handler::ACCEPT_MASK))
{
this->dispatch_set_.rd_mask_.clr_bit (handle);
}
if (ACE_BIT_ENABLED (mask, ACE_Event_Handler::WRITE_MASK))
{
this->dispatch_set_.wr_mask_.clr_bit (handle);
}
if (ACE_BIT_ENABLED (mask, ACE_Event_Handler::EXCEPT_MASK))
{
this->dispatch_set_.ex_mask_.clr_bit (handle);
}
// That will make the dispatch_io_set iterator re-start and rescan
// the dispatch set.
this->state_changed_ = true;
}
int
ACE_Select_Reactor_Impl::resumable_handler (void)
{
// The select reactor has no handlers that can be resumed by the
// application. So return 0;
return 0;
}
#if defined (ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION)
#if defined (ACE_HAS_REACTOR_NOTIFICATION_QUEUE)
template class ACE_Unbounded_Queue <ACE_Notification_Buffer *>;
template class ACE_Unbounded_Queue_Iterator <ACE_Notification_Buffer *>;
template class ACE_Node <ACE_Notification_Buffer *>;
#endif /* ACE_HAS_REACTOR_NOTIFICATION_QUEUE */
#elif defined (ACE_HAS_TEMPLATE_INSTANTIATION_PRAGMA)
#if defined (ACE_HAS_REACTOR_NOTIFICATION_QUEUE)
#pragma instantiate ACE_Unbounded_Queue <ACE_Notification_Buffer *>
#pragma instantiate ACE_Unbounded_Queue_Iterator <ACE_Notification_Buffer *>
#pragma instantiate ACE_Node <ACE_Notification_Buffer *>
#endif /* ACE_HAS_REACTOR_NOTIFICATION_QUEUE */
#endif /* ACE_HAS_EXPLICIT_TEMPLATE_INSTANTIATION */
ACE_END_VERSIONED_NAMESPACE_DECL
|