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 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455
|
/* message.c: MPS/CLIENT MESSAGES
*
* $Id$
* Copyright (c) 2001-2020 Ravenbrook Limited. See end of file for license.
*
* DESIGN
*
* .design: <design/message> (it really exists).
*
* PURPOSE
*
* .purpose: Provide the generic part of the MPS / Client message
* interface. Messages are instances of Message Classes; much of the
* "real work" goes on in the modules that provide the actual messages.
*
* TODO: Consider using protocol classes for messages.
*/
#include "bt.h"
#include "mpm.h"
SRCID(message, "$Id$");
/* Maps from a Ring pointer to the message */
#define MessageNodeMessage(node) \
PARENT(MessageStruct, queueRing, node)
/* forward declarations */
static Bool MessageTypeEnabled(Arena arena, MessageType type);
static void MessageDelete(Message message);
/* Internal (MPM) Interface -- functions for message originator
*
*/
Bool MessageTypeCheck(MessageType type)
{
CHECKL(type < MessageTypeLIMIT);
UNUSED(type); /* <code/mpm.c#check.unused> */
return TRUE;
}
/* See .message.clocked. Currently finalization messages are the */
/* only ones that can be numerous. */
#define MessageIsClocked(message) \
((message)->klass->type != MessageTypeFINALIZATION)
Bool MessageCheck(Message message)
{
CHECKS(Message, message);
CHECKU(Arena, message->arena);
CHECKD(MessageClass, message->klass);
CHECKD_NOSIG(Ring, &message->queueRing);
/* postedClock is uncheckable for clocked message types, */
/* but must be 0 for unclocked message types: */
CHECKL(MessageIsClocked(message) || (message->postedClock == 0));
return TRUE;
}
Bool MessageClassCheck(MessageClass klass)
{
CHECKS(MessageClass, klass);
CHECKL(klass->name != NULL);
CHECKL(MessageTypeCheck(klass->type));
CHECKL(FUNCHECK(klass->delete));
CHECKL(FUNCHECK(klass->finalizationRef));
CHECKL(FUNCHECK(klass->gcLiveSize));
CHECKL(FUNCHECK(klass->gcCondemnedSize));
CHECKL(FUNCHECK(klass->gcNotCondemnedSize));
CHECKL(FUNCHECK(klass->gcStartWhy));
CHECKL(klass->endSig == MessageClassSig);
return TRUE;
}
void MessageInit(Arena arena, Message message, MessageClass klass,
MessageType type)
{
AVERT(Arena, arena);
AVER(message != NULL);
AVERT(MessageClass, klass);
AVERT(MessageType, type);
message->arena = arena;
message->klass = klass;
RingInit(&message->queueRing);
message->postedClock = 0;
message->sig = MessageSig;
AVERT(Message, message);
AVER(MessageGetType(message) == type);
}
void MessageFinish(Message message)
{
AVERT(Message, message);
AVER(RingIsSingle(&message->queueRing));
message->sig = SigInvalid;
RingFinish(&message->queueRing);
}
Arena MessageArena(Message message)
{
AVERT(Message, message);
return message->arena;
}
Bool MessageOnQueue(Message message)
{
AVERT(Message, message);
/* message is on queue if and only if its ring is not a singleton. */
return !RingIsSingle(&message->queueRing);
}
/* Post a message to the arena's queue of pending messages */
void MessagePost(Arena arena, Message message)
{
AVERT(Arena, arena);
AVERT(Message, message);
/* queueRing field must be a singleton, see */
/* <design/message#.fun.post.singleton> */
AVER(!MessageOnQueue(message));
if(MessageTypeEnabled(arena, MessageGetType(message))) {
/* .message.clocked: Reading the clock with ClockNow() */
/* involves an mpslib call, so we avoid it for message */
/* types that may be numerous. */
if(MessageIsClocked(message)) {
message->postedClock = ClockNow();
}
RingAppend(&arena->messageRing, &message->queueRing);
} else {
/* discard message immediately if client hasn't enabled that type */
MessageDiscard(arena, message);
}
}
/* Return the message at the head of the arena's queue */
static Message MessageHead(Arena arena)
{
AVERT(Arena, arena);
AVER(!RingIsSingle(&arena->messageRing));
return MessageNodeMessage(RingNext(&arena->messageRing));
}
/* Delete the message at the head of the queue (helper function). */
static void MessageDeleteHead(Arena arena)
{
Message message;
AVERT(Arena, arena);
AVER(!RingIsSingle(&arena->messageRing));
message = MessageHead(arena);
AVERT(Message, message);
RingRemove(&message->queueRing);
MessageDelete(message);
}
/* Empty the queue by discarding all messages */
void MessageEmpty(Arena arena)
{
AVERT(Arena, arena);
while(!RingIsSingle(&arena->messageRing)) {
MessageDeleteHead(arena);
}
}
/* Delivery (Client) Interface -- functions for recipient
*
* Most of these functions are exposed through the external MPS
* interface.
*/
static Bool MessageTypeEnabled(Arena arena, MessageType type)
{
AVERT(Arena, arena);
AVERT(MessageType, type);
return BTGet(arena->enabledMessageTypes, type);
}
void MessageTypeEnable(Arena arena, MessageType type)
{
AVERT(Arena, arena);
AVERT(MessageType, type);
BTSet(arena->enabledMessageTypes, type);
}
void MessageTypeDisable(Arena arena, MessageType type)
{
Message message;
AVERT(Arena, arena);
AVERT(MessageType, type);
/* Flush existing messages of this type */
while(MessageGet(&message, arena, type)) {
MessageDelete(message);
}
BTRes(arena->enabledMessageTypes, type);
}
/* Any messages on the queue? */
Bool MessagePoll(Arena arena)
{
AVERT(Arena, arena);
if(RingIsSingle(&arena->messageRing)) {
return FALSE;
} else {
return TRUE;
}
}
/* Return the type of the message at the head of the queue, if any */
Bool MessageQueueType(MessageType *typeReturn, Arena arena)
{
Message message;
MessageType type;
AVER(typeReturn != NULL);
AVERT(Arena, arena);
if(!MessagePoll(arena)) {
return FALSE;
}
message = MessageHead(arena);
type = MessageGetType(message);
*typeReturn = type;
return TRUE;
}
/* Get next message of specified type, removing it from the queue */
Bool MessageGet(Message *messageReturn, Arena arena, MessageType type)
{
Ring node, next;
AVER(messageReturn != NULL);
AVERT(Arena, arena);
AVERT(MessageType, type);
RING_FOR(node, &arena->messageRing, next) {
Message message = RING_ELT(Message, queueRing, node);
if(MessageGetType(message) == type) {
RingRemove(&message->queueRing);
*messageReturn = message;
return TRUE;
}
}
return FALSE;
}
/* Discard a message (recipient has finished using it). */
void MessageDiscard(Arena arena, Message message)
{
AVERT(Arena, arena);
AVERT(Message, message);
AVER(!MessageOnQueue(message));
MessageDelete(message);
}
/* Message Methods, Generic
*
* (Some of these dispatch on message->klass).
*/
/* Return the type of a message */
MessageType MessageGetType(Message message)
{
MessageClass klass;
AVERT(Message, message);
klass = message->klass;
AVERT(MessageClass, klass);
return klass->type;
}
/* Return the class of a message */
MessageClass MessageGetClass(Message message)
{
AVERT(Message, message);
return message->klass;
}
Clock MessageGetClock(Message message)
{
AVERT(Message, message);
return message->postedClock;
}
static void MessageDelete(Message message)
{
AVERT(Message, message);
(*message->klass->delete)(message);
}
/* Message Method Dispatchers, Type-specific
*
*/
void MessageFinalizationRef(Ref *refReturn, Arena arena,
Message message)
{
AVER(refReturn != NULL);
AVERT(Arena, arena);
AVERT(Message, message);
AVER(MessageGetType(message) == MessageTypeFINALIZATION);
(*message->klass->finalizationRef)(refReturn, arena, message);
}
Size MessageGCLiveSize(Message message)
{
AVERT(Message, message);
AVER(MessageGetType(message) == MessageTypeGC);
return (*message->klass->gcLiveSize)(message);
}
Size MessageGCCondemnedSize(Message message)
{
AVERT(Message, message);
AVER(MessageGetType(message) == MessageTypeGC);
return (*message->klass->gcCondemnedSize)(message);
}
Size MessageGCNotCondemnedSize(Message message)
{
AVERT(Message, message);
AVER(MessageGetType(message) == MessageTypeGC);
return (*message->klass->gcNotCondemnedSize)(message);
}
const char *MessageGCStartWhy(Message message)
{
AVERT(Message, message);
AVER(MessageGetType(message) == MessageTypeGCSTART);
return (*message->klass->gcStartWhy)(message);
}
/* Message Method Stubs, Type-specific
*
*/
void MessageNoFinalizationRef(Ref *refReturn, Arena arena,
Message message)
{
AVER(refReturn != NULL);
AVERT(Arena, arena);
AVERT(Message, message);
NOTREACHED;
}
Size MessageNoGCLiveSize(Message message)
{
AVERT(Message, message);
UNUSED(message);
NOTREACHED;
return (Size)0;
}
Size MessageNoGCCondemnedSize(Message message)
{
AVERT(Message, message);
UNUSED(message);
NOTREACHED;
return (Size)0;
}
Size MessageNoGCNotCondemnedSize(Message message)
{
AVERT(Message, message);
UNUSED(message);
NOTREACHED;
return (Size)0;
}
const char *MessageNoGCStartWhy(Message message)
{
AVERT(Message, message);
UNUSED(message);
NOTREACHED;
return NULL;
}
/* C. COPYRIGHT AND LICENSE
*
* Copyright (C) 2001-2020 Ravenbrook Limited <https://www.ravenbrook.com/>.
*
* 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.
*
* 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.
*/
|