HomeSort by: relevance | last modified time | path
    Searched defs:n_keys (Results 1 - 6 of 6) sorted by relevancy

  /src/crypto/external/bsd/heimdal/dist/kadmin/
init.c 55 int n_keys, i; local
94 ret = kadm5_randkey_principal(kadm_handle, princ, &keys, &n_keys);
100 for(i = 0; i < n_keys; i++)
ank.c 161 int n_keys, i; local
163 &new_keys, &n_keys);
166 n_keys = 0;
168 for(i = 0; i < n_keys; i++)
170 if (n_keys > 0)
server.c 59 int n_keys; local
508 &n_keys);
517 krb5_store_int32(sp, n_keys);
518 for(i = 0; i < n_keys; i++){
rpc.c 95 int n_keys;
649 int n_keys; local
660 &new_keys, &n_keys);
669 CHECK(krb5_store_int32(out, n_keys));
671 for(i = 0; i < n_keys; i++){
  /src/crypto/external/bsd/heimdal/dist/admin/
get.c 131 int n_keys; local
172 ret = kadm5_randkey_principal(kadm_handle, princ_ent, &keys, &n_keys);
184 for (j = 0; j < n_keys; j++)
201 for (j = 0; j < n_keys; j++)
207 for(j = 0; j < n_keys; j++) {
  /src/crypto/external/bsd/heimdal/dist/lib/kadm5/
get_s.c 71 size_t n_keys, Key *keys, krb5_salt *salt,
80 for (i = 0; i < n_keys; i++) {
257 size_t n_keys = ent.entry.keys.len; local
272 n_keys += hist_keys->val[i].keys.len;
273 out->key_data = malloc(n_keys * sizeof(*out->key_data));
274 if (out->key_data == NULL && n_keys != 0) {
292 assert( out->n_key_data == n_keys );

Completed in 37 milliseconds