Home
last modified time | relevance | path

Searched refs:k (Results 1 – 25 of 63) sorted by relevance

123

/xen/xen/common/
A Dbitmap.c58 for (k = 0; k < lim; ++k) in __bitmap_empty()
73 for (k = 0; k < lim; ++k) in __bitmap_full()
89 for (k = 0; k < lim; ++k) in __bitmap_equal()
104 for (k = 0; k < lim; ++k) in __bitmap_complement()
118 for (k = 0; k < nr; k++) in __bitmap_and()
129 for (k = 0; k < nr; k++) in __bitmap_or()
140 for (k = 0; k < nr; k++) in __bitmap_xor()
151 for (k = 0; k < nr; k++) in __bitmap_andnot()
160 for (k = 0; k < lim; ++k) in __bitmap_intersects()
175 for (k = 0; k < lim; ++k) in __bitmap_subset()
[all …]
A Dperfc.c40 unsigned int k, cpu; in perfc_printall() local
55 k = 0; in perfc_printall()
58 if ( k > 0 && (k % 4) == 0 ) in perfc_printall()
61 ++k; in perfc_printall()
72 for ( k = 0; k < perfc_info[i].nr_elements; k++ ) in perfc_printall()
81 for ( k = 0; k < perfc_info[i].nr_elements; k++ ) in perfc_printall()
93 k = 0; in perfc_printall()
104 if ( k > 0 && (k % 4) == 0 ) in perfc_printall()
107 ++k; in perfc_printall()
224 for ( k = 0; k < perfc_d[i].nr_vals; k++ ) in perfc_copy_info()
[all …]
A Dinflate.c230 #define NEEDBITS(n) {while(k<(n)){b|=((ulg)NEXTBYTE())<<k;k+=8;}}
450 for (; k <= g; k++) in huft_build()
605 k = bk; in inflate_codes()
689 bk = k; in inflate_codes()
712 k = bk; in inflate_stored()
748 bk = k; in inflate_stored()
858 k = bk; in inflate_dynamic()
968 bk = k; in inflate_dynamic()
1043 k = bk; in inflate_block()
1060 bk = k; in inflate_block()
[all …]
A Dkeyhandler.c44 [k] = { { (f) }, desc, 0, diag }
439 int k; in run_all_nonirq_keyhandlers() local
443 for ( k = 0; k < ARRAY_SIZE(key_table); k++ ) in run_all_nonirq_keyhandlers()
446 h = &key_table[k]; in run_all_nonirq_keyhandlers()
449 printk("[%c: %s]\n", k, h->desc); in run_all_nonirq_keyhandlers()
450 h->fn(k); in run_all_nonirq_keyhandlers()
462 unsigned int k; in run_all_keyhandlers() local
469 for ( k = 0; k < ARRAY_SIZE(key_table); k++ ) in run_all_keyhandlers()
471 h = &key_table[k]; in run_all_keyhandlers()
474 printk("[%c: %s]\n", k, h->desc); in run_all_keyhandlers()
[all …]
A Dbunzip2.c153 i, j, k, t, runPos, symCount, symTotal, nSelectors, in get_next_block() local
188 k = get_bits(bd, 16); in get_next_block()
190 if (k&(1 << (15-j))) in get_next_block()
247 k = get_bits(bd, 2); in get_next_block()
248 if (k < 2) { in get_next_block()
254 t += (((k+1)&2)-1); in get_next_block()
478 k = j+byteCount[i]; in get_next_block()
480 j = k; in get_next_block()
/xen/stubdom/vtpmmgr/
A Dmarshal.h461 return pack_BUFFER(ptr, k->IV, k->ivSize); in pack_TPM_SYMMETRIC_KEY_PARMS()
469 return pack_BUFFER(ptr, k->data, k->size); in pack_TPM_SYMMETRIC_KEY()
477 unpack3_PTR(ptr, pos, max, &k->IV, k->ivSize, alloc); in unpack3_TPM_SYMMETRIC_KEY_PARMS()
490 unpack3_PTR(ptr, pos, max, &k->data, k->size, alloc); in unpack3_TPM_SYMMETRIC_KEY()
498 return pack_BUFFER(ptr, k->exponent, k->exponentSize); in pack_TPM_RSA_KEY_PARMS()
522 if(k->parmSize) { in pack_TPM_KEY_PARMS()
561 if (!k->parmSize) in sizeof_TPM_KEY_PARMS()
579 ptr = pack_BUFFER(ptr, k->key, k->keyLength); in pack_TPM_STORE_PUBKEY()
586 unpack3_PTR(ptr, pos, max, &k->key, k->keyLength, alloc); in unpack3_TPM_STORE_PUBKEY()
724 return pack_BUFFER(ptr, k->encData, k->encDataSize); in pack_TPM_KEY()
[all …]
A Dvtpm_disk.c217 int i, j, k; in find_vtpm() local
225 for (k = 0; k < pg->size; k++) { in find_vtpm()
226 struct mem_vtpm *vt = pg->vtpms[k]; in find_vtpm()
A Dtcg.h571 inline void free_TPM_PUBKEY(TPM_PUBKEY* k) { in free_TPM_PUBKEY() argument
572 free_TPM_KEY_PARMS(&k->algorithmParms); in free_TPM_PUBKEY()
573 free_TPM_STORE_PUBKEY(&k->pubKey); in free_TPM_PUBKEY()
657 inline void free_TPM_KEY(TPM_KEY* k) { in free_TPM_KEY() argument
658 if(k->PCRInfoSize) { in free_TPM_KEY()
659 free_TPM_PCR_INFO(&k->PCRInfo); in free_TPM_KEY()
661 free_TPM_STORE_PUBKEY(&k->pubKey); in free_TPM_KEY()
662 free(k->encData); in free_TPM_KEY()
663 k->encData = NULL; in free_TPM_KEY()
/xen/tools/xenstore/
A Dhashtable.h99 hashtable_insert(struct hashtable *h, void *k, void *v);
102 int fnname (struct hashtable *h, keytype *k, valuetype *v) \
104 return hashtable_insert(h,k,v); \
117 hashtable_search(struct hashtable *h, void *k);
120 valuetype * fnname (struct hashtable *h, keytype *k) \
122 return (valuetype *) (hashtable_search(h,k)); \
135 hashtable_remove(struct hashtable *h, void *k);
138 valuetype * fnname (struct hashtable *h, keytype *k) \
140 return (valuetype *) (hashtable_remove(h,k)); \
A Dhashtable.c68 hash(struct hashtable *h, void *k) in hash() argument
72 unsigned int i = h->hashfn(k); in hash()
163 e->h = hash(h,k); in hashtable_insert()
165 e->k = k; in hashtable_insert()
174 hashtable_search(struct hashtable *h, void *k) in hashtable_search() argument
178 hashvalue = hash(h,k); in hashtable_search()
184 if ((hashvalue == e->h) && (h->eqfn(k, e->k))) return e->v; in hashtable_search()
192 hashtable_remove(struct hashtable *h, void *k) in hashtable_remove() argument
202 hashvalue = hash(h,k); in hashtable_remove()
209 if ((hashvalue == e->h) && (h->eqfn(k, e->k))) in hashtable_remove()
[all …]
A Dhashtable_private.h11 void *k, *v; member
22 unsigned int (*hashfn) (void *k);
28 hash(struct hashtable *h, void *k);
/xen/xen/include/xen/
A Dcompat.h134 #define CHECK_NAME_(k, n, tag) __check ## tag ## k ## _ ## n argument
143 #define CHECK_TYPE_(k, n) \ argument
145 CHECK_NAME_(k, n, T)(k xen_ ## n *x, \
146 k compat_ ## n *c) \
154 #define CHECK_SIZE_(k, n) \ argument
155 typedef int CHECK_NAME_(k, n, S)[1 - (sizeof(k xen_ ## n) != \
166 static inline int __maybe_unused name(k xen_ ## n *x, k compat_ ## n *c) \
175 #define CHECK_FIELD_(k, n, f) \ argument
176 CHECK_FIELD_COMMON_(k, CHECK_NAME_(k, n ## __ ## f, F), n, f)
181 CHECK_FIELD_COMMON_(k, CHECK_NAME_(k, n ## __ ## f1 ## __ ## f2, F1), \
[all …]
/xen/xen/arch/x86/cpu/
A Dintel_cacheinfo.c197 unsigned char k = 0; in init_intel_cacheinfo() local
200 while (cache_table[k].descriptor != 0) in init_intel_cacheinfo()
202 if (cache_table[k].descriptor == des) { in init_intel_cacheinfo()
203 if (only_trace && cache_table[k].cache_type != LVL_TRACE) in init_intel_cacheinfo()
205 switch (cache_table[k].cache_type) { in init_intel_cacheinfo()
207 l1i += cache_table[k].size; in init_intel_cacheinfo()
210 l1d += cache_table[k].size; in init_intel_cacheinfo()
213 l2 += cache_table[k].size; in init_intel_cacheinfo()
216 l3 += cache_table[k].size; in init_intel_cacheinfo()
219 trace += cache_table[k].size; in init_intel_cacheinfo()
[all …]
/xen/tools/libxl/
A Dlibxl_numa.c62 if (n < k) in comb_init()
66 GCNEW_ARRAY(new_iter, k); in comb_init()
67 for (i = 0; i < k; i++) in comb_init()
74 static int comb_next(comb_iter_t it, int n, int k) in comb_next() argument
96 for (i = k - 1; it[i] == n - k + i; i--) { in comb_next()
100 for (it[i]++, i++; i < k; i++) in comb_next()
131 if (m < k && n == it[m]) { in comb_get_nodemap()
190 int i, j, k; in nr_vcpus_on_nodes() local
241 libxl_for_each_set_bit(k, vinfo[j].cpumap) { in nr_vcpus_on_nodes()
242 if (k >= tinfo_elements) in nr_vcpus_on_nodes()
[all …]
/xen/tools/ocaml/xenstored/
A Dconfig.ml61 | k :: v :: [] -> Some (trim_end lc k, trim_start lc v)
85 List.iter (fun (k, v) ->
87 if not (List.mem_assoc k expected) then
88 other k v
89 else let ty = List.assoc k expected in
101 | Not_found -> append (k, "unknown key")
102 | Failure "int_of_string" -> append (k, "expect int arg")
103 | Failure "bool_of_string" -> append (k, "expect bool arg")
104 | Failure "float_of_string" -> append (k, "expect float arg")
105 | exn -> append (k, Printexc.to_string exn)
A Dtrie.mli27 (** [mem t k] returns true if a value is associated with the key [k] in the trie [t].
31 (** [find t k] returns the value associated with the key [k] in the trie [t].
32 Returns [Not_found] if no values are associated with [k] in [t]. *)
35 (** [set t k v] associates the value [v] with the key [k] in the trie [t]. *)
38 (** [unset k v] removes the association of value [v] with the key [k] in the trie [t].
/xen/tools/xl/
A Dxl_vsnd.c104 int i, j, k, n; in main_vsndlist() local
145 for(k = 0; k < vsnds[i].pcms[j].num_vsnd_streams; k++) { in main_vsndlist()
146 libxl_vsnd_stream *stream = &vsnds[i].pcms[j].streams[k]; in main_vsndlist()
147 libxl_streaminfo *info = &vsndinfo.pcms[j].streams[k]; in main_vsndlist()
150 XENSND_FIELD_TYPE": %s", k, stream->unique_id, in main_vsndlist()
/xen/automation/scripts/
A Dqemu-smoke-x86-64.sh18 pvh) k=test-hvm32pae-example extra="dom0-iommu=none dom0=pvh" ;;
19 *) k=test-pv32pae-example extra= ;;
26 -initrd xtf/tests/example/$k \
/xen/xen/xsm/flask/ss/
A Dhashtab.h55 int hashtab_insert(struct hashtab *h, void *k, void *d);
63 void *hashtab_search(struct hashtab *h, const void *k);
82 int (*apply)(void *k, void *d, void *args), void *args);
A Dconditional.c271 static int cond_insertf(struct avtab *a, struct avtab_key *k, in cond_insertf() argument
285 if ( k->specified & AVTAB_TYPE ) in cond_insertf()
287 if ( avtab_search(&p->te_avtab, k) ) in cond_insertf()
303 node_ptr = avtab_search_node(&p->te_cond_avtab, k); in cond_insertf()
306 if ( avtab_search_node_next(node_ptr, k->specified) ) in cond_insertf()
329 if ( avtab_search(&p->te_cond_avtab, k) ) in cond_insertf()
338 node_ptr = avtab_insert_nonunique(&p->te_cond_avtab, k, d); in cond_insertf()
A Davtab.h65 struct avtab_datum *avtab_search(struct avtab *h, struct avtab_key *k);
71 int (*insert)(struct avtab *a, struct avtab_key *k,
/xen/tools/tests/x86_emulator/
A Dblowfish.c394 int i, j, k; in Blowfish_Init() local
405 for (k = 0; k < 4; ++k) { in Blowfish_Init()
/xen/xen/arch/x86/boot/
A Dmem.S58 shll $6,%edx # and go from 64k to 1k chunks
/xen/xen/tools/kconfig/
A Dmconf.c367 int k = 0; in update_text() local
373 if (k < JUMP_NB) { in update_text()
377 data->keys[k] = key; in update_text()
378 data->targets[k] = pos->target; in update_text()
379 k++; in update_text()
387 data->keys[k] = 0; in update_text()
/xen/xen/tools/
A Dsymbols.c306 unsigned int i, k, off; in write_src() local
356 for (k = 0; k < table[i].len; k++) in write_src()
357 printf(", 0x%02x", table[i].sym[k]); in write_src()

Completed in 33 milliseconds

123