Sort a list of object identifiers: Difference between revisions
m
Reformatted to reduce line count
(→{{header|REXX}}: moved data into the GEN subroutine, added/changed comments and whitespace, split some multi-statement lines.) |
m (Reformatted to reduce line count) |
||
Line 222:
=={{header|C}}==
A C99 (or later) compiler is required.
<lang
#include <stdlib.h>
#include <string.h>
typedef struct oid_tag {
char* str_;
int* numbers_;
Line 234 ⟶ 233:
// free memory, no-op if p is null
void oid_destroy(oid* p) {
if (p != 0) {▼
▲ if (p != 0)
free(p->str_);
free(p->numbers_);
Line 244 ⟶ 241:
}
int char_count(const char* str, char ch) {
int count = 0;
if (*p == ch)
++count;
Line 257 ⟶ 252:
// construct an OID from a string
// returns 0 on memory allocation failure or parse error
oid* oid_create(const char* str) {
oid* ptr = calloc(1, sizeof(oid));
if (ptr == 0)
return 0;
ptr->str_ = strdup(str);
if (ptr->str_ == 0) {
oid_destroy(ptr);
return 0;
Line 270 ⟶ 263:
int dots = char_count(str, '.');
ptr->numbers_ = malloc(sizeof(int) * (dots + 1));
if (ptr->numbers_ == 0) {
oid_destroy(ptr);
return 0;
Line 277 ⟶ 269:
ptr->length_ = dots + 1;
const char* p = str;
for (int i = 0; i <= dots && *p;) {
char* eptr = 0;
int num = strtol(p, &eptr, 10);
if (*eptr != 0 && *eptr != '.') {
// TODO: check for overflow/underflow
oid_destroy(ptr);
Line 296 ⟶ 286:
// compare two OIDs
int oid_compare(const void* p1, const void* p2) {
const oid* o1 = *(oid* const*)p1;
const oid* o2 = *(oid* const*)p2;
int i1 = 0, i2 = 0;
for (; i1 < o1->length_ && i2 < o2->length_; ++i1, ++i2) {
if (o1->numbers_[i1] < o2->numbers_[i2])
return -1;
Line 315 ⟶ 303:
}
int main() {
const char* input[] = {
"1.3.6.1.4.1.11.2.17.19.3.4.0.10",
Line 329 ⟶ 316:
memset(oids, 0, sizeof(oids));
int i;
for (i = 0; i < len; ++i) {
oids[i] = oid_create(input[i]);
if (oids[i] == 0)
| |||