source: src/libcfa/concurrency/monitor@ 02d241f

//                              -*- Mode: CFA -*-
//
// Cforall Version 1.0.0 Copyright (C) 2016 University of Waterloo
//
// The contents of this file are covered under the licence agreement in the
// file "LICENCE" distributed with Cforall.
//
// monitor --
//
// Author           : Thierry Delisle
// Created On       : Thd Feb 23 12:27:26 2017
// Last Modified By : Thierry Delisle
// Last Modified On : --
// Update Count     : 0
//

#ifndef MONITOR_H
#define MONITOR_H

#include "assert"
#include "invoke.h"
#include "stdlib"

static inline void ?{}(monitor_desc * this) {
        this->owner = 0;
        this->recursion = 0;
}

//Array entering routine
void enter(monitor_desc **, int count);
void leave(monitor_desc **, int count);

struct monitor_guard_t {
        monitor_desc ** m;
        int count;
};

static inline int ?<?(monitor_desc* lhs, monitor_desc* rhs) {
        return ((intptr_t)lhs) < ((intptr_t)rhs);
}

static inline void ?{}( monitor_guard_t * this, monitor_desc ** m, int count ) {
        this->m = m;
        this->count = count;
        qsort(this->m, count);
        enter( this->m, this->count );
}

static inline void ^?{}( monitor_guard_t * this ) {
        leave( this->m, this->count );
}


#endif //MONITOR_H