static void
foreachIndexDo(FILE *f, SmiNode *smiNode, ForEachIndexFunc func, void *data)
{
SmiNode *indexNode = NULL, *iNode;
SmiElement *smiElement;
switch (smiNode->indexkind) {
case SMI_INDEX_INDEX:
case SMI_INDEX_REORDER:
indexNode = smiNode;
break;
case SMI_INDEX_EXPAND: /* TODO: we have to do more work here! */
break;
case SMI_INDEX_AUGMENT:
case SMI_INDEX_SPARSE:
indexNode = smiGetRelatedNode(smiNode);
break;
case SMI_INDEX_UNKNOWN:
break;
}
if (indexNode) {
for (smiElement = smiGetFirstElement(indexNode);
smiElement; smiElement = smiGetNextElement(smiElement)) {
iNode = smiGetElementNode(smiElement);
if (iNode) {
(func) (f, smiNode, iNode, data);
}
}
}
}
static void fprintIndex(FILE *f, int indent, SmiNode *smiNode)
{
SmiNode *relatedNode;
SmiModule *relatedModule = NULL;
fprintSegment(f, indent, "<linkage", 0);
if (smiNode->implied) {
fprint(f, " implied=\"true\"");
}
fprint(f, ">\n");
relatedNode = smiGetRelatedNode(smiNode);
if (relatedNode) {
relatedModule = smiGetNodeModule(relatedNode);
}
switch (smiNode->indexkind) {
case SMI_INDEX_INDEX:
fprintElementList(f, indent + INDENT, "index",
smiGetFirstElement(smiNode));
break;
case SMI_INDEX_AUGMENT:
if (relatedNode && relatedModule) {
fprintSegment(f, indent + INDENT, "", 0);
fprint(f, "<augments module=\"%s\" name=\"%s\"/>\n",
relatedModule->name, relatedNode->name);
} /* TODO: else print error */
break;
case SMI_INDEX_REORDER:
if (relatedNode && relatedModule) {
fprintSegment(f, indent + INDENT, "", 0);
fprint(f, "<reorders module=\"%s\" name=\"%s\"/>\n",
relatedModule->name, relatedNode->name);
fprintElementList(f, indent + INDENT, "index",
smiGetFirstElement(smiNode));
} /* TODO: else print error */
break;
case SMI_INDEX_SPARSE:
if (relatedNode && relatedModule) {
fprintSegment(f, indent + INDENT, "", 0);
fprint(f, "<sparse module=\"%s\" name=\"%s\"/>\n",
relatedModule->name, relatedNode->name);
} /* TODO: else print error */
break;
case SMI_INDEX_EXPAND:
if (relatedNode && relatedModule) {
fprintSegment(f, indent + INDENT, "", 0);
fprint(f, "<expands module=\"%s\" name=\"%s\"/>\n",
relatedModule->name, relatedNode->name);
fprintElementList(f, indent + INDENT, "index",
smiGetFirstElement(smiNode));
} /* TODO: else print error */
break;
case SMI_INDEX_UNKNOWN:
break;
}
fprintSegment(f, indent, "</linkage>\n", 0);
}
static void fprintObjects(FILE *f, SmiModule *smiModule)
{
int i, j;
SmiNode *smiNode, *relatedNode;
SmiElement *smiElement;
SmiType *smiType;
int indent = 0;
int lastindent = -1;
char *s = NULL;
SmiNodekind nodekinds;
nodekinds = SMI_NODEKIND_NODE | SMI_NODEKIND_TABLE |
SMI_NODEKIND_ROW | SMI_NODEKIND_COLUMN | SMI_NODEKIND_SCALAR |
SMI_NODEKIND_CAPABILITIES;
for(i = 0, smiNode = smiGetFirstNode(smiModule, nodekinds);
smiNode; smiNode = smiGetNextNode(smiNode, nodekinds)) {
if (smiNode->nodekind == SMI_NODEKIND_NODE) {
indent = 0;
s = "node";
} else if (smiNode->nodekind == SMI_NODEKIND_CAPABILITIES) {
indent = 0;
s = "node";
} else if (smiNode->nodekind == SMI_NODEKIND_TABLE) {
indent = 0;
s = "table";
} else if (smiNode->nodekind == SMI_NODEKIND_ROW) {
indent = 1;
s = "row";
} else if (smiNode->nodekind == SMI_NODEKIND_COLUMN) {
indent = 2;
s = "column";
} else if (smiNode->nodekind == SMI_NODEKIND_SCALAR) {
indent = 0;
s = "scalar";
}
if (!i && !silent) {
fprint(f, "//\n// OBJECT DEFINITIONS\n//\n\n");
}
for (j = lastindent; j >= indent; j--) {
fprintSegment(f, (1 + j) * INDENT, "", 0);
fprint(f, "};\n");
}
fprint(f, "\n");
lastindent = indent;
if (smiNode->nodekind == SMI_NODEKIND_CAPABILITIES) {
fprintSegment(f, (1 + indent) * INDENT, "", 0);
fprint(f, "-- This has been an SMIv2 AGENT-CAPABILITIES node:\n");
}
fprintSegment(f, (1 + indent) * INDENT, "", 0);
fprint(f, "%s %s {\n", s, smiNode->name);
if (smiNode->oid) {
fprintSegment(f, (2 + indent) * INDENT, "oid", INDENTVALUE);
fprint(f, "%s;\n", getOidString(smiNode, 0));
}
smiType = smiGetNodeType(smiNode);
if (smiType && (smiType->basetype != SMI_BASETYPE_UNKNOWN)) {
fprintSegment(f, (2 + indent) * INDENT, "type", INDENTVALUE);
if (!smiType->name) {
/*
* an implicitly restricted type.
*/
fprint(f, "%s", getTypeString(smiType->basetype,
smiGetParentType(smiType)));
fprintSubtype(f, smiType);
fprint(f, ";\n");
} else {
fprint(f, "%s;\n",
getTypeString(smiType->basetype, smiType));
}
}
if ((smiNode->nodekind != SMI_NODEKIND_TABLE) &&
(smiNode->nodekind != SMI_NODEKIND_ROW) &&
(smiNode->nodekind != SMI_NODEKIND_CAPABILITIES) &&
(smiNode->nodekind != SMI_NODEKIND_NODE)) {
if (smiNode->access != SMI_ACCESS_UNKNOWN) {
fprintSegment(f, (2 + indent) * INDENT, "access", INDENTVALUE);
fprint(f, "%s;\n", getAccessString(smiNode->access));
}
}
relatedNode = smiGetRelatedNode(smiNode);
switch (smiNode->indexkind) {
case SMI_INDEX_INDEX:
if (smiNode->implied) {
fprintSegment(f, (2 + indent) * INDENT, "index implied",
INDENTVALUE);
} else {
fprintSegment(f, (2 + indent) * INDENT, "index", INDENTVALUE);
}
fprint(f, "(");
for (j = 0, smiElement = smiGetFirstElement(smiNode); smiElement;
j++, smiElement = smiGetNextElement(smiElement)) {
if (j) {
fprint(f, ", ");
}
fprintWrapped(f, INDENTVALUE + 1,
smiGetElementNode(smiElement)->name);
/* TODO: non-local name if non-local */
} /* TODO: empty? -> print error */
fprint(f, ");\n");
break;
case SMI_INDEX_AUGMENT:
if (relatedNode) {
fprintSegment(f, (2 + indent) * INDENT, "augments",
INDENTVALUE);
fprint(f, "%s;\n", relatedNode->name);
/* TODO: non-local name if non-local */
} /* TODO: else print error */
break;
case SMI_INDEX_REORDER:
if (relatedNode) {
fprintSegment(f, (2 + indent) * INDENT, "", 0);
fprint(f, "reorders %s", relatedNode->name);
/* TODO: non-local name if non-local */
if (smiNode->implied) {
fprint(f, " implied");
}
fprint(f, " (");
for (j = 0, smiElement = smiGetFirstElement(smiNode);
smiElement;
j++, smiElement = smiGetNextElement(smiElement)) {
if (j) {
fprint(f, ", ");
}
fprintWrapped(f, INDENTVALUE + 1,
smiGetElementNode(smiElement)->name);
/* TODO: non-local name if non-local */
} /* TODO: empty? -> print error */
fprint(f, ");\n");
} /* TODO: else print error */
break;
case SMI_INDEX_SPARSE:
if (relatedNode) {
fprintSegment(f, (2 + indent) * INDENT, "sparse", INDENTVALUE);
fprint(f, "%s;\n", relatedNode->name);
/* TODO: non-local name if non-local */
} /* TODO: else print error */
break;
case SMI_INDEX_EXPAND:
if (relatedNode) {
fprintSegment(f, (2 + indent) * INDENT, "", 0);
fprint(f, "expands %s", relatedNode->name);
/* TODO: non-local name if non-local */
if (smiNode->implied) {
fprint(f, " implied");
}
fprint(f, " (");
for (j = 0, smiElement = smiGetFirstElement(smiNode);
smiElement;
j++, smiElement = smiGetNextElement(smiElement)) {
if (j) {
fprint(f, ", ");
}
fprintWrapped(f, INDENTVALUE + 1,
smiGetElementNode(smiElement)->name);
/* TODO: non-local name if non-local */
} /* TODO: empty? -> print error */
fprint(f, ");\n");
} /* TODO: else print error */
break;
case SMI_INDEX_UNKNOWN:
break;
}
if (smiNode->create) {
fprintSegment(f, (2 + indent) * INDENT, "create", INDENTVALUE);
/* TODO: create list */
fprint(f, ";\n");
}
if (smiNode->value.basetype != SMI_BASETYPE_UNKNOWN) {
fprintSegment(f, (2 + indent) * INDENT, "default", INDENTVALUE);
fprint(f, "%s", getValueString(&smiNode->value, smiType));
fprint(f, ";\n");
}
if (smiNode->format) {
fprintSegment(f, (2 + indent) * INDENT, "format", INDENTVALUE);
fprint(f, "\"%s\";\n",smiNode->format);
}
if (smiNode->units) {
fprintSegment(f, (2 + indent) * INDENT, "units", INDENTVALUE);
fprint(f, "\"%s\";\n", smiNode->units);
}
if ((smiNode->status != SMI_STATUS_CURRENT) &&
(smiNode->status != SMI_STATUS_UNKNOWN) &&
(smiNode->status != SMI_STATUS_MANDATORY) &&
(smiNode->status != SMI_STATUS_OPTIONAL)) {
fprintSegment(f, (2 + indent) * INDENT, "status", INDENTVALUE);
fprint(f, "%s;\n", getStringStatus(smiNode->status));
}
if (smiNode->description) {
fprintSegment(f, (2 + indent) * INDENT, "description",
INDENTVALUE);
fprint(f, "\n");
fprintMultilineString(f, (2 + indent) * INDENT,
smiNode->description);
fprint(f, ";\n");
}
if (smiNode->reference) {
fprintSegment(f, (2 + indent) * INDENT, "reference",
INDENTVALUE);
fprint(f, "\n");
fprintMultilineString(f, (2 + indent) * INDENT,
smiNode->reference);
fprint(f, ";\n");
}
i++;
}
if (i) {
fprintSegment(f, (1 + indent) * INDENT, "", 0);
fprint(f, "};\n\n");
}
}
static int
ber_len_varbind(SmiNode *smiNode, len_type flags)
{
SmiNode *row;
SmiSubid oid[128];
unsigned int oidlen = sizeof(oid)/sizeof(oid[0]);
int len = 0;
#ifdef DUMP_OID
int x;
#endif
switch (smiNode->nodekind) {
case SMI_NODEKIND_SCALAR:
for (oidlen = 0; oidlen < smiNode->oidlen; oidlen++) {
oid[oidlen] = smiNode->oid[oidlen];
}
oid[oidlen++] = 0;
break;
case SMI_NODEKIND_COLUMN:
for (oidlen = 0; oidlen < smiNode->oidlen; oidlen++) {
oid[oidlen] = smiNode->oid[oidlen];
}
row = smiGetParentNode(smiNode);
if (row) {
SmiNode *indexNode = NULL, *iNode;
SmiElement *smiElement;
switch (row->indexkind) {
case SMI_INDEX_INDEX:
case SMI_INDEX_REORDER:
indexNode = row;
break;
case SMI_INDEX_EXPAND: /* TODO: we have to do more work here! */
break;
case SMI_INDEX_AUGMENT:
case SMI_INDEX_SPARSE:
indexNode = smiGetRelatedNode(row);
break;
case SMI_INDEX_UNKNOWN:
break;
}
if (indexNode) {
for (smiElement = smiGetFirstElement(indexNode);
smiElement;
smiElement = smiGetNextElement(smiElement)) {
iNode = smiGetElementNode(smiElement);
append_index(oid, &oidlen, iNode, flags);
}
}
}
break;
default:
return 0;
}
#ifdef DUMP_OID
fprintf(stderr, "%-32s\t", smiNode->name);
for (x = 0; x < oidlen; x++) {
fprintf(stderr, ".%u", oid[x]);
}
fprintf(stderr, "\n");
#endif
len += ber_len_oid(oid, oidlen);
len += ber_len_val(smiGetNodeType(smiNode), flags);
len += ber_len_length(len) + 1;
return len;
}
