Searched refs:next_code (Results 1 – 11 of 11) sorted by relevance
277 next_code: in hvkbd_read_char_locked()372 goto next_code; in hvkbd_read_char_locked()446 goto next_code; in hvkbd_read_char_locked()459 goto next_code; in hvkbd_read_char_locked()464 goto next_code; in hvkbd_read_char_locked()494 goto next_code; in hvkbd_read_char_locked()500 goto next_code; in hvkbd_read_char_locked()506 goto next_code; in hvkbd_read_char_locked()511 goto next_code; in hvkbd_read_char_locked()518 goto next_code; in hvkbd_read_char_locked()[all …]
140 static int next_code(struct archive_read_filter *);264 next_code(self); in compress_bidder_init()292 ret = next_code(self); in compress_filter_read()323 next_code(struct archive_read_filter *self) in next_code() function363 return (next_code(self)); in next_code()
657 next_code: in kbdmux_read_char()695 goto next_code; in kbdmux_read_char()749 goto next_code; in kbdmux_read_char()826 goto next_code; in kbdmux_read_char()839 goto next_code; in kbdmux_read_char()844 goto next_code; in kbdmux_read_char()878 goto next_code; in kbdmux_read_char()886 goto next_code; in kbdmux_read_char()894 goto next_code; in kbdmux_read_char()901 goto next_code; in kbdmux_read_char()[all …]
813 next_code: in vkbd_read_char()865 goto next_code; in vkbd_read_char()939 goto next_code; in vkbd_read_char()952 goto next_code; in vkbd_read_char()957 goto next_code; in vkbd_read_char()1007 goto next_code; in vkbd_read_char()1015 goto next_code; in vkbd_read_char()1023 goto next_code; in vkbd_read_char()1030 goto next_code; in vkbd_read_char()1037 goto next_code; in vkbd_read_char()[all …]
656 next_code: in atkbd_read_char()734 goto next_code; in atkbd_read_char()808 goto next_code; in atkbd_read_char()821 goto next_code; in atkbd_read_char()826 goto next_code; in atkbd_read_char()872 goto next_code; in atkbd_read_char()878 goto next_code; in atkbd_read_char()884 goto next_code; in atkbd_read_char()889 goto next_code; in atkbd_read_char()896 goto next_code; in atkbd_read_char()[all …]
203 ush next_code[MAX_BITS+1]; /* next code value for each bit length */ in gen_codes() local213 next_code[bits] = (ush)code; in gen_codes()226 tree[n].Code = (ush)bi_reverse(next_code[len]++, len); in gen_codes()229 n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len] - 1)); in gen_codes()
1315 next_code: in hkbd_read_char_locked()1445 goto next_code; in hkbd_read_char_locked()1464 goto next_code; in hkbd_read_char_locked()1471 goto next_code; in hkbd_read_char_locked()
1615 next_code: in ukbd_read_char_locked()1745 goto next_code; in ukbd_read_char_locked()1764 goto next_code; in ukbd_read_char_locked()1771 goto next_code; in ukbd_read_char_locked()
746 next_code: in gpiokeys_read_char_locked()770 goto next_code; in gpiokeys_read_char_locked()
432 next_code[bits] = code;444 tree[n].Code = next_code[len];445 next_code[len]++;468 Step 2 computes the following next_code values:470 N next_code[N]
3767 next_code: in scgetc()3816 goto next_code; in scgetc()3821 goto next_code; in scgetc()3829 goto next_code; in scgetc()3837 goto next_code; in scgetc()3849 goto next_code; in scgetc()3861 goto next_code; in scgetc()4065 goto next_code; in scgetc()