| 35 | /* acl_ring_append - insert entry after ring head */ |
| 36 | |
| 37 | void acl_ring_append(ACL_RING *ring, ACL_RING *entry) |
| 38 | { |
| 39 | if (ring == NULL || entry == NULL) |
| 40 | return; |
| 41 | entry->succ = ring->succ; |
| 42 | entry->pred = ring; |
| 43 | entry->parent = ring->parent; |
| 44 | ring->succ->pred = entry; |
| 45 | ring->succ = entry; |
| 46 | ring->parent->len++; |
| 47 | } |
| 48 | |
| 49 | /* acl_ring_prepend - insert new entry before ring head */ |
| 50 |
no outgoing calls
searching dependent graphs…