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
|
/*
* Copyright (c) 1999-2005 Mark D. Hill and David A. Wood
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met: redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer;
* 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;
* neither the name of the copyright holders 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
* OWNER 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.
*/
// External Types
external_type(MessageBuffer, buffer="yes", inport="yes", outport="yes");
external_type(OutPort, primitive="yes");
external_type(InPort, primitive="yes") {
bool isReady();
void dequeue();
int dequeue_getDelayCycles();
void recycle();
bool isEmpty();
}
external_type(NodeID, default="0");
external_type(MachineID);
MessageBuffer getMandatoryQueue(int core_id);
external_type(Set, non_obj="yes") {
void setSize(int);
void add(NodeID);
void addSet(Set);
void remove(NodeID);
void removeSet(Set);
void broadcast();
void addRandom();
void clear();
int count();
bool isElement(NodeID);
bool isEqual(Set);
bool isSuperset(Set);
bool intersectionIsEmpty(Set);
NodeID smallestElement();
}
external_type(NetDest, non_obj="yes") {
void setSize(int);
void setSize(int, int);
void add(NodeID);
void add(MachineID);
void addSet(Set);
void addNetDest(NetDest);
void setNetDest(MachineType, Set);
void remove(NodeID);
void remove(MachineID);
void removeSet(Set);
void removeNetDest(NetDest);
void broadcast();
void broadcast(MachineType);
void addRandom();
void clear();
Set toSet();
int count();
bool isElement(NodeID);
bool isElement(MachineID);
bool isSuperset(Set);
bool isSuperset(NetDest);
bool isEmpty();
bool intersectionIsEmpty(Set);
bool intersectionIsEmpty(NetDest);
MachineID smallestElement(MachineType);
}
external_type(Sequencer) {
void readCallback(Address, DataBlock);
void writeCallback(Address, DataBlock);
void checkCoherence(Address);
void profileNack(Address, int, int, uint64);
}
external_type(TimerTable, inport="yes") {
bool isReady();
Address readyAddress();
void set(Address, int);
void unset(Address);
bool isSet(Address);
}
external_type(GenericBloomFilter) {
void clear(int);
void increment(Address, int);
void decrement(Address, int);
void set(Address, int);
void unset(Address, int);
bool isSet(Address, int);
int getCount(Address, int);
}
|
