Lines Matching defs:seg
64 register Vuid_seg *seg;
71 /* Get (search for) seg from state assoicated with event */
72 if ((seg = vuid_find_seg(state, vuid_id_addr(event->id))) ==
74 /* Allocate and initialize new seg for event */
75 seg = (Vuid_seg *) vuid_alloc(sizeof (*seg));
76 bzero((caddr_t)seg, sizeof (*seg));
77 seg->addr = vuid_id_addr(event->id);
78 /* Add the seg to state */
79 *state_ptr = seg;
80 seg->next = state;
82 int_bit = vuid_get_int_bit(seg, offset);
85 (void) vuid_add_value(seg, offset);
91 vuid_set_boolean_bit(seg, offset);
93 vuid_clear_boolean_bit(seg, offset);
96 val_node = vuid_find_value(seg, offset);
103 if (!vuid_get_int_bit(seg, pair))
104 (void) vuid_add_value(seg, pair);
106 pair_val_node = vuid_find_value(seg, pair);
113 if (!vuid_get_int_bit(seg, pair))
114 (void) vuid_add_value(seg, pair);
116 pair_val_node = vuid_find_value(seg, pair);
143 register Vuid_seg *seg;
147 /* Get (search for) seg from state assoicated with id */
148 if ((seg = vuid_find_seg(state, vuid_id_addr(id))) == VUID_SEG_NULL)
151 if (!vuid_get_int_bit(seg, offset))
152 return (vuid_get_boolean_bit(seg, offset) != 0);
155 val_node = vuid_find_value(seg, offset);
165 register Vuid_seg *seg;
168 for (seg = state; seg; seg = seg_next) {
169 seg_next = seg->next;
170 vuid_destroy_seg(seg);
175 vuid_destroy_seg(seg)
176 Vuid_seg *seg;
181 for (val_node = seg->list; val_node; val_node = val_node_next) {
185 vuid_free((caddr_t)seg, sizeof (Vuid_seg));
193 register Vuid_seg *seg;
198 for (seg = state; seg; seg = seg->next) {
199 new_seg = vuid_copy_seg(seg);
200 /* Remember first seg as state */
206 /* Remember seg for linking later */
213 vuid_copy_seg(seg)
214 Vuid_seg *seg;
221 /* Allocate and initialize new seg for event */
222 new_seg = (Vuid_seg *) vuid_alloc(sizeof (*seg));
223 *new_seg = *seg;
228 for (val_node = seg->list; val_node; val_node = val_node->next) {
249 register Vuid_seg *seg;
251 for (seg = state; seg; seg = seg->next) {
252 if (seg->addr == addr)
253 return (seg);
259 vuid_find_value(seg, offset)
260 Vuid_seg *seg;
265 for (val_node = seg->list; val_node; val_node = val_node->next) {
273 vuid_add_value(seg, offset)
274 Vuid_seg *seg;
285 list_tmp = seg->list;
286 seg->list = val_node;
288 vuid_set_int_bit(seg, offset);
290 vuid_clear_boolean_bit(seg, offset);