Lines Matching defs:NA
79 #define NA DST_KEY_STATE_NA
592 * A state in 'states' that is NA matches any state.
594 * If 'next_state' is set (not NA), we are pretending as if record 'type' of
606 if (states[i] == NA) {
609 if (next_state != NA && i == type &&
661 if (keymgr_key_match_state(d->key, k, NA, NA, hidden)) {
719 dst_key_state_t zst[NUM_KEYSTATES] = { NA, NA, NA, NA };
762 * If 'next_state' is not NA, we are actually looking for a key as if
845 * If 'next_state' is not NA, we are actually looking for a key as if
855 dst_key_state_t dnskey_chained[NUM_KEYSTATES] = { OMNIPRESENT, NA,
856 OMNIPRESENT, NA };
857 dst_key_state_t ds_hidden[NUM_KEYSTATES] = { NA, NA, NA, HIDDEN };
859 dst_key_state_t na[NUM_KEYSTATES] = { NA, NA, NA, NA };
913 * If 'next_state' is not NA, we are actually looking for a key as if
925 OMNIPRESENT, NA, NA };
926 dst_key_state_t dnskey_hidden[NUM_KEYSTATES] = { HIDDEN, NA, NA, NA };
928 dst_key_state_t na[NUM_KEYSTATES] = { NA, NA, NA, NA };
975 { NA, NA, NA, OMNIPRESENT }, /* DS present */
976 { NA, NA, NA, RUMOURED } /* DS introducing */
979 dst_key_state_t na[NUM_KEYSTATES] = { NA, NA, NA, NA };
1004 { OMNIPRESENT, NA, OMNIPRESENT, OMNIPRESENT }, /* (3b) */
1006 { OMNIPRESENT, NA, OMNIPRESENT, UNRETENTIVE }, /* (3c)p */
1007 { OMNIPRESENT, NA, OMNIPRESENT, RUMOURED }, /* (3c)s */
1009 { UNRETENTIVE, NA, UNRETENTIVE, OMNIPRESENT }, /* (3d)p */
1010 { OMNIPRESENT, NA, UNRETENTIVE, OMNIPRESENT }, /* (3d)p */
1011 { UNRETENTIVE, NA, OMNIPRESENT, OMNIPRESENT }, /* (3d)p */
1012 { RUMOURED, NA, RUMOURED, OMNIPRESENT }, /* (3d)s */
1013 { OMNIPRESENT, NA, RUMOURED, OMNIPRESENT }, /* (3d)s */
1014 { RUMOURED, NA, OMNIPRESENT, OMNIPRESENT }, /* (3d)s */
1017 dst_key_state_t na[NUM_KEYSTATES] = { NA, NA, NA, NA };
1096 { OMNIPRESENT, OMNIPRESENT, NA, NA }, /* (3f) */
1097 { UNRETENTIVE, OMNIPRESENT, NA, NA }, /* (3g)p */
1098 { RUMOURED, OMNIPRESENT, NA, NA }, /* (3g)s */
1099 { OMNIPRESENT, UNRETENTIVE, NA, NA }, /* (3h)p */
1100 { OMNIPRESENT, RUMOURED, NA, NA }, /* (3h)s */
1103 dst_key_state_t na[NUM_KEYSTATES] = { NA, NA, NA, NA };
1161 dst_key_state_t ksk_present[NUM_KEYSTATES] = { OMNIPRESENT, NA,
1164 dst_key_state_t ds_rumoured[NUM_KEYSTATES] = { OMNIPRESENT, NA,
1166 dst_key_state_t ds_retired[NUM_KEYSTATES] = { OMNIPRESENT, NA,
1169 dst_key_state_t ksk_rumoured[NUM_KEYSTATES] = { RUMOURED, NA, NA,
1171 dst_key_state_t ksk_retired[NUM_KEYSTATES] = { UNRETENTIVE, NA, NA,
1174 dst_key_state_t na[NUM_KEYSTATES] = { NA, NA, NA, NA };
1235 rule1a = keymgr_have_ds(keyring, key, type, NA,
1239 rule2a = keymgr_have_dnskey(keyring, key, type, NA);
1241 rule3a = keymgr_have_rrsig(keyring, key, type, NA);
1263 (!keymgr_have_ds(keyring, key, type, NA, secure_to_insecure) ||
1270 (!keymgr_have_dnskey(keyring, key, type, NA) ||
1277 (!keymgr_have_rrsig(keyring, key, type, NA) ||
1944 dst_key_state_t hidden[NUM_KEYSTATES] = { HIDDEN, NA, NA, NA };
1975 if (!keymgr_key_match_state(key, key, 0, NA, hidden)) {
2411 dst_key_state_t state = NA;
2436 dst_key_state_t state = NA, goal = NA;
2463 state = NA;
2512 dst_key_state_t state = NA;
2528 case NA: