Q
Line Name ----- ----0 53 append_list_entry( 55 copy_list/ 45 dec_list_entries , 71 dequeue_entry, 70 enqueue_entry* 93 entry_blink* 94 entry_flink/ 44 inc_list_entries ( 56 init_list. 106 isbegin_of_list+ 57 isempty_list , 107 isend_of_list, 104 isfirst_entry+ 105 islast_entry + 41 list_entries ) 42 list_first ( 43 list_last) 95 next_entry ( 64 pop_entry1 54 prepend_list_entry ) 96 prev_entry ) 63 push_entry . 98 set_entry_blink. 97 set_entry_flink- 46 set_list_first , 47 set_list_last
BEGINNING OF FILE
V 1: /****************************************************************************/ 2: /* */ 8 3: /* FACILITY: Generic Support Library */ 4: /* */ / 5: /* MODULE: List Management */ 6: /* */ O 7: /* AUTHOR: Steve Branam, Network Product Support Group, Digital */ > 8: /* Equipment Corporation, Littleton, MA, USA. */ 9: /* */ V 10: /* DESCRIPTION: This header file contains all type definitions for the */T 11: /* generic list object types used by Routine Analyzer. Member access */V 12: /* routines (get/set values) and a number of object management routines */6 13: /* are implemented here as macros. */ 14: /* */ * 15: /* REVISION HISTORY: */ 16: /* */ 7 17: /* V0.1-00 24-AUG-1994 Steve Branam */ 18: /* */ ( 19: /* Original version. */ 20: /* */ V 21: /****************************************************************************/ 22: V 23: /****************************************************************************/ 24: /* */ ) 25: /* List object type. */ 26: /* */ V 27: /****************************************************************************/ 28: 29: typedef struct {E 30: long entries; /* Number of items in list. */ I 31: struct list_entry_hdr /* Ptr to first item in list. */ 32: *head; I 33: struct list_entry_hdr /* Ptr to last item in list. */ 34: *tail; 35: } LIST; 36: 37: /* */ 9 38: /* List object member access routines. */ 39: /* */ 40:
1 41: #define list_entries(l) ((l)->entries)J END list_entries. Go to: Beginning of routine.
, 42: #define list_first(l) ((l)->head)H END list_first. Go to: Beginning of routine.
+ 43: #define list_last(l) ((l)->tail)G END list_last. Go to: Beginning of routine.
7 44: #define inc_list_entries(l) ((l)->entries++)N END inc_list_entries. Go to: Beginning of routine.
7 45: #define dec_list_entries(l) ((l)->entries--)N END dec_list_entries. Go to: Beginning of routine.
7 46: #define set_list_first(l, p) ((l)->head = p)L END set_list_first. Go to: Beginning of routine.
6 47: #define set_list_last(l, p) ((l)->tail = p)K END set_list_last. Go to: Beginning of routine.
48: 49: /* */ 6 50: /* List object management routines. */ 51: /* */ 52:
O 53: #define append_list_entry(l, e) insert_list_entry((l), list_last(l), e)O END append_list_entry. Go to: Beginning of routine.
H 54: #define prepend_list_entry(l, e) insert_list_entry((l), NULL, e)P END prepend_list_entry. Go to: Beginning of routine.
u 55: #define copy_list(s, d) ((d)->head=(s)->head,(d)->tail=(s)->tail,(d)->entries=(s)->entries)G END copy_list. Go to: Beginning of routine.
V 56: #define init_list(l) ((l)->head=NULL, (l)->tail=NULL, (l)->entries=0)G END init_list. Go to: Beginning of routine.
s
>
n6 57: #define isempty_list(l) ((l)->head == NULL)J END isempty_list. Go to: Beginning of routine.
i 58: 59: /* */tA 60: /* Treat a list as a stack: last-in, first-out. */L 61: /* */ 62:
A
#8 63: #define push_entry(s, e) append_list_entry(s, e)H END push_entry. Go to: Beginning of routine.
_
i
n? 64: #define pop_entry(s) remove_list_entry(s, list_last(s))HG END pop_entry. Go to: Beginning of routine.
0 65: 66: /* */=A 67: /* Treat a list as a queue: first-in, first-out. */_ 68: /* */# 69:
b
t; 70: #define enqueue_entry(s, e) append_list_entry(s, e)K END enqueue_entry. Go to: Beginning of routine.
*
/
D 71: #define dequeue_entry(s) remove_list_entry(s, list_first(s))K END dequeue_entry. Go to: Beginning of routine.
:
f 72: V 73: /****************************************************************************/ 74: /* */sV 75: /* List entry header object. Application list entry objects are expected to */P 76: /* define the following as the first element of their structures: */ 77: /* */I1 78: /* LIST_ENTRY_HDR entry_hdr; */* 79: /* */AV 80: /****************************************************************************/ 81: ' 82: typedef struct list_entry_hdr { I 83: struct list_entry_hdr /* Ptr to next record in list. */* 84: *flink;H 85: struct list_entry_hdr /* Ptr to previous record. */ 86: *blink; 87: } LIST_ENTRY_HDR; 88: 89: /* */*@ 90: /* Entry header object member access routines. */ 91: /* */* 92:
t
n. 93: #define entry_blink(e) ((e)->blink)I END entry_blink. Go to: Beginning of routine.
b
t
f. 94: #define entry_flink(e) ((e)->flink)I END entry_flink. Go to: Beginning of routine.
Z 95: #define next_entry(e) ((e) == NULL ? NULL : entry_flink(&((e)->entry_hdr)))H END next_entry. Go to: Beginning of routine.
i
_
oZ 96: #define prev_entry(e) ((e) == NULL ? NULL : entry_blink(&((e)->entry_hdr)))H END prev_entry. Go to: Beginning of routine.
H
47 97: #define set_entry_flink(e, p) (e->flink = p)>M END set_entry_flink. Go to: Beginning of routine.
>
E
7 98: #define set_entry_blink(e, p) (e->blink = p)RM END set_entry_blink. Go to: Beginning of routine.
>
R 99: 100: /* */A= 101: /* Entry header object management routines. */> 102: /* */b 103:
e
>9 104: #define isfirst_entry(e) (entry_blink(e) == NULL)K END isfirst_entry. Go to: Beginning of routine.
0
o
.
H8 105: #define islast_entry(e) (entry_flink(e) == NULL)J END islast_entry. Go to: Beginning of routine.
3
n: 106: #define isbegin_of_list(e) (prev_entry(e) == NULL)M END isbegin_of_list. Go to: Beginning of routine.
<
>
s
A8 107: #define isend_of_list(e) (next_entry(e) == NULL)K END isend_of_list. Go to: Beginning of routine.
1
n 108:
END OF FILEP TOTAL: 26 routines, 1 Avg Length