Home
last modified time | relevance | path

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

1234

/xen-4.10.0-shim-comet/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()
206 for (k = 0; k < nr; k++) in __bitmap_and()
217 for (k = 0; k < nr; k++) in __bitmap_or()
228 for (k = 0; k < nr; k++) in __bitmap_xor()
239 for (k = 0; k < nr; k++) in __bitmap_andnot()
248 for (k = 0; k < lim; ++k) in __bitmap_intersects()
263 for (k = 0; k < lim; ++k) in __bitmap_subset()
[all …]
A Dperfc.c41 unsigned int k, cpu; in perfc_printall() local
56 k = 0; in perfc_printall()
59 if ( k > 0 && (k % 4) == 0 ) in perfc_printall()
62 ++k; in perfc_printall()
73 for ( k = 0; k < perfc_info[i].nr_elements; k++ ) in perfc_printall()
82 for ( k = 0; k < perfc_info[i].nr_elements; k++ ) in perfc_printall()
94 k = 0; in perfc_printall()
105 if ( k > 0 && (k % 4) == 0 ) in perfc_printall()
108 ++k; in perfc_printall()
226 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.c46 [k] = { { (f) }, desc, 0, diag }
462 int k; in run_all_nonirq_keyhandlers() local
466 for ( k = 0; k < ARRAY_SIZE(key_table); k++ ) in run_all_nonirq_keyhandlers()
469 h = &key_table[k]; in run_all_nonirq_keyhandlers()
472 printk("[%c: %s]\n", k, h->desc); in run_all_nonirq_keyhandlers()
473 h->fn(k); in run_all_nonirq_keyhandlers()
485 unsigned int k; in run_all_keyhandlers() local
492 for ( k = 0; k < ARRAY_SIZE(key_table); k++ ) in run_all_keyhandlers()
494 h = &key_table[k]; in run_all_keyhandlers()
497 printk("[%c: %s]\n", k, h->desc); in run_all_keyhandlers()
[all …]
/xen-4.10.0-shim-comet/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 …]
/xen-4.10.0-shim-comet/tools/xenstore/
A Dhashtable.h104 hashtable_insert(struct hashtable *h, void *k, void *v);
107 int fnname (struct hashtable *h, keytype *k, valuetype *v) \
109 return hashtable_insert(h,k,v); \
122 hashtable_search(struct hashtable *h, void *k);
125 valuetype * fnname (struct hashtable *h, keytype *k) \
127 return (valuetype *) (hashtable_search(h,k)); \
140 hashtable_remove(struct hashtable *h, void *k);
143 valuetype * fnname (struct hashtable *h, keytype *k) \
145 return (valuetype *) (hashtable_remove(h,k)); \
A Dhashtable.c73 hash(struct hashtable *h, void *k) in hash() argument
77 unsigned int i = h->hashfn(k); in hash()
168 e->h = hash(h,k); in hashtable_insert()
170 e->k = k; in hashtable_insert()
179 hashtable_search(struct hashtable *h, void *k) in hashtable_search() argument
183 hashvalue = hash(h,k); in hashtable_search()
189 if ((hashvalue == e->h) && (h->eqfn(k, e->k))) return e->v; in hashtable_search()
197 hashtable_remove(struct hashtable *h, void *k) in hashtable_remove() argument
207 hashvalue = hash(h,k); in hashtable_remove()
214 if ((hashvalue == e->h) && (h->eqfn(k, e->k))) in hashtable_remove()
[all …]
A Dhashtable_private.h16 void *k, *v; member
27 unsigned int (*hashfn) (void *k);
33 hash(struct hashtable *h, void *k);
/xen-4.10.0-shim-comet/tools/blktap2/drivers/
A Dhashtable.h104 hashtable_insert(struct hashtable *h, void *k, void *v);
107 int fnname (struct hashtable *h, keytype *k, valuetype *v) \
109 return hashtable_insert(h,k,v); \
122 hashtable_search(struct hashtable *h, void *k);
125 valuetype * fnname (struct hashtable *h, keytype *k) \
127 return (valuetype *) (hashtable_search(h,k)); \
140 hashtable_remove(struct hashtable *h, void *k);
143 valuetype * fnname (struct hashtable *h, keytype *k) \
145 return (valuetype *) (hashtable_remove(h,k)); \
A Dhashtable.c62 hash(struct hashtable *h, void *k) in hash() argument
66 unsigned int i = h->hashfn(k); in hash()
157 e->h = hash(h,k); in hashtable_insert()
159 e->k = k; in hashtable_insert()
168 hashtable_search(struct hashtable *h, void *k) in hashtable_search() argument
172 hashvalue = hash(h,k); in hashtable_search()
178 if ((hashvalue == e->h) && (h->eqfn(k, e->k))) return e->v; in hashtable_search()
196 hashvalue = hash(h,k); in hashtable_remove()
197 index = indexFor(h->tablelength,hash(h,k)); in hashtable_remove()
203 if ((hashvalue == e->h) && (h->eqfn(k, e->k))) in hashtable_remove()
[all …]
A Dhashtable_utility.c19 hashtable_change(struct hashtable *h, void *k, void *v) in hashtable_change() argument
23 hashvalue = hash(h,k); in hashtable_change()
29 if ((hashvalue == e->h) && (h->eqfn(k, e->k))) in hashtable_change()
A Dhashtable_itr.c50 { return i->e->k; } in hashtable_iterator_key()
123 freekey(remember_e->k); in hashtable_iterator_remove()
136 struct hashtable *h, void *k) in hashtable_iterator_search() argument
141 hashvalue = hash(h,k); in hashtable_iterator_search()
149 if ((hashvalue == e->h) && (h->eqfn(k, e->k))) in hashtable_iterator_search()
A Dhashtable_private.h16 void *k, *v; member
27 unsigned int (*hashfn) (void *k);
33 hash(struct hashtable *h, void *k);
A Dhashtable_itr.h53 struct hashtable *h, void *k);
56 int fnname (struct hashtable_itr *i, struct hashtable *h, keytype *k) \
58 return (hashtable_iterator_search(i,h,k)); \
A Dimg2qcow.c84 int i,k; in print_bytes() local
88 for (k = 0; k < length; k++) { in print_bytes()
91 if(k % 16 == 0) DFPRINTF("\n"); in print_bytes()
92 else if(k % 2 == 0) DFPRINTF(" "); in print_bytes()
/xen-4.10.0-shim-comet/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-4.10.0-shim-comet/xen/arch/x86/cpu/
A Dintel_cacheinfo.c203 unsigned char k = 0; in init_intel_cacheinfo() local
206 while (cache_table[k].descriptor != 0) in init_intel_cacheinfo()
208 if (cache_table[k].descriptor == des) { in init_intel_cacheinfo()
209 if (only_trace && cache_table[k].cache_type != LVL_TRACE) in init_intel_cacheinfo()
211 switch (cache_table[k].cache_type) { in init_intel_cacheinfo()
213 l1i += cache_table[k].size; in init_intel_cacheinfo()
216 l1d += cache_table[k].size; in init_intel_cacheinfo()
219 l2 += cache_table[k].size; in init_intel_cacheinfo()
222 l3 += cache_table[k].size; in init_intel_cacheinfo()
225 trace += cache_table[k].size; in init_intel_cacheinfo()
[all …]
/xen-4.10.0-shim-comet/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-4.10.0-shim-comet/tools/python/
A Dtest.py892 for k, v in opts:
895 elif k == "--all":
913 elif k == "-F":
934 elif k == "-m":
951 elif k in ("-u", "--gui"):
955 elif k == "--times":
961 elif k in ('-s', '--dir'):
1018 k = []
1020 k.append(False)
1022 k.append(True)
[all …]
/xen-4.10.0-shim-comet/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-4.10.0-shim-comet/tools/memshr/
A Dbidir-namedefs.h63 int __key_lookup (struct __hash *h, __k_t k, __v_t *vp);
65 int __insert (struct __hash *h, __k_t k, __v_t v);
66 int __key_remove (struct __hash *h, __k_t k, __v_t *vp);
69 void (*entry_consumer)(__k_t k, __v_t v, void *p),
72 int (*entry_consumer)(__k_t k, __v_t v, void *p),
A Dbidir-hash.c760 idx = hash_to_idx(h, __prim_hash(k)); in __key_lookup()
768 if(__prim_cmp(k, entry->__prim)) in __key_lookup()
811 idx = hash_to_idx(h, __prim_hash(k)); in __value_lookup()
819 if(__prim_cmp(k, entry->__prim)) in __value_lookup()
834 int __insert(struct __hash *h, __k_t k, __v_t v) in __insert() argument
857 entry->key = k; in __insert()
861 k_idx = hash_to_idx(h, __key_hash(k)); in __insert()
926 old_kidx = kidx = hash_to_idx(h, __prim_hash(k)); in __key_remove()
935 if(__prim_cmp(k, e->__prim)) in __key_remove()
1075 old_kidx = kidx = hash_to_idx(h, __prim_hash(k)); in __value_remove()
[all …]
/xen-4.10.0-shim-comet/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);
/xen-4.10.0-shim-comet/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()

Completed in 40 milliseconds

1234