Visit Our UNIX and Linux User Community

Linux and UNIX Man Pages

Test Your Knowledge in Computers #945
Difficulty: Medium
A Fraggle attack is a variation of the Smurf attack where an attacker sends a large amount of UDP traffic to ports 7 (Echo) and 19 (CHARGEN) to an IP broadcast address with the intended victim's spoofed source IP address.
True or False?
Linux & Unix Commands - Search Man Pages

list(3) [suse man page]

list(3) 						    InterNetNews Documentation							   list(3)

NAME
list - list routines SYNOPSIS
#include <inn/list.h> struct node { struct node *succ; struct node *pred; }; struct list { struct node *head; struct node *tail; struct node *tailpred; }; void list_new(struct list *list); struct node *list_addhead(struct list *list, struct node *node); struct node *list_addtail(struct list *list, struct node *node); struct node *list_head(struct list *list); struct node *list_tail(struct list *list); struct node *list_succ(struct node *node); struct node *list_pred(struct node *node); struct node *list_remhead(struct list *list); struct node *list_remtail(struct list *list); struct node *list_remove(struct node *node); struct node *list_insert(struct list *list, struct node *node, struct node *pred); bool list_isempty(struct list *list); DESCRIPTION
list_new initialises the list header list so as to create an empty list. list_addhead adds node to the head of list, returning the node just added. list_addtail adds node to the tail of list, returning the node just added. list_head returns a pointer to the the node at the head of list or NULL if the list is empty. list_tail returns a pointer to the the node at the tail of list or NULL if the list is empty. list_succ returns the next (successor) node on the list after node or NULL if node was the final node. list_pred returns the previous (predecessor) node on the list before node or NULL if node was the first node. list_remhead removes the first node from list and returns it to the caller. If the list is empty NULL is returned. list_remtail removes the last node from list and returns it to the caller. If the list is empty NULL is returned. list_remove removes node from the list it is on and returns it to the caller. list_insert inserts node onto list after the node pred. If pred is NULL then node is added to the head of list. HISTORY
Written by Alex Kiernan <alex.kiernan@thus.net> for InterNetNews 2.4.0. $Id: list.pod 7851 2008-05-26 19:33:08Z iulius $ INN 2.5.2 2009-05-21 list(3)

Check Out this Related Man Page

di_minor_next(3DEVINFO) 			       Device Information Library Functions				   di_minor_next(3DEVINFO)

NAME
di_minor_next - libdevinfo minor node traversal functions SYNOPSIS
cc [ flag... ] file... -ldevinfo [ library... ] #include <libdevinfo.h> di_minor_t di_minor_next(di_node_t node, di_minor_t minor); PARAMETERS
minor Handle to the current minor node or DI_MINOR_NIL. node Device node with which the minor node is associated. DESCRIPTION
The di_minor_next() function returns a handle to the next minor node for the device node node. If minor is DI_MINOR_NIL, a handle to the first minor node is returned. RETURN VALUES
Upon successful completion, a handle to the next minor node is returned. Otherwise, DI_MINOR_NIL is returned and errno is set to indicate the error. ERRORS
The di_minor_next() function will fail if: EINVAL Invalid argument. ENOTSUP Minor node information is not available in snapshot. ENXIO End of minor node list. ATTRIBUTES
See attributes(5) for descriptions of the following attributes: +-----------------------------+-----------------------------+ | ATTRIBUTE TYPE | ATTRIBUTE VALUE | +-----------------------------+-----------------------------+ |Interface Stability |Evolving | +-----------------------------+-----------------------------+ |MT-Level |Safe | +-----------------------------+-----------------------------+ SEE ALSO
libdevinfo(3LIB), attributes(5) Writing Device Drivers SunOS 5.10 1 Dec 1998 di_minor_next(3DEVINFO)

Featured Tech Videos