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
|
#include <linux/sched.h>
#include <linux/slab.h>
#include <litmus/litmus.h>
#include <litmus/reservation.h>
//#define TRACE(fmt, args...) do {} while (false)
//#define TRACE_TASK(fmt, args...) do {} while (false)
#define BUDGET_ENFORCEMENT_AT_C 0
void reservation_init(struct reservation *res)
{
memset(res, sizeof(*res), 0);
res->state = RESERVATION_INACTIVE;
INIT_LIST_HEAD(&res->clients);
}
struct task_struct* default_dispatch_client(
struct reservation *res,
lt_t *for_at_most)
{
struct reservation_client *client, *next;
struct task_struct* tsk;
BUG_ON(res->state != RESERVATION_ACTIVE);
*for_at_most = 0;
list_for_each_entry_safe(client, next, &res->clients, list) {
tsk = client->dispatch(client);
if (likely(tsk)) {
return tsk;
}
}
return NULL;
}
static struct task_struct * task_client_dispatch(struct reservation_client *client)
{
struct task_client *tc = container_of(client, struct task_client, client);
return tc->task;
}
void task_client_init(struct task_client *tc, struct task_struct *tsk,
struct reservation *res)
{
memset(&tc->client, sizeof(tc->client), 0);
tc->client.dispatch = task_client_dispatch;
tc->client.reservation = res;
tc->task = tsk;
}
static void sup_scheduler_update_at(
struct sup_reservation_environment* sup_env,
lt_t when)
{
//TRACE("SCHEDULER_UPDATE_AT update: %llu > when %llu\n", sup_env->next_scheduler_update, when);
if (sup_env->next_scheduler_update > when)
sup_env->next_scheduler_update = when;
}
void sup_scheduler_update_after(
struct sup_reservation_environment* sup_env,
lt_t timeout)
{
sup_scheduler_update_at(sup_env, sup_env->env.current_time + timeout);
}
static int _sup_queue_depleted(
struct sup_reservation_environment* sup_env,
struct reservation *res)
{
struct list_head *pos;
struct reservation *queued;
int passed_earlier = 0;
list_for_each(pos, &sup_env->depleted_reservations) {
queued = list_entry(pos, struct reservation, list);
if (queued->next_replenishment > res->next_replenishment) {
list_add(&res->list, pos->prev);
return passed_earlier;
} else
passed_earlier = 1;
}
list_add_tail(&res->list, &sup_env->depleted_reservations);
return passed_earlier;
}
static void sup_queue_depleted(
struct sup_reservation_environment* sup_env,
struct reservation *res)
{
int passed_earlier = _sup_queue_depleted(sup_env, res);
/* check for updated replenishment time */
if (!passed_earlier)
sup_scheduler_update_at(sup_env, res->next_replenishment);
}
static int _sup_queue_active(
struct sup_reservation_environment* sup_env,
struct reservation *res)
{
struct list_head *pos;
struct reservation *queued;
int passed_active = 0;
list_for_each(pos, &sup_env->active_reservations) {
queued = list_entry(pos, struct reservation, list);
if (queued->priority > res->priority) {
list_add(&res->list, pos->prev);
return passed_active;
} else if (queued->state == RESERVATION_ACTIVE)
passed_active = 1;
}
list_add_tail(&res->list, &sup_env->active_reservations);
return passed_active;
}
static void sup_queue_active(
struct sup_reservation_environment* sup_env,
struct reservation *res)
{
int passed_active = _sup_queue_active(sup_env, res);
/* check for possible preemption */
if (res->state == RESERVATION_ACTIVE && !passed_active)
sup_env->next_scheduler_update = SUP_RESCHEDULE_NOW;
else {
/* Active means this reservation is draining budget => make sure
* the scheduler is called to notice when the reservation budget has been
* drained completely. */
sup_scheduler_update_after(sup_env, res->cur_budget);
}
}
static void sup_queue_reservation(
struct sup_reservation_environment* sup_env,
struct reservation *res)
{
switch (res->state) {
case RESERVATION_INACTIVE:
list_add(&res->list, &sup_env->inactive_reservations);
break;
case RESERVATION_DEPLETED:
sup_queue_depleted(sup_env, res);
break;
case RESERVATION_ACTIVE_IDLE:
case RESERVATION_ACTIVE:
sup_queue_active(sup_env, res);
break;
}
}
void sup_add_new_reservation(
struct sup_reservation_environment* sup_env,
struct reservation* new_res)
{
new_res->env = &sup_env->env;
sup_queue_reservation(sup_env, new_res);
}
struct reservation* sup_find_by_id(struct sup_reservation_environment* sup_env,
unsigned int id)
{
struct reservation *res;
list_for_each_entry(res, &sup_env->active_reservations, list) {
if (res->id == id)
return res;
}
list_for_each_entry(res, &sup_env->inactive_reservations, list) {
if (res->id == id)
return res;
}
list_for_each_entry(res, &sup_env->depleted_reservations, list) {
if (res->id == id)
return res;
}
return NULL;
}
static void sup_charge_budget(
struct sup_reservation_environment* sup_env,
lt_t delta)
{
struct list_head *pos, *next;
struct reservation *res;
int encountered_active = 0;
list_for_each_safe(pos, next, &sup_env->active_reservations) {
/* charge all ACTIVE_IDLE up to the first ACTIVE reservation */
res = list_entry(pos, struct reservation, list);
if (res->state == RESERVATION_ACTIVE) {
TRACE("sup_charge_budget ACTIVE R%u drain %llu\n", res->id, delta);
if (encountered_active == 0 && res->blocked_by_ghost == 0) {
TRACE("DRAIN !!\n");
res->ops->drain_budget(res, delta);
encountered_active = 1;
}
} else {
//BUG_ON(res->state != RESERVATION_ACTIVE_IDLE);
TRACE("sup_charge_budget INACTIVE R%u drain %llu\n", res->id, delta);
res->ops->drain_budget(res, delta);
}
if (res->state == RESERVATION_ACTIVE ||
res->state == RESERVATION_ACTIVE_IDLE)
{
/* make sure scheduler is invoked when this reservation expires
* its remaining budget */
TRACE("requesting scheduler update for reservation %u in %llu nanoseconds\n",
res->id, res->cur_budget);
sup_scheduler_update_after(sup_env, res->cur_budget);
}
//if (encountered_active == 2)
/* stop at the first ACTIVE reservation */
// break;
}
//TRACE("finished charging budgets\n");
}
static void sup_replenish_budgets(struct sup_reservation_environment* sup_env)
{
struct list_head *pos, *next;
struct reservation *res;
list_for_each_safe(pos, next, &sup_env->depleted_reservations) {
res = list_entry(pos, struct reservation, list);
if (res->next_replenishment <= sup_env->env.current_time) {
res->ops->replenish(res);
} else {
/* list is ordered by increasing depletion times */
break;
}
}
//TRACE("finished replenishing budgets\n");
/* request a scheduler update at the next replenishment instant */
res = list_first_entry_or_null(&sup_env->depleted_reservations,
struct reservation, list);
if (res)
sup_scheduler_update_at(sup_env, res->next_replenishment);
}
void sup_update_time(
struct sup_reservation_environment* sup_env,
lt_t now)
{
lt_t delta;
/* If the time didn't advance, there is nothing to do.
* This check makes it safe to call sup_advance_time() potentially
* multiple times (e.g., via different code paths. */
//TRACE("(sup_update_time) now: %llu, current_time: %llu\n", now, sup_env->env.current_time);
if (unlikely(now <= sup_env->env.current_time))
return;
delta = now - sup_env->env.current_time;
sup_env->env.current_time = now;
/* check if future updates are required */
if (sup_env->next_scheduler_update <= sup_env->env.current_time)
sup_env->next_scheduler_update = SUP_NO_SCHEDULER_UPDATE;
/* deplete budgets by passage of time */
//TRACE("CHARGE###\n");
sup_charge_budget(sup_env, delta);
/* check if any budgets where replenished */
//TRACE("REPLENISH###\n");
sup_replenish_budgets(sup_env);
}
struct task_struct* sup_dispatch(struct sup_reservation_environment* sup_env)
{
struct reservation *res, *next;
struct task_struct *tsk = NULL;
lt_t time_slice;
list_for_each_entry_safe(res, next, &sup_env->active_reservations, list) {
if (res->state == RESERVATION_ACTIVE) {
tsk = res->ops->dispatch_client(res, &time_slice);
if (likely(tsk)) {
if (time_slice)
sup_scheduler_update_after(sup_env, time_slice);
sup_scheduler_update_after(sup_env, res->cur_budget);
return tsk;
}
}
}
return NULL;
}
static void sup_res_change_state(
struct reservation_environment* env,
struct reservation *res,
reservation_state_t new_state)
{
struct sup_reservation_environment* sup_env;
sup_env = container_of(env, struct sup_reservation_environment, env);
TRACE("reservation R%d state %d->%d at %llu\n",
res->id, res->state, new_state, env->current_time);
list_del(&res->list);
/* check if we need to reschedule because we lost an active reservation */
if (res->state == RESERVATION_ACTIVE && !sup_env->will_schedule)
sup_env->next_scheduler_update = SUP_RESCHEDULE_NOW;
res->state = new_state;
sup_queue_reservation(sup_env, res);
}
void sup_init(struct sup_reservation_environment* sup_env)
{
memset(sup_env, sizeof(*sup_env), 0);
INIT_LIST_HEAD(&sup_env->active_reservations);
INIT_LIST_HEAD(&sup_env->depleted_reservations);
INIT_LIST_HEAD(&sup_env->inactive_reservations);
sup_env->env.change_state = sup_res_change_state;
sup_env->next_scheduler_update = SUP_NO_SCHEDULER_UPDATE;
}
struct reservation* gmp_find_by_id(struct gmp_reservation_environment* gmp_env,
unsigned int id)
{
struct reservation *res;
list_for_each_entry(res, &gmp_env->active_reservations, list) {
if (res->id == id)
return res;
}
list_for_each_entry(res, &gmp_env->inactive_reservations, list) {
if (res->id == id)
return res;
}
list_for_each_entry(res, &gmp_env->depleted_reservations, list) {
if (res->id == id)
return res;
}
return NULL;
}
struct next_timer_event* gmp_find_event_by_id(struct gmp_reservation_environment* gmp_env,
unsigned int id)
{
struct next_timer_event *event;
list_for_each_entry(event, &gmp_env->next_events, list) {
if (event->id == id)
return event;
}
return NULL;
}
struct next_timer_event* gmp_find_event_by_time(struct gmp_reservation_environment* gmp_env,
lt_t when)
{
struct next_timer_event *event;
list_for_each_entry(event, &gmp_env->next_events, list) {
if (event->next_update == when)
return event;
}
return NULL;
}
#define TIMER_RESOLUTION 100000L
static void gmp_add_event(
struct gmp_reservation_environment* gmp_env,
lt_t when, unsigned int id, event_type_t type)
{
struct next_timer_event *nevent, *queued;
struct list_head *pos;
int found = 0, update = 0;
//when = div64_u64(when, TIMER_RESOLUTION);
//when *= TIMER_RESOLUTION;
//printk(KERN_ALERT "GMP_ADD id=%d type=%d when=%llu\n", id, type, when);
nevent = gmp_find_event_by_id(gmp_env, id);
if (nevent)
TRACE("EVENT R%d update prev = %llu, new = %llu\n", nevent->id, nevent->next_update, when);
if (nevent && nevent->next_update > when) {
list_del(&nevent->list);
update = 1;
}
if (!nevent || nevent->type != type || update == 1) {
if (update == 0)
nevent = kzalloc(sizeof(*nevent), GFP_ATOMIC);
BUG_ON(!nevent);
nevent->next_update = when;
nevent->id = id;
nevent->type = type;
nevent->timer_armed_on = NO_CPU;
list_for_each(pos, &gmp_env->next_events) {
queued = list_entry(pos, struct next_timer_event, list);
if (queued->next_update > nevent->next_update) {
list_add(&nevent->list, pos->prev);
found = 1;
TRACE("NEXT_EVENT id=%d type=%d update=%llu ADDED at before %llu\n", nevent->id, nevent->type, nevent->next_update, queued->next_update);
break;
}
}
if (!found) {
list_add_tail(&nevent->list, &gmp_env->next_events);
TRACE("NEXT_EVENT id=%d type=%d update=%llu ADDED at TAIL\n", nevent->id, nevent->type, nevent->next_update);
}
} else {
//TRACE("EVENT FOUND id = %d type=%d when=%llu, NEW EVENT type=%d when=%llu\n", nevent->id, nevent->type, nevent->next_update, type, when);
; //printk(KERN_ALERT "EVENT FOUND id = %d type=%d when=%llu, NEW EVENT type=%d when=%llu\n", nevent->id, nevent->type, nevent->next_update, type, when);
}
TRACE("======START PRINTING EVENT LIST======\n");
gmp_print_events(gmp_env, litmus_clock());
TRACE("======FINISH PRINTING EVENT LIST======\n");
}
void gmp_add_event_after(
struct gmp_reservation_environment* gmp_env, lt_t timeout, unsigned int id, event_type_t type)
{
//printk(KERN_ALERT "ADD_EVENT_AFTER id = %d\n", id);
gmp_add_event(gmp_env, gmp_env->env.current_time + timeout, id, type);
}
static void gmp_queue_depleted(
struct gmp_reservation_environment* gmp_env,
struct reservation *res)
{
struct list_head *pos;
struct reservation *queued;
int found = 0;
//printk(KERN_ALERT "R%d request to enqueue depleted_list\n", res->id);
list_for_each(pos, &gmp_env->depleted_reservations) {
queued = list_entry(pos, struct reservation, list);
if (queued && (queued->next_replenishment > res->next_replenishment)) {
//printk(KERN_ALERT "QUEUED R%d %llu\n", queued->id, queued->next_replenishment);
list_add(&res->list, pos->prev);
found = 1;
break;
}
}
if (!found)
list_add_tail(&res->list, &gmp_env->depleted_reservations);
TRACE("R%d queued to depleted_list\n", res->id);
//printk(KERN_ALERT "R%d queued to depleted_list\n", res->id);
gmp_add_event(gmp_env, res->next_replenishment, res->id, EVENT_REPLENISH);
}
static void gmp_queue_active(
struct gmp_reservation_environment* gmp_env,
struct reservation *res)
{
struct list_head *pos;
struct reservation *queued;
int check_preempt = 1, found = 0;
list_for_each(pos, &gmp_env->active_reservations) {
queued = list_entry(pos, struct reservation, list);
if (queued->priority > res->priority) {
list_add(&res->list, pos->prev);
found = 1;
break;
} else if (queued->scheduled_on == NO_CPU)
check_preempt = 0;
}
if (!found)
list_add_tail(&res->list, &gmp_env->active_reservations);
/* check for possible preemption */
if (res->state == RESERVATION_ACTIVE && check_preempt)
gmp_env->schedule_now++;
#if BUDGET_ENFORCEMENT_AT_C
gmp_add_event_after(gmp_env, res->cur_budget, res->id, EVENT_DRAIN);
#endif
res->event_added = 1;
}
static void gmp_queue_reservation(
struct gmp_reservation_environment* gmp_env,
struct reservation *res)
{
//printk(KERN_ALERT "DEBUG: Passed %s %d %p R%d STATE %d\n",__FUNCTION__,__LINE__, gmp_env, res->id, res->state);
switch (res->state) {
case RESERVATION_INACTIVE:
list_add(&res->list, &gmp_env->inactive_reservations);
break;
case RESERVATION_DEPLETED:
gmp_queue_depleted(gmp_env, res);
break;
case RESERVATION_ACTIVE_IDLE:
case RESERVATION_ACTIVE:
gmp_queue_active(gmp_env, res);
break;
}
}
void gmp_add_new_reservation(
struct gmp_reservation_environment* gmp_env,
struct reservation* new_res)
{
new_res->env = &gmp_env->env;
gmp_queue_reservation(gmp_env, new_res);
}
#if BUDGET_ENFORCEMENT_AT_C
static void gmp_charge_budget(
struct gmp_reservation_environment* gmp_env,
lt_t delta)
{
struct list_head *pos, *next;
struct reservation *res;
list_for_each_safe(pos, next, &gmp_env->active_reservations) {
int drained = 0;
/* charge all ACTIVE_IDLE up to the first ACTIVE reservation */
res = list_entry(pos, struct reservation, list);
if (res->state == RESERVATION_ACTIVE) {
TRACE("gmp_charge_budget ACTIVE R%u scheduled_on=%d drain %llu\n", res->id, res->scheduled_on, delta);
if (res->scheduled_on != NO_CPU && res->blocked_by_ghost == 0) {
TRACE("DRAIN !!\n");
drained = 1;
res->ops->drain_budget(res, delta);
} else {
TRACE("NO DRAIN (not scheduled)!!\n");
}
} else {
//BUG_ON(res->state != RESERVATION_ACTIVE_IDLE);
if (res->state != RESERVATION_ACTIVE_IDLE)
TRACE("BUG!!!!!!!!!!!! gmp_charge_budget()\n");
TRACE("gmp_charge_budget INACTIVE R%u drain %llu\n", res->id, delta);
//if (res->is_ghost != NO_CPU) {
TRACE("DRAIN !!\n");
drained = 1;
res->ops->drain_budget(res, delta);
//}
}
if ((res->state == RESERVATION_ACTIVE ||
res->state == RESERVATION_ACTIVE_IDLE) && (drained == 1))
{
/* make sure scheduler is invoked when this reservation expires
* its remaining budget */
TRACE("requesting gmp_scheduler update for reservation %u in %llu nanoseconds\n", res->id, res->cur_budget);
gmp_add_event_after(gmp_env, res->cur_budget, res->id, EVENT_DRAIN);
res->event_added = 1;
}
//if (encountered_active == 2)
/* stop at the first ACTIVE reservation */
// break;
}
//TRACE("finished charging budgets\n");
}
#else
static void gmp_charge_budget(
struct gmp_reservation_environment* gmp_env,
lt_t delta)
{
return;
}
#endif
static void gmp_replenish_budgets(struct gmp_reservation_environment* gmp_env)
{
struct list_head *pos, *next;
struct reservation *res;
list_for_each_safe(pos, next, &gmp_env->depleted_reservations) {
res = list_entry(pos, struct reservation, list);
if (res->next_replenishment <= gmp_env->env.current_time) {
res->ops->replenish(res);
if (res->is_ghost != NO_CPU) {
TRACE("R%d replenished! scheduled_on=%d\n", res->id, res->scheduled_on);
}
} else {
/* list is ordered by increasing depletion times */
break;
}
}
//TRACE("finished replenishing budgets\n");
}
#define EPSILON 50
/* return schedule_now */
int gmp_update_time(
struct gmp_reservation_environment* gmp_env,
lt_t now)
{
struct next_timer_event *event, *next;
lt_t delta, ret;
/* If the time didn't advance, there is nothing to do.
* This check makes it safe to call sup_advance_time() potentially
* multiple times (e.g., via different code paths. */
//TRACE("(gmp_update_time) now: %llu, current_time: %llu\n", now, gmp_env->env.current_time);
if (unlikely(now <= gmp_env->env.current_time + EPSILON))
return 0;
delta = now - gmp_env->env.current_time;
gmp_env->env.current_time = now;
//gmp_print_events(gmp_env, now);
/* deplete budgets by passage of time */
//TRACE("CHARGE###\n");
gmp_charge_budget(gmp_env, delta);
/* check if any budgets where replenished */
//TRACE("REPLENISH###\n");
gmp_replenish_budgets(gmp_env);
list_for_each_entry_safe(event, next, &gmp_env->next_events, list) {
if (event->next_update < now) {
list_del(&event->list);
//TRACE("EVENT at %llu IS DELETED\n", event->next_update);
kfree(event);
} else {
break;
}
}
//gmp_print_events(gmp_env, litmus_clock());
ret = min(gmp_env->schedule_now, NR_CPUS);
gmp_env->schedule_now = 0;
return ret;
}
void gmp_print_events(struct gmp_reservation_environment* gmp_env, lt_t now)
{
struct next_timer_event *event, *next;
TRACE("GLOBAL EVENTS now=%llu\n", now);
list_for_each_entry_safe(event, next, &gmp_env->next_events, list) {
TRACE("at %llu type=%d id=%d armed_on=%d\n", event->next_update, event->type, event->id, event->timer_armed_on);
}
}
static void gmp_res_change_state(
struct reservation_environment* env,
struct reservation *res,
reservation_state_t new_state)
{
struct gmp_reservation_environment* gmp_env;
gmp_env = container_of(env, struct gmp_reservation_environment, env);
TRACE("GMP reservation R%d state %d->%d at %llu\n",
res->id, res->state, new_state, env->current_time);
list_del(&res->list);
/* check if we need to reschedule because we lost an active reservation */
if (res->state == RESERVATION_ACTIVE)
gmp_env->schedule_now++;
res->state = new_state;
gmp_queue_reservation(gmp_env, res);
}
void gmp_init(struct gmp_reservation_environment* gmp_env)
{
memset(gmp_env, sizeof(*gmp_env), 0);
INIT_LIST_HEAD(&gmp_env->active_reservations);
INIT_LIST_HEAD(&gmp_env->depleted_reservations);
INIT_LIST_HEAD(&gmp_env->inactive_reservations);
INIT_LIST_HEAD(&gmp_env->next_events);
gmp_env->env.change_state = gmp_res_change_state;
gmp_env->schedule_now = 0;
gmp_env->will_schedule = false;
raw_spin_lock_init(&gmp_env->lock);
}
|