source: src/libcfa/concurrency/monitor @ 1c273d0

aaron-thesisarm-ehcleanup-dtorsdeferred_resndemanglerjacob/cs343-translationjenkins-sandboxnew-astnew-ast-unique-exprnew-envno_listpersistent-indexerresolv-newwith_gc
Last change on this file since 1c273d0 was 1c273d0, checked in by Thierry Delisle <tdelisle@…>, 4 years ago

preemption works for threads

  • Property mode set to 100644
File size: 3.0 KB
Line 
1//                              -*- Mode: CFA -*-
2//
3// Cforall Version 1.0.0 Copyright (C) 2016 University of Waterloo
4//
5// The contents of this file are covered under the licence agreement in the
6// file "LICENCE" distributed with Cforall.
7//
8// monitor --
9//
10// Author           : Thierry Delisle
11// Created On       : Thd Feb 23 12:27:26 2017
12// Last Modified By : Thierry Delisle
13// Last Modified On : --
14// Update Count     : 0
15//
16
17#ifndef MONITOR_H
18#define MONITOR_H
19
20#include <stddef.h>
21
22#include "assert"
23#include "invoke.h"
24#include "stdlib"
25
26static inline void ?{}(monitor_desc * this) {
27        this->owner = NULL;
28        this->recursion = 0;
29}
30
31struct monitor_guard_t {
32        monitor_desc ** m;
33        int count;
34        monitor_desc ** prev_mntrs;
35        unsigned short  prev_count;
36};
37
38static inline int ?<?(monitor_desc* lhs, monitor_desc* rhs) {
39        return ((intptr_t)lhs) < ((intptr_t)rhs);
40}
41
42void ?{}( monitor_guard_t * this, monitor_desc ** m, int count );
43void ^?{}( monitor_guard_t * this );
44
45//-----------------------------------------------------------------------------
46// Internal scheduling
47
48struct __condition_criterion_t {
49        bool ready;                                             //Whether or not the criterion is met (True if met)
50        monitor_desc * target;                          //The monitor this criterion concerns
51        struct __condition_node_t * owner;              //The parent node to which this criterion belongs
52        __condition_criterion_t * next;         //Intrusive linked list Next field
53};
54
55struct __condition_node_t {
56        thread_desc * waiting_thread;                   //Thread that needs to be woken when all criteria are met
57        __condition_criterion_t * criteria;     //Array of criteria (Criterions are contiguous in memory)
58        unsigned short count;                           //Number of criterions in the criteria
59        __condition_node_t * next;                      //Intrusive linked list Next field
60        uintptr_t user_info;                            //Custom user info accessible before signalling
61};
62
63struct __condition_blocked_queue_t {
64        __condition_node_t * head;
65        __condition_node_t ** tail;
66};
67
68void ?{}( __condition_blocked_queue_t * );
69void append( __condition_blocked_queue_t *, __condition_node_t * );
70__condition_node_t * pop_head( __condition_blocked_queue_t * );
71
72struct condition {
73        __condition_blocked_queue_t blocked;    //Link list which contains the blocked threads as-well as the information needed to unblock them
74        monitor_desc ** monitors;                       //Array of monitor pointers (Monitors are NOT contiguous in memory)
75        unsigned short monitor_count;                   //Number of monitors in the array
76};
77
78static inline void ?{}( condition * this ) {
79        this->monitors = NULL;
80        this->monitor_count = 0;
81}
82
83static inline void ^?{}( condition * this ) {
84        free( this->monitors );
85}
86
87void wait( condition * this, uintptr_t user_info = 0 );
88bool signal( condition * this );
89bool signal_block( condition * this );
90static inline bool is_empty( condition * this ) { return !this->blocked.head; }
91uintptr_t front( condition * this );
92
93struct __acceptable_t {
94        void (*func)(void);
95        unsigned short count;
96        monitor_desc * monitors[1];
97};
98
99void __accept_internal( unsigned short count, __acceptable_t * acceptables, void (*func)(void) );
100
101#endif //MONITOR_H
Note: See TracBrowser for help on using the repository browser.