1

#include "chain.h"

     2

     3

#include <stdlib.h>

     4

     5

err_t chain_add (struct chain_list *list, const void *chain, void *arg)

     6

{

     7

    struct chain_head *item;

     8

     9

    // allocate the chain item

    10

    if ((item = calloc(1, sizeof(*item))) == NULL)

    11

        return ERR_CALLOC;

    12

    13

    // store

    14

    item->chain = chain;

    15

    item->arg = arg;

    16

    17

    // append

    18

    STAILQ_INSERT_TAIL(list, item, node);

    19

    20

    // ok

    21

    return SUCCESS;

    22

}

    23

    24

void chain_remove (struct chain_list *list, const void *chain, void *arg)

    25

{

    26

    struct chain_head *item;

    27

    28

    // look for it

    29

    CHAIN_FOREACH(list, item) {

    30

        if (item->chain == chain && item->arg == arg) {

    31

            // remove it

    32

            // XXX: use TAILQ instead?

    33

            STAILQ_REMOVE(list, item, chain_head, node);

    34

    35

            // free it

    36

            free(item);

    37

    38

            // ok

    39

            return;

    40

        }

    41

    }

    42

    43

    // not found... ignore

    44

}

    45

    46

void chain_free (struct chain_list *list)

    47

{

    48

    // start from the first item

    49

    struct chain_head *next = STAILQ_FIRST(list);

    50

    51

    // clean up any handler chains

    52

    while (next) {

    53

        struct chain_head *node = next;

    54

    55

        // update next

    56

        next = STAILQ_NEXT(node, node);

    57

    58

        // free

    59

        free(node);

    60

    }

    61

}