| 1 |
/* HEADER Testing binary OID array */ |
| 2 |
|
| 3 |
static const char test_name[] = "binary-array-of-OIDs-test"; |
| 4 |
oid o1 = 1; |
| 5 |
oid o2 = 2; |
| 6 |
oid o3 = 6; |
| 7 |
oid o4 = 8; |
| 8 |
oid o5 = 9; |
| 9 |
oid ox = 7; |
| 10 |
oid oy = 10; |
| 11 |
netsnmp_index i1, i2, i3, i4, i5, ix, iy, *ip; |
| 12 |
const netsnmp_index *const i_last = &i5; |
| 13 |
netsnmp_index *a[] = { &ix, &iy }; |
| 14 |
netsnmp_index *b[] = { &i4, &i2, &i3, &i1, &i5 }; |
| 15 |
netsnmp_container *c; |
| 16 |
int i; |
| 17 |
|
| 18 |
init_snmp(test_name); |
| 19 |
|
| 20 |
c = netsnmp_container_get_binary_array(); |
| 21 |
c->compare = netsnmp_compare_netsnmp_index; |
| 22 |
|
| 23 |
i1.oids = &o1; |
| 24 |
i2.oids = &o2; |
| 25 |
i3.oids = &o3; |
| 26 |
i4.oids = &o4; |
| 27 |
i5.oids = &o5; |
| 28 |
ix.oids = &ox; |
| 29 |
iy.oids = &oy; |
| 30 |
i1.len = i2.len = i3.len = i4.len = i5.len = ix.len = iy.len = 1; |
| 31 |
|
| 32 |
for (i = 0; i < sizeof(b)/sizeof(b[0]); ++i) { |
| 33 |
OKF(CONTAINER_INSERT(c, b[i]) == 0, |
| 34 |
("Inserting %" NETSNMP_PRIo "d succeeded", b[i]->oids[0])); |
| 35 |
OKF(CONTAINER_INSERT(c, b[i]) != 0, |
| 36 |
("Inserting %" NETSNMP_PRIo "d failed", b[i]->oids[0])); |
| 37 |
} |
| 38 |
|
| 39 |
for (ip = CONTAINER_FIRST(c); ip; ip = CONTAINER_NEXT(c, ip)) { |
| 40 |
for (i = sizeof(b)/sizeof(b[0]) - 1; i >= 0; --i) |
| 41 |
if (c->compare(ip, b[i]) == 0) |
| 42 |
break; |
| 43 |
OKF(i >= 0, ("OID b[%d] = %" NETSNMP_PRIo "d present", i, b[i]->oids[0])); |
| 44 |
} |
| 45 |
|
| 46 |
for (i = 0; i < sizeof(b)/sizeof(b[0]); ++i) { |
| 47 |
ip = CONTAINER_FIND(c, b[i]); |
| 48 |
OKF(ip, ("Value b[%d] = %" NETSNMP_PRIo "d present", i, b[i]->oids[0])); |
| 49 |
ip = CONTAINER_NEXT(c, b[i]); |
| 50 |
if (c->compare(b[i], i_last) < 0) |
| 51 |
OKF(ip && c->compare(b[i], ip) < 0, |
| 52 |
("Successor of b[%d] = %" NETSNMP_PRIo "d is %" NETSNMP_PRIo "d", |
| 53 |
i, b[i]->oids[0], ip->oids[0])); |
| 54 |
else |
| 55 |
OKF(!ip, ("No successor found for b[%d] = %" NETSNMP_PRIo "d", i, |
| 56 |
b[i]->oids[0])); |
| 57 |
} |
| 58 |
|
| 59 |
for (i = 0; i < sizeof(a)/sizeof(a[0]); ++i) { |
| 60 |
ip = CONTAINER_FIND(c, a[i]); |
| 61 |
OKF(!ip, ("a[%d] = %" NETSNMP_PRIo "d absent", i, a[i]->oids[0])); |
| 62 |
ip = CONTAINER_NEXT(c, a[i]); |
| 63 |
if (c->compare(a[i], i_last) < 0) |
| 64 |
OKF(ip && c->compare(ip, a[i]) > 0, |
| 65 |
("Successor of a[%d] = %" NETSNMP_PRIo "d is %" NETSNMP_PRIo "d", |
| 66 |
i, a[i]->oids[0], ip->oids[0])); |
| 67 |
else |
| 68 |
OKF(!ip, ("No successor found for a[%d] = %" NETSNMP_PRIo "d", i, |
| 69 |
a[i]->oids[0])); |
| 70 |
} |
| 71 |
|
| 72 |
while ((ip = CONTAINER_FIRST(c))) { |
| 73 |
OK(CONTAINER_REMOVE(c, ip) == 0, "Removing succeeded"); |
| 74 |
} |
| 75 |
CONTAINER_FREE(c); |
| 76 |
|
| 77 |
snmp_shutdown(test_name); |