This repository was archived by the owner on Mar 20, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 42
Expand file tree
/
Copy pathmechanism.hpp
More file actions
153 lines (137 loc) · 5.06 KB
/
mechanism.hpp
File metadata and controls
153 lines (137 loc) · 5.06 KB
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
/*
Copyright (c) 2019, Blue Brain Project
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
THE POSSIBILITY OF SUCH DAMAGE.
*/
#pragma once
#include <string.h>
#include "coreneuron/nrnconf.h"
#include "coreneuron/utils/memory.h"
namespace coreneuron {
// OpenACC with PGI compiler has issue when union is used and hence use struct
// \todo check if newer PGI versions has resolved this issue
#if defined(_OPENACC)
struct ThreadDatum {
int i;
double* pval;
void* _pvoid;
};
#else
union ThreadDatum {
double val;
int i;
double* pval;
void* _pvoid;
};
#endif
/* will go away at some point */
struct Point_process {
int _i_instance;
short _type;
short _tid; /* NrnThread id */
};
struct NetReceiveBuffer_t {
int* _displ; /* _displ_cnt + 1 of these */
int* _nrb_index; /* _cnt of these (order of increasing _pnt_index) */
int* _pnt_index;
int* _weight_index;
double* _nrb_t;
double* _nrb_flag;
int _cnt;
int _displ_cnt; /* number of unique _pnt_index */
int _size; /* capacity */
int _pnt_offset;
};
struct NetSendBuffer_t : MemoryManaged {
int* _sendtype; // net_send, net_event, net_move
int* _vdata_index;
int* _pnt_index;
int* _weight_index;
double* _nsb_t;
double* _nsb_flag;
int _cnt;
int _size; /* capacity */
int reallocated; /* if buffer resized/reallocated, needs to be copy to cpu */
NetSendBuffer_t(int size) : _size(size) {
_cnt = 0;
_sendtype = (int*)ecalloc_align(_size, sizeof(int));
_vdata_index = (int*)ecalloc_align(_size, sizeof(int));
_pnt_index = (int*)ecalloc_align(_size, sizeof(int));
_weight_index = (int*)ecalloc_align(_size, sizeof(int));
// when == 1, NetReceiveBuffer_t is newly allocated (i.e. we need to free previous copy
// and recopy new data
reallocated = 1;
_nsb_t = (double*)ecalloc_align(_size, sizeof(double));
_nsb_flag = (double*)ecalloc_align(_size, sizeof(double));
}
~NetSendBuffer_t() {
free_memory(_sendtype);
free_memory(_vdata_index);
free_memory(_pnt_index);
free_memory(_weight_index);
free_memory(_nsb_t);
free_memory(_nsb_flag);
}
void grow() {
#if defined(_OPENACC)
int cannot_reallocate_on_device = 0;
assert(cannot_reallocate_on_device);
#else
int new_size = _size * 2;
grow_buf(&_sendtype, _size, new_size);
grow_buf(&_vdata_index, _size, new_size);
grow_buf(&_pnt_index, _size, new_size);
grow_buf(&_weight_index, _size, new_size);
grow_buf(&_nsb_t, _size, new_size);
grow_buf(&_nsb_flag, _size, new_size);
_size = new_size;
#endif
}
private:
template <typename T>
void grow_buf(T** buf, int size, int new_size) {
T* new_buf = nullptr;
new_buf = (T*)ecalloc_align(new_size, sizeof(T));
memcpy(new_buf, *buf, size * sizeof(T));
free(*buf);
*buf = new_buf;
}
};
struct Memb_list {
/* nodeindices contains all nodes this extension is responsible for,
* ordered according to the matrix. This allows to access the matrix
* directly via the nrn_actual_* arrays instead of accessing it in the
* order of insertion and via the node-structure, making it more
* cache-efficient */
int* nodeindices;
int* _permute;
double* data;
Datum* pdata;
ThreadDatum* _thread; /* thread specific data (when static is no good) */
NetReceiveBuffer_t* _net_receive_buffer;
NetSendBuffer_t* _net_send_buffer;
int nodecount; /* actual node count */
int _nodecount_padded;
void* instance; /* mechanism instance */
};
} // namespace coreneuron