Searched refs:keys (Results 1 - 200 of 751) sorted by relevance

1234

/linux-4.1.27/security/keys/encrypted-keys/
H A DMakefile2 # Makefile for encrypted keys
5 obj-$(CONFIG_ENCRYPTED_KEYS) += encrypted-keys.o
7 encrypted-keys-y := encrypted.o ecryptfs_format.o
10 encrypted-keys-y += $(masterkey-y) $(masterkey-m-m)
H A Dmasterkey_trusted.c14 * See Documentation/security/keys-trusted-encrypted.txt
20 #include <keys/trusted-type.h>
21 #include <keys/encrypted-type.h>
27 * Trusted keys are sealed to PCRs and other metadata. Although userspace
/linux-4.1.27/drivers/input/keyboard/
H A Dipaq-micro-keys.c46 struct ipaq_micro_keys *keys = data; micro_key_receive() local
53 input_report_key(keys->input, keys->codes[key], down); micro_key_receive()
54 input_sync(keys->input); micro_key_receive()
58 static void micro_key_start(struct ipaq_micro_keys *keys) micro_key_start() argument
60 spin_lock(&keys->micro->lock); micro_key_start()
61 keys->micro->key = micro_key_receive; micro_key_start()
62 keys->micro->key_data = keys; micro_key_start()
63 spin_unlock(&keys->micro->lock); micro_key_start()
66 static void micro_key_stop(struct ipaq_micro_keys *keys) micro_key_stop() argument
68 spin_lock(&keys->micro->lock); micro_key_stop()
69 keys->micro->key = NULL; micro_key_stop()
70 keys->micro->key_data = NULL; micro_key_stop()
71 spin_unlock(&keys->micro->lock); micro_key_stop()
76 struct ipaq_micro_keys *keys = input_get_drvdata(input); micro_key_open() local
78 micro_key_start(keys); micro_key_open()
85 struct ipaq_micro_keys *keys = input_get_drvdata(input); micro_key_close() local
87 micro_key_stop(keys); micro_key_close()
92 struct ipaq_micro_keys *keys; micro_key_probe() local
96 keys = devm_kzalloc(&pdev->dev, sizeof(*keys), GFP_KERNEL); micro_key_probe()
97 if (!keys) micro_key_probe()
100 keys->micro = dev_get_drvdata(pdev->dev.parent); micro_key_probe()
102 keys->input = devm_input_allocate_device(&pdev->dev); micro_key_probe()
103 if (!keys->input) micro_key_probe()
106 keys->input->keycodesize = sizeof(micro_keycodes[0]); micro_key_probe()
107 keys->input->keycodemax = ARRAY_SIZE(micro_keycodes); micro_key_probe()
108 keys->codes = devm_kmemdup(&pdev->dev, micro_keycodes, micro_key_probe()
109 keys->input->keycodesize * keys->input->keycodemax, micro_key_probe()
111 keys->input->keycode = keys->codes; micro_key_probe()
113 __set_bit(EV_KEY, keys->input->evbit); micro_key_probe()
115 __set_bit(micro_keycodes[i], keys->input->keybit); micro_key_probe()
117 keys->input->name = "h3600 micro keys"; micro_key_probe()
118 keys->input->open = micro_key_open; micro_key_probe()
119 keys->input->close = micro_key_close; micro_key_probe()
120 input_set_drvdata(keys->input, keys); micro_key_probe()
122 error = input_register_device(keys->input); micro_key_probe()
126 platform_set_drvdata(pdev, keys); micro_key_probe()
132 struct ipaq_micro_keys *keys = dev_get_drvdata(dev); micro_key_suspend() local
134 micro_key_stop(keys); micro_key_suspend()
141 struct ipaq_micro_keys *keys = dev_get_drvdata(dev); micro_key_resume() local
142 struct input_dev *input = keys->input; micro_key_resume()
147 micro_key_start(keys); micro_key_resume()
159 .name = "ipaq-micro-keys",
167 MODULE_DESCRIPTION("driver for iPAQ Atmel micro keys");
168 MODULE_ALIAS("platform:ipaq-micro-keys");
H A Dsh_keysc.c91 DECLARE_BITMAP(keys, SH_KEYSC_MAXKEYS); sh_keysc_isr()
103 bitmap_zero(keys, SH_KEYSC_MAXKEYS); sh_keysc_isr()
119 __set_bit(n + k, keys); sh_keysc_isr()
128 bitmap_complement(keys, keys, SH_KEYSC_MAXKEYS); sh_keysc_isr()
129 bitmap_and(keys1, keys1, keys, SH_KEYSC_MAXKEYS); sh_keysc_isr()
130 bitmap_or(keys0, keys0, keys, SH_KEYSC_MAXKEYS); sh_keysc_isr()
132 sh_keysc_map_dbg(&pdev->dev, keys, "keys"); sh_keysc_isr()
221 input->phys = "sh-keysc-keys/input0"; sh_keysc_probe()
H A Dgpio_keys.c2 * Driver for keys on GPIO lines capable of generating interrupts.
59 * SYSFS interface for enabling/disabling keys and switches:
61 * There are 4 attributes under /sys/devices/platform/gpio-keys/
62 * keys [ro] - bitmap of keys (EV_KEY) which can be
66 * disabled_keys [rw] - bitmap of keys currently disabled
73 * For example, if we have following switches set up as gpio-keys:
89 * We can disable only those keys which don't allow sharing the irq.
275 ATTR_SHOW_FN(keys, EV_KEY, false);
283 * /sys/devices/platform/gpio-keys/keys [ro]
284 * /sys/devices/platform/gpio-keys/switches [ro]
286 static DEVICE_ATTR(keys, S_IRUGO, gpio_keys_show_keys, NULL);
312 * /sys/devices/platform/gpio-keys/disabled_keys [rw]
313 * /sys/devices/platform/gpio-keys/disables_switches [rw]
674 { .compatible = "gpio-keys", },
727 input->phys = "gpio-keys/input0"; gpio_keys_probe()
755 dev_err(dev, "Unable to export keys/switches, error: %d\n", gpio_keys_probe()
842 .name = "gpio-keys",
864 MODULE_ALIAS("platform:gpio-keys");
H A Dlm8333.c82 u8 keys[LM8333_FIFO_TRANSFER_SIZE]; lm8333_key_handler() local
87 LM8333_FIFO_TRANSFER_SIZE, keys); lm8333_key_handler()
94 for (i = 0; i < LM8333_FIFO_TRANSFER_SIZE && keys[i]; i++) { lm8333_key_handler()
95 pressed = keys[i] & 0x80; lm8333_key_handler()
96 code = keys[i] & 0x7f; lm8333_key_handler()
H A Dsun4i-lradc-keys.c2 * Allwinner sun4i low res adc attached tablet keys driver
19 * various (tablet) keys (ie home, back, search, etc). attached to it using
20 * a resistor network. This driver is for the keys on such boards.
256 "sun4i-a10-lradc-keys", lradc); sun4i_lradc_probe()
269 { .compatible = "allwinner,sun4i-a10-lradc-keys", },
276 .name = "sun4i-a10-lradc-keys",
284 MODULE_DESCRIPTION("Allwinner sun4i low res adc attached tablet keys driver");
H A Dcros_ec_keyb.c16 * communicating the keyboard state (which keys are pressed) from a keyboard EC
42 * @valid_keys: bitmap of existing keys for each matrix column
43 * @old_kb_state: bitmap of keys pressed last scan
64 * Returns true when there is at least one combination of pressed keys that
74 * Ghosting happens if for any pressed key X there are other keys cros_ec_keyb_has_ghosting()
121 * improvement is to only ignore changes to keys involved in cros_ec_keyb_process()
205 * ghosting logic to ignore NULL or virtual keys.
307 /* Clear any keys in the buffer */ cros_ec_keyb_clear_keyboard()
H A Dadp5520-keys.c107 input->phys = "adp5520-keys/input0"; adp5520_keys_probe()
186 .name = "adp5520-keys",
196 MODULE_ALIAS("platform:adp5520-keys");
H A Dbf54x-keys.c2 * File: drivers/input/keyboard/bf54x-keys.c
48 #define DRV_NAME "bf54x-keys"
268 input->phys = "bf54x-keys/input0"; bfin_kpad_probe()
399 MODULE_ALIAS("platform:bf54x-keys");
H A Dtca6416-keypad.c2 * Driver for keys on TCA6416 I2C IO expander
31 { "tca6416-keys", 16, },
32 { "tca6408-keys", 8, },
239 input->phys = "tca6416-keys/input0"; tca6416_keypad_probe()
H A Dtegra-kbc.c41 /* Maximum keys supported by Tegra KBC yet is 16 x 8*/
191 * Ghosting occurs if there are 3 keys such that - tegra_kbc_report_keys()
192 * any 2 of the 3 keys share a row, and any 2 of them share a column. tegra_kbc_report_keys()
202 * Find 2 keys such that one key is in the same row tegra_kbc_report_keys()
218 * If the platform uses Fn keymaps, translate keys on a Fn keypress. tegra_kbc_report_keys()
270 * If more than one keys are pressed we need not wait tegra_kbc_keypress_timer()
276 /* Release any pressed keys and exit the polling loop */ tegra_kbc_keypress_timer()
283 /* All keys are released so enable the keypress interrupt */ tegra_kbc_keypress_timer()
307 * Until all keys are released, defer further processing to tegra_kbc_isr()
327 /* Either mask all keys or none. */ tegra_kbc_setup_wakekeys()
H A Dmpr121_touchkey.c56 /* MPR121 has 12 keys */
178 dev_dbg(&client->dev, "set up with %x keys.\n", mpr121->keycount); mpr121_phys_init()
208 dev_err(&client->dev, "too many keys defined\n"); mpr_touchkey_probe()
H A Datkbd.c64 MODULE_PARM_DESC(extra, "Enable extra LEDs and keys on IBM RapidAcces, EzKey and similar keyboards");
143 #define ATKBD_CMD_SETALL_MB 0x00f8 /* Set all keys to give break codes */
331 * between make/break pair of scancodes for select keys and PS/2
447 dev_dbg(&serio->dev, "Keyboard on %s reports too many keys pressed.\n", atkbd_interrupt()
923 const unsigned int *keys = data; atkbd_apply_forced_release_keylist() local
927 for (i = 0; keys[i] != -1U; i++) atkbd_apply_forced_release_keylist()
928 __set_bit(keys[i], atkbd->force_release_mask); atkbd_apply_forced_release_keylist()
932 * Most special keys (Fn+F?) on Dell laptops do not generate release
955 * Amilo Pi 3525 key release for Fn+Volume keys not working
969 * Soltech TA12 system with broken key release on volume keys and mute key
977 * keys, with key list below common among them
984 * OQO 01+ multimedia keys (64--66) generate e0 6x upon release whereas
1035 * HANGEUL and HANJA keys do not send release events so we need to atkbd_set_keycode_table()
1658 * task of adjusting list of keys that should be "released" automatically
H A Dpxa27x_keypad.c360 * The keycodes may not only include matrix keys but also the direct pxa27x_keypad_build_keycode()
361 * or rotary keys. pxa27x_keypad_build_keycode()
365 /* For direct keys. */ pxa27x_keypad_build_keycode()
603 /* enable matrix keys with automatic scan */ pxa27x_keypad_config()
610 /* enable rotary key, debounce interval same as direct keys */ pxa27x_keypad_config()
627 * Direct keys usage may not start from KP_DKIN0, check the platfrom pxa27x_keypad_config()
/linux-4.1.27/tools/perf/scripts/python/Perf-Trace-Util/lib/Perf/Trace/
H A DCore.py35 keys = flag_fields[event_name][field_name]['values'].keys()
36 keys.sort()
37 for idx in keys:
54 keys = symbolic_fields[event_name][field_name]['values'].keys()
55 keys.sort()
56 for idx in keys:
77 keys = trace_flags.keys()
79 for idx in keys:
/linux-4.1.27/drivers/mfd/
H A Ducb1x00-assabet.c44 struct gpio_keys_platform_data keys; ucb1x00_assabet_add() local
49 memset(&keys, 0, sizeof(keys)); ucb1x00_assabet_add()
58 keys.buttons = buttons; ucb1x00_assabet_add()
59 keys.nbuttons = ARRAY_SIZE(buttons); ucb1x00_assabet_add()
60 keys.poll_interval = 50; ucb1x00_assabet_add()
61 keys.name = "ucb1x00"; ucb1x00_assabet_add()
63 pdev = platform_device_register_data(&ucb->dev, "gpio-keys", -1, ucb1x00_assabet_add()
64 &keys, sizeof(keys)); ucb1x00_assabet_add()
H A Dadp5520.c6 * Keys : drivers/input/keyboard/adp5520-keys (ADP5520 only)
256 if (pdata->keys) { adp5520_probe()
257 pdev = platform_device_register_data(chip->dev, "adp5520-keys", adp5520_probe()
258 chip->id, pdata->keys, sizeof(*pdata->keys)); adp5520_probe()
/linux-4.1.27/drivers/input/misc/
H A Ddm355evm_keys.c107 struct dm355evm_keys *keys = _keys; dm355evm_keys_irq() local
120 dev_dbg(keys->dev, "input high err %d\n", dm355evm_keys_irq()
128 dev_dbg(keys->dev, "input low err %d\n", dm355evm_keys_irq()
157 ke = sparse_keymap_entry_from_scancode(keys->input, event); dm355evm_keys_irq()
159 dev_dbg(keys->dev, dm355evm_keys_irq()
164 input_report_key(keys->input, keycode, 1); dm355evm_keys_irq()
165 input_sync(keys->input); dm355evm_keys_irq()
166 input_report_key(keys->input, keycode, 0); dm355evm_keys_irq()
167 input_sync(keys->input); dm355evm_keys_irq()
177 struct dm355evm_keys *keys; dm355evm_keys_probe() local
182 keys = kzalloc(sizeof *keys, GFP_KERNEL); dm355evm_keys_probe()
184 if (!keys || !input) { dm355evm_keys_probe()
189 keys->dev = &pdev->dev; dm355evm_keys_probe()
190 keys->input = input; dm355evm_keys_probe()
196 keys->irq = status; dm355evm_keys_probe()
198 input_set_drvdata(input, keys); dm355evm_keys_probe()
214 status = request_threaded_irq(keys->irq, NULL, dm355evm_keys_irq, dm355evm_keys_probe()
216 dev_name(&pdev->dev), keys); dm355evm_keys_probe()
225 platform_set_drvdata(pdev, keys); dm355evm_keys_probe()
230 free_irq(keys->irq, keys); dm355evm_keys_probe()
235 kfree(keys); dm355evm_keys_probe()
243 struct dm355evm_keys *keys = platform_get_drvdata(pdev); dm355evm_keys_remove() local
245 free_irq(keys->irq, keys); dm355evm_keys_remove()
246 sparse_keymap_free(keys->input); dm355evm_keys_remove()
247 input_unregister_device(keys->input); dm355evm_keys_remove()
248 kfree(keys); dm355evm_keys_remove()
H A Dpcap_keys.c70 input_dev->phys = "pcap-keys/input0"; pcap_keys_probe()
123 .name = "pcap-keys",
H A Dapanel.c32 /* How often we poll keys - msecs */
83 * Read Application keys via SMI
86 * CD keys:
H A Dcm109.c79 /* up to 256 normal keys, up to 16 special keys */
153 * The "up" and "down" keys, are symbolised by arrows on the button.
154 * The "pickup" and "hangup" keys are symbolised by a green and red phone
359 /* Special keys */ cm109_urb_irq_callback()
540 dev->key_code = -1; /* no keys pressed */ cm109_input_open()
/linux-4.1.27/drivers/md/bcache/
H A Ddebug.c43 sorted = b->c->verify_data->keys.set->data; bch_btree_verify()
44 inmemory = b->keys.set->data; bch_btree_verify()
49 v->keys.ops = b->keys.ops; bch_btree_verify()
63 sorted = v->keys.set->data; bch_btree_verify()
65 if (inmemory->keys != sorted->keys || bch_btree_verify()
75 bch_dump_bset(&b->keys, inmemory, 0); bch_btree_verify()
78 bch_dump_bset(&v->keys, sorted, 0); bch_btree_verify()
85 bch_dump_bset(&b->keys, i, block); for_each_written_bset()
91 for (j = 0; j < inmemory->keys; j++)
153 struct keybuf keys; member in struct:dump_iterator
185 w = bch_keybuf_next_rescan(i->c, &i->keys, &MAX_KEY, dump_pred); bch_dump_read()
191 bch_keybuf_del(&i->keys, w); bch_dump_read()
208 bch_keybuf_init(&i->keys); bch_dump_open()
209 i->keys.last_scanned = KEY(0, 0, 0); bch_dump_open()
H A Dbtree.c17 * as keys are inserted we only sort the pages that have not yet been written.
49 * Check for bad keys in replay
165 if (b->level && b->keys.nsets) bch_btree_init_next()
166 bch_btree_sort(&b->keys, &b->c->sort); bch_btree_init_next()
168 bch_btree_sort_lazy(&b->keys, &b->c->sort); bch_btree_init_next()
171 bch_bset_init_next(&b->keys, write_block(b), bch_btree_init_next()
209 iter->b = &b->keys; bch_btree_node_read_done()
216 b->written < btree_blocks(b) && i->seq == b->keys.set[0].data->seq; bch_btree_node_read_done()
244 if (i != b->keys.set[0].data && !i->keys) bch_btree_node_read_done()
254 bset_sector_offset(&b->keys, i) < KEY_SIZE(&b->key); bch_btree_node_read_done()
256 if (i->seq == b->keys.set[0].data->seq) bch_btree_node_read_done()
259 bch_btree_sort_and_fix_extents(&b->keys, iter, &b->c->sort); bch_btree_node_read_done()
261 i = b->keys.set[0].data; bch_btree_node_read_done()
263 if (b->keys.set[0].size && bch_btree_node_read_done()
264 bkey_cmp(&b->key, &b->keys.set[0].end) < 0) bch_btree_node_read_done()
268 bch_bset_init_next(&b->keys, write_block(b), bch_btree_node_read_done()
275 bch_cache_set_error(b->c, "%s at bucket %zu, block %u, %u keys", bch_btree_node_read_done()
277 bset_block_offset(b, i), i->keys); bch_btree_node_read_done()
303 bch_bio_map(bio, b->keys.set[0].data); bch_btree_node_read()
421 bset_sector_offset(&b->keys, i)); do_btree_node_write()
456 BUG_ON(b->written && !i->keys); __bch_btree_node_write()
458 bch_check_keys(&b->keys, "writing"); __bch_btree_node_write()
479 unsigned nsets = b->keys.nsets; bch_btree_node_write()
489 if (nsets && !b->keys.nsets) bch_btree_node_write()
526 BUG_ON(!i->keys); bch_btree_leaf_dirty()
566 bch_btree_keys_free(&b->keys); mca_data_free()
588 if (!bch_btree_keys_alloc(&b->keys, mca_data_alloc()
630 BUG_ON(btree_node_dirty(b) && !b->keys.set[0].data); mca_reap()
632 if (b->keys.page_order < min_order) mca_reap()
685 * succeed, so that inserting keys into the btree can always succeed and bch_mca_scan()
801 c->verify_data->keys.set->data) bch_btree_cache_alloc()
913 if (!b->keys.set[0].data) mca_alloc()
924 if (!b->keys.set->data) mca_alloc()
941 bch_btree_keys_init(&b->keys, &bch_extent_keys_ops, mca_alloc()
944 bch_btree_keys_init(&b->keys, &bch_btree_keys_ops, mca_alloc()
1008 for (; i <= b->keys.nsets && b->keys.set[i].size; i++) { bch_btree_node_get()
1009 prefetch(b->keys.set[i].tree); bch_btree_node_get()
1010 prefetch(b->keys.set[i].data); bch_btree_node_get()
1013 for (; i <= b->keys.nsets; i++) bch_btree_node_get()
1014 prefetch(b->keys.set[i].data); bch_btree_node_get()
1092 bch_bset_init_next(&b->keys, b->keys.set->data, bset_magic(&b->c->sb)); __bch_btree_node_alloc()
1120 bch_btree_sort_into(&b->keys, &n->keys, &b->c->sort); btree_node_alloc_replacement()
1179 * ptr_invalid() can't return true for the keys that mark btree nodes as __bch_btree_mark_key()
1248 unsigned keys = 0, good_keys = 0; btree_gc_mark_node() local
1255 for_each_key_filter(&b->keys, k, &iter, bch_ptr_invalid) { btree_gc_mark_node()
1257 keys++; btree_gc_mark_node()
1259 if (bch_ptr_bad(&b->keys, k)) btree_gc_mark_node()
1269 for (t = b->keys.set; t <= &b->keys.set[b->keys.nsets]; t++) btree_gc_mark_node()
1271 bset_written(&b->keys, t) && btree_gc_mark_node()
1281 if ((keys - good_keys) * 2 > keys) btree_gc_mark_node()
1291 unsigned keys; member in struct:gc_merge_info
1300 unsigned i, nodes = 0, keys = 0, blocks; btree_gc_coalesce() local
1315 keys += r[nodes++].keys; btree_gc_coalesce()
1320 __set_blocks(b->keys.set[0].data, keys, btree_gc_coalesce()
1347 keys = 0; btree_gc_coalesce()
1353 if (__set_blocks(n1, n1->keys + keys + btree_gc_coalesce()
1359 keys += bkey_u64s(k); btree_gc_coalesce()
1365 * the remaining keys into this node; we can't ensure btree_gc_coalesce()
1367 * length keys (shouldn't be possible in practice, btree_gc_coalesce()
1370 if (__set_blocks(n1, n1->keys + n2->keys, btree_gc_coalesce()
1375 keys = n2->keys; btree_gc_coalesce()
1380 BUG_ON(__set_blocks(n1, n1->keys + keys, block_bytes(b->c)) > btree_gc_coalesce()
1388 (void *) bset_bkey_idx(n2, keys) - (void *) n2->start); btree_gc_coalesce()
1390 n1->keys += keys; btree_gc_coalesce()
1391 r[i].keys = n1->keys; btree_gc_coalesce()
1394 bset_bkey_idx(n2, keys), btree_gc_coalesce()
1396 (void *) bset_bkey_idx(n2, keys)); btree_gc_coalesce()
1398 n2->keys -= keys; btree_gc_coalesce()
1414 BUG_ON(btree_bset_first(new_nodes[0])->keys); btree_gc_coalesce()
1467 struct keylist keys; btree_gc_rewrite_node() local
1484 bch_keylist_init(&keys); btree_gc_rewrite_node()
1485 bch_keylist_add(&keys, &n->key); btree_gc_rewrite_node()
1487 make_btree_freeing_key(replace, keys.top); btree_gc_rewrite_node()
1488 bch_keylist_push(&keys); btree_gc_rewrite_node()
1490 bch_btree_insert_node(b, op, &keys, NULL, NULL); btree_gc_rewrite_node()
1491 BUG_ON(!bch_keylist_empty(&keys)); btree_gc_rewrite_node()
1506 for_each_key_filter(&b->keys, k, &iter, bch_ptr_bad) btree_gc_count_keys()
1522 bch_btree_iter_init(&b->keys, &iter, &b->c->gc_done); btree_gc_recurse()
1528 k = bch_btree_iter_next_filter(&iter, &b->keys, bch_ptr_bad); btree_gc_recurse()
1537 r->keys = btree_gc_count_keys(r->b); btree_gc_recurse()
1673 /* don't reclaim buckets to which writeback keys point */ bch_btree_gc_finish()
1687 &dc->writeback_keys.keys, node) bch_btree_gc_finish()
1700 for (i = ca->sb.d; i < ca->sb.d + ca->sb.keys; i++) for_each_cache()
1815 for_each_key_filter(&b->keys, k, &iter, bch_ptr_invalid) bch_btree_check_recurse()
1821 bch_btree_iter_init(&b->keys, &iter, NULL); bch_btree_check_recurse()
1824 k = bch_btree_iter_next_filter(&iter, &b->keys, bch_btree_check_recurse()
1893 status = bch_btree_insert_key(&b->keys, k, replace_key); btree_insert_key()
1895 bch_check_keys(&b->keys, "%u for %s", status, btree_insert_key()
1907 long ret = bch_btree_keys_u64s_remaining(&b->keys); insert_u64s_remaining()
1912 if (b->keys.ops->is_extents) insert_u64s_remaining()
1923 int oldsize = bch_count_data(&b->keys); bch_btree_insert_keys()
1926 struct bkey *k = insert_keys->keys; bch_btree_insert_keys()
1939 bkey_copy(&temp.key, insert_keys->keys); bch_btree_insert_keys()
1942 bch_cut_front(&b->key, insert_keys->keys); bch_btree_insert_keys()
1956 BUG_ON(bch_count_data(&b->keys) < oldsize); bch_btree_insert_keys()
1988 unsigned keys = 0; btree_split() local
1990 trace_bcache_btree_node_split(b, btree_bset_first(n1)->keys); btree_split()
2012 while (keys < (btree_bset_first(n1)->keys * 3) / 5) btree_split()
2013 keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), btree_split()
2014 keys)); btree_split()
2017 bset_bkey_idx(btree_bset_first(n1), keys)); btree_split()
2018 keys += bkey_u64s(bset_bkey_idx(btree_bset_first(n1), keys)); btree_split()
2020 btree_bset_first(n2)->keys = btree_bset_first(n1)->keys - keys; btree_split()
2021 btree_bset_first(n1)->keys = keys; btree_split()
2025 btree_bset_first(n2)->keys * sizeof(uint64_t)); btree_split()
2034 trace_bcache_btree_node_compact(b, btree_bset_first(n1)->keys); btree_split()
2108 b->keys.last_set_unwritten) bch_btree_insert_node()
2190 struct keylist *keys; member in struct:btree_insert_op
2200 int ret = bch_btree_insert_node(b, &op->op, op->keys, btree_insert_fn()
2202 if (ret && !bch_keylist_empty(op->keys)) btree_insert_fn()
2208 int bch_btree_insert(struct cache_set *c, struct keylist *keys, bch_btree_insert() argument
2215 BUG_ON(bch_keylist_empty(keys)); bch_btree_insert()
2218 op.keys = keys; bch_btree_insert()
2222 while (!ret && !bch_keylist_empty(keys)) { bch_btree_insert()
2225 &START_KEY(keys->keys), bch_btree_insert()
2234 while ((k = bch_keylist_pop(keys))) bch_btree_insert()
2266 /* Map across nodes or keys */
2278 bch_btree_iter_init(&b->keys, &iter, from); bch_btree_map_nodes_recurse()
2280 while ((k = bch_btree_iter_next_filter(&iter, &b->keys, bch_btree_map_nodes_recurse()
2311 bch_btree_iter_init(&b->keys, &iter, from); bch_btree_map_keys_recurse()
2313 while ((k = bch_btree_iter_next_filter(&iter, &b->keys, bch_ptr_bad))) { bch_btree_map_keys_recurse()
2340 /* Overlapping keys compare equal */ keybuf_cmp()
2391 if (RB_INSERT(&buf->keys, w, node, keybuf_cmp)) refill_keybuf_fn()
2430 if (!RB_EMPTY_ROOT(&buf->keys)) { bch_refill_keybuf()
2432 w = RB_FIRST(&buf->keys, struct keybuf_key, node); bch_refill_keybuf()
2435 w = RB_LAST(&buf->keys, struct keybuf_key, node); bch_refill_keybuf()
2447 rb_erase(&w->node, &buf->keys); __bch_keybuf_del()
2470 w = RB_GREATER(&buf->keys, s, node, keybuf_nonoverlapping_cmp); bch_keybuf_check_overlapping()
2491 w = RB_FIRST(&buf->keys, struct keybuf_key, node); bch_keybuf_next()
2529 buf->keys = RB_ROOT; bch_keybuf_init()
H A Dbset.h19 * bch_ptr_invalid() primarily filters out keys and pointers that would be
20 * invalid due to some sort of bug, whereas bch_ptr_bad() filters out keys and
23 * The one exception to the rule that ptr_invalid() filters out invalid keys is
24 * that it also filters out keys of size 0 - these are keys that have been
29 * We can't filter out stale keys when we're resorting, because garbage
31 * unless we're rewriting the btree node those stale keys still exist on disk.
55 * The btree iterator code serves both functions; it iterates through the keys
56 * in a btree node in sorted order, starting from either keys after a specific
61 * Since keys are variable length, we can't use a binary search on a bset - we
66 * So we need to construct some sort of lookup table. Since we only insert keys
67 * into the last (unwritten) set, most of the keys within a given btree node are
126 * The keys in the auxiliary search tree are stored in (software) floating
131 * We need 7 bits for the exponent and 3 bits for the key's offset (since keys
175 * The nodes in the bset tree point to specific keys - this
217 * Sets of sorted keys - the real btree node - plus a binary search tree
252 #define set_bytes(i) __set_bytes(i, i->keys)
257 __set_blocks(i, (i)->keys, block_bytes)
383 #define bset_bkey_last(i) bkey_idx((struct bkey *) (i)->d, (i)->keys)
463 struct bkey *keys; member in union:keylist::__anon5369
471 /* Enough room for btree_split's keys without realloc */
483 l->keys = k; bch_keylist_init_single()
500 return l->top == l->keys; bch_keylist_empty()
505 l->top = l->keys; bch_keylist_reset()
H A Djournal.c18 * entries, do some other stuff, then we mark all the keys in the journal
23 * We only journal keys that go in leaf nodes, which simplifies things quite a
314 int ret = 0, keys = 0, entries = 0; bch_journal_replay() local
341 keys++; list_for_each_entry()
352 pr_info("journal replay done, %i keys in %i entries, seq %llu",
353 keys, entries, end);
544 j->cur->data->keys = 0; bch_journal_next()
692 sectors = __set_blocks(w->data, w->data->keys + nkeys, journal_wait_for_write()
708 * XXX: If we were inserting so many keys that they journal_wait_for_write()
713 BUG_ON(!w->data->keys); journal_wait_for_write()
746 * pass bch_journal() a list of keys to be journalled, and then
747 * bch_journal() hands those same keys off to btree_insert_async()
751 struct keylist *keys, bch_journal()
760 w = journal_wait_for_write(c, bch_keylist_nkeys(keys)); bch_journal()
762 memcpy(bset_bkey_last(w->data), keys->keys, bch_keylist_bytes(keys)); bch_journal()
763 w->data->keys += bch_keylist_nkeys(keys); bch_journal()
786 struct keylist keys; bch_journal_meta() local
789 bch_keylist_init(&keys); bch_journal_meta()
791 ref = bch_journal(c, &keys, cl); bch_journal_meta()
750 bch_journal(struct cache_set *c, struct keylist *keys, struct closure *parent) bch_journal() argument
H A Dbset.c2 * Code for working with individual keys, and sorted sets of keys with in a
27 (unsigned) ((u64 *) k - i->d), i->keys); bch_dump_bset()
80 err = "Overlapping keys"; __bch_check_keys()
87 err = "Duplicate keys"; __bch_check_keys()
158 struct bkey *k = l->keys; bch_keylist_pop()
171 l->top_p -= bkey_u64s(l->keys); bch_keylist_pop_front()
173 memmove(l->keys, bch_keylist_pop_front()
174 bkey_next(l->keys), bch_keylist_pop_front()
263 /* Space required for the btree node keys */ btree_keys_bytes()
357 * Second loop starts at 1 because b->keys[0]->data is the memory we bch_btree_keys_init()
498 * immediately preceding it is: we have to check if the two keys differ in the
532 * For the write set - the one we're currently inserting keys into - we don't
565 ? bset_bkey_idx(t->data, t->data->keys - bkey_u64s(&t->end)) make_bfloat()
628 i->keys = 0; bch_bset_init_next()
806 __set_bytes(t->data, t->data->keys + bkey_u64s(insert)) > bch_bset_insert()
813 t->data->keys += bkey_u64s(insert); bch_bset_insert()
978 * of bits, and keys above and below the set it covers might __bch_bset_search()
1174 out->keys = last ? (uint64_t *) bkey_next(last) - out->d : 0; btree_mergesort()
1176 pr_debug("sorted %i keys", out->keys); btree_mergesort()
1215 b->set[start].data->keys = out->keys; __btree_sort()
1234 size_t order = b->page_order, keys = 0; bch_btree_sort_partial() local
1244 keys += b->set[i].data->keys; bch_btree_sort_partial()
1246 order = get_order(__set_bytes(b->set->data, keys)); bch_btree_sort_partial()
1291 if (b->set[i].data->keys < crit) { bch_btree_sort_lazy()
1314 size_t bytes = t->data->keys * sizeof(uint64_t); bch_btree_keys_stats()
H A Djournal.h11 * Journal entries contain a list of keys, ordered by the time they were
12 * inserted; thus journal replay just has to reinsert the keys.
31 * journal entry still open - i.e. that has keys that haven't been flushed to
40 * We take a refcount on a journal entry when we add some keys to a journal
42 * insert those keys into the btree the btree write we're setting up takes a
47 * might contain keys for many journal entries - we handle this by making sure
49 * entries it has keys for.
H A Dextents.c17 * as keys are inserted we only sort the pages that have not yet been written.
125 static void bch_bkey_dump(struct btree_keys *keys, const struct bkey *k) bch_bkey_dump() argument
127 struct btree *b = container_of(keys, struct btree, keys); bch_bkey_dump()
167 struct btree *b = container_of(bk, struct btree, keys); bch_btree_ptr_invalid()
205 struct btree *b = container_of(bk, struct btree, keys); bch_btree_ptr_bad()
230 struct btree *b = container_of(bk, struct btree, keys); bch_btree_ptr_insert_fixup()
253 * Necessary for btree_sort_fixup() - if there are multiple keys that compare
326 struct cache_set *c = container_of(b, struct btree, keys)->c; bch_extent_insert_fixup()
499 struct btree *b = container_of(bk, struct btree, keys); bch_extent_invalid()
535 struct btree *b = container_of(bk, struct btree, keys); bch_extent_bad()
580 struct btree *b = container_of(bk, struct btree, keys); bch_extent_merge()
H A Dwriteback.c142 struct keylist keys; write_dirty_finish() local
144 bch_keylist_init(&keys); write_dirty_finish()
146 bkey_copy(keys.top, &w->key); write_dirty_finish()
147 SET_KEY_DIRTY(keys.top, false); write_dirty_finish()
148 bch_keylist_push(&keys); write_dirty_finish()
153 ret = bch_btree_insert(dc->disk.c, &keys, NULL, &w->key); write_dirty_finish()
444 RB_EMPTY_ROOT(&dc->writeback_keys.keys)) { bch_writeback_thread()
H A Dbtree.h7 * At a high level, bcache's btree is relatively standard b+ tree. All keys and
21 * we do is resort all the sets of keys with a mergesort, and in the same pass
62 * it ensures that the dirty keys will be written at some point in the future.
136 struct btree_keys keys; member in struct:btree
178 return b->keys.set->data; btree_bset_first()
183 return bset_tree_last(&b->keys)->data; btree_bset_last()
188 return bset_sector_offset(&b->keys, i) >> b->c->block_bits; bset_block_offset()
H A Dbcache.h89 * BTREE_INSERT will just take a list of keys and insert them into the btree -
103 * This means that there are always stale/invalid keys in the btree. They're
121 * can append new keys to an existing btree node without rewriting it. This
122 * means each set of keys we write is sorted, but the node is not.
124 * We maintain this log structure in memory - keeping 1Mb of keys sorted would
125 * be expensive, and we have to distinguish between the keys we have written and
126 * the keys we haven't. So to do a lookup in a btree node, we have to search
128 * these extra searches is quite low (normally most of the keys in a btree node
164 * a few keys each) - highly inefficient in terms of amount of metadata writes,
167 * The journal is just a log of keys we've inserted; on startup we just reinsert
168 * all the keys in the open journal entries. That means that when we're updating
169 * a node in the btree, we can wait until a 4k block of keys fills up before
235 * keys.
240 struct rb_root keys; member in struct:keybuf
574 * This is a refcount that blocks prio_write() until the new keys are
H A Drequest.c104 * The journalling code doesn't handle the case where the keys to insert bch_keylist_realloc()
106 * bio_insert() and bio_invalidate() will insert the keys created so far bch_keylist_realloc()
148 * Our data write just errored, which means we've got a bunch of keys to bch_data_insert_error()
151 * We don't have to insert those keys but we still have to invalidate bch_data_insert_error()
153 * from the keys we'll accomplish just that. bch_data_insert_error()
156 struct bkey *src = op->insert_keys.keys, *dst = op->insert_keys.keys; bch_data_insert_error()
278 * From a cache miss, we can just insert the keys for the data bch_data_insert_start()
299 * It first writes the data to the cache, creating a list of keys to be inserted
300 * (if the data had to be fragmented there will be multiple keys); after the
301 * data is written it calls bch_journal, and after the keys have been added to
890 * But check_overlapping drops dirty keys for which io hasn't started, cached_dev_write()
/linux-4.1.27/security/keys/
H A DMakefile28 obj-$(CONFIG_ENCRYPTED_KEYS) += encrypted-keys/
H A Dgc.c15 #include <keys/keyring-type.h>
24 * Reaper for unused keys.
30 * Reaper for links from keyrings to dead keys.
85 * reaper to go through a cycle finding expired keys.
95 * Reap keys of dead type.
98 * collector: the first to mark keys of that type as being dead, the second to
99 * collect dead links and the third to clean up the dead keys. We have to be
125 * Garbage collect a list of unreferenced, detached keys
127 static noinline void key_gc_unused_keys(struct list_head *keys) key_gc_unused_keys() argument
129 while (!list_empty(keys)) { key_gc_unused_keys()
131 list_entry(keys->next, struct key, graveyard_link); key_gc_unused_keys()
169 * Garbage collector for unused keys.
182 #define KEY_GC_REAPING_DEAD_1 0x10 /* - We need to mark dead keys */ key_garbage_collector()
184 #define KEY_GC_REAPING_DEAD_3 0x40 /* - We need to reap dead keys */ key_garbage_collector()
274 * where we didn't reap any keys. key_garbage_collector()
287 * dying keys that they don't have a reference upon or a link key_garbage_collector()
295 kdebug("gc keys"); key_garbage_collector()
302 /* No remaining dead keys: short circuit the remaining key_garbage_collector()
338 * dead or expired keys. We don't flag another reap immediately as we key_garbage_collector()
340 * can reap the keys to which it refers. key_garbage_collector()
H A Dkeyring.c19 #include <keys/keyring-type.h>
20 #include <keys/user-type.h>
72 * The keyring key type definition. Keyrings are simply keys of this type and
73 * can be treated as ordinary keys in addition to having their own special
151 assoc_array_init(&keyring->keys); keyring_instantiate()
205 * ordinary keys by making sure the lowest level segment in the hash is hash_key_type_and_desc()
290 * Compare the index keys of a pair of objects and determine the bit position
397 assoc_array_destroy(&keyring->keys, &keyring_assoc_array_ops); keyring_destroy()
411 if (keyring->keys.nr_leaves_on_tree != 0) keyring_describe()
412 seq_printf(m, ": %lu", keyring->keys.nr_leaves_on_tree); keyring_describe()
463 nr_keys = keyring->keys.nr_leaves_on_tree; keyring_read()
476 /* Copy the IDs of the subscribed keys into the buffer */ keyring_read()
479 ret = assoc_array_iterate(&keyring->keys, keyring_read_iterator, &ctx); keyring_read()
514 * By default, we keys found by getting an exact match on their descriptions.
533 /* ignore keys not of this type */ keyring_search_iterator()
539 /* skip invalidated, revoked and expired keys */ keyring_search_iterator()
556 /* keys that don't match */ keyring_search_iterator()
600 object = assoc_array_find(&keyring->keys, search_keyring()
605 return assoc_array_iterate(&keyring->keys, ctx->iterator, ctx); search_keyring()
664 /* Search through the keys in this keyring before its searching its search_nested_keyrings()
678 ptr = ACCESS_ONCE(keyring->keys.root); search_nested_keyrings()
825 * caller to be searchable and keys can only be found if they too grant Search
843 * successful; -EAGAIN if no matching keys were found, or if expired or revoked
844 * keys were found; -ENOKEY if only negative keys were found; -ENOTDIR if the
927 * successful and returns NULL if not found. Revoked and invalidated keys are
944 object = assoc_array_find(&keyring->keys, &keyring_assoc_array_ops, find_key_to_update()
1102 edit = assoc_array_insert(&keyring->keys,
1137 * Check already instantiated keys aren't going to be a problem.
1140 * keys that were created since __key_link_begin() was called.
1272 edit = assoc_array_delete(&keyring->keys, &keyring_assoc_array_ops, key_unlink()
1310 edit = assoc_array_clear(&keyring->keys, &keyring_assoc_array_ops); keyring_clear()
1334 edit = assoc_array_clear(&keyring->keys, &keyring_assoc_array_ops); keyring_revoke()
1378 /* scan the keyring looking for dead keys */ keyring_gc()
1380 result = assoc_array_iterate(&keyring->keys, keyring_gc()
1392 assoc_array_gc(&keyring->keys, &keyring_assoc_array_ops, keyring_gc()
H A Dpermission.c39 /* use the second 8-bits of permissions for keys the caller owns */ key_task_permission()
45 /* use the third 8-bits of permissions for keys the caller has a group key_task_permission()
65 /* use the top 8-bits of permissions for keys the caller possesses key_task_permission()
H A Dinternal.h43 * Keep track of keys for a user.
48 * We also keep track of keys under request from userspace for this UID here.
55 atomic_t nkeys; /* number of keys */
56 atomic_t nikeys; /* number of instantiated keys */
58 int qnkeys; /* number of keys allocated to this user */
120 #define KEYRING_SEARCH_SKIP_EXPIRED 0x0020 /* Ignore expired keys (intention to replace) */
H A Dbig_key.c18 #include <keys/user-type.h>
19 #include <keys/big_key-type.h>
31 * big_key defined keys take an arbitrary string as the description and an
H A Dproc.c68 p = proc_create("keys", 0, NULL, &proc_keys_fops); key_proc_init()
70 panic("Cannot create /proc/keys\n"); key_proc_init()
82 * Implement "/proc/keys" to provide a list of the keys on the system that
H A Duser_defined.c17 #include <keys/user-type.h>
24 * user defined keys take an arbitrary string as the description and an
H A Drequest_key.c11 * See Documentation/security/keys-request-key.txt
609 * to a keyring if found, new keys are always allocated in the user's quota,
614 * completion of keys undergoing construction with a non-interruptible wait.
648 * to a keyring if found and new keys are always allocated in the user's quota.
651 * completion of keys undergoing construction with a non-interruptible wait.
683 * to a keyring if found, new keys are always allocated in the user's quota and
709 * to a keyring if found and new keys are always allocated in the user's quota.
/linux-4.1.27/drivers/net/ethernet/cisco/enic/
H A Denic_clsf.c14 * @keys: flow_keys of ipv4 5tuple
20 int enic_addfltr_5t(struct enic *enic, struct flow_keys *keys, u16 rq) enic_addfltr_5t() argument
25 switch (keys->ip_proto) { enic_addfltr_5t()
36 data.u.ipv4.src_addr = ntohl(keys->src); enic_addfltr_5t()
37 data.u.ipv4.dst_addr = ntohl(keys->dst); enic_addfltr_5t()
38 data.u.ipv4.src_port = ntohs(keys->port16[0]); enic_addfltr_5t()
39 data.u.ipv4.dst_port = ntohs(keys->port16[1]); enic_addfltr_5t()
161 if (tpos->keys.src == k->src && htbl_key_search()
162 tpos->keys.dst == k->dst && htbl_key_search()
163 tpos->keys.ports == k->ports && htbl_key_search()
164 tpos->keys.ip_proto == k->ip_proto && htbl_key_search()
165 tpos->keys.n_proto == k->n_proto) htbl_key_search()
173 struct flow_keys keys; enic_rx_flow_steer() local
180 res = skb_flow_dissect(skb, &keys); enic_rx_flow_steer()
181 if (!res || keys.n_proto != htons(ETH_P_IP) || enic_rx_flow_steer()
182 (keys.ip_proto != IPPROTO_TCP && keys.ip_proto != IPPROTO_UDP)) enic_rx_flow_steer()
187 n = htbl_key_search(&enic->rfs_h.ht_head[tbl_idx], &keys); enic_rx_flow_steer()
212 res = enic_addfltr_5t(enic, &keys, rxq_index); enic_rx_flow_steer()
222 res = enic_addfltr_5t(enic, &keys, rxq_index); enic_rx_flow_steer()
265 res = enic_addfltr_5t(enic, &keys, rxq_index); enic_rx_flow_steer()
274 n->keys = keys; enic_rx_flow_steer()
H A Denic_clsf.h9 int enic_addfltr_5t(struct enic *enic, struct flow_keys *keys, u16 rq);
H A Denic_ethtool.c351 switch (n->keys.ip_proto) { enic_grxclsrule()
363 fsp->h_u.tcp_ip4_spec.ip4src = n->keys.src; enic_grxclsrule()
366 fsp->h_u.tcp_ip4_spec.ip4dst = n->keys.dst; enic_grxclsrule()
369 fsp->h_u.tcp_ip4_spec.psrc = n->keys.port16[0]; enic_grxclsrule()
372 fsp->h_u.tcp_ip4_spec.pdst = n->keys.port16[1]; enic_grxclsrule()
/linux-4.1.27/tools/perf/scripts/perl/Perf-Trace-Util/lib/Perf/Trace/
H A DCore.pm39 foreach my $idx (sort {$a <=> $b} keys %trace_flags) {
69 foreach my $idx (sort {$a <=> $b} keys %{$flag_fields{$event_name}{$field_name}{"values"}}) {
104 for my $event (keys %flag_fields) {
106 for my $field (keys %{$flag_fields{$event}}) {
109 foreach my $idx (sort {$a <=> $b} keys %{$flag_fields{$event}{$field}{"values"}}) {
121 foreach my $idx (sort {$a <=> $b} keys %{$symbolic_fields{$event_name}{$field_name}{"values"}}) {
151 for my $event (keys %symbolic_fields) {
153 for my $field (keys %{$symbolic_fields{$event}}) {
155 foreach my $idx (sort {$a <=> $b} keys %{$symbolic_fields{$event}{$field}{"values"}}) {
/linux-4.1.27/include/linux/platform_data/
H A Dkeypad-pxa27x.h15 * 1. direct_key_num indicates the number of keys in the direct keypad
20 * 2. direct_key_map is the key code map for the direct keys, if rotary
24 * REL_WHEEL/REL_HWHEEL) or specific keys (e.g. UP/DOWN/LEFT/RIGHT)
38 /* code map for the matrix keys */
43 /* direct keys */
H A Dkeypad-omap.h30 /* Group (0..3) -- when multiple keys are pressed, only the
31 * keys pressed in the same group are considered as pressed. This is
/linux-4.1.27/tools/perf/scripts/perl/
H A Drw-by-pid.pl83 ($reads{$a}{bytes_read} || 0) } keys %reads) {
101 foreach my $pid (keys %reads) {
102 foreach my $error (keys %{$reads{$pid}{errors}}) {
124 ($writes{$a}{bytes_written} || 0)} keys %writes) {
141 foreach my $pid (keys %writes) {
142 foreach my $error (keys %{$writes{$pid}{errors}}) {
163 if ((scalar keys %unhandled) == 0) {
173 foreach my $event_name (keys %unhandled) {
H A Drw-by-file.pl58 $reads{$a}{bytes_requested}} keys %reads) {
70 $writes{$a}{bytes_written}} keys %writes) {
83 if ((scalar keys %unhandled) == 0) {
93 foreach my $event_name (keys %unhandled) {
H A Drwtop.pl137 ($reads{$a}{bytes_read} || 0) } keys %reads) {
161 ($writes{$a}{bytes_written} || 0)} keys %writes) {
182 if ((scalar keys %unhandled) == 0) {
192 foreach my $event_name (keys %unhandled) {
H A Dcheck-perf-trace.pl77 if ((scalar keys %unhandled) == 0) {
87 foreach my $event_name (keys %unhandled) {
H A Dwakeup-latency.pl86 if ((scalar keys %unhandled) == 0) {
96 foreach my $event_name (keys %unhandled) {
H A Dfailed-syscalls.pl42 keys %failed_syscalls) {
/linux-4.1.27/drivers/md/persistent-data/
H A Ddm-btree.c40 /* makes the assumption that no two keys are the same. */ bsearch()
47 uint64_t mid_key = le64_to_cpu(n->keys[mid]); bsearch()
96 array_insert(node->keys, sizeof(*node->keys), nr_entries, index, &key_le); __dm_written_to_disk()
342 *result_key = le64_to_cpu(ro_node(s)->keys[i]); btree_lookup_raw()
349 uint64_t *keys, void *value_le) dm_btree_lookup()
371 r = btree_lookup_raw(&spine, root, keys[level], dm_btree_lookup()
376 if (rkey != keys[level]) { dm_btree_lookup()
451 memcpy(rn->keys, ln->keys + nr_left, nr_right * sizeof(rn->keys[0])); btree_split_sibling()
473 le64_to_cpu(rn->keys[0]), &location); btree_split_sibling()
477 if (key < le64_to_cpu(rn->keys[0])) { btree_split_sibling()
547 memcpy(ln->keys, pn->keys, nr_left * sizeof(pn->keys[0])); btree_split_beneath()
548 memcpy(rn->keys, pn->keys + nr_left, nr_right * sizeof(pn->keys[0])); btree_split_beneath()
567 pn->keys[0] = ln->keys[0]; btree_split_beneath()
572 pn->keys[1] = rn->keys[0]; btree_split_beneath()
583 if (key < le64_to_cpu(rn->keys[0])) { btree_split_beneath()
643 node->keys[0] = cpu_to_le64(key); btree_insert_raw()
651 if (i < 0 || le64_to_cpu(node->keys[i]) != key) btree_insert_raw()
659 uint64_t *keys, void *value, dm_block_t *new_root,
674 r = btree_insert_raw(&spine, block, &le64_type, keys[level], &index); __dm_written_to_disk()
680 (le64_to_cpu(n->keys[index]) != keys[level])); __dm_written_to_disk()
694 keys[level], &new_le); __dm_written_to_disk()
704 keys[level], &index); __dm_written_to_disk()
710 (le64_to_cpu(n->keys[index]) != keys[level])); __dm_written_to_disk()
717 keys[level], value); __dm_written_to_disk()
750 uint64_t *keys, void *value, dm_block_t *new_root) __dm_written_to_disk()
753 return insert(info, root, keys, value, new_root, NULL); __dm_written_to_disk()
758 uint64_t *keys, void *value, dm_block_t *new_root,
762 return insert(info, root, keys, value, new_root, inserted); __dm_written_to_disk()
787 *result_key = le64_to_cpu(ro_node(s)->keys[i]); find_key()
789 *result_key = le64_to_cpu(ro_node(s)->keys[0]); find_key()
846 int (*fn)(void *context, uint64_t *keys, void *leaf), walk_node()
853 uint64_t keys; walk_node() local
868 keys = le64_to_cpu(*key_ptr(n, i)); walk_node()
869 r = fn(context, &keys, value_ptr(n, i)); walk_node()
881 int (*fn)(void *context, uint64_t *keys, void *leaf), dm_btree_walk()
348 dm_btree_lookup(struct dm_btree_info *info, dm_block_t root, uint64_t *keys, void *value_le) dm_btree_lookup() argument
845 walk_node(struct dm_btree_info *info, dm_block_t block, int (*fn)(void *context, uint64_t *keys, void *leaf), void *context) walk_node() argument
880 dm_btree_walk(struct dm_btree_info *info, dm_block_t root, int (*fn)(void *context, uint64_t *keys, void *leaf), void *context) dm_btree_walk() argument
H A Ddm-btree.h33 * Manipulates hierarchical B+ trees with 64-bit keys and arbitrary-sized
110 uint64_t *keys, void *value_le);
116 uint64_t *keys, void *value, dm_block_t *new_root)
125 uint64_t *keys, void *value, dm_block_t *new_root,
135 uint64_t *keys, dm_block_t *new_root);
159 int (*fn)(void *context, uint64_t *keys, void *leaf),
H A Ddm-btree-internal.h26 * of 8-bytes in size, otherwise the 64bit keys will be mis-aligned.
41 __le64 keys[0]; member in struct:btree_node
110 return n->keys + index; key_ptr()
115 return &n->keys[le32_to_cpu(n->header.max_entries)]; value_base()
H A Ddm-btree-remove.c227 *key_ptr(parent, r->index) = right->keys[0]; __rebalance2()
285 *key_ptr(parent, r->index) = right->keys[0]; delete_center_node()
340 *key_ptr(parent, c->index) = center->keys[0]; redistribute3()
341 *key_ptr(parent, r->index) = right->keys[0]; redistribute3()
491 (le64_to_cpu(n->keys[i]) != key)) do_leaf()
553 uint64_t *keys, dm_block_t *new_root) dm_btree_remove()
567 root, keys[level], (unsigned *)&index); dm_btree_remove()
552 dm_btree_remove(struct dm_btree_info *info, dm_block_t root, uint64_t *keys, dm_block_t *new_root) dm_btree_remove() argument
/linux-4.1.27/net/sched/
H A Dact_pedit.c40 struct tc_pedit_key *keys = NULL; tcf_pedit_init() local
64 keys = kmalloc(ksize, GFP_KERNEL); tcf_pedit_init()
65 if (keys == NULL) { tcf_pedit_init()
79 keys = kmalloc(ksize, GFP_KERNEL); tcf_pedit_init()
80 if (keys == NULL) tcf_pedit_init()
88 if (keys) { tcf_pedit_init()
90 p->tcfp_keys = keys; tcf_pedit_init()
93 memcpy(p->tcfp_keys, parm->keys, ksize); tcf_pedit_init()
103 struct tc_pedit_key *keys = p->tcfp_keys; tcf_pedit_cleanup() local
104 kfree(keys); tcf_pedit_cleanup()
192 memcpy(opt->keys, p->tcfp_keys, tcf_pedit_dump()
H A Dsch_sfb.c290 struct flow_keys keys; sfb_enqueue() local
315 keys.src = salt; sfb_enqueue()
316 keys.dst = 0; sfb_enqueue()
317 keys.ports = 0; sfb_enqueue()
319 skb_flow_dissect(skb, &keys); sfb_enqueue()
324 sfbhash = jhash_3words((__force u32)keys.dst, sfb_enqueue()
325 (__force u32)keys.src, sfb_enqueue()
326 (__force u32)keys.ports, sfb_enqueue()
359 sfbhash = jhash_3words((__force u32)keys.dst, sfb_enqueue()
360 (__force u32)keys.src, sfb_enqueue()
361 (__force u32)keys.ports, sfb_enqueue()
H A Dsch_fq_codel.c73 struct flow_keys keys; fq_codel_hash() local
76 skb_flow_dissect(skb, &keys); fq_codel_hash()
77 hash = jhash_3words((__force u32)keys.dst, fq_codel_hash()
78 (__force u32)keys.src ^ keys.ip_proto, fq_codel_hash()
79 (__force u32)keys.ports, q->perturbation); fq_codel_hash()
H A Dsch_sfq.c164 struct flow_keys keys; member in struct:sfq_skb_cb
176 const struct flow_keys *keys = &sfq_skb_cb(skb)->keys; sfq_hash() local
179 hash = jhash_3words((__force u32)keys->dst, sfq_hash()
180 (__force u32)keys->src ^ keys->ip_proto, sfq_hash()
181 (__force u32)keys->ports, q->perturbation); sfq_hash()
200 skb_flow_dissect(skb, &sfq_skb_cb(skb)->keys); sfq_classify()
H A Dsch_choke.c145 u8 keys[QDISC_CB_PRIV_LEN - 3]; member in struct:choke_skb_cb
180 memcpy(&choke_skb_cb(skb1)->keys, &temp, CHOKE_K_LEN); choke_match_flow()
186 memcpy(&choke_skb_cb(skb2)->keys, &temp, CHOKE_K_LEN); choke_match_flow()
189 return !memcmp(&choke_skb_cb(skb1)->keys, choke_match_flow()
190 &choke_skb_cb(skb2)->keys, choke_match_flow()
H A Dsch_hhf.c182 struct flow_keys keys; skb_hash() local
188 skb_flow_dissect(skb, &keys); skb_hash()
189 hash = jhash_3words((__force u32)keys.dst, skb_hash()
190 (__force u32)keys.src ^ keys.ip_proto, skb_hash()
191 (__force u32)keys.ports, q->perturbation); skb_hash()
/linux-4.1.27/arch/x86/include/asm/
H A Dkbdleds.h5 * Some laptops take the 789uiojklm,. keys as number pad when NumLock is on.
/linux-4.1.27/include/uapi/linux/tc_act/
H A Dtc_pedit.h30 struct tc_pedit_key keys[0]; member in struct:tc_pedit_sel
/linux-4.1.27/tools/perf/scripts/python/
H A Dcheck-perf-trace.py71 keys = unhandled.keys()
72 if not keys:
81 for event_name in keys:
H A Dfailed-syscalls-by-pid.py68 comm_keys = syscalls.keys()
70 pid_keys = syscalls[comm].keys()
73 id_keys = syscalls[comm][pid].keys()
76 ret_keys = syscalls[comm][pid][id].keys()
H A Dsyscall-counts-by-pid.py66 comm_keys = syscalls.keys()
68 pid_keys = syscalls[comm].keys()
71 id_keys = syscalls[comm][pid].keys()
H A Dnetdev-times.py132 if 'comm' in event.keys():
137 elif 'handle' in event.keys():
303 if cpu not in irq_dic.keys():
310 if cpu not in irq_dic.keys():
317 if 'event_list' in irq_record.keys():
322 if cpu not in irq_dic.keys() \
326 if 'event_list' in irq_record.keys():
342 if cpu in irq_dic.keys():
345 if cpu in net_rx_dic.keys():
358 if cpu in net_rx_dic.keys():
367 if cpu not in irq_dic.keys() \
371 if 'event_list' in irq_record.keys():
385 if cpu in net_rx_dic.keys():
H A Dnet_dropmonitor.py53 for i in drop_log.keys():
/linux-4.1.27/tools/perf/ui/
H A Dkeysyms.h22 /* Not really keys */
/linux-4.1.27/kernel/
H A Dsystem_keyring.c1 /* System trusted keyring for trusted public keys
17 #include <keys/asymmetric-type.h>
18 #include <keys/system_keyring.h>
28 * Load the compiled-in keys
48 * Must be initialised before we try and load the keys into the keyring.
/linux-4.1.27/net/core/
H A Dflow_dissector.c283 static inline u32 __flow_hash_from_keys(struct flow_keys *keys) __flow_hash_from_keys() argument
288 if (((__force u32)keys->dst < (__force u32)keys->src) || __flow_hash_from_keys()
289 (((__force u32)keys->dst == (__force u32)keys->src) && __flow_hash_from_keys()
290 ((__force u16)keys->port16[1] < (__force u16)keys->port16[0]))) { __flow_hash_from_keys()
291 swap(keys->dst, keys->src); __flow_hash_from_keys()
292 swap(keys->port16[0], keys->port16[1]); __flow_hash_from_keys()
295 hash = __flow_hash_3words((__force u32)keys->dst, __flow_hash_from_keys()
296 (__force u32)keys->src, __flow_hash_from_keys()
297 (__force u32)keys->ports); __flow_hash_from_keys()
304 u32 flow_hash_from_keys(struct flow_keys *keys) flow_hash_from_keys() argument
306 return __flow_hash_from_keys(keys); flow_hash_from_keys()
318 struct flow_keys keys; __skb_get_hash() local
320 if (!skb_flow_dissect(skb, &keys)) __skb_get_hash()
323 if (keys.ports) __skb_get_hash()
328 skb->hash = __flow_hash_from_keys(&keys); __skb_get_hash()
361 const struct flow_keys *keys, int hlen) __skb_get_poff()
363 u32 poff = keys->thoff; __skb_get_poff()
365 switch (keys->ip_proto) { __skb_get_poff()
413 struct flow_keys keys; skb_get_poff() local
415 if (!skb_flow_dissect(skb, &keys)) skb_get_poff()
418 return __skb_get_poff(skb, skb->data, &keys, skb_headlen(skb)); skb_get_poff()
360 __skb_get_poff(const struct sk_buff *skb, void *data, const struct flow_keys *keys, int hlen) __skb_get_poff() argument
/linux-4.1.27/arch/arm/mach-imx/
H A Dmach-vpr200.c124 {KEY_F2, GPIO_BUTTON1, 1, "vpr-keys: F2", 0, VPR_KEY_DEBOUNCE},
125 {KEY_F3, GPIO_BUTTON2, 1, "vpr-keys: F3", 0, VPR_KEY_DEBOUNCE},
126 {KEY_F4, GPIO_BUTTON3, 1, "vpr-keys: F4", 0, VPR_KEY_DEBOUNCE},
127 {KEY_F5, GPIO_BUTTON4, 1, "vpr-keys: F5", 0, VPR_KEY_DEBOUNCE},
128 {KEY_F6, GPIO_BUTTON5, 1, "vpr-keys: F6", 0, VPR_KEY_DEBOUNCE},
129 {KEY_F7, GPIO_BUTTON6, 1, "vpr-keys: F7", 0, VPR_KEY_DEBOUNCE},
130 {KEY_F8, GPIO_BUTTON7, 1, "vpr-keys: F8", 1, VPR_KEY_DEBOUNCE},
131 {KEY_F9, GPIO_BUTTON8, 1, "vpr-keys: F9", 1, VPR_KEY_DEBOUNCE},
226 /* GPIO keys */
H A Dmach-pcm037_eet.c24 /* GPIO keys */
66 /* GPIO-keys input device */
/linux-4.1.27/include/trace/events/
H A Dbcache.h247 __field(unsigned, keys )
253 __entry->keys = b->keys.set[b->keys.nsets].data->keys;
343 TP_PROTO(struct btree *b, unsigned keys),
344 TP_ARGS(b, keys),
348 __field(unsigned, keys )
353 __entry->keys = keys;
356 TP_printk("bucket %zu keys %u", __entry->bucket, __entry->keys)
360 TP_PROTO(struct btree *b, unsigned keys),
361 TP_ARGS(b, keys)
365 TP_PROTO(struct btree *b, unsigned keys),
366 TP_ARGS(b, keys)
398 TP_printk("found %u keys from %u:%llu to %u:%llu", __entry->nr_found,
/linux-4.1.27/arch/powerpc/crypto/
H A DMakefile13 aes-ppc-spe-y := aes-spe-core.o aes-spe-keys.o aes-tab-4k.o aes-spe-modes.o aes-spe-glue.o
H A Daes-spe-keys.S97 xor r5,r5,r14 /* xor next 4 keys */
101 stw r5,0(r3) /* store next 4 keys */
143 xor r5,r5,r14 /* xor next 6 keys */
197 xor r5,r5,r14 /* xor 4 keys */
203 xor r9,r9,r14 /* xor 4 keys */
/linux-4.1.27/include/keys/
H A Dasymmetric-type.h3 * See Documentation/security/asymmetric-keys.txt
32 * CA keys that are intended to sign other keys, so don't appear in end
36 * public key and certain parameters, but since we don't support PGP keys at
H A Dasymmetric-subtype.h3 * See Documentation/security/asymmetric-keys.txt
18 #include <keys/asymmetric-type.h>
31 /* Describe a key of this subtype for /proc/keys */
H A Dsystem_keyring.h1 /* System keyring containing trusted public keys.
H A Dasymmetric-parser.h3 * See Documentation/crypto/asymmetric-keys.txt
/linux-4.1.27/drivers/crypto/nx/
H A Dnx-aes-xcbc.c76 u8 keys[2][AES_BLOCK_SIZE]; nx_xcbc_empty() local
88 memset(keys[0], 0x01, sizeof(keys[0])); nx_xcbc_empty()
89 memset(keys[1], 0x03, sizeof(keys[1])); nx_xcbc_empty()
91 len = sizeof(keys); nx_xcbc_empty()
93 in_sg = nx_build_sg_list(nx_ctx->in_sg, (u8 *) keys, &len, nx_xcbc_empty()
96 if (len != sizeof(keys)) nx_xcbc_empty()
99 out_sg = nx_build_sg_list(nx_ctx->out_sg, (u8 *) keys, &len, nx_xcbc_empty()
102 if (len != sizeof(keys)) nx_xcbc_empty()
115 keys[1][0] ^= 0x80; nx_xcbc_empty()
117 len = sizeof(keys[1]); nx_xcbc_empty()
120 memcpy(csbcpb->cpb.aes_ecb.key, keys[0], AES_BLOCK_SIZE); nx_xcbc_empty()
121 in_sg = nx_build_sg_list(nx_ctx->in_sg, (u8 *) keys[1], &len, nx_xcbc_empty()
124 if (len != sizeof(keys[1])) nx_xcbc_empty()
/linux-4.1.27/crypto/asymmetric_keys/
H A Dpkcs7_key_type.c17 #include <keys/user-type.h>
18 #include <keys/system_keyring.h>
70 * user defined keys take an arbitrary string as the description and an
H A Dpublic_key.c3 * See Documentation/crypto/asymmetric-keys.txt
20 #include <keys/asymmetric-subtype.h>
46 * Provide a part of a description of the key for /proc/keys.
H A Dsignature.c3 * See Documentation/security/asymmetric-keys.txt
15 #include <keys/asymmetric-subtype.h>
H A Dpkcs7_trust.c19 #include <keys/asymmetric-type.h>
55 * keys. pkcs7_validate_trust_one()
86 * trusted keys. pkcs7_validate_trust_one()
150 * keys we already know and trust.
157 * (*) 0 if at least one signature chain intersects with the keys in the trust
H A Dpublic_key.h3 * See Documentation/crypto/asymmetric-keys.txt
H A Dasymmetric_type.c3 * See Documentation/security/asymmetric-keys.txt
13 #include <keys/asymmetric-subtype.h>
14 #include <keys/asymmetric-parser.h>
54 * asymmetric_key_id_same - Return true if two asymmetric keys IDs are the same.
69 * asymmetric_key_id_partial - Return true if two asymmetric keys IDs
145 * Match asymmetric keys by an exact match on an ID.
158 * Match asymmetric keys by a partial match on an IDs.
H A DMakefile2 # Makefile for asymmetric cryptographic keys
H A Dx509_public_key.c19 #include <keys/asymmetric-subtype.h>
20 #include <keys/asymmetric-parser.h>
21 #include <keys/system_keyring.h>
67 * @keyring: The keys to search.
/linux-4.1.27/drivers/hid/
H A Dhid-twinhan.c71 /* Map all keys from Twinhan Remote */ twinhan_input_mapping()
107 /* Kill the extra keys used for multi-key "power" and "volume" keys twinhan_input_mapping()
108 * as well as continuously to release CTRL,ALT,META,... keys */ twinhan_input_mapping()
H A Dhid-microsoft.c68 * Microsoft uses these 2 reserved usage ids for 2 keys on ms_ergonomy_kb_quirk()
88 /* Special keypad keys */ ms_ergonomy_kb_quirk()
99 * This byte contains a copy of the modifier keys byte of a ms_ergonomy_kb_quirk()
186 /* Special keypad keys */ ms_event()
H A Dhid-prodikeys.c3 * providing midi & extra multimedia keys functionality
396 /* break keys */ pcmidi_handle_report4()
406 /* make keys */ pcmidi_handle_report4()
505 case 0x01: /* midi keys (qwerty)*/ pcmidi_handle_report()
511 case 0x04: /* multimedia/midi keys (qwerty)*/ pcmidi_handle_report()
521 /* reassigned functionality for N/A keys pcmidi_setup_extra_keys()
525 unsigned int keys[] = { pcmidi_setup_extra_keys() local
541 unsigned int *pkeys = &keys[0]; pcmidi_setup_extra_keys()
784 case 0x01: /* midi keys (qwerty)*/ pk_raw_event()
786 case 0x04: /* extra/midi keys (qwerty)*/ pk_raw_event()
H A Dhid-primax.c47 * 0-valued keys, so they don't stop parsing. px_raw_event()
H A Dhid-picolcd_core.c37 * The PicoLCD has an IR receiver header, a built-in keypad with 5 keys
38 * and header for 4x4 key matrix. The built-in keys are part of the matrix.
130 * First and second data bytes list currently pressed keys, picolcd_raw_keypad()
131 * 0x00 means no key and at most 2 keys may be pressed at same time picolcd_raw_keypad()
135 /* determine newly pressed keys */ picolcd_raw_keypad()
163 /* determine newly released keys */ picolcd_raw_keypad()
/linux-4.1.27/arch/s390/include/asm/
H A Dmmu.h21 /* The mmu context uses storage keys. */
/linux-4.1.27/arch/arm/mach-pxa/
H A Dcsb701.c36 .name = "gpio-keys",
H A Dpalmt5.c149 * GPIO keys palmt5_kpc_init()
162 .name = "gpio-keys",
H A Dpalmld.c215 * GPIO keys palmld_kpc_init()
230 .name = "gpio-keys",
H A Dpalmte2.c110 * GPIO keys
130 .name = "gpio-keys",
/linux-4.1.27/include/crypto/
H A Dauthenc.h34 int crypto_authenc_extractkeys(struct crypto_authenc_keys *keys, const u8 *key,
H A Dpublic_key.h3 * See Documentation/crypto/asymmetric-keys.txt
18 #include <keys/asymmetric-type.h>
/linux-4.1.27/drivers/media/rc/keymaps/
H A Drc-real-audio-220-32-keys.c1 /* real-audio-220-32-keys.h - Keytable for real_audio_220_32_keys Remote Controller
16 /* Zogis Real Audio 220 - 32 keys IR */
H A Drc-kworld-plus-tv-analog.c27 { 0x02, KEY_3 }, /* Two keys have the same code: 3 and left */
28 { 0x03, KEY_4 }, /* Two keys have the same code: 3 and right */
H A Drc-nec-terratec-cinergy-xs.c22 /* Terratec Grey IR, with most keys in orange */
84 /* Terratec Black IR, with most keys in black */
H A Drc-tivo.c18 * a command/not_command pair, it has a vendor ID of 0xa10c, but some keys, the
20 * values and the checksum-passed versions for those keys.
H A Drc-it913x-v2.c41 /* keys stereo, snapshot unassigned */
H A Drc-tt-1500.c52 { 0x153a, KEY_RECORD }, /* these keys are only in the black remote */
H A Drc-imon-mce.c17 /* keys sorted mostly by frequency of use to optimize lookups */
H A Drc-imon-pad.c22 /* keys sorted mostly by frequency of use to optimize lookups */
/linux-4.1.27/scripts/
H A Dcheckincludes.pl57 foreach my $filename (keys %includedfiles) {
71 foreach my $filename (keys %includedfiles) {
H A Dheaderdep.pl176 for my $header (keys %deps) {
184 for my $header (keys %deps) {
H A Dexport_report.pl28 for my $mod (sort keys %$href) {
176 for my $thismod (sort keys %MODULE) {
/linux-4.1.27/drivers/net/wireless/orinoco/
H A Dwext.c28 /* Helper routine to record keys
34 kzfree(priv->keys[index].key); orinoco_set_key()
35 kzfree(priv->keys[index].seq); orinoco_set_key()
38 priv->keys[index].key = kzalloc(key_len, GFP_ATOMIC); orinoco_set_key()
39 if (!priv->keys[index].key) orinoco_set_key()
42 priv->keys[index].key = NULL; orinoco_set_key()
45 priv->keys[index].seq = kzalloc(seq_len, GFP_ATOMIC); orinoco_set_key()
46 if (!priv->keys[index].seq) orinoco_set_key()
49 priv->keys[index].seq = NULL; orinoco_set_key()
51 priv->keys[index].key_len = key_len; orinoco_set_key()
52 priv->keys[index].seq_len = seq_len; orinoco_set_key()
55 memcpy((void *)priv->keys[index].key, key, key_len); orinoco_set_key()
57 memcpy((void *)priv->keys[index].seq, seq, seq_len); orinoco_set_key()
61 priv->keys[index].cipher = WLAN_CIPHER_SUITE_TKIP; orinoco_set_key()
65 priv->keys[index].cipher = (key_len > SMALL_KEY_SIZE) ? orinoco_set_key()
71 priv->keys[index].cipher = 0; orinoco_set_key()
78 kfree(priv->keys[index].key); orinoco_set_key()
79 priv->keys[index].key = NULL; orinoco_set_key()
82 priv->keys[index].key_len = 0; orinoco_set_key()
83 priv->keys[index].seq_len = 0; orinoco_set_key()
84 priv->keys[index].cipher = 0; orinoco_set_key()
287 if (priv->keys[index].key_len == 0) { orinoco_ioctl_setiwencode()
308 /* Try fast key change if connected and only keys are changed */ orinoco_ioctl_setiwencode()
354 erq->length = priv->keys[index].key_len; orinoco_ioctl_getiwencode()
356 memcpy(keybuf, priv->keys[index].key, erq->length); orinoco_ioctl_getiwencode()
794 priv->keys[idx].key, orinoco_ioctl_set_encodeext()
852 ext->key_len = min(priv->keys[idx].key_len, max_key_len); orinoco_ioctl_get_encodeext()
853 memcpy(ext->key, priv->keys[idx].key, ext->key_len); orinoco_ioctl_get_encodeext()
858 ext->key_len = min(priv->keys[idx].key_len, max_key_len); orinoco_ioctl_get_encodeext()
859 memcpy(ext->key, priv->keys[idx].key, ext->key_len); orinoco_ioctl_get_encodeext()
H A Dhw.c814 /* Change the WEP keys and/or the current keys. Can be called
828 struct orinoco_key keys[ORINOCO_MAX_KEYS]; __orinoco_hw_setup_wepkeys() local
830 memset(&keys, 0, sizeof(keys)); __orinoco_hw_setup_wepkeys()
832 int len = min(priv->keys[i].key_len, __orinoco_hw_setup_wepkeys()
834 memcpy(&keys[i].data, priv->keys[i].key, len); __orinoco_hw_setup_wepkeys()
836 keys[i].len = cpu_to_le16(LARGE_KEY_SIZE); __orinoco_hw_setup_wepkeys()
838 keys[i].len = cpu_to_le16(SMALL_KEY_SIZE); __orinoco_hw_setup_wepkeys()
840 keys[i].len = cpu_to_le16(0); __orinoco_hw_setup_wepkeys()
845 &keys); __orinoco_hw_setup_wepkeys()
862 keylen = priv->keys[priv->tx_key].key_len; __orinoco_hw_setup_wepkeys()
875 /* Write all 4 keys */ __orinoco_hw_setup_wepkeys()
879 memcpy(key, priv->keys[i].key, __orinoco_hw_setup_wepkeys()
880 priv->keys[i].key_len); __orinoco_hw_setup_wepkeys()
911 /* Setup WEP keys */ __orinoco_hw_setup_enc()
986 /* key must be 32 bytes, including the tx and rx MIC keys.
/linux-4.1.27/scripts/kconfig/
H A Dmconf.c41 "keys and press <Y> to build it in, <M> to make it a module or\n"
49 "o Use the Up/Down arrow keys (cursor keys) to highlight the item you\n"
57 " You may also use the <PAGE UP> and <PAGE DOWN> keys to scroll\n"
60 "o To exit a menu use the cursor keys to highlight the <Exit> button\n"
67 " Also, the <TAB> and cursor keys will cycle between <Select>,\n"
70 "o To get help with an item, use the cursor keys to highlight <Help>\n"
80 "o Use the cursor keys to select the option you wish to set and press\n"
86 "o To see available help for the item, use the cursor keys to highlight\n"
91 " Also, the <TAB> and cursor keys will cycle between <Select> and\n"
101 "o For help, use the <TAB> or cursor keys to highlight the help option\n"
107 "o Use the cursor keys to scroll up/down/left/right. The VI editor\n"
108 " keys h,j,k,l function here as do <u>, <d>, <SPACE BAR> and <B> for\n"
176 "Arrow keys navigate the menu. "
183 "Use the arrow keys to navigate this window or "
290 int *keys, int *vscroll, int *hscroll,
361 int *keys; member in struct:search_data
378 data->keys[k] = key; update_text()
388 data->keys[k] = 0; update_text()
436 int keys[JUMP_NB + 1], i; search_conf() local
440 .keys = keys, search_conf()
447 str_get(&res), 0, 0, keys, &vscroll, search_conf()
451 for (i = 0; i < JUMP_NB && keys[i]; i++) search_conf()
452 if (dres == keys[i]) { search_conf()
757 *keys, int *vscroll, int *hscroll, update_text_fn show_textbox_ext()
761 return dialog_textbox(title, text, r, c, keys, vscroll, hscroll, show_textbox_ext()
756 show_textbox_ext(const char *title, char *text, int r, int c, int *keys, int *vscroll, int *hscroll, update_text_fn update_text, void *data) show_textbox_ext() argument
/linux-4.1.27/arch/mips/ath79/
H A Ddev-gpio-buttons.c32 pdev = platform_device_alloc("gpio-keys-polled", id); ath79_register_gpio_keys_polled()
/linux-4.1.27/arch/arm/mach-s3c64xx/
H A Dmach-hmt.c205 { /* left function keys */
210 { /* right function keys - red */
214 { /* right function keys - green */
218 { /* right function keys - blue */
H A Dmach-smartq5.c103 .name = "gpio-keys",
H A Dmach-smartq7.c119 .name = "gpio-keys",
/linux-4.1.27/arch/arm/mach-imx/devices/
H A Dplatform-gpio_keys.c26 return imx_add_platform_device("gpio-keys", -1, NULL, imx_add_gpio_keys()
/linux-4.1.27/net/ceph/
H A Dauth_x_protocol.h45 __le32 keys; member in struct:ceph_x_service_ticket_request
/linux-4.1.27/include/linux/
H A Dcontext_tracking_state.h12 * may be further optimized using static keys.
H A Dbtree.h11 * unsigned long, u32, u64 and 2 * u64) keys into pointers. The data structure
16 * a variable number (starting with zero) nodes. Each node contains the keys
17 * and pointers to sub-nodes, or, for leaf nodes, the keys and values for the
24 * number of keys and values (N) is geo->no_pairs.
150 * The two trees @target and @victim may not contain the same keys,
H A Dassoc_array.h32 * Operations on objects and index keys for use by array manipulation routines.
45 * their keys? (or -1 if they're the same)
H A Drxrpc.h37 #define RXRPC_SECURITY_KEYRING 2 /* [srvr] set ring of server security keys */
H A Dgpio_keys.h20 * @irq: Irq number in case of interrupt keys
H A Dkey.h12 * See Documentation/security/keys.txt for information on keys/keyrings.
172 #define KEY_FLAG_TRUSTED_ONLY 9 /* set if keyring only accepts links to trusted keys */
210 struct assoc_array keys; member in union:key::__anon11890
/linux-4.1.27/include/net/netfilter/
H A Dnf_queue.h16 u16 size; /* sizeof(entry) + saved route keys */
18 /* extra space to store route keys */
/linux-4.1.27/net/wireless/
H A Dibss.c170 * Delete all the keys ... pairwise keys can't really __cfg80211_clear_ibss()
171 * exist any more anyway, but default keys might. __cfg80211_clear_ibss()
287 if (wdev->wext.keys) { cfg80211_ibss_wext_join()
288 wdev->wext.keys->def = wdev->wext.default_key; cfg80211_ibss_wext_join()
289 wdev->wext.keys->defmgmt = wdev->wext.default_mgmt_key; cfg80211_ibss_wext_join()
294 if (wdev->wext.keys) { cfg80211_ibss_wext_join()
295 ck = kmemdup(wdev->wext.keys, sizeof(*ck), GFP_KERNEL); cfg80211_ibss_wext_join()
H A Dwext-compat.c444 if (!wdev->wext.keys) { __cfg80211_set_encryption()
445 wdev->wext.keys = kzalloc(sizeof(*wdev->wext.keys), __cfg80211_set_encryption()
447 if (!wdev->wext.keys) __cfg80211_set_encryption()
450 wdev->wext.keys->params[i].key = __cfg80211_set_encryption()
451 wdev->wext.keys->data[i]; __cfg80211_set_encryption()
493 * able to delete keys that don't exist, so allow that. __cfg80211_set_encryption()
499 memset(wdev->wext.keys->data[idx], 0, __cfg80211_set_encryption()
500 sizeof(wdev->wext.keys->data[idx])); __cfg80211_set_encryption()
501 wdev->wext.keys->params[idx].key_len = 0; __cfg80211_set_encryption()
502 wdev->wext.keys->params[idx].cipher = 0; __cfg80211_set_encryption()
529 wdev->wext.keys->params[idx] = *params; __cfg80211_set_encryption()
530 memcpy(wdev->wext.keys->data[idx], __cfg80211_set_encryption()
532 wdev->wext.keys->params[idx].key = __cfg80211_set_encryption()
533 wdev->wext.keys->data[idx]; __cfg80211_set_encryption()
761 if (!wdev->wext.keys || !wdev->wext.keys->params[idx].cipher) { cfg80211_wext_giwencode()
768 wdev->wext.keys->params[idx].key_len); cfg80211_wext_giwencode()
769 memcpy(keybuf, wdev->wext.keys->params[idx].key, erq->length); cfg80211_wext_giwencode()
H A Dwext-sme.c36 if (wdev->wext.keys) { cfg80211_mgd_wext_connect()
37 wdev->wext.keys->def = wdev->wext.default_key; cfg80211_mgd_wext_connect()
38 wdev->wext.keys->defmgmt = wdev->wext.default_mgmt_key; cfg80211_mgd_wext_connect()
46 if (wdev->wext.keys) { cfg80211_mgd_wext_connect()
47 ck = kmemdup(wdev->wext.keys, sizeof(*ck), GFP_KERNEL); cfg80211_mgd_wext_connect()
/linux-4.1.27/include/uapi/linux/
H A Dbcache.h20 /* Btree keys - all units are in sectors */
202 __u16 keys; member in union:cache_sb::__anon13127
264 * last_seq is the oldest journal entry that still has keys the btree hasn't
279 __u32 keys; member in struct:jset
345 * On disk a btree node is a list/log of these; within each set the keys are
353 __u32 keys; member in struct:bset
/linux-4.1.27/crypto/
H A Dauthenc.c55 int crypto_authenc_extractkeys(struct crypto_authenc_keys *keys, const u8 *key, crypto_authenc_extractkeys() argument
69 keys->enckeylen = be32_to_cpu(param->enckeylen); crypto_authenc_extractkeys()
74 if (keylen < keys->enckeylen) crypto_authenc_extractkeys()
77 keys->authkeylen = keylen - keys->enckeylen; crypto_authenc_extractkeys()
78 keys->authkey = key; crypto_authenc_extractkeys()
79 keys->enckey = key + keys->authkeylen; crypto_authenc_extractkeys()
91 struct crypto_authenc_keys keys; crypto_authenc_setkey() local
94 if (crypto_authenc_extractkeys(&keys, key, keylen) != 0) crypto_authenc_setkey()
100 err = crypto_ahash_setkey(auth, keys.authkey, keys.authkeylen); crypto_authenc_setkey()
110 err = crypto_ablkcipher_setkey(enc, keys.enckey, keys.enckeylen); crypto_authenc_setkey()
H A Dauthencesn.c65 struct crypto_authenc_keys keys; crypto_authenc_esn_setkey() local
68 if (crypto_authenc_extractkeys(&keys, key, keylen) != 0) crypto_authenc_esn_setkey()
74 err = crypto_ahash_setkey(auth, keys.authkey, keys.authkeylen); crypto_authenc_esn_setkey()
84 err = crypto_ablkcipher_setkey(enc, keys.enckey, keys.enckeylen); crypto_authenc_esn_setkey()
/linux-4.1.27/arch/blackfin/mach-bf533/boards/
H A Dezkit.c371 {BTN_0, GPIO_PF7, 1, "gpio-keys: BTN0"},
372 {BTN_1, GPIO_PF8, 1, "gpio-keys: BTN1"},
373 {BTN_2, GPIO_PF9, 1, "gpio-keys: BTN2"},
374 {BTN_3, GPIO_PF10, 1, "gpio-keys: BTN3"},
383 .name = "gpio-keys",
H A Dblackstamp.c344 {BTN_0, GPIO_PF4, 0, "gpio-keys: BTN0"},
345 {BTN_1, GPIO_PF5, 0, "gpio-keys: BTN1"},
346 {BTN_2, GPIO_PF6, 0, "gpio-keys: BTN2"},
355 .name = "gpio-keys",
/linux-4.1.27/drivers/net/wireless/ipw2x00/
H A Dlibipw_wx.c349 /* Check all the keys to see if any are still configured, libipw_wx_set_encode()
412 memcpy(sec.keys[key], keybuf, erq->length); libipw_wx_set_encode()
414 memset(sec.keys[key] + erq->length, 0, libipw_wx_set_encode()
417 key, len, sec.keys[key], libipw_wx_set_encode()
421 (*crypt)->ops->set_key(sec.keys[key], len, NULL, libipw_wx_set_encode()
431 len = (*crypt)->ops->get_key(sec.keys[key], WEP_KEY_LEN, libipw_wx_set_encode()
437 memset(sec.keys[key], 0, 13); libipw_wx_set_encode()
438 (*crypt)->ops->set_key(sec.keys[key], 13, NULL, libipw_wx_set_encode()
505 memcpy(keybuf, sec->keys[key], len); libipw_wx_get_encode()
652 memcpy(sec.keys[idx], ext->key, ext->key_len); libipw_wx_set_encodeext()
668 /* Don't set sec level for group keys. */ libipw_wx_set_encodeext()
723 memcpy(ext->key, sec->keys[idx], ext->key_len); libipw_wx_get_encodeext()
/linux-4.1.27/lib/
H A Dtest_rhashtable.c130 * Insert TEST_ENTRIES into table with all keys even numbers test_rhashtable()
132 pr_info(" Adding %d keys\n", TEST_ENTRIES); test_rhashtable()
161 pr_info(" Deleting %d keys\n", TEST_ENTRIES); test_rhashtable()
H A Dkobject_uevent.c238 /* default keys */ kobject_uevent_env()
249 /* keys passed in from the caller */ kobject_uevent_env()
308 /* copy keys to our continuous event payload buffer */ kobject_uevent_env()
392 WARN(1, KERN_ERR "add_uevent_var: too many keys\n"); add_uevent_var()
/linux-4.1.27/tools/perf/util/
H A Dsort.h159 /* common sort keys */
171 /* branch stack specific sort keys */
181 /* memory mode specific sort keys */
/linux-4.1.27/include/xen/interface/io/
H A Dnetif.h71 * ring-ref keys are written as before, simplifying the backend processing
76 * event-channel (or event-channel-{tx,rx}) and {tx,rx}-ring-ref keys,
77 * instead writing those keys under sub-keys having the name "queue-N" where
78 * N is the integer ID of the queue for which those keys belong. Queues
80 * event channels must write the following set of queue-related keys:
/linux-4.1.27/drivers/crypto/qat/qat_common/
H A Dqat_algs.c283 struct crypto_authenc_keys *keys) qat_alg_aead_init_enc_session()
291 sizeof(struct icp_qat_hw_auth_setup) + keys->enckeylen); qat_alg_aead_init_enc_session()
301 memcpy(cipher->aes.key, keys->enckey, keys->enckeylen); qat_alg_aead_init_enc_session()
308 if (qat_alg_do_precomputes(hash, ctx, keys->authkey, keys->authkeylen)) qat_alg_aead_init_enc_session()
324 cipher_cd_ctrl->cipher_key_sz = keys->enckeylen >> 3; qat_alg_aead_init_enc_session()
363 struct crypto_authenc_keys *keys) qat_alg_aead_init_dec_session()
386 memcpy(cipher->aes.key, keys->enckey, keys->enckeylen); qat_alg_aead_init_dec_session()
394 if (qat_alg_do_precomputes(hash, ctx, keys->authkey, keys->authkeylen)) qat_alg_aead_init_dec_session()
410 cipher_cd_ctrl->cipher_key_sz = keys->enckeylen >> 3; qat_alg_aead_init_dec_session()
521 struct crypto_authenc_keys keys; qat_alg_aead_init_sessions() local
527 if (crypto_authenc_extractkeys(&keys, key, keylen)) qat_alg_aead_init_sessions()
530 if (qat_alg_validate_key(keys.enckeylen, &alg)) qat_alg_aead_init_sessions()
533 if (qat_alg_aead_init_enc_session(ctx, alg, &keys)) qat_alg_aead_init_sessions()
536 if (qat_alg_aead_init_dec_session(ctx, alg, &keys)) qat_alg_aead_init_sessions()
281 qat_alg_aead_init_enc_session(struct qat_alg_aead_ctx *ctx, int alg, struct crypto_authenc_keys *keys) qat_alg_aead_init_enc_session() argument
361 qat_alg_aead_init_dec_session(struct qat_alg_aead_ctx *ctx, int alg, struct crypto_authenc_keys *keys) qat_alg_aead_init_dec_session() argument
/linux-4.1.27/include/uapi/linux/dvb/
H A Dca.h48 unsigned int num; /* number of available descramblers (keys) */
58 unsigned int descr_num; /* total number of descrambler slots (keys) */
/linux-4.1.27/fs/ext4/
H A Dcrypto_key.c11 #include <keys/encrypted-type.h>
12 #include <keys/user-type.h>
/linux-4.1.27/net/mac802154/
H A Dllsec.c40 INIT_LIST_HEAD(&sec->table.keys); mac802154_llsec_init()
68 list_for_each_entry_safe(key, kn, &sec->table.keys, list) { mac802154_llsec_destroy()
228 list_for_each_entry(pos, &sec->table.keys, list) { mac802154_llsec_key_add()
264 list_add_rcu(&new->list, &sec->table.keys); mac802154_llsec_key_add()
278 list_for_each_entry(pos, &sec->table.keys, list) { mac802154_llsec_key_del()
344 list_for_each_entry_safe(pos, pn, &dev->dev.keys, list) { llsec_dev_free()
375 INIT_LIST_HEAD(&entry->dev.keys); mac802154_llsec_dev_add()
414 list_for_each_entry_rcu(devkey, &dev->dev.keys, list) { llsec_devkey_find()
445 list_add_tail_rcu(&devkey->devkey.list, &dev->dev.keys); mac802154_llsec_devkey_add()
566 list_for_each_entry_rcu(key_entry, &sec->table.keys, list) { llsec_lookup_key()
933 list_add_rcu(&next->devkey.list, &dev->dev.keys); llsec_update_devkey_record()
H A Dllsec.h50 /* protects dev.frame_counter and the elements of dev.keys */
/linux-4.1.27/net/mac80211/
H A Dkey.c35 * keys and per-station keys. Since each station belongs to an interface,
90 * 2. SKB resize was skipped because all the keys were hw planted but increment_tailroom_need_count()
262 key = key_mtx_dereference(sdata->local, sdata->keys[idx]); __ieee80211_set_default_key()
292 key = key_mtx_dereference(sdata->local, sdata->keys[idx]); __ieee80211_set_default_mgmt_key()
357 rcu_assign_pointer(sdata->keys[idx], new); ieee80211_key_replace()
628 old_key = key_mtx_dereference(sdata->local, sdata->keys[idx]); ieee80211_key_link()
745 struct list_head *keys) ieee80211_free_keys_iface()
759 list_add_tail(&key->list, keys); ieee80211_free_keys_iface()
772 LIST_HEAD(keys); ieee80211_free_keys()
778 ieee80211_free_keys_iface(sdata, &keys); ieee80211_free_keys()
782 ieee80211_free_keys_iface(vlan, &keys); ieee80211_free_keys()
785 if (!list_empty(&keys) || force_synchronize) ieee80211_free_keys()
787 list_for_each_entry_safe(key, tmp, &keys, list) ieee80211_free_keys()
852 * make roaming faster: during roaming, all keys are first deleted ieee80211_delayed_tailroom_dec()
853 * and then new keys are installed. The first new key causes the ieee80211_delayed_tailroom_dec()
860 * The cost is that if the AP switching was from an AP with keys ieee80211_delayed_tailroom_dec()
744 ieee80211_free_keys_iface(struct ieee80211_sub_if_data *sdata, struct list_head *keys) ieee80211_free_keys_iface() argument
H A Ddebugfs_key.c304 if (!key->local->debugfs.keys) ieee80211_debugfs_key_add()
311 key->local->debugfs.keys); ieee80211_debugfs_key_add()
364 sprintf(buf, "../keys/%d", key->debugfs.cnt); ieee80211_debugfs_key_update_default()
376 sprintf(buf, "../keys/%d", key->debugfs.cnt); ieee80211_debugfs_key_update_default()
394 sprintf(buf, "../keys/%d", key->debugfs.cnt); ieee80211_debugfs_key_add_mgmt_default()
/linux-4.1.27/arch/x86/platform/intel-mid/device_libs/
H A Dplatform_gpio_keys.c21 #define DEVICE_NAME "gpio-keys"
/linux-4.1.27/fs/nilfs2/
H A Ddirect.c215 __u64 *keys, __u64 *ptrs, int nitems) nilfs_direct_gather_data()
227 keys[n] = key; nilfs_direct_gather_data()
236 __u64 key, __u64 *keys, __u64 *ptrs, int n) nilfs_direct_delete_and_convert()
255 if ((j < n) && (i == keys[j])) { nilfs_direct_delete_and_convert()
214 nilfs_direct_gather_data(struct nilfs_bmap *direct, __u64 *keys, __u64 *ptrs, int nitems) nilfs_direct_gather_data() argument
235 nilfs_direct_delete_and_convert(struct nilfs_bmap *bmap, __u64 key, __u64 *keys, __u64 *ptrs, int n) nilfs_direct_delete_and_convert() argument
H A Dbmap.c113 __u64 keys[NILFS_BMAP_SMALL_HIGH + 1]; nilfs_bmap_do_insert() local
121 bmap, keys, ptrs, NILFS_BMAP_SMALL_HIGH + 1); nilfs_bmap_do_insert()
125 bmap, key, ptr, keys, ptrs, n); nilfs_bmap_do_insert()
168 __u64 keys[NILFS_BMAP_LARGE_LOW + 1]; nilfs_bmap_do_delete() local
176 bmap, keys, ptrs, NILFS_BMAP_LARGE_LOW + 1); nilfs_bmap_do_delete()
180 bmap, key, keys, ptrs, n); nilfs_bmap_do_delete()
295 * Description: nilfs_bmap_truncate() removes key-record pairs whose keys are
/linux-4.1.27/drivers/platform/x86/
H A Dmsi-wmi.c48 /* Generic MSI keys (not present on MSI Wind) */
54 /* MSI Wind keys */
69 /* These keys work without WMI. Ignore them to avoid double keycodes */
80 /* These are MSI Wind keys that should be handled via WMI */
/linux-4.1.27/include/net/
H A Dflow_keys.h42 u32 flow_hash_from_keys(struct flow_keys *keys);
H A Dip.h362 struct flow_keys keys; inet_set_txhash() local
364 keys.src = inet->inet_saddr; inet_set_txhash()
365 keys.dst = inet->inet_daddr; inet_set_txhash()
366 keys.port16[0] = inet->inet_sport; inet_set_txhash()
367 keys.port16[1] = inet->inet_dport; inet_set_txhash()
369 sk->sk_txhash = flow_hash_from_keys(&keys); inet_set_txhash()
/linux-4.1.27/arch/arm/mach-gemini/
H A Dboard-nas4220b.c83 .name = "gpio-keys",
H A Dboard-rut1xx.c41 .name = "gpio-keys",
H A Dboard-wbd111.c44 .name = "gpio-keys",
H A Dboard-wbd222.c44 .name = "gpio-keys",
/linux-4.1.27/scripts/kconfig/lxdialog/
H A Dtextbox.c53 * keys is a null-terminated array
57 int initial_width, int *keys, int *_vscroll, int *_hscroll, dialog_textbox()
250 for (i = 0; keys[i]; i++) { dialog_textbox()
251 if (key == keys[i]) { dialog_textbox()
56 dialog_textbox(const char *title, char *tbuf, int initial_height, int initial_width, int *keys, int *_vscroll, int *_hscroll, update_text_fn update_text, void *data) dialog_textbox() argument
H A Ddialog.h239 int initial_width, int *keys, int *_vscroll, int *_hscroll,
249 * This is the base for fictitious keys, which activate
252 * Mouse-generated keys are the following:
/linux-4.1.27/sound/core/
H A Djack.c83 /* Add capabilities for any keys that are enabled */ snd_jack_dev_register()
191 * reporting of keys on accessories via the jack abstraction. If no
192 * mapping is provided but keys are enabled in the jack type then
199 * numbers of keys that can be reported. It is also possible to
/linux-4.1.27/include/linux/i2c/
H A Dlm8323.h25 * so keys can be mapped directly at the index of the
/linux-4.1.27/drivers/staging/rtl8192u/ieee80211/
H A Dieee80211_wx.c327 /* Check all the keys to see if any are still configured, ieee80211_wx_set_encode()
390 memcpy(sec.keys[key], keybuf, erq->length); ieee80211_wx_set_encode()
392 memset(sec.keys[key] + erq->length, 0, ieee80211_wx_set_encode()
395 key, escape_essid(sec.keys[key], len), ieee80211_wx_set_encode()
398 (*crypt)->ops->set_key(sec.keys[key], len, NULL, ieee80211_wx_set_encode()
408 len = (*crypt)->ops->get_key(sec.keys[key], WEP_KEY_LEN, ieee80211_wx_set_encode()
417 memset(sec.keys[key], 0, 13); ieee80211_wx_set_encode()
418 (*crypt)->ops->set_key(sec.keys[key], 13, NULL, ieee80211_wx_set_encode()
649 //memcpy(sec.keys[idx], ext->key, ext->key_len); ieee80211_wx_set_encode_ext()
665 /* Don't set sec level for group keys. */ ieee80211_wx_set_encode_ext()
/linux-4.1.27/arch/blackfin/mach-bf561/boards/
H A Dezkit.c359 {BTN_0, GPIO_PF5, 1, "gpio-keys: BTN0"},
360 {BTN_1, GPIO_PF6, 1, "gpio-keys: BTN1"},
361 {BTN_2, GPIO_PF7, 1, "gpio-keys: BTN2"},
362 {BTN_3, GPIO_PF8, 1, "gpio-keys: BTN3"},
371 .name = "gpio-keys",
/linux-4.1.27/drivers/staging/rtl8192e/
H A Drtllib_wx.c338 /* Check all the keys to see if any are still configured, rtllib_wx_set_encode()
404 memcpy(sec.keys[key], keybuf, erq->length); rtllib_wx_set_encode()
406 memset(sec.keys[key] + erq->length, 0, rtllib_wx_set_encode()
409 key, escape_essid(sec.keys[key], len), rtllib_wx_set_encode()
412 (*crypt)->ops->set_key(sec.keys[key], len, NULL, rtllib_wx_set_encode()
423 len = (*crypt)->ops->get_key(sec.keys[key], WEP_KEY_LEN, rtllib_wx_set_encode()
430 memset(sec.keys[key], 0, 13); rtllib_wx_set_encode()
431 (*crypt)->ops->set_key(sec.keys[key], 13, NULL, rtllib_wx_set_encode()
665 /* Don't set sec level for group keys. */ rtllib_wx_set_encode_ext()
/linux-4.1.27/drivers/net/wireless/ath/
H A Dkey.c225 * Michael MIC TX/RX keys in the same key cache entry ath_hw_set_keycache_entry()
263 * keys): ath_hw_set_keycache_entry()
264 * Michael MIC TX/RX keys are in different key cache ath_hw_set_keycache_entry()
274 * for TX and RX keys when these registers offsets are ath_hw_set_keycache_entry()
365 /* TX and RX keys share the same key cache entry. */ ath_setkey_tkip()
450 /* Do not allow slots that could be needed for TKIP group keys ath_reserve_key_cache_slot()
/linux-4.1.27/fs/ubifs/
H A Dkey.h298 * Note, UBIFS does not have truncation keys on the media and this function is
475 * keys_cmp - compare keys.
480 * This function compares 2 keys and returns %-1 if @key1 is less than
481 * @key2, %0 if the keys are equivalent and %1 if @key1 is greater than @key2.
500 * keys_eq - determine if keys are equivalent.
505 * This function compares 2 keys and returns %1 if @key1 is equal to @key2 and
/linux-4.1.27/drivers/staging/lustre/lustre/include/
H A Dlustre_param.h38 * User-settable parameter keys
74 /****************** User-settable parameter keys *********************/
/linux-4.1.27/drivers/net/wireless/ti/wl12xx/
H A Dacx.h131 /* WEP address keys configured */
134 /* default keys configured */
/linux-4.1.27/drivers/tty/
H A Dsysrq.c54 /* Whether we react on sysrq keys or just ignore them */
571 /* Simple translation table for the SysRq keys */
626 /* Disable reset until old keys are not released */ sysrq_parse_reset_sequence()
661 * case additional keys were pressed after a reset sysrq_detect_reset_sequence()
670 * Key release - all keys in the reset sequence need sysrq_detect_reset_sequence()
784 * to release all keys after exiting debugger. If we sysrq_handle_keypress()
814 * keyboard state so we can release keys that have been sysrq_handle_keypress()
830 * Pass on release events for keys that was pressed before sysrq_handle_keypress()
/linux-4.1.27/arch/arm64/crypto/
H A Daes-ce-cipher.c197 * Generate the decryption keys for the Equivalent Inverse Cipher. ce_aes_expandkey()
198 * This involves reversing the order of the round keys, and applying ce_aes_expandkey()
/linux-4.1.27/arch/arm/mach-sa1100/
H A Dh3xxx.c214 * GPIO keys
241 .name = "gpio-keys",
/linux-4.1.27/net/dns_resolver/
H A Ddns_query.c42 #include <keys/dns_resolver-type.h>
43 #include <keys/user-type.h>
/linux-4.1.27/net/sctp/
H A Dobjcnt.c56 SCTP_DBG_OBJCNT(keys); variable
72 SCTP_DBG_OBJCNT_ENTRY(keys),
H A Dauth.c68 SCTP_DBG_OBJCNT_DEC(keys); sctp_auth_key_put()
88 SCTP_DBG_OBJCNT_INC(keys); sctp_auth_create_key()
121 void sctp_auth_destroy_keys(struct list_head *keys) sctp_auth_destroy_keys() argument
126 if (list_empty(keys)) sctp_auth_destroy_keys()
129 key_for_each_safe(ep_key, tmp, keys) { key_for_each_safe()
183 * computation of keys. Parameters which were not sent are simply
249 * From the endpoint pair shared keys and the key vectors the
250 * association shared keys are computed. This is performed by selecting
310 * computation of keys. Parameters which were not sent are simply sctp_auth_asoc_create_secret()
433 /* First search associations set of endpoint pair shared keys */ sctp_auth_get_shkey()
864 /* If we are replacing, remove the old keys data from the
/linux-4.1.27/drivers/media/rc/
H A Dir-mce_kbd-decoder.c24 * - MCIR-2 32-bit IR signals used for standard keyboard keys
26 * The media keys on the keyboard send RC-6 signals that are inditinguishable
27 * from the keys of the same name on the stock MCE remote, and will be handled
124 IR_dprintk(2, "timer callback clearing all keys\n"); mce_kbd_rx_timeout()
/linux-4.1.27/arch/x86/platform/geode/
H A Dgeos.c51 .name = "gpio-keys-polled",
H A Dnet5501.c54 .name = "gpio-keys-polled",
/linux-4.1.27/arch/unicore32/kernel/
H A Dpuv3-nb0916.c118 platform_device_register_data(NULL, "gpio-keys", -1, mach_nb0916_init()
/linux-4.1.27/drivers/gpu/drm/sis/
H A Dsis_drv.h66 /** Mapping of userspace keys to mm objects */
/linux-4.1.27/arch/sh/boards/mach-rsk/
H A Ddevices-rsk7203.c115 .name = "gpio-keys-polled",
/linux-4.1.27/security/integrity/
H A Ddigsig_asymmetric.c19 #include <keys/asymmetric-type.h>
/linux-4.1.27/arch/s390/kernel/
H A Dsuspend.c32 * The size of the keys array is (PAGE_SIZE - sizeof(long))
50 * keys need to be memorized until the page data has been restored.
51 * Only then can the storage keys be set to their old state.
/linux-4.1.27/arch/blackfin/mach-bf548/boards/
H A Dezkit.c151 .name = "bf54x-keys",
1784 {BTN_0, GPIO_PB8, 1, "gpio-keys: BTN0"},
1785 {BTN_1, GPIO_PB9, 1, "gpio-keys: BTN1"},
1786 {BTN_2, GPIO_PB10, 1, "gpio-keys: BTN2"},
1787 {BTN_3, GPIO_PB11, 1, "gpio-keys: BTN3"},
1796 .name = "gpio-keys",
2148 PIN_MAP_MUX_GROUP_DEFAULT("bf54x-keys", "pinctrl-adi2.0", "keys_4x4grp", "keys"),
2149 PIN_MAP_MUX_GROUP("bf54x-keys", "4bit", "pinctrl-adi2.0", "keys_4x4grp", "keys"),
2150 PIN_MAP_MUX_GROUP("bf54x-keys", "8bit", "pinctrl-adi2.0", "keys_8x8grp", "keys"),
/linux-4.1.27/Documentation/trace/postprocess/
H A Dtrace-pagealloc-postprocess.pl307 foreach $process_pid (keys %perprocesspid) {
324 foreach $process_pid (keys %stats) {
358 foreach $process_pid (keys %perprocesspid) {
/linux-4.1.27/kernel/debug/kdb/
H A Dkdb_keyboard.c67 * (except for shift keys, where we want to kdb_get_kbd_char()
223 * + Need to handle mashed keys. kdb_kbd_cleanup_state()
251 * We can also see make and break codes for other keys kdb_kbd_cleanup_state()
/linux-4.1.27/arch/s390/crypto/
H A Ddes_s390.c42 /* check for weak keys */ des_setkey()
230 * complementation keys. Any weakness is obviated by the use of
231 * multiple keys.
233 * However, if the first two or last two independent 64-bit keys are
235 * same as DES. Implementers MUST reject keys that exhibit this
/linux-4.1.27/arch/m68k/atari/
H A Datakeyb.c52 /* bitmap of keys reported as broken */
66 * application keys (i.e. sending Esc O c).
217 * keys (keys being down). The code *should* be a break atari_keyboard_interrupt()
343 * all keys making contact ikbd_reset()
/linux-4.1.27/net/bluetooth/hidp/
H A Dcore.c175 unsigned char *keys = session->keys; hidp_input_report() local
186 * too many keys were pressed at the same time. */ hidp_input_report()
191 if (keys[i] > 3 && memscan(udata + 2, keys[i], 6) == udata + 8) { hidp_input_report()
192 if (hidp_keycode[keys[i]]) hidp_input_report()
193 input_report_key(dev, hidp_keycode[keys[i]], 0); hidp_input_report()
195 BT_ERR("Unknown key (scancode %#x) released.", keys[i]); hidp_input_report()
198 if (udata[i] > 3 && memscan(keys + 2, udata[i], 6) == keys + 8) { hidp_input_report()
206 memcpy(keys, udata, 8); hidp_input_report()
/linux-4.1.27/tools/testing/ktest/
H A Dktest.pl1167 foreach my $default (keys %default) {
1180 foreach my $option (keys %opt) {
1193 $s = " is" if (keys %not_used == 1);
1195 foreach my $option (keys %not_used) {
1214 foreach my $test (keys %repeat_tests) {
2332 foreach my $config (keys %force_config) {
2342 my @force_list = keys %force_config;
3032 foreach my $config (keys %configs) {
3059 foreach my $item (keys %a) {
3078 foreach my $item (keys %b) {
3100 foreach my $item (keys %b) {
3109 foreach my $item (keys %a) {
3188 my @diff_arr = keys %diff_configs;
3191 my @b_arr = keys %b_configs;
3194 my @g_arr = keys %g_configs;
3837 my @config_keys = keys %min_configs;
3885 my @test_configs = keys %min_configs;
3887 # Sort keys by who is most dependent on
3967 foreach my $config (keys %save_configs) {
3984 my @config_keys = keys %min_configs;
3995 foreach my $config (keys %keep_configs) {
3998 foreach my $config (keys %min_configs) {
4095 my @new_configs = keys %entered_configs;
4124 foreach my $option (sort keys %opt) {
4155 foreach my $test (keys %repeat_tests) {
4214 foreach my $opt (keys %option_map) {
/linux-4.1.27/arch/s390/kvm/
H A Dkvm-s390.c747 uint8_t *keys; kvm_s390_get_skeys() local
755 /* Is this guest using storage keys? */ kvm_s390_get_skeys()
763 keys = kmalloc_array(args->count, sizeof(uint8_t), kvm_s390_get_skeys()
765 if (!keys) kvm_s390_get_skeys()
766 keys = vmalloc(sizeof(uint8_t) * args->count); kvm_s390_get_skeys()
767 if (!keys) kvm_s390_get_skeys()
782 keys[i] = curkey; kvm_s390_get_skeys()
785 r = copy_to_user((uint8_t __user *)args->skeydata_addr, keys, kvm_s390_get_skeys()
790 kvfree(keys); kvm_s390_get_skeys()
796 uint8_t *keys; kvm_s390_set_skeys() local
807 keys = kmalloc_array(args->count, sizeof(uint8_t), kvm_s390_set_skeys()
809 if (!keys) kvm_s390_set_skeys()
810 keys = vmalloc(sizeof(uint8_t) * args->count); kvm_s390_set_skeys()
811 if (!keys) kvm_s390_set_skeys()
814 r = copy_from_user(keys, (uint8_t __user *)args->skeydata_addr, kvm_s390_set_skeys()
832 if (keys[i] & 0x01) { kvm_s390_set_skeys()
838 (unsigned long)keys[i], 0); kvm_s390_set_skeys()
843 kvfree(keys); kvm_s390_set_skeys()
/linux-4.1.27/drivers/crypto/
H A Dixp4xx_crypto.c1151 struct crypto_authenc_keys keys; aead_setkey() local
1153 if (crypto_authenc_extractkeys(&keys, key, keylen) != 0) aead_setkey()
1156 if (keys.authkeylen > sizeof(ctx->authkey)) aead_setkey()
1159 if (keys.enckeylen > sizeof(ctx->enckey)) aead_setkey()
1162 memcpy(ctx->authkey, keys.authkey, keys.authkeylen); aead_setkey()
1163 memcpy(ctx->enckey, keys.enckey, keys.enckeylen); aead_setkey()
1164 ctx->authkey_len = keys.authkeylen; aead_setkey()
1165 ctx->enckey_len = keys.enckeylen; aead_setkey()
H A Dpicoxcell_crypto.c472 * IPSec engine only supports 128 and 256 bit AES keys. If we get a spacc_aead_aes_setkey()
498 struct crypto_authenc_keys keys; spacc_aead_setkey() local
501 if (crypto_authenc_extractkeys(&keys, key, keylen) != 0) spacc_aead_setkey()
504 if (keys.enckeylen > AES_MAX_KEY_SIZE) spacc_aead_setkey()
507 if (keys.authkeylen > sizeof(ctx->hash_ctx)) spacc_aead_setkey()
512 err = spacc_aead_aes_setkey(tfm, keys.enckey, keys.enckeylen); spacc_aead_setkey()
514 err = spacc_aead_des_setkey(tfm, keys.enckey, keys.enckeylen); spacc_aead_setkey()
519 memcpy(ctx->hash_ctx, keys.authkey, keys.authkeylen); spacc_aead_setkey()
520 ctx->hash_key_len = keys.authkeylen; spacc_aead_setkey()
856 * IPSec engine only supports 128 and 256 bit AES keys. If we get a spacc_aes_setkey()
/linux-4.1.27/drivers/net/wireless/ath/ath9k/
H A Dcommon.c54 * Key miss events are only relevant for pairwise keys where the ath9k_cmn_rx_accept()
389 * are required to handle both tx+rx MIC keys. ath9k_cmn_init_crypto()
390 * With split mic keys the number of stations is limited ath9k_cmn_init_crypto()
/linux-4.1.27/drivers/net/wireless/libertas/
H A Dcfg.c875 * This removes all WEP keys
896 * Set WEP keys
927 /* Only set wep keys if we have at least one of them */ lbs_set_wep_keys()
951 /* Otherwise remove all wep keys */ lbs_set_wep_keys()
1372 /* As this is a new connection, clear locally stored WEP keys */ lbs_cfg_connect()
1377 /* set/remove WEP keys */ lbs_cfg_connect()
1381 /* Store provided WEP keys in priv-> */ lbs_cfg_connect()
1385 /* Set WEP keys and WEP mode */ lbs_cfg_connect()
1395 * we remove all keys like in the WPA/WPA2 setup, lbs_cfg_connect()
1402 /* Remove WEP keys and WEP mode */ lbs_cfg_connect()
1407 /* clear the WPA/WPA2 keys */ lbs_cfg_connect()
1583 * - we clear all keys whenever we do lbs_cfg_connect() anyway lbs_cfg_del_key()
/linux-4.1.27/drivers/hid/usbhid/
H A Dusbkbd.c73 * keys were pressed. By comparing with the current list of keys
75 * @irq: URB for receiving a list of keys that are pressed when a
/linux-4.1.27/arch/blackfin/mach-bf518/boards/
H A Dtcm-bf518.c572 {BTN_0, GPIO_PG0, 1, "gpio-keys: BTN0"},
573 {BTN_1, GPIO_PG13, 1, "gpio-keys: BTN1"},
582 .name = "gpio-keys",

Completed in 3706 milliseconds

1234