}
bool
-dane_wildcard_label_cmp(int iw, const char* w, int il, const char* l)
+dane_wildcard_label_cmp(uint8_t iw, const char* w, uint8_t il, const char* l)
{
if (iw == 0) { /* End of match label */
if (il == 0) { /* And end in the to be matched label */
bool
dane_label_matches_label(ldns_rdf* w, ldns_rdf* l)
{
- int iw;
- int il;
+ uint8_t iw;
+ uint8_t il;
iw = ldns_rdf_data(w)[0];
il = ldns_rdf_data(l)[0];
static ldns_radix_node_t*
ldns_radix_last_in_subtree(ldns_radix_node_t* node)
{
- uint16_t i;
+ int i;
/** Look for the most right leaf node. */
- for (i=(node->len)-1; i >= 0; i--) {
+ for (i=(int)(node->len)-1; i >= 0; i--) {
if (node->array[i].edge) {
/** Keep looking for the most right leaf node. */
if (node->array[i].edge->len > 0) {