-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy paththreads.html
821 lines (588 loc) · 31.2 KB
/
threads.html
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
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
"http://www.w3.org/TR/html4/loose.dtd"><!-- DO NOT EDIT THIS FILE-->
<!-- Edit the .tex version instead-->
<html>
<head>
<title>Thread System</title>
<link href="csug.css" rel="stylesheet" type="text/css">
</head>
<body>
<a name="g133"></a>
<a name="./threads:h0"></a>
<h1>Chapter 15. Thread System<a name="CHPTTHREADS"></a></h1>
<p>
<a name="./threads:s0"></a>This chapter describes the <i>Chez Scheme</i> thread-system procedures
and syntactic forms.
With the exception of locks, locked increment, and locked decrement,
the features of the thread system are implemented on top of the Posix
thread system (pthreads) on non-Windows-based system and directly using
the Windows API on Windows-based systems.
Consult the appropriate documentation on your system for basic details
of thread creation and interaction.
<p>
Most primitive Scheme procedures are <a name="./threads:s1"></a><i>thread-safe</i>, meaning
that they can be called concurrently from multiple threads.
This includes allocation operations like <tt><i>cons</i></tt> and <tt>make-string</tt>,
accessors like <tt>car</tt> and <tt>vector-ref</tt>,
numeric operators like <tt>+</tt> and <tt>sqrt</tt>, and nondestructive
higher-level primitive operators like <tt>append</tt> and <tt>map</tt>.
<p>
Simple mutation operators, like <tt>set-car!</tt>, <tt>vector-set!</tt>,
and record field mutators are thread-safe.
Likewise, assignments to local variables, including assignments to
(unexported) library and top-level program variables are thread-safe.
<p>
Other destructive operators are thread safe only if they are used to
operate on different objects from those being read or modified by other
threads.
For example, assignments to global variables are thread-safe only as
long as one thread does not assign the same variable another thread
references or assigns.
Similarly, <tt>putprop</tt> can be called in one thread while another
concurrently calls <tt>putprop</tt> or <tt>getprop</tt> if the symbols
whose property lists are being modified or accessed differ.
<p>
In this context, most I/O operations should be considered destructive,
since they might modify a port's internal structure; see also
Section <a href="./threads.html#g140">15.7</a> for information on buffered ports.
<p>
Use of operators that are not thread-safe without proper synchronization
can corrupt the objects upon which they operate.
This corruption can lead to incorrect behavior, memory faults, and even
unrecoverable errors that cause the system to abort.
<p>
The compiler and interpreter are thread-safe to the extent that user code
evaluated during the compilation and evaluation process is thread-safe or
properly synchronized.
Thus, two or more threads
can call any of the compiler or interpreter entry points, i.e.,
<tt>compile</tt>, <tt>compile-file</tt>, <tt>compile-program</tt>, <tt>compile-script</tt>,
<tt>compile-port</tt>, or <tt>interpret</tt> at the same time.
Naturally, the object-file targets of two file compilation operations that
run at the same time should be different.
The same is true for <tt>eval</tt> and <tt>load</tt> as long as
the default evaluator is used or is set explicitly to <tt>compile</tt>,
<tt>interpret</tt>, or some other thread-safe evaluator.
<p>
One restriction should be observed when one of multiple threads creates or
loads compiled code, however, which is that only that thread or
subsequently created children, or children of subsequently created
children, etc., should run the code.
This is because multiple-processor systems upon which threaded code may
run might not guarantee that the data and instruction caches are
synchronized across processors.
<p>
<h3><a name="g134"></a><a name="./threads:h1"></a>Section 15.1. Thread Creation</h3>
<p>
<a name="./threads:s2"></a><span class=formdef><b>procedure</b>: <tt>(fork-thread <i>thunk</i>)</tt></span>
<br>
<b>returns: </b>a thread object
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p><tt><i>thunk</i></tt> must be a procedure that accepts zero arguments.
<p>
<tt>fork-thread</tt> invokes <tt><i>thunk</i></tt> in a new thread and returns
a thread object.
<p>
Nothing can be done with the thread object returned by
<tt>fork-thread</tt>, other than to print it.
<p>
Threads created by foreign code using some means other than
<tt>fork-thread</tt> must call <tt>Sactivate_thread</tt>
(Section <a href="./foreign.html#g34">4.8</a>) before touching any Scheme data
or calling any Scheme procedures.
<p>
<a name="./threads:s3"></a><span class=formdef><b>procedure</b>: <tt>(thread? <i>obj</i>)</tt></span>
<br>
<b>returns: </b><tt>#t</tt> if <tt><i>obj</i></tt> is a thread object, <tt>#f</tt> otherwise
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p><a name="./threads:s4"></a><span class=formdef><b>procedure</b>: <tt>(get-thread-id)</tt></span>
<br>
<b>returns: </b>the thread id of the current thread
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p>The thread id is a thread number assigned by thread id, and has no
relationship to the process id returned by
<a name="./threads:s5"></a><tt>get-process-id</tt>, which is the same
in all threads.
<p>
<h3><a name="g135"></a><a name="./threads:h2"></a>Section 15.2. Mutexes</h3>
<p>
<a name="./threads:s6"></a><span class=formdef><b>procedure</b>: <tt>(make-mutex)</tt></span>
<br>
<b>returns: </b>a new mutex object
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p><a name="./threads:s7"></a><span class=formdef><b>procedure</b>: <tt>(mutex? <i>obj</i>)</tt></span>
<br>
<b>returns: </b><tt>#t</tt> if <tt><i>obj</i></tt> is a mutex, <tt>#f</tt> otherwise
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p><a name="./threads:s8"></a><span class=formdef><b>procedure</b>: <tt>(mutex-acquire <i>mutex</i>)</tt></span>
<br><span class=formdef><b>procedure</b>: <tt>(mutex-acquire <i>mutex</i> <i>block?</i>)</tt></span>
<br>
<b>returns: </b>see below
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p><tt><i>mutex</i></tt> must be a mutex.
<p>
<tt><i>mutex-acquire</i></tt> acquires the mutex identified by <tt><i>mutex</i></tt>.
The optional boolean argument <tt><i>block?</i></tt> defaults to
<tt>#t</tt> and specifies whether the thread should block
waiting for the mutex.
If <tt><i>block?</i></tt> is omitted or is true, the thread
blocks until the mutex has been acquired, and an unspecified
value is returned.
<p>
If <tt>block?</tt> is false and the mutex currently belongs
to a different thread, the current thread does not block.
Instead, <tt>mutex-acquire</tt> returns
immediately with the value <tt>#f</tt> to
indicate that the mutex is not available.
If <tt><i>block?</i></tt> is false and the mutex is successfully
acquired, <tt>mutex-acquire</tt> returns <tt>#t</tt>.
<p>
Mutexes are <i>recursive</i> in Posix threads terminology, which
means that the calling thread can use <tt>mutex-acquire</tt> to
(re)acquire a mutex it already has.
In this case, an equal number of <tt>mutex-release</tt> calls
is necessary to release the mutex.
<p>
<a name="./threads:s9"></a><span class=formdef><b>procedure</b>: <tt>(mutex-release <i>mutex</i>)</tt></span>
<br>
<b>returns: </b>unspecified
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p><tt><i>mutex</i></tt> must be a mutex.
<p>
<tt>mutex-release</tt> releases the mutex identified by <tt><i>mutex</i></tt>.
Unpredictable behavior results if the mutex is not owned by the
calling thread.
<p>
<a name="./threads:s10"></a><span class=formdef><b>syntax</b>: <tt>(with-mutex <i>mutex</i> <i>body<sub>1</sub></i> <i>body<sub>2</sub></i> ...)</tt></span>
<br>
<b>returns: </b>the values of the body <tt><i>body<sub>1</sub></i> <i>body<sub>2</sub></i> ...</tt>
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p><tt>with-mutex</tt> evaluates the expression <tt><i>mutex</i></tt>, which must
evaluate to a mutex, acquires the mutex, evaluates the body
<tt><i>body<sub>1</sub></i> <i>body<sub>2</sub></i> ...</tt>, and releases the mutex.
The mutex is released whether the body returns normally or
via a control operation (that is, throw to a continuation, perhaps because
of an error) that results in
a nonlocal exit from the <tt>with-mutex</tt> form.
If control subsequently returns to the body via a
continuation invocation, the mutex is reacquired.
<p>
Using <tt>with-mutex</tt> is generally more convenient and safer than using
<tt>mutex-acquire</tt> and <tt>mutex-release</tt> directly.
<p>
<h3><a name="g136"></a><a name="./threads:h3"></a>Section 15.3. Conditions</h3>
<p>
<a name="./threads:s11"></a><span class=formdef><b>procedure</b>: <tt>(make-condition)</tt></span>
<br>
<b>returns: </b>a new condition object
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p><a name="./threads:s12"></a><span class=formdef><b>procedure</b>: <tt>(thread-condition? <i>obj</i>)</tt></span>
<br>
<b>returns: </b><tt>#t</tt> if <tt><i>obj</i></tt> is a condition object, <tt>#f</tt> otherwise
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p><a name="./threads:s13"></a><span class=formdef><b>procedure</b>: <tt>(condition-wait <i>cond</i> <i>mutex</i>)</tt></span>
<br>
<b>returns: </b>unspecified
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p><tt><i>cond</i></tt> must be a condition object, and
<tt><i>mutex</i></tt> must be a mutex.
<p>
<tt>condition-wait</tt> waits for the condition
identified by the condition object <tt><i>cond</i></tt>.
The calling thread must have acquired the mutex identified by the mutex
<tt><i>mutex</i></tt> at the time <tt>condition-wait</tt> is
called.
<tt><i>mutex</i></tt> is released as a side effect of the call to
<tt>condition-wait</tt>.
When a thread is later released from the condition variable by one
of the procedures described below, <tt><i>mutex</i></tt> is reacquired
and <tt>condition-wait</tt> returns.
<p>
<a name="./threads:s14"></a><span class=formdef><b>procedure</b>: <tt>(condition-signal <i>cond</i>)</tt></span>
<br>
<b>returns: </b>unspecified
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p><tt><i>cond</i></tt> must be a condition object.
<p>
<tt>condition-signal</tt> releases one of the threads waiting for the
condition identified by <tt><i>cond</i></tt>.
<p>
<a name="./threads:s15"></a><span class=formdef><b>procedure</b>: <tt>(condition-broadcast <i>cond</i>)</tt></span>
<br>
<b>returns: </b>unspecified
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p><tt><i>cond</i></tt> must be a condition object.
<p>
<tt>condition-broadcast</tt> releases all of the threads waiting for the
condition identified by <tt><i>cond</i></tt>.
<p>
<h3><a name="g137"></a><a name="./threads:h4"></a>Section 15.4. Locks<a name="SECTTHREADLOCKS"></a></h3>
<p>
<a name="./threads:s16"></a>Locks are more primitive but more flexible and efficient than mutexes
and can be used in situations where the added mutex functionality
is not needed or desired.
They can also be used independently of the thread system
(including in nonthreaded versions of <i>Chez Scheme</i>)
to synchronize operations running in separate Scheme processes
as long as the lock is allocated in memory shared by the processes.
<p>
A lock is simply a word-sized integer, i.e., an <tt>iptr</tt> or
<tt>uptr</tt> foreign type (Section <a href="./foreign.html#g31">4.5</a>) with the native
endiannes of the target machine, possibly part of a larger structure
defined using <tt>define-ftype</tt> (page <a href="./foreign.html#defn:define-ftype">75</a>).
It must be explicitly allocated in memory that resides outside the Scheme
heap and, when appropriate, explicitly deallocated.
When just threads are involved (i.e., when multiple processes are not
involved), the memory can be allocated via <tt>foreign-alloc</tt>.
When multiple processes are involved, the lock should be allocated in
some area shared by the processes that will interact with the lock.
<p>
Once initialized using <tt>ftype-init-lock!</tt>, a process or thread
can attempt to lock the lock via <tt>ftype-lock!</tt> or <tt>ftype-spin-lock!</tt>.
Once the lock has been locked and before it is unlocked, further
attempts to lock the lock fail, even by the process or thread that
most recently locked it.
Locks can be unlocked, via <tt>ftype-unlock!</tt>, by any process or thread,
not just by the process or thread that most recently locked the lock.
<p>
The lock mechanism provides little structure, and mistakes
in allocation and use can lead to memory faults, deadlocks,
and other problems.
Thus, it is usually advisable to use locks only as part of a
higher-level abstraction that ensures locks are used in a
disciplined manner.
<p>
<p><tt>(define lock<br>
(make-ftype-pointer uptr<br>
(foreign-alloc (ftype-sizeof uptr))))
<br>
<br>
(ftype-init-lock! uptr () lock)<br>
(ftype-lock! uptr () lock) <img src="math/csug/0.gif" alt="<graphic>"> #t<br>
(ftype-lock! uptr () lock) <img src="math/csug/0.gif" alt="<graphic>"> #f<br>
(ftype-unlock! uptr () lock)<br>
(ftype-spin-lock! uptr () lock)<br>
(ftype-lock! uptr () lock) <img src="math/csug/0.gif" alt="<graphic>"> #f<br>
(ftype-unlock! uptr () lock)</tt>
<p><a name="./threads:s17"></a><span class=formdef><b>syntax</b>: <tt>(ftype-init-lock! <i>ftype-name</i> (<i>a</i> ...) <i>fptr-expr</i>)</tt></span>
<br><span class=formdef><b>syntax</b>: <tt>(ftype-init-lock! <i>ftype-name</i> (<i>a</i> ...) <i>fptr-expr</i> <i>index</i>)</tt></span>
<br>
<b>returns: </b>unspecified
<br><span class=formdef><b>syntax</b>: <tt>(ftype-lock! <i>ftype-name</i> (<i>a</i> ...) <i>fptr-expr</i>)</tt></span>
<br><span class=formdef><b>syntax</b>: <tt>(ftype-lock! <i>ftype-name</i> (<i>a</i> ...) <i>fptr-expr</i> <i>index</i>)</tt></span>
<br>
<b>returns: </b><tt>#t</tt> if the lock is not already locked, <tt>#f</tt> otherwise
<br><span class=formdef><b>syntax</b>: <tt>(ftype-spin-lock! <i>ftype-name</i> (<i>a</i> ...) <i>fptr-expr</i>)</tt></span>
<br><span class=formdef><b>syntax</b>: <tt>(ftype-spin-lock! <i>ftype-name</i> (<i>a</i> ...) <i>fptr-expr</i> <i>index</i>)</tt></span>
<br>
<b>returns: </b>unspecified
<br><span class=formdef><b>syntax</b>: <tt>(ftype-unlock! <i>ftype-name</i> (<i>a</i> ...) <i>fptr-expr</i>)</tt></span>
<br><span class=formdef><b>syntax</b>: <tt>(ftype-unlock! <i>ftype-name</i> (<i>a</i> ...) <i>fptr-expr</i> <i>index</i>)</tt></span>
<br>
<b>returns: </b>unspecified
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p>Each of these has a syntax like and behaves similarly to
<tt>ftype-set!</tt> (page <a href="./foreign.html#defn:ftype-set!">84</a>), though with an implicit
<tt><i>val-expr</i></tt>.
In particular, the restrictions on and handling of <tt><i>fptr-expr</i></tt>
and the accessors <tt><i>a</i> ...</tt> is similar, with one important
restriction: the field specified by the last accessor, upon which
the form operates, must be a word-size integer, i.e., an
<tt>iptr</tt>, <tt>uptr</tt>, or the equivalent, with the native
endianness.
<p>
<tt>ftype-init-lock!</tt> should be used to initialize the lock prior
to the use of any of the other operators; if this is not done, the
behavior of the other operators is undefined.
<p>
<tt>ftype-lock!</tt> can be used to lock the lock.
If it finds the lock unlocked at the time of the operation, it locks
the lock and returns <tt>#t</tt>; if it finds the lock already locked,
it returns <tt>#f</tt> without changing the lock.
<p>
<tt>ftype-spin-lock!</tt> can also be used to lock the lock.
If it finds the lock unlocked at the time of the operation, it locks the
lock and returns; if it finds the lock already locked, it waits until
the lock is unlocked, then locks the lock and returns.
If no other thread or process unlocks the lock, the operation does
not return and cannot be interrupted by normal means, including by the
storage manager for the purpose of initiating a garbage collection.
There are also no guarantees of fairness, so a process might hang
indefinitely even if other processes are actively locking and unlocking
the lock.
<p>
<tt>ftype-unlock!</tt> is used to unlock a lock.
If it finds the lock locked, it unlocks the lock and returns.
Otherwise, it returns without changing the lock.
<p>
<h3><a name="g138"></a><a name="./threads:h5"></a>Section 15.5. Locked increment and decrement<a name="SECTTHREADLOCKEDINCRDECR"></a></h3>
<p>
The locked operations described here can be used when just an atomic
increment or decrement is required.
<p>
<a name="./threads:s18"></a><span class=formdef><b>syntax</b>: <tt>(ftype-locked-incr! <i>ftype-name</i> (<i>a</i> ...) <i>fptr-expr</i>)</tt></span>
<br><span class=formdef><b>syntax</b>: <tt>(ftype-locked-incr! <i>ftype-name</i> (<i>a</i> ...) <i>fptr-expr</i> <i>index</i>)</tt></span>
<br>
<b>returns: </b><tt>#t</tt> if the updated value is 0, <tt>#f</tt> otherwise
<br><span class=formdef><b>syntax</b>: <tt>(ftype-locked-decr! <i>ftype-name</i> (<i>a</i> ...) <i>fptr-expr</i>)</tt></span>
<br><span class=formdef><b>syntax</b>: <tt>(ftype-locked-decr! <i>ftype-name</i> (<i>a</i> ...) <i>fptr-expr</i> <i>index</i>)</tt></span>
<br>
<b>returns: </b><tt>#t</tt> if the updated value is 0, <tt>#f</tt> otherwise
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p>Each of these has a syntax like and behaves similarly to
<tt>ftype-set!</tt> (page <a href="./foreign.html#defn:ftype-set!">84</a>), though with an implicit
<tt><i>val-expr</i></tt>.
In particular, the restrictions on and handling of <tt><i>fptr-expr</i></tt>
and the accessors <tt><i>a</i> ...</tt> is similar, with one important
restriction: the field specified by the last accessor, upon which
the form operates, must be a word-size integer, i.e., an
<tt>iptr</tt>, <tt>uptr</tt>, or the equivalent, with the native
endianness.
<p>
<tt>ftype-locked-incr!</tt> atomically reads the value of the specified
field, adds 1 to the value, and writes the new value back into the
field.
Similarly, <tt>ftype-locked-decr!</tt> atomically reads the value of
the specified field, subtracts 1 from the value, and writes the new
value back into the field.
Both return <tt>#t</tt> if the new value is 0, otherwise <tt>#f</tt>.
<p>
<h3><a name="g139"></a><a name="./threads:h6"></a>Section 15.6. Thread Parameters<a name="SECTTHREADPARAMETERS"></a></h3>
<p>
<a name="./threads:s19"></a><span class=formdef><b>procedure</b>: <tt>(make-thread-parameter <i>object</i>)</tt></span>
<br><span class=formdef><b>procedure</b>: <tt>(make-thread-parameter <i>object</i> <i>procedure</i>)</tt></span>
<br>
<b>returns: </b>a new thread parameter
<br>
<b>libraries: </b><tt>(chezscheme)</tt>
<p>See Section <a href="./system.html#g120">12.13</a> for a general
discussion of parameters and the use of the optional second argument.
<p>
When a thread parameter is created, a separate location is set aside
in each current and future thread to hold the value of the parameter's
internal state variable.
(This location may be eliminated by the storage manager when the
parameter becomes inaccessible.)
Changes to the thread parameter in one thread are not seen by any
other thread.
<p>
When a new thread is created (see <tt>fork-thread</tt>),
the current value (not location) of each
thread parameter is inherited from the forking thread by the new thread.
Similarly, when a thread created by some other means is activated for the
first time (see <tt>Sactivate_thread</tt> in
Section <a href="./foreign.html#g34">4.8</a>), the current value (not location) of each
thread parameter is inherited from the main (original) thread by the new
thread.
<p>
Most built-in parameters are thread parameters, but some are global.
All are marked as global or thread where they are defined.
There is no distinction between built-in global and thread parameters
in the nonthreaded versions of the system.
<p>
<h3><a name="g140"></a><a name="./threads:h7"></a>Section 15.7. Buffered I/O<a name="SECTTHREADSBUFFEREDIO"></a></h3>
<p>
Chez Scheme buffers file I/O operations for efficiency, but buffered
I/O is not thread safe.
Two threads that write to or read from the same buffered port concurrently
can corrupt the port, resulting in buffer overruns and, ultimately,
invalid memory references.
<p>
Buffering on binary output ports can be disabled when opened with
buffer-mode <tt>none</tt>.
Buffering on input ports cannot be completely disabled, however, due to
the need to support lookahead, and buffering on textual ports, even
textual output ports, cannot be disabled completely because the
transcoders that convert between characters and bytes sometimes
require some lookahead.
<p>
Two threads should thus <i>never</i> read from or write to the same port
concurrently, except in the special case of a binary output port
opened buffer-mode <tt>none</tt>.
Alternatives include appointing one thread to perform all I/O for a
given port and providing a per-thread generic-port wrapper that
forwards requests to the port only after acquiring a mutex.
<p>
The initial console and current input and output ports are thread-safe,
as are transcript ports, so it is safe for multiple threads to print error
and/or debugging messages to the console.
The output may be interleaved, even within the same line, but the port
will not become corrupted.
Thread safety for these ports is accomplished at the high cost of
acquiring a mutex for each I/O operation.
<p>
<h3><a name="g141"></a><a name="./threads:h8"></a>Section 15.8. Example: Bounded Queues</h3>
<p>
The following code, taken from the article
"A Scheme for native threads [<a class=citation href="./bibliography.html#g156">10</a>],"
implements a bounded queue using many of the
thread-system features.
A bounded queue has a fixed number of available slots.
Attempting to enqueue when the queue is full causes the calling thread
to block.
Attempting to dequeue from an empty queue causes the calling thread
to block.
<p>
<p><tt>(define-record-type bq<br>
(fields<br>
(immutable data)<br>
(mutable head)<br>
(mutable tail)<br>
(immutable mutex)<br>
(immutable ready)<br>
(immutable room))<br>
(protocol<br>
(lambda (new)<br>
(lambda (bound)<br>
(new (make-vector bound) 0 0 (make-mutex)<br>
(make-condition) (make-condition))))))
<br>
<br>
(define dequeue!<br>
(lambda (q)<br>
(with-mutex (bq-mutex q)<br>
(let loop ()<br>
(let ([head (bq-head q)])<br>
(cond<br>
[(= head (bq-tail q))<br>
(condition-wait (bq-ready q) (bq-mutex q))<br>
(loop)]<br>
[else<br>
(bq-head-set! q (incr q head))<br>
(condition-signal (bq-room q))<br>
(vector-ref (bq-data q) head)]))))))
<br>
<br>
(define enqueue!<br>
(lambda (item q)<br>
(with-mutex (bq-mutex q)<br>
(let loop ()<br>
(let* ([tail (bq-tail q)] [tail^ (incr q tail)])<br>
(cond<br>
[(= tail^ (bq-head q))<br>
(condition-wait (bq-room q) (bq-mutex q))<br>
(loop)]<br>
[else<br>
(vector-set! (bq-data q) tail item)<br>
(bq-tail-set! q tail^)<br>
(condition-signal (bq-ready q))]))))))
<br>
<br>
(define incr<br>
(lambda (q i)<br>
(modulo (+ i 1) (vector-length (bq-data q)))))</tt>
<p>The code below demonstrates the use of the bounded queue abstraction
with a set of threads that act as consumers and producers of the
data in the queue.
<p>
<p><tt>(define job-queue)<br>
(define die? #f)
<br>
<br>
(define make-job<br>
(let ([count 0])<br>
(define fib<br>
(lambda (n)<br>
(if (< n 2)<br>
n<br>
(+ (fib (- n 2)) (fib (- n 1))))))<br>
(lambda (n)<br>
(set! count (+ count 1))<br>
(printf "Adding job #~s = (lambda () (fib ~s))\n" count n)<br>
(cons count (lambda () (fib n))))))
<br>
<br>
(define make-producer<br>
(lambda (n)<br>
(rec producer<br>
(lambda ()<br>
(printf "producer ~s posting a job\n" n)<br>
(enqueue! (make-job (+ 20 (random 10))) job-queue)<br>
(if die?<br>
(printf "producer ~s dying\n" n)<br>
(producer))))))
<br>
<br>
(define make-consumer<br>
(lambda (n)<br>
(rec consumer<br>
(lambda ()<br>
(printf "consumer ~s looking for a job~%" n)<br>
(let ([job (dequeue! job-queue)])<br>
(if die?<br>
(printf "consumer ~s dying\n" n)<br>
(begin<br>
(printf "consumer ~s executing job #~s~%" n (car job))<br>
(printf "consumer ~s computed: ~s~%" n ((cdr job)))<br>
(consumer))))))))
<br>
<br>
(define (bq-test np nc)<br>
(set! job-queue (make-bq (max nc np)))<br>
(do ([np np (- np 1)])<br>
((<= np 0))<br>
(fork-thread (make-producer np)))<br>
(do ([nc nc (- nc 1)])<br>
((<= nc 0))<br>
(fork-thread (make-consumer nc))))</tt>
<p>Here are a possible first several lines of output from a sample run of the example program.
<p>
<p><tt>> (begin<br>
(bq-test 3 4)<br>
(system "sleep 3")<br>
(set! die? #t))<br>
producer 3 posting a job<br>
Adding job #1 = (lambda () (fib 29))<br>
producer 3 posting a job<br>
Adding job #2 = (lambda () (fib 26))<br>
producer 3 posting a job<br>
Adding job #3 = (lambda () (fib 22))<br>
producer 3 posting a job<br>
Adding job #4 = (lambda () (fib 21))<br>
producer 2 posting a job<br>
Adding job #5 = (lambda () (fib 29))<br>
producer 1 posting a job<br>
Adding job #6 = (lambda () (fib 29))<br>
consumer 4 looking for a job<br>
producer 3 posting a job<br>
Adding job #7 = (lambda () (fib 24))<br>
consumer 4 executing job #1<br>
consumer 3 looking for a job<br>
producer 2 posting a job<br>
Adding job #8 = (lambda () (fib 26))<br>
consumer 3 executing job #2<br>
consumer 3 computed: 121393<br>
consumer 3 looking for a job<br>
producer 1 posting a job<br>
Adding job #9 = (lambda () (fib 26))<br>
...</tt>
<p>Additional examples, including definitions of suspendable threads and
threads that automatically terminate when they become inaccessible, are
given in "A Scheme for native threads [<a class=citation href="./bibliography.html#g156">10</a>]."
<p>
<hr class=copyright align=left>
<p>
<a class=plain href="index.html">Chez Scheme Version 9 User's Guide</a><br>
Copyright © 2016 Cisco Systems, Inc.<br>
Licensed under the <a href="http://www.apache.org/licenses/LICENSE-2.0">Apache License Version 2.0</a>
(<a class=plain href="canned/copyright.html">full copyright notice.</a>).</br>
Revised June 2016 for Chez Scheme Version 9.4<br>
<a class=plain href="canned/about.html">about this book</a>
</tr></table>
</body>
</html>