source: libcfa/src/concurrency/monitor.hfa @ fe9468e2

ADTarm-ehast-experimentalenumforall-pointer-decayjacob/cs343-translationnew-ast-unique-exprpthread-emulationqualifiedEnum
Last change on this file since fe9468e2 was 77a2994, checked in by Thierry Delisle <tdelisle@…>, 4 years ago

Implemented joining of threads.
It behaves very similarly to monitor destructors.

  • Property mode set to 100644
File size: 3.8 KB
RevLine 
[f07e037]1//
2// Cforall Version 1.0.0 Copyright (C) 2016 University of Waterloo
3//
4// The contents of this file are covered under the licence agreement in the
5// file "LICENCE" distributed with Cforall.
6//
7// monitor --
8//
9// Author           : Thierry Delisle
10// Created On       : Thd Feb 23 12:27:26 2017
[91c389a]11// Last Modified By : Peter A. Buhr
[121be3e]12// Last Modified On : Wed Dec  4 07:55:32 2019
13// Update Count     : 11
[f07e037]14//
15
[6b0b624]16#pragma once
[f07e037]17
[690f13c]18#include <stddef.h>
19
[91c389a]20#include <assert.h>
[f07e037]21#include "invoke.h"
[58b6d1b]22#include "stdlib.hfa"
[f07e037]23
[1dcd9554]24trait is_monitor(dtype T) {
[ac2b598]25        $monitor * get_monitor( T & );
[1dcd9554]26        void ^?{}( T & mutex );
27};
28
[ac2b598]29static inline void ?{}($monitor & this) with( this ) {
[c40e7c5]30        lock{};
31        entry_queue{};
32        signal_stack{};
[121be3e]33        owner         = 0p;
[c40e7c5]34        recursion     = 0;
[121be3e]35        mask.accepted = 0p;
36        mask.data     = 0p;
[c40e7c5]37        mask.size     = 0;
[121be3e]38        dtor_node     = 0p;
[cc7f4b1]39}
40
[ac2b598]41static inline void ^?{}($monitor & ) {}
[6c3a5ac1]42
[cc7f4b1]43struct monitor_guard_t {
[ac2b598]44        $monitor **     m;
[0cf5b79]45        __lock_size_t           count;
46        __monitor_group_t prev;
[51f3798]47};
48
[ac2b598]49void ?{}( monitor_guard_t & this, $monitor ** m, __lock_size_t count, void (*func)() );
[242a902]50void ^?{}( monitor_guard_t & this );
[51f3798]51
[549c006]52struct monitor_dtor_guard_t {
[ac2b598]53        $monitor *    m;
[0cf5b79]54        __monitor_group_t prev;
[77a2994]55        bool join;
[549c006]56};
57
[77a2994]58void ?{}( monitor_dtor_guard_t & this, $monitor ** m, void (*func)(), bool join );
[549c006]59void ^?{}( monitor_dtor_guard_t & this );
60
[751d963]61static inline forall( dtype T | sized(T) | { void ^?{}( T & mutex ); } )
62void delete( T * th ) {
63        ^(*th){};
64        free( th );
65}
66
[5ea06d6]67//-----------------------------------------------------------------------------
68// Internal scheduling
[0c78741]69
70struct __condition_criterion_t {
[025278e]71        // Whether or not the criterion is met (True if met)
72        bool ready;
73
74        // The monitor this criterion concerns
[ac2b598]75        $monitor * target;
[025278e]76
77        // The parent node to which this criterion belongs
78        struct __condition_node_t * owner;
79
80        // Intrusive linked list Next field
81        __condition_criterion_t * next;
[0c78741]82};
83
[0cf5b79]84static inline __condition_criterion_t * & get_next( __condition_criterion_t & this ) {
85        return this.next;
86}
87
[0c78741]88struct __condition_node_t {
[025278e]89        // Thread that needs to be woken when all criteria are met
[ac2b598]90        $thread * waiting_thread;
[025278e]91
92        // Array of criteria (Criterions are contiguous in memory)
93        __condition_criterion_t * criteria;
94
95        // Number of criterions in the criteria
[c1a9c86]96        __lock_size_t count;
[025278e]97
98        // Intrusive linked list Next field
99        __condition_node_t * next;
100
101        // Custom user info accessible before signalling
102        uintptr_t user_info;
[0c78741]103};
104
[0cf5b79]105static inline __condition_node_t * & get_next( __condition_node_t & this ) {
106        return this.next;
107}
[0c78741]108
[ac2b598]109void ?{}(__condition_node_t & this, $thread * waiting_thread, __lock_size_t count, uintptr_t user_info );
[e5c8488]110void ?{}(__condition_criterion_t & this );
[ac2b598]111void ?{}(__condition_criterion_t & this, $monitor * target, __condition_node_t * owner );
[e5c8488]112
[5ea06d6]113struct condition {
[025278e]114        // Link list which contains the blocked threads as-well as the information needed to unblock them
[0cf5b79]115        __queue_t(__condition_node_t) blocked;
[025278e]116
117        // Array of monitor pointers (Monitors are NOT contiguous in memory)
[ac2b598]118        $monitor ** monitors;
[025278e]119
120        // Number of monitors in the array
[c1a9c86]121        __lock_size_t monitor_count;
[5ea06d6]122};
[51f3798]123
[242a902]124static inline void ?{}( condition & this ) {
[121be3e]125        this.monitors = 0p;
[242a902]126        this.monitor_count = 0;
[5ea06d6]127}
[2781e65]128
[242a902]129static inline void ^?{}( condition & this ) {
130        free( this.monitors );
[1167cd4]131}
132
[8fc45b7]133              void wait        ( condition & this, uintptr_t user_info = 0 );
134              bool signal      ( condition & this );
135              bool signal_block( condition & this );
[3381ed7]136static inline bool is_empty    ( condition & this ) { return this.blocked.head == 1p; }
[8fc45b7]137         uintptr_t front       ( condition & this );
[be3d020]138
[97e3296]139//-----------------------------------------------------------------------------
140// External scheduling
141
[c81ebf9]142struct __acceptable_t {
[b1672e1]143        inline struct __monitor_group_t;
[9f5ecf5]144        bool is_dtor;
[c81ebf9]145};
146
[6ae8c92]147void __waitfor_internal( const __waitfor_mask_t & mask, int duration );
[c81ebf9]148
[6b0b624]149// Local Variables: //
150// mode: c //
151// tab-width: 4 //
152// End: //
Note: See TracBrowser for help on using the repository browser.