Lines Matching full:index
46 uint8_t index[13]; member
65 return (memcmp(s1->index, s2->index, 13)); in sroute_compare()
75 oid->subs[sub + i] = s->index[i]; in sroute_index_append()
85 printf("%u.", r->index[i]);
86 printf("%u proto=%u type=%u", r->index[i], r->proto, r->type);
118 /* build the index */ in mib_sroute_process()
120 key.index[0] = (ha >> 24) & 0xff; in mib_sroute_process()
121 key.index[1] = (ha >> 16) & 0xff; in mib_sroute_process()
122 key.index[2] = (ha >> 8) & 0xff; in mib_sroute_process()
123 key.index[3] = (ha >> 0) & 0xff; in mib_sroute_process()
126 key.index[4] = (ha >> 24) & 0xff; in mib_sroute_process()
127 key.index[5] = (ha >> 16) & 0xff; in mib_sroute_process()
128 key.index[6] = (ha >> 8) & 0xff; in mib_sroute_process()
129 key.index[7] = (ha >> 0) & 0xff; in mib_sroute_process()
132 key.index[8] = 0; in mib_sroute_process()
135 key.index[9] = (ha >> 24) & 0xff; in mib_sroute_process()
136 key.index[10] = (ha >> 16) & 0xff; in mib_sroute_process()
137 key.index[11] = (ha >> 8) & 0xff; in mib_sroute_process()
138 key.index[12] = (ha >> 0) & 0xff; in mib_sroute_process()
146 key.index[0], key.index[1], key.index[2], in mib_sroute_process()
147 key.index[3], key.index[4], key.index[5], in mib_sroute_process()
148 key.index[6], key.index[7], key.index[8], in mib_sroute_process()
149 key.index[9], key.index[10], key.index[11], in mib_sroute_process()
150 key.index[12]); in mib_sroute_process()
160 key.index[0], key.index[1], key.index[2], in mib_sroute_process()
161 key.index[3], key.index[4], key.index[5], in mib_sroute_process()
162 key.index[6], key.index[7], key.index[8], in mib_sroute_process()
163 key.index[9], key.index[10], key.index[11], in mib_sroute_process()
164 key.index[12]); in mib_sroute_process()
173 /* make it a get so the kernel fills the index */ in mib_sroute_process()
185 memcpy(r->index, key.index, sizeof(r->index)); in mib_sroute_process()
186 r->ifindex = (ifp == NULL) ? 0 : ifp->index; in mib_sroute_process()
200 key.index[0], key.index[1], key.index[2], in mib_sroute_process()
201 key.index[3], key.index[4], key.index[5], in mib_sroute_process()
202 key.index[6], key.index[7], key.index[8], in mib_sroute_process()
203 key.index[9], key.index[10], key.index[11], in mib_sroute_process()
204 key.index[12]); in mib_sroute_process()
217 key.index[0], key.index[1], key.index[2], in mib_sroute_process()
218 key.index[3], key.index[4], key.index[5], in mib_sroute_process()
219 key.index[6], key.index[7], key.index[8], in mib_sroute_process()
220 key.index[9], key.index[10], key.index[11], in mib_sroute_process()
221 key.index[12]); in mib_sroute_process()
293 key.index[i] = oid->subs[sub + i]; in sroute_get()
318 * This is also true for any index that consists of zeros and is in sroute_getnext()
319 * shorter than the full index. in sroute_getnext()
329 * Now if the index is too short, we fill it with zeros and then in sroute_getnext()
330 * subtract one from the index. We can do this, because we now, in sroute_getnext()
331 * that there is at least one index element that is not zero. in sroute_getnext()
346 /* build the index */ in sroute_getnext()
348 key.index[i - sub] = oid->subs[i]; in sroute_getnext()
415 value->v.ipaddress[0] = r->index[0]; in op_route_table()
416 value->v.ipaddress[1] = r->index[1]; in op_route_table()
417 value->v.ipaddress[2] = r->index[2]; in op_route_table()
418 value->v.ipaddress[3] = r->index[3]; in op_route_table()
422 value->v.ipaddress[0] = r->index[4]; in op_route_table()
423 value->v.ipaddress[1] = r->index[5]; in op_route_table()
424 value->v.ipaddress[2] = r->index[6]; in op_route_table()
425 value->v.ipaddress[3] = r->index[7]; in op_route_table()
429 value->v.integer = r->index[8]; in op_route_table()
433 value->v.ipaddress[0] = r->index[9]; in op_route_table()
434 value->v.ipaddress[1] = r->index[10]; in op_route_table()
435 value->v.ipaddress[2] = r->index[11]; in op_route_table()
436 value->v.ipaddress[3] = r->index[12]; in op_route_table()