Lines Matching refs:entries
182 struct vis_info_entry *entries;
204 entries = (struct vis_info_entry *)
207 for (i = 0; i < info->packet.entries; i++) {
208 if (entries[i].quality == 0)
210 vis_data_insert_interface(entries[i].src, &vis_if_list,
211 compare_orig(entries[i].src,
216 buf_size += 18 + 26 * info->packet.entries;
242 entries = (struct vis_info_entry *)
245 for (i = 0; i < info->packet.entries; i++) {
246 if (entries[i].quality == 0)
248 vis_data_insert_interface(entries[i].src, &vis_if_list,
249 compare_orig(entries[i].src,
258 for (i = 0; i < info->packet.entries; i++)
260 &entries[i],
342 * is newer than old entries in the hash. */
395 /* repair if entries is longer than packet. */
396 if (info->packet.entries * sizeof(struct vis_info_entry) > vis_info_len)
397 info->packet.entries = vis_info_len /
504 if (info->packet.entries + 1 >
530 info->packet.entries = 0;
553 entry = &entry_array[info->packet.entries];
559 info->packet.entries++;
573 entry = &entry_array[info->packet.entries];
577 info->packet.entries++;
689 info->packet.entries * sizeof(struct vis_info_entry);
761 my_vis_info->packet.entries = 0;