bsnmp/snmp_mibII/mibII_route.c

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