|
|
|
|
link_addr(3) -- elementary address specification routines for link level access
|
|
The routine link_addr() interprets character strings representing linklevel addresses, returning binary information suitable for use in system calls. The routine link_ntoa() takes a link-level address... |
|
link_ntoa(3) -- elementary address specification routines for link level access
|
|
The routine link_addr() interprets character strings representing linklevel addresses, returning binary information suitable for use in system calls. The routine link_ntoa() takes a link-level address... |
|
LIST_EMPTY(3) -- implementations of singlylinked lists, lists, simple queues, tail queues, and circular queues
|
|
These macros define and operate on five types of data structures: singlylinked lists, lists, simple queues, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_ENTRY(3) -- implementations of singlylinked lists, lists, simple queues, tail queues, and circular queues
|
|
These macros define and operate on five types of data structures: singlylinked lists, lists, simple queues, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_FIRST(3) -- implementations of singlylinked lists, lists, simple queues, tail queues, and circular queues
|
|
These macros define and operate on five types of data structures: singlylinked lists, lists, simple queues, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_HEAD(3) -- implementations of singlylinked lists, lists, simple queues, tail queues, and circular queues
|
|
These macros define and operate on five types of data structures: singlylinked lists, lists, simple queues, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_HEAD_INITIALIZER(3) -- implementations of singlylinked lists, lists, simple queues, tail queues, and circular queues
|
|
These macros define and operate on five types of data structures: singlylinked lists, lists, simple queues, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_INIT(3) -- implementations of singlylinked lists, lists, simple queues, tail queues, and circular queues
|
|
These macros define and operate on five types of data structures: singlylinked lists, lists, simple queues, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_INSERT_AFTER(3) -- implementations of singlylinked lists, lists, simple queues, tail queues, and circular queues
|
|
These macros define and operate on five types of data structures: singlylinked lists, lists, simple queues, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_INSERT_BEFORE(3) -- implementations of singlylinked lists, lists, simple queues, tail queues, and circular queues
|
|
These macros define and operate on five types of data structures: singlylinked lists, lists, simple queues, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_INSERT_HEAD(3) -- implementations of singlylinked lists, lists, simple queues, tail queues, and circular queues
|
|
These macros define and operate on five types of data structures: singlylinked lists, lists, simple queues, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_NEXT(3) -- implementations of singlylinked lists, lists, simple queues, tail queues, and circular queues
|
|
These macros define and operate on five types of data structures: singlylinked lists, lists, simple queues, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
LIST_REMOVE(3) -- implementations of singlylinked lists, lists, simple queues, tail queues, and circular queues
|
|
These macros define and operate on five types of data structures: singlylinked lists, lists, simple queues, tail queues, and circular queues. All five structures support the following functionality: 1... |
|
|
|
|
