static struct index_node_f *index_readchild(const struct index_node_f *parent,
int ch)
{
- if (parent->first <= ch && ch <= parent->last)
+ if (parent->first <= ch && ch <= parent->last) {
return index_read(parent->file,
parent->children[ch - parent->first]);
- else
- return NULL;
+ }
+
+ return NULL;
}
static char *index_search__node(struct index_node_f *node, const char *key, int i)
return NULL;
}
}
+
i += j;
if (key[i] == '\0') {
return;
}
}
+
i += j;
child = index_readchild(node, '*');
along with these programs. If not, see <http://www.gnu.org/licenses/>.
*/
-#ifndef MODINITTOOLS_INDEX_H
-#define MODINITTOOLS_INDEX_H
+#ifndef _LIBKMOD_INDEX_H
+#define _LIBKMOD_INDEX_H
#include <stdint.h>
void index_values_free(struct index_value *values);
-#endif /* MODINITTOOLS_INDEX_H */
+#endif