| /kernel/linux/linux-5.10/security/apparmor/include/ |
| H A D | match.h | 110 #define UNPACK_ARRAY(TABLE, BLOB, LEN, TTYPE, BTYPE, NTOHX) \
113 TTYPE *__t = (TTYPE *) TABLE; \
|
| /kernel/linux/linux-6.6/security/apparmor/include/ |
| H A D | match.h | 110 #define UNPACK_ARRAY(TABLE, BLOB, LEN, TTYPE, BTYPE, NTOHX) \
113 TTYPE *__t = (TTYPE *) TABLE; \
|
| /kernel/linux/linux-5.10/lib/zlib_inflate/ |
| H A D | inflate.h | 33 TABLE, /* i: waiting for dynamic block table lengths */ enumerator
62 TYPE -> STORED or TABLE or LEN or CHECK
64 TABLE -> LENLENS -> CODELENS -> LEN
|
| H A D | inflate.c | 430 state->mode = TABLE; in zlib_inflate()
466 case TABLE: in zlib_inflate()
|
| /kernel/linux/linux-6.6/lib/zlib_inflate/ |
| H A D | inflate.h | 33 TABLE, /* i: waiting for dynamic block table lengths */ enumerator
62 TYPE -> STORED or TABLE or LEN or CHECK
64 TABLE -> LENLENS -> CODELENS -> LEN
|
| H A D | inflate.c | 430 state->mode = TABLE; in zlib_inflate()
466 case TABLE: in zlib_inflate()
|
| /kernel/linux/linux-5.10/tools/testing/selftests/net/ |
| H A D | fib_rule_tests.sh | 96 pref=$($IP -6 rule show | grep "$1 lookup $TABLE" | cut -d ":" -f 1)
165 pref=$($IP rule show | grep "$1 lookup $TABLE" | cut -d ":" -f 1)
|
| H A D | vrf-xfrm-tests.sh | 25 TABLE=300
192 create_vrf "host1" ${VRF} ${TABLE}
|
| /kernel/linux/linux-5.10/arch/m68k/fpsp040/ |
| H A D | stwotox.S | 234 lea EXPTBL,%a1 | ...LOAD ADDRESS OF TABLE OF 2^(J/64)
337 lea EXPTBL,%a1 | ...LOAD ADDRESS OF TABLE OF 2^(J/64)
|
| H A D | ssin.S | 200 |--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
205 lea PITBL+0x200,%a1 | ...TABLE OF N*PI/2, N = -32,...,32
555 |--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
560 lea PITBL+0x200,%a1 | ...TABLE OF N*PI/2, N = -32,...,32
|
| H A D | stan.S | 188 |--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
193 leal PITBL+0x200,%a1 | ...TABLE OF N*PI/2, N = -32,...,32
|
| H A D | slogn.S | 348 |--ALSO NOTE THAT THE VALUE 1/F IS STORED IN A TABLE SO THAT NO
525 |--HERE WE USE THE USUAL TABLE DRIVEN APPROACH. CARE HAS TO BE
|
| /kernel/linux/linux-6.6/arch/m68k/fpsp040/ |
| H A D | stwotox.S | 234 lea EXPTBL,%a1 | ...LOAD ADDRESS OF TABLE OF 2^(J/64)
337 lea EXPTBL,%a1 | ...LOAD ADDRESS OF TABLE OF 2^(J/64)
|
| H A D | ssin.S | 200 |--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
205 lea PITBL+0x200,%a1 | ...TABLE OF N*PI/2, N = -32,...,32
555 |--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
560 lea PITBL+0x200,%a1 | ...TABLE OF N*PI/2, N = -32,...,32
|
| H A D | stan.S | 188 |--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
193 leal PITBL+0x200,%a1 | ...TABLE OF N*PI/2, N = -32,...,32
|
| H A D | slogn.S | 348 |--ALSO NOTE THAT THE VALUE 1/F IS STORED IN A TABLE SO THAT NO
525 |--HERE WE USE THE USUAL TABLE DRIVEN APPROACH. CARE HAS TO BE
|
| /kernel/linux/linux-5.10/lib/raid6/ |
| H A D | Makefile | 86 quiet_cmd_mktable = TABLE $@
|
| /kernel/linux/linux-6.6/lib/raid6/ |
| H A D | Makefile | 90 quiet_cmd_mktable = TABLE $@
|
| /kernel/linux/linux-6.6/tools/testing/selftests/net/ |
| H A D | vrf-xfrm-tests.sh | 25 TABLE=300
192 create_vrf "host1" ${VRF} ${TABLE}
|
| /kernel/linux/linux-5.10/arch/m68k/ifpsp060/src/ |
| H A D | fplsp.S | 5046 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5051 lea PITBL+0x200(%pc),%a1 # TABLE OF N*PI/2, N = -32,...,32
5257 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5263 lea PITBL+0x200(%pc),%a1 # TABLE OF N*PI/2, N = -32,...,32
5776 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5780 lea.l PITBL+0x200(%pc),%a1 # TABLE OF N*PI/2, N = -32,...,32
6258 #--THE MOST LIKELY CASE, |X| IN [1/16, 16). WE USE TABLE TECHNIQUE
6261 #--A TABLE, ALL WE NEED IS TO APPROXIMATE ATAN(U) WHERE
8245 #--ALSO NOTE THAT THE VALUE 1/F IS STORED IN A TABLE SO THAT NO
8485 #--HERE WE USE THE USUAL TABLE DRIVE
[all...] |
| H A D | fpsp.S | 5152 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5157 lea PITBL+0x200(%pc),%a1 # TABLE OF N*PI/2, N = -32,...,32
5363 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5369 lea PITBL+0x200(%pc),%a1 # TABLE OF N*PI/2, N = -32,...,32
5882 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5886 lea.l PITBL+0x200(%pc),%a1 # TABLE OF N*PI/2, N = -32,...,32
6364 #--THE MOST LIKELY CASE, |X| IN [1/16, 16). WE USE TABLE TECHNIQUE
6367 #--A TABLE, ALL WE NEED IS TO APPROXIMATE ATAN(U) WHERE
8351 #--ALSO NOTE THAT THE VALUE 1/F IS STORED IN A TABLE SO THAT NO
8591 #--HERE WE USE THE USUAL TABLE DRIVE
[all...] |
| /kernel/linux/linux-6.6/arch/m68k/ifpsp060/src/ |
| H A D | fplsp.S | 5046 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5051 lea PITBL+0x200(%pc),%a1 # TABLE OF N*PI/2, N = -32,...,32
5257 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5263 lea PITBL+0x200(%pc),%a1 # TABLE OF N*PI/2, N = -32,...,32
5776 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5780 lea.l PITBL+0x200(%pc),%a1 # TABLE OF N*PI/2, N = -32,...,32
6258 #--THE MOST LIKELY CASE, |X| IN [1/16, 16). WE USE TABLE TECHNIQUE
6261 #--A TABLE, ALL WE NEED IS TO APPROXIMATE ATAN(U) WHERE
8245 #--ALSO NOTE THAT THE VALUE 1/F IS STORED IN A TABLE SO THAT NO
8485 #--HERE WE USE THE USUAL TABLE DRIVE
[all...] |
| H A D | fpsp.S | 5152 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5157 lea PITBL+0x200(%pc),%a1 # TABLE OF N*PI/2, N = -32,...,32
5363 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5369 lea PITBL+0x200(%pc),%a1 # TABLE OF N*PI/2, N = -32,...,32
5882 #--THE ARGUMENT REDUCTION IS DONE BY TABLE LOOK UP.
5886 lea.l PITBL+0x200(%pc),%a1 # TABLE OF N*PI/2, N = -32,...,32
6364 #--THE MOST LIKELY CASE, |X| IN [1/16, 16). WE USE TABLE TECHNIQUE
6367 #--A TABLE, ALL WE NEED IS TO APPROXIMATE ATAN(U) WHERE
8351 #--ALSO NOTE THAT THE VALUE 1/F IS STORED IN A TABLE SO THAT NO
8591 #--HERE WE USE THE USUAL TABLE DRIVE
[all...] |