/usr/include/flext/flqueue.cpp is in pd-flext-dev 0.6.0+git20161101.1.01318a94-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 | /*
flext - C++ layer for Max and Pure Data externals
Copyright (c) 2001-2015 Thomas Grill (gr@grrrr.org)
For information on usage and redistribution, and for a DISCLAIMER OF ALL
WARRANTIES, see the file, "license.txt," in this distribution.
*/
/*! \file flqueue.cpp
\brief Implementation of the flext message queuing functionality.
\todo Let's see if queuing can be implemented for Max/MSP with defer_low
if FLEXT_PDLOCK is defined, the new PD thread lock functions are used
*/
#ifndef __FLEXT_QUEUE_CPP
#define __FLEXT_QUEUE_CPP
#include "flext.h"
#include "flinternal.h"
#include "flcontainers.h"
#include <cstring> // for memcpy
#include "flpushns.h"
#ifdef FLEXT_THREADS
//! Thread id of message queue thread
FLEXT_TEMPIMPL(FLEXT_TEMPINST(FLEXT_CLASSDEF(flext))::thrid_t FLEXT_CLASSDEF(flext))::thrmsgid;
#endif
FLEXT_TEMPIMPL(bool FLEXT_CLASSDEF(flext_base))::qustarted = false;
#ifdef FLEXT_SHARED
/*
For the shared version it _should_ be possible to have only one queue for all externals.
Yet I don't know how to do this cross-platform
*/
#define PERMANENTIDLE
#endif
FLEXT_TEMPLATE void Trigger();
FLEXT_TEMPLATE
class QueueFifo
: public PooledFifo<flext::MsgBundle>
{
public:
~QueueFifo();
};
FLEXT_TEMPLATE
class Queue:
public flext,
public FLEXT_TEMPINST(QueueFifo)
{
public:
inline bool Empty() const { return !Avail(); }
void Push(MsgBundle *m); // defined after MsgBundle (gcc 3.3. won't take it otherwise...)
};
FLEXT_TEMPLATE
struct QVars {
#if FLEXT_QMODE == 2
static flext::ThrCond *qthrcond;
#elif FLEXT_QMODE == 0
static t_clock *qclk;
#endif
static FLEXT_TEMPINST(Queue) *queue;
};
#if FLEXT_QMODE == 2
FLEXT_TEMPIMPL(flext::ThrCond *QVars)::qthrcond = NULL;
#elif FLEXT_QMODE == 0
FLEXT_TEMPIMPL(t_clock *QVars)::qclk = NULL;
#endif
FLEXT_TEMPIMPL(FLEXT_TEMPINST(Queue) *QVars)::queue = NULL;
#define STATSIZE 8
FLEXT_TEMPIMPL(class FLEXT_CLASSDEF(flext))::MsgBundle:
public flext,
public FifoCell
{
public:
static MsgBundle *New()
{
MsgBundle *m = FLEXT_TEMPINST(QVars)::queue->New();
m->msg.Init();
return m;
}
static void Free(MsgBundle *m)
{
for(Msg *mi = m->msg.nxt; mi; ) {
Msg *mn = mi->nxt;
mi->Free();
delete mi;
mi = mn;
}
m->msg.Free();
FLEXT_TEMPINST(QVars)::queue->Free(m);
}
bool BelongsTo(flext_base *t) const
{
return !msg.nxt && msg.BelongsTo(t);
}
void Idle(flext_base *t)
{
Get()->Idle(t);
}
void Idle(bool (*idlefun)(int argc,const t_atom *argv),int argc,const t_atom *argv)
{
Get()->Idle(idlefun,argc,argv);
}
inline MsgBundle &Add(flext_base *t,int o,const t_symbol *s,int ac,const t_atom *av)
{
Get()->Set(t,o,s,ac,av);
return *this;
}
inline MsgBundle &Add(const t_symbol *r,const t_symbol *s,int ac,const t_atom *av)
{
Get()->Set(r,s,ac,av);
return *this;
}
inline MsgBundle &Add(flext_base *th,int o) // bang
{
return Add(th,o,sym_bang,0,NULL);
}
inline MsgBundle &Add(flext_base *th,int o,float dt)
{
t_atom at;
SetFloat(at,dt);
return Add(th,o,sym_float,1,&at);
}
inline MsgBundle &Add(flext_base *th,int o,int dt)
{
t_atom at;
SetInt(at,dt);
const t_symbol *sym;
#if FLEXT_SYS == FLEXT_SYS_PD
sym = sym_float;
#elif FLEXT_SYS == FLEXT_SYS_MAX
sym = sym_int;
#else
#error Not implemented!
#endif
return Add(th,o,sym,1,&at);
}
inline MsgBundle &Add(flext_base *th,int o,const t_symbol *dt)
{
t_atom at;
SetSymbol(at,dt);
return Add(th,o,sym_symbol,1,&at);
}
inline MsgBundle &Add(flext_base *th,int o,const t_atom &a)
{
const t_symbol *sym;
if(IsSymbol(a))
sym = sym_symbol;
else if(IsFloat(a))
sym = sym_float;
#if FLEXT_SYS == FLEXT_SYS_MAX
else if(IsInt(a))
sym = sym_int;
#endif
#if FLEXT_SYS == FLEXT_SYS_PD
else if(IsPointer(a))
sym = sym_pointer;
#endif
else {
error("atom type not supported");
return *this;
}
return Add(th,o,sym,1,&a);
}
inline MsgBundle &Add(flext_base *th,int o,int argc,const t_atom *argv)
{
return Add(th,o,sym_list,argc,argv);
}
// \note PD sys lock must already be held by caller
inline bool Send() const
{
if(!msg.Ok()) return false; // Empty!
const Msg *m = &msg;
do {
if(m->Send()) {
// we should re-enqeue the message... it can't be a real bundle then, only a solo message
FLEXT_ASSERT(!m->nxt);
return true;
}
m = m->nxt;
} while(m);
return false;
}
private:
class Msg {
public:
inline bool Ok() const { return th || recv; }
void Init()
{
th = NULL;
recv = NULL;
nxt = NULL;
argc = 0;
}
void Free()
{
if(argc > STATSIZE) {
FLEXT_ASSERT(argv);
delete[] argv;
}
}
//! Attention: works only for solo messages, not real bundles!!
bool BelongsTo(flext_base *t) const
{
FLEXT_ASSERT(!nxt);
return th == t;
}
void Set(flext_base *t,int o,const t_symbol *s,int ac,const t_atom *av)
{
FLEXT_ASSERT(t);
th = t;
out = o;
SetMsg(s,ac,av);
}
void Set(const t_symbol *r,const t_symbol *s,int ac,const t_atom *av)
{
FLEXT_ASSERT(r);
th = NULL;
recv = r;
SetMsg(s,ac,av);
}
void Idle(flext_base *t)
{
FLEXT_ASSERT(t);
th = t;
SetMsg(NULL,0,NULL);
}
void Idle(bool (*idlefun)(int argc,const t_atom *argv),int argc,const t_atom *argv)
{
FLEXT_ASSERT(idlefun);
th = NULL;
fun = idlefun;
SetMsg(NULL,argc,argv);
}
bool Send() const
{
if(LIKELY(sym)) {
// messages
if(th) {
if(UNLIKELY(out < 0))
// message to self
th->CbMethodHandler(-1-out,sym,argc,argc > STATSIZE?argv:argl);
else
// message to outlet
th->ToSysAnything(out,sym,argc,argc > STATSIZE?argv:argl);
}
else
flext::SysForward(recv,sym,argc,argc > STATSIZE?argv:argl);
return false;
}
else {
// idle processing
if(th)
// call virtual method
return th->CbIdle();
else
// call static function
return (*fun)(argc,argc > STATSIZE?argv:argl);
}
}
Msg *nxt;
protected:
flext_base *th;
union {
int out;
const t_symbol *recv;
bool (*fun)(int argc,const t_atom *argv);
};
const t_symbol *sym;
int argc;
union {
t_atom *argv;
t_atom argl[STATSIZE];
};
void SetMsg(const t_symbol *s,int cnt,const t_atom *lst)
{
sym = s;
argc = cnt;
if(UNLIKELY(cnt > STATSIZE)) {
argv = new t_atom[cnt];
flext::CopyAtoms(cnt,argv,lst);
}
else
flext::CopyAtoms(cnt,argl,lst);
}
} msg;
Msg *Get()
{
Msg *m = &msg;
if(LIKELY(m->Ok())) {
for(; m->nxt; m = m->nxt) {}
m = m->nxt = new Msg;
m->Init();
}
return m;
}
};
FLEXT_TEMPIMPL(QueueFifo)::~QueueFifo()
{
flext::MsgBundle *n;
while((n = Get()) != NULL) delete n;
}
FLEXT_TEMPIMPL(void Queue)::Push(MsgBundle *m)
{
if(LIKELY(m)) {
Put(m);
FLEXT_TEMPINST(Trigger)();
}
}
#define CHUNK 10
#if FLEXT_QMODE == 1
FLEXT_TEMPLATE bool QWork(bool syslock,flext_base *flushobj = NULL)
{
// Since qcnt can only be increased from any other function than QWork
// qc will be a minimum guaranteed number of present queue elements.
// On the other hand, if new queue elements are added by the methods called
// in the loop, these will be sent in the next tick to avoid recursion overflow.
flext::MsgBundle *q;
if((q = queue.Get()) == NULL)
return false;
else if(q->Send()) {
if(!flushobj || !q->BelongsTo(flushobj))
queue.Push(q); // remember messages to be processed again
else
flext::MsgBundle::Free(q);
return true;
}
else {
flext::MsgBundle::Free(q);
return false;
}
}
#else
FLEXT_TEMPLATE bool QWork(bool syslock,flext_base *flushobj = NULL)
{
FLEXT_TEMPINST(Queue) newmsgs;
flext::MsgBundle *q;
#if 0
static int counter = 0;
fprintf(stderr,"QWORK %i\n",counter++);
#endif
for(;;) {
// Since qcnt can only be increased from any other function than QWork
// qc will be a minimum guaranteed number of present queue elements.
// On the other hand, if new queue elements are added by the methods called
// in the loop, these will be sent in the next tick to avoid recursion overflow.
if(!FLEXT_TEMPINST(QVars)::queue->Avail()) break;
#if FLEXT_QMODE == 2
if(syslock) flext::Lock();
#endif
while((q = FLEXT_TEMPINST(QVars)::queue->Get()) != NULL) {
if(q->Send())
newmsgs.Push(q); // remember messages to be processed again
else
flext::MsgBundle::Free(q);
}
#if FLEXT_QMODE == 2
if(syslock) flext::Unlock();
#endif
}
// enqueue messages that have to be processed again
while((q = newmsgs.Get()) != NULL)
if(!flushobj || !q->BelongsTo(flushobj))
FLEXT_TEMPINST(QVars)::queue->Push(q);
else
flext::MsgBundle::Free(q);
return FLEXT_TEMPINST(QVars)::queue->Avail();
}
#endif
#if FLEXT_QMODE == 0
#if FLEXT_SYS == FLEXT_SYS_JMAX
FLEXT_TEMPLATE void QTick(fts_object_t *c,int winlet, fts_symbol_t s, int ac, const fts_atom_t *at)
{
#else
FLEXT_TEMPLATE void QTick(flext_base *c)
{
#endif
FLEXT_TEMPINST(QWork)(false);
}
#elif FLEXT_QMODE == 1
# ifndef PERMANENTIDLE
static bool qtickactive = false;
# endif
FLEXT_TEMPLATE t_int QTick(t_int *)
{
#ifndef PERMANENTIDLE
qtickactive = false;
#endif
if(QWork(false))
return 1;
else {
# ifdef PERMANENTIDLE
// will be run in the next idle cycle
return 2;
# else
// won't be run again
// for non-shared externals assume that there's rarely a message waiting
// so it's better to delete the callback meanwhile
return 0;
# endif
}
}
#endif
/*
It would be sufficient to only flush messages belonging to object th
But then the order of sent messages is not as intended
*/
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::QFlush(flext_base *th)
{
FLEXT_ASSERT(!IsThreadRegistered());
while(!FLEXT_TEMPINST(QVars)::queue->Empty()) FLEXT_TEMPINST(QWork)(false,th);
}
FLEXT_TEMPLATE void Trigger()
{
#if FLEXT_SYS == FLEXT_SYS_PD
# if FLEXT_QMODE == 2
// wake up worker thread
FLEXT_TEMPINST(QVars)::qthrcond->Signal();
# elif FLEXT_QMODE == 1 && !defined(PERMANENTIDLE)
if(!qtickactive) {
sys_callback(FLEXT_TEMPINST(QTick),NULL,0);
qtickactive = true;
}
# elif FLEXT_QMODE == 0
# ifdef FLEXT_THREADS
bool sys = flext::IsThread(flext::GetSysThreadId());
# else
bool sys = true;
# endif
if(!sys) flext::Lock();
clock_delay(FLEXT_TEMPINST(QVars)::qclk,0);
if(!sys) flext::Unlock();
# endif
#elif FLEXT_SYS == FLEXT_SYS_MAX
# if FLEXT_QMODE == 0
// qelem_front(FLEXT_TEMPINST(QVars)::qclk);
clock_delay(FLEXT_TEMPINST(QVars)::qclk,0);
# endif
#else
# error Not implemented
#endif
}
#if FLEXT_QMODE == 2
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::QWorker(thr_params *)
{
thrmsgid = GetThreadId();
qustarted = true;
for(;;) {
// we need a timed wait so that idle processing can take place
FLEXT_TEMPINST(QVars)::qthrcond->TimedWait(0.001);
FLEXT_TEMPINST(QWork)(true);
}
}
#endif
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::StartQueue()
{
#if FLEXT_QMODE == 2
FLEXT_TEMPINST(QVars)::qthrcond = new FLEXT_CLASSDEF(flext)::ThrCond;
#endif
FLEXT_TEMPINST(QVars)::queue = new FLEXT_TEMPINST(Queue);
if(qustarted) return;
#if FLEXT_QMODE == 1
# ifdef PERMANENTIDLE
sys_callback(FLEXT_TEMPINST(QTick),NULL,0);
qustarted = true;
# endif
#elif FLEXT_QMODE == 2
LaunchThread(QWorker,NULL);
// very unelegant... but waiting should be ok, since happens only on loading
while(!qustarted) Sleep(0.001);
#elif FLEXT_QMODE == 0 && (FLEXT_SYS == FLEXT_SYS_PD || FLEXT_SYS == FLEXT_SYS_MAX)
// qclk = (t_qelem *)(qelem_new(NULL,(t_method)FLEXT_TEMPINST(QTick)));
FLEXT_TEMPINST(QVars)::qclk = (t_clock *)(clock_new(NULL,(t_method)FLEXT_TEMPINST(QTick)));
qustarted = true;
#else
# error Not implemented!
#endif
}
FLEXT_TEMPIMPL(FLEXT_TEMPSUB(FLEXT_CLASSDEF(flext))::MsgBundle *FLEXT_CLASSDEF(flext))::MsgNew()
{
return MsgBundle::New();
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext))::MsgFree(MsgBundle *m)
{
MsgBundle::Free(m);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext))::ToSysMsg(MsgBundle *m)
{
m->Send();
FLEXT_TEMPINST(QVars)::queue->Free(m);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext))::ToQueueMsg(MsgBundle *m)
{
FLEXT_TEMPINST(QVars)::queue->Push(m);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::ToQueueBang(int o) const
{
MsgBundle *m = MsgBundle::New();
m->Add(const_cast<flext_base *>(this),o);
FLEXT_TEMPINST(QVars)::queue->Push(m);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::ToQueueFloat(int o,float f) const
{
MsgBundle *m = MsgBundle::New();
m->Add(const_cast<flext_base *>(this),o,f);
FLEXT_TEMPINST(QVars)::queue->Push(m);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::ToQueueInt(int o,int f) const
{
MsgBundle *m = MsgBundle::New();
m->Add(const_cast<flext_base *>(this),o,f);
FLEXT_TEMPINST(QVars)::queue->Push(m);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::ToQueueSymbol(int o,const t_symbol *s) const
{
MsgBundle *m = MsgBundle::New();
m->Add(const_cast<flext_base *>(this),o,s);
FLEXT_TEMPINST(QVars)::queue->Push(m);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::ToQueueAtom(int o,const t_atom &at) const
{
MsgBundle *m = MsgBundle::New();
m->Add(const_cast<flext_base *>(this),o,at);
FLEXT_TEMPINST(QVars)::queue->Push(m);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::ToQueueList(int o,int argc,const t_atom *argv) const
{
MsgBundle *m = MsgBundle::New();
m->Add(const_cast<flext_base *>(this),o,argc,argv);
FLEXT_TEMPINST(QVars)::queue->Push(m);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::ToQueueAnything(int o,const t_symbol *s,int argc,const t_atom *argv) const
{
MsgBundle *m = MsgBundle::New();
m->Add(const_cast<flext_base *>(this),o,s,argc,argv);
FLEXT_TEMPINST(QVars)::queue->Push(m);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::MsgAddBang(MsgBundle *m,int n) const
{
m->Add(const_cast<flext_base *>(this),n);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::MsgAddFloat(MsgBundle *m,int n,float f) const
{
m->Add(const_cast<flext_base *>(this),n,f);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::MsgAddInt(MsgBundle *m,int n,int f) const
{
m->Add(const_cast<flext_base *>(this),n,f);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::MsgAddSymbol(MsgBundle *m,int n,const t_symbol *s) const
{
m->Add(const_cast<flext_base *>(this),n,s);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::MsgAddAtom(MsgBundle *m,int n,const t_atom &at) const
{
m->Add(const_cast<flext_base *>(this),n,at);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::MsgAddList(MsgBundle *m,int n,int argc,const t_atom *argv) const
{
m->Add(const_cast<flext_base *>(this),n,argc,argv);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::MsgAddAnything(MsgBundle *m,int n,const t_symbol *s,int argc,const t_atom *argv) const
{
m->Add(const_cast<flext_base *>(this),n,s,argc,argv);
}
FLEXT_TEMPIMPL(bool FLEXT_CLASSDEF(flext))::SysForward(const t_symbol *recv,const t_symbol *s,int argc,const t_atom *argv)
{
void *cl = recv->s_thing;
if(UNLIKELY(!cl)) return false;
#if FLEXT_SYS == FLEXT_SYS_PD
pd_typedmess((t_class **)cl,(t_symbol *)s,argc,(t_atom *)argv);
#elif FLEXT_SYS == FLEXT_SYS_MAX
typedmess(recv->s_thing,(t_symbol *)s,argc,(t_atom *)argv);
#else
# error Not implemented
#endif
return true;
}
FLEXT_TEMPIMPL(bool FLEXT_CLASSDEF(flext))::QueueForward(const t_symbol *recv,const t_symbol *s,int argc,const t_atom *argv)
{
MsgBundle *m = MsgBundle::New();
m->Add(recv,s,argc,argv);
// send over queue
FLEXT_TEMPINST(QVars)::queue->Push(m);
return true;
}
FLEXT_TEMPIMPL(bool FLEXT_CLASSDEF(flext))::MsgForward(MsgBundle *m,const t_symbol *recv,const t_symbol *s,int argc,const t_atom *argv)
{
m->Add(recv,s,argc,argv);
return true;
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::AddIdle()
{
MsgBundle *m = MsgBundle::New();
m->Idle(const_cast<flext_base *>(this));
// send over queue
FLEXT_TEMPINST(QVars)::queue->Push(m);
}
FLEXT_TEMPIMPL(void FLEXT_CLASSDEF(flext_base))::AddIdle(bool (*idlefun)(int argc,const t_atom *argv),int argc,const t_atom *argv)
{
MsgBundle *m = MsgBundle::New();
m->Idle(idlefun,argc,argv);
// send over queue
FLEXT_TEMPINST(QVars)::queue->Push(m);
}
#include "flpopns.h"
#endif // __FLEXT_QUEUE_CPP
|