bsnmp/snmp_mibII/mibII_route.c

47 	uint8_t		index[13];
66 	return (memcmp(s1->index, s2->index, 13));
76 		oid->subs[sub + i] = s->index[i];
86 		printf("%u.", r->index[i]);
87 	printf("%u proto=%u type=%u", r->index[i], r->proto, r->type);
119 	/* build the index */
121 	key.index[0] = (ha >> 24) & 0xff;
122 	key.index[1] = (ha >> 16) & 0xff;
123 	key.index[2] = (ha >>  8) & 0xff;
124 	key.index[3] = (ha >>  0) & 0xff;
127 	key.index[4] = (ha >> 24) & 0xff;
128 	key.index[5] = (ha >> 16) & 0xff;
129 	key.index[6] = (ha >>  8) & 0xff;
130 	key.index[7] = (ha >>  0) & 0xff;
133 	key.index[8] = 0;
136 	key.index[9] = (ha >> 24) & 0xff;
137 	key.index[10] = (ha >> 16) & 0xff;
138 	key.index[11] = (ha >>  8) & 0xff;
139 	key.index[12] = (ha >>  0) & 0xff;
147 			    key.index[0], key.index[1], key.index[2],
148 			    key.index[3], key.index[4], key.index[5],
149 			    key.index[6], key.index[7], key.index[8],
150 			    key.index[9], key.index[10], key.index[11],
151 			    key.index[12]);
161 		    key.index[0], key.index[1], key.index[2],
162 		    key.index[3], key.index[4], key.index[5],
163 		    key.index[6], key.index[7], key.index[8],
164 		    key.index[9], key.index[10], key.index[11],
165 		    key.index[12]);
174 			/* make it a get so the kernel fills the index */
186 	memcpy(r->index, key.index, sizeof(r->index));
187 	r->ifindex = (ifp == NULL) ? 0 : ifp->index;
201 		    key.index[0], key.index[1], key.index[2],
202 		    key.index[3], key.index[4], key.index[5],
203 		    key.index[6], key.index[7], key.index[8],
204 		    key.index[9], key.index[10], key.index[11],
205 		    key.index[12]);
218 	    key.index[0], key.index[1], key.index[2],
219 	    key.index[3], key.index[4], key.index[5],
220 	    key.index[6], key.index[7], key.index[8],
221 	    key.index[9], key.index[10], key.index[11],
222 	    key.index[12]);
294 		key.index[i] = oid->subs[sub + i];
319 	 * This is also true for any index that consists of zeros and is
320 	 * shorter than the full index.
330 		 * Now if the index is too short, we fill it with zeros and then
331 		 * subtract one from the index. We can do this, because we now,
332 		 * that there is at least one index element that is not zero.
347 	/* build the index */
349 		key.index[i - sub] = oid->subs[i];
416 		value->v.ipaddress[0] = r->index[0];
417 		value->v.ipaddress[1] = r->index[1];
418 		value->v.ipaddress[2] = r->index[2];
419 		value->v.ipaddress[3] = r->index[3];
423 		value->v.ipaddress[0] = r->index[4];
424 		value->v.ipaddress[1] = r->index[5];
425 		value->v.ipaddress[2] = r->index[6];
426 		value->v.ipaddress[3] = r->index[7];
430 		value->v.integer = r->index[8];
434 		value->v.ipaddress[0] = r->index[9];
435 		value->v.ipaddress[1] = r->index[10];
436 		value->v.ipaddress[2] = r->index[11];
437 		value->v.ipaddress[3] = r->index[12];