CallbackChain Class Reference

Callback chains contain zero or more callbacks. More...

Inheritance diagram for CallbackChain:

Collaboration diagram for CallbackChain:

Classes
class	CallbackNode

Public Member Functions
	ATTRIB (CallbackChain, cbc_next, CallbackNode)
	CallbackChain ::CallbackChain (string _name)
bool	CallbackChain_Add (CallbackChain this, Callback cb, int order)
bool	CallbackChain_Call (CallbackChain this)
int	CallbackChain_Remove (CallbackChain this, Callback cb)

Public Attributes
int	cbc_order = 0

Detailed Description

Callback chains contain zero or more callbacks.

Definition at line 36 of file base.qh.

Member Function Documentation

ATTRIB()

CallbackChain::ATTRIB	(	CallbackChain	,
		cbc_next	,
		CallbackNode
	)

CallbackChain ::CallbackChain()

CallbackChain::CallbackChain ::CallbackChain ( string  _name )

inline

Definition at line 50 of file base.qh.

References CONSTRUCT, and netname.

                                             {
        CONSTRUCT(CallbackChain);
        this.netname = _name;
    }

CallbackChain_Add()

bool CallbackChain::CallbackChain_Add ( CallbackChain  this, Callback  cb, int  order  )

inline

Definition at line 55 of file base.qh.

References CBC_ORDER_ANY, CBC_ORDER_FIRST, CBC_ORDER_LAST, entity(), NEW, NULL, and prev.

    {
        if (order & CBC_ORDER_FIRST) {
            if (order & CBC_ORDER_LAST)
                if (this.cbc_order & CBC_ORDER_ANY)
                    return false;
            if (this.cbc_order & CBC_ORDER_FIRST)
                return false;
        } else if (order & CBC_ORDER_LAST) {
            if (this.cbc_order & CBC_ORDER_LAST)
                return false;
        }
        entity node = NEW(CallbackNode, cb, order);
        if (order & CBC_ORDER_FIRST) {
            node.cbc_next = this.cbc_next;
            this.cbc_next = node;
        } else if (order & CBC_ORDER_LAST) {
            CallbackNode prev = NULL, it = this.cbc_next;
            while (it) { prev = it, it = it.cbc_next; }
            if (prev) prev.cbc_next = node;
            else this.cbc_next = node;
        } else {
            // by default we execute last, but before a possible CBC_ORDER_LAST callback
            CallbackNode prev = NULL, it = this.cbc_next;
            while (it && !(it.cbc_order & CBC_ORDER_LAST)) { prev = it, it = it.cbc_next; }
            node.cbc_next = it;
            if (prev) prev.cbc_next = node;
            else this.cbc_next = node;
        }
        this.cbc_order |= (order | CBC_ORDER_ANY);
        return true;
    }

Here is the call graph for this function:

CallbackChain_Call()

bool CallbackChain::CallbackChain_Call ( CallbackChain  this )

inline

Definition at line 104 of file base.qh.

References CallbackChain_ReturnValue, and ENDCLASS.

    {
        bool r = false;
        for (Callback it = this.cbc_next; it; it = it.cbc_next) {
            CallbackChain_ReturnValue = r;
            r |= it.cbc.cbc_func();
        }
        return r; // callbacks return an error status, so 0 is default return value
    }

CallbackChain_Remove()

int CallbackChain::CallbackChain_Remove ( CallbackChain  this, Callback  cb  )

inline

Definition at line 87 of file base.qh.

References CBC_ORDER_ANY, next, NULL, and prev.

    {
        int n = 0, order = 0;
        for (Callback prev = NULL, it = this.cbc_next; it; prev = it, it = it.cbc_next) {
            if (it.cbc == cb) {
                // remove it from the chain
                Callback next = it.cbc_next;
                if (prev) prev.cbc_next = next;
                else this.cbc_next = next;
                ++n;
            }
            // it is now something we want to keep
            order |= (it.cbc_order & CBC_ORDER_ANY);
        }
        this.cbc_order = order;
        return n;
    }

Member Data Documentation

cbc_order

int CallbackChain::cbc_order = 0

Definition at line 49 of file base.qh.

---

The documentation for this class was generated from the following file:

• common/mutators/base.qh