325  * first in the array, and in the same order as the ordering. The algorithm
342 	int same;	/* number of elements which are the same */  in sort_array_by_ordering()  local
354 	same = dest_count;  in sort_array_by_ordering()
362 	return same;  in sort_array_by_ordering()
368  * Given a list of new key codes, we check how many of these are the same
374  * @param same		Returns number of key codes which are the same
377 			   int keycode[], int num_keycodes, int *same)  in input_check_keycodes()  argument
385 	/* sort the keycodes into the same order as the previous ones */  in input_check_keycodes()
386 	*same = sort_array_by_ordering(keycode, num_keycodes,  in input_check_keycodes()
392 	return *same != num_keycodes;  in input_check_keycodes()
447  * @param same		Number of key codes which are the same
453 		int max_chars, int same)  in input_keycodes_to_ascii()  argument
471 	/* Start conversion by looking for the first new keycode (by same). */  in input_keycodes_to_ascii()
472 	for (i = same; i < num_keycodes; i++) {  in input_keycodes_to_ascii()
513 	int count, i, same = 0;  in _input_send_keycodes()  local
518 	if (!input_check_keycodes(config, keycode, num_keycodes, &same)) {  in _input_send_keycodes()
520 		 * Same as last time - is it time for another repeat?  in _input_send_keycodes()
534 					ch, sizeof(ch), is_repeat ? 0 : same);  in _input_send_keycodes()