head 1.1; access; symbols netbsd-11-0-RC4:1.1 netbsd-11-0-RC3:1.1 netbsd-11-0-RC2:1.1 netbsd-11-0-RC1:1.1 perseant-exfatfs-base-20250801:1.1 netbsd-11:1.1.0.58 netbsd-11-base:1.1 netbsd-10-1-RELEASE:1.1 perseant-exfatfs-base-20240630:1.1 perseant-exfatfs:1.1.0.56 perseant-exfatfs-base:1.1 netbsd-8-3-RELEASE:1.1 netbsd-9-4-RELEASE:1.1 netbsd-10-0-RELEASE:1.1 netbsd-10-0-RC6:1.1 netbsd-10-0-RC5:1.1 netbsd-10-0-RC4:1.1 netbsd-10-0-RC3:1.1 netbsd-10-0-RC2:1.1 thorpej-ifq:1.1.0.54 thorpej-ifq-base:1.1 thorpej-altq-separation:1.1.0.52 thorpej-altq-separation-base:1.1 netbsd-10-0-RC1:1.1 netbsd-10:1.1.0.50 netbsd-10-base:1.1 bouyer-sunxi-drm:1.1.0.48 bouyer-sunxi-drm-base:1.1 netbsd-9-3-RELEASE:1.1 thorpej-i2c-spi-conf2:1.1.0.46 thorpej-i2c-spi-conf2-base:1.1 thorpej-futex2:1.1.0.44 thorpej-futex2-base:1.1 thorpej-cfargs2:1.1.0.42 thorpej-cfargs2-base:1.1 cjep_sun2x-base1:1.1 cjep_sun2x:1.1.0.40 cjep_sun2x-base:1.1 cjep_staticlib_x-base1:1.1 netbsd-9-2-RELEASE:1.1 cjep_staticlib_x:1.1.0.38 cjep_staticlib_x-base:1.1 thorpej-i2c-spi-conf:1.1.0.36 thorpej-i2c-spi-conf-base:1.1 thorpej-cfargs:1.1.0.34 thorpej-cfargs-base:1.1 thorpej-futex:1.1.0.32 thorpej-futex-base:1.1 netbsd-9-1-RELEASE:1.1 bouyer-xenpvh-base2:1.1 phil-wifi-20200421:1.1 bouyer-xenpvh-base1:1.1 phil-wifi-20200411:1.1 bouyer-xenpvh:1.1.0.30 bouyer-xenpvh-base:1.1 is-mlppp:1.1.0.28 is-mlppp-base:1.1 phil-wifi-20200406:1.1 netbsd-8-2-RELEASE:1.1 ad-namecache-base3:1.1 netbsd-9-0-RELEASE:1.1 netbsd-9-0-RC2:1.1 ad-namecache-base2:1.1 ad-namecache-base1:1.1 ad-namecache:1.1.0.26 ad-namecache-base:1.1 netbsd-9-0-RC1:1.1 phil-wifi-20191119:1.1 netbsd-9:1.1.0.24 netbsd-9-base:1.1 phil-wifi-20190609:1.1 netbsd-8-1-RELEASE:1.1 netbsd-8-1-RC1:1.1 isaki-audio2:1.1.0.22 isaki-audio2-base:1.1 pgoyette-compat-merge-20190127:1.1 pgoyette-compat-20190127:1.1 pgoyette-compat-20190118:1.1 pgoyette-compat-1226:1.1 pgoyette-compat-1126:1.1 pgoyette-compat-1020:1.1 pgoyette-compat-0930:1.1 pgoyette-compat-0906:1.1 pgoyette-compat-0728:1.1 netbsd-8-0-RELEASE:1.1 phil-wifi:1.1.0.20 phil-wifi-base:1.1 pgoyette-compat-0625:1.1 netbsd-8-0-RC2:1.1 pgoyette-compat-0521:1.1 pgoyette-compat-0502:1.1 pgoyette-compat-0422:1.1 netbsd-8-0-RC1:1.1 pgoyette-compat-0415:1.1 pgoyette-compat-0407:1.1 pgoyette-compat-0330:1.1 pgoyette-compat-0322:1.1 pgoyette-compat-0315:1.1 pgoyette-compat:1.1.0.18 pgoyette-compat-base:1.1 tls-maxphys:1.1.0.16 tls-maxphys-base-20171202:1.1 matt-nb8-mediatek:1.1.0.14 matt-nb8-mediatek-base:1.1 nick-nhusb:1.1.0.12 nick-nhusb-base-20170825:1.1 perseant-stdc-iso10646:1.1.0.10 perseant-stdc-iso10646-base:1.1 netbsd-8:1.1.0.8 netbsd-8-base:1.1 prg-localcount2-base3:1.1 prg-localcount2-base2:1.1 prg-localcount2-base1:1.1 prg-localcount2:1.1.0.6 prg-localcount2-base:1.1 pgoyette-localcount:1.1.0.4 pgoyette-localcount-20170426:1.1 bouyer-socketcan:1.1.0.2 bouyer-socketcan-base1:1.1; locks; strict; comment @# @; 1.1 date 2017.04.15.04.27.30; author kamil; state Exp; branches 1.1.2.1 1.1.4.1 1.1.12.1 1.1.16.1; next ; commitid HezLhRDNdYAWiANz; 1.1.2.1 date 2017.04.15.04.27.30; author kamil; state dead; branches; next 1.1.2.2; 1.1.2.2 date 2017.04.15.04.27.31; author kamil; state Exp; branches; next ; 1.1.4.1 date 2017.04.15.04.27.30; author pgoyette; state dead; branches; next 1.1.4.2; commitid ojV02aOSdzvBqZOz; 1.1.4.2 date 2017.04.26.02.53.28; author pgoyette; state Exp; branches; next ; commitid ojV02aOSdzvBqZOz; 1.1.12.1 date 2017.04.15.04.27.30; author skrll; state dead; branches; next 1.1.12.2; commitid UQQpnjvcNkUZn05A; 1.1.12.2 date 2017.08.28.17.53.10; author skrll; state Exp; branches; next ; commitid UQQpnjvcNkUZn05A; 1.1.16.1 date 2017.04.15.04.27.30; author jdolecek; state dead; branches; next 1.1.16.2; commitid XcIYRZTAh1LmerhA; 1.1.16.2 date 2017.12.03.11.38.53; author jdolecek; state Exp; branches; next ; commitid XcIYRZTAh1LmerhA; desc @@ 1.1 log @Add new example kernel module in Lua luareadhappy This example presents a C module with its device (/dev entry) and its content generator with algorithm defined in Lua state. The Lua state can be changed dynamically from userland, without interruption of read(2) over the device. This is an example how to call Lua code from C. @ text @-- $NetBSD$ -- -- Copyright (c) 2015 The NetBSD Foundation, Inc. -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions -- are met: -- 1. Redistributions of source code must retain the above copyright -- notice, this list of conditions and the following disclaimer. -- 2. Redistributions in binary form must reproduce the above copyright -- notice, this list of conditions and the following disclaimer in the -- documentation and/or other materials provided with the distribution. -- -- THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS -- ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED -- TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -- PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS -- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR -- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF -- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS -- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN -- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) -- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE -- POSSIBILITY OF SUCH DAMAGE. -- -- -- Commentary: -- A happy number is a number defined by the following process: Starting with -- any positive integer, replace the number by the sum of the squares of its -- digits, and repeat the process until the number equals 1 (where it will -- stay), or it loops endlessly in a cycle which does not include 1. Those -- numbers for which this process ends in 1 are happy numbers, while those that -- do not end in 1 are unhappy numbers (or sad numbers). -- -- For more information on happy numbers, and the algorithms, see -- http://en.wikipedia.org/wiki/Happy_number -- -- The happy number generator is here only to have something that the user -- can read from our device. Any other arbitrary data generator could -- have been used. The algorithm is not critical to the implementation -- of the module. local HAPPY_NUMBER = 1 -- If n is not happy then its sequence ends in the cycle: -- 4, 16, 37, 58, 89, 145, 42, 20, 4, ... local SAD_NUMBER = 4 -- This following algorithm is designed for numbers of the integer type. -- Integer numbers are used by default in the NetBSD kernel, as there would be -- need for additional overhead in context-switch with support for floats. function dsum(n) local sum = 0 while n > 0 do local x = n % 10 sum = sum + (x * x) n = n / 10 end return sum end function is_happy(n) while true do local total = dsum(n) if total == HAPPY_NUMBER then return 1 end if total == SAD_NUMBER then return 0 end n = total end end @ 1.1.16.1 log @file happy.lua was added on branch tls-maxphys on 2017-12-03 11:38:53 +0000 @ text @d1 77 @ 1.1.16.2 log @update from HEAD @ text @a0 77 -- $NetBSD$ -- -- Copyright (c) 2015 The NetBSD Foundation, Inc. -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions -- are met: -- 1. Redistributions of source code must retain the above copyright -- notice, this list of conditions and the following disclaimer. -- 2. Redistributions in binary form must reproduce the above copyright -- notice, this list of conditions and the following disclaimer in the -- documentation and/or other materials provided with the distribution. -- -- THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS -- ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED -- TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -- PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS -- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR -- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF -- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS -- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN -- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) -- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE -- POSSIBILITY OF SUCH DAMAGE. -- -- -- Commentary: -- A happy number is a number defined by the following process: Starting with -- any positive integer, replace the number by the sum of the squares of its -- digits, and repeat the process until the number equals 1 (where it will -- stay), or it loops endlessly in a cycle which does not include 1. Those -- numbers for which this process ends in 1 are happy numbers, while those that -- do not end in 1 are unhappy numbers (or sad numbers). -- -- For more information on happy numbers, and the algorithms, see -- http://en.wikipedia.org/wiki/Happy_number -- -- The happy number generator is here only to have something that the user -- can read from our device. Any other arbitrary data generator could -- have been used. The algorithm is not critical to the implementation -- of the module. local HAPPY_NUMBER = 1 -- If n is not happy then its sequence ends in the cycle: -- 4, 16, 37, 58, 89, 145, 42, 20, 4, ... local SAD_NUMBER = 4 -- This following algorithm is designed for numbers of the integer type. -- Integer numbers are used by default in the NetBSD kernel, as there would be -- need for additional overhead in context-switch with support for floats. function dsum(n) local sum = 0 while n > 0 do local x = n % 10 sum = sum + (x * x) n = n / 10 end return sum end function is_happy(n) while true do local total = dsum(n) if total == HAPPY_NUMBER then return 1 end if total == SAD_NUMBER then return 0 end n = total end end @ 1.1.12.1 log @file happy.lua was added on branch nick-nhusb on 2017-08-28 17:53:10 +0000 @ text @d1 77 @ 1.1.12.2 log @Sync with HEAD @ text @a0 77 -- $NetBSD: happy.lua,v 1.1 2017/04/15 04:27:30 kamil Exp $ -- -- Copyright (c) 2015 The NetBSD Foundation, Inc. -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions -- are met: -- 1. Redistributions of source code must retain the above copyright -- notice, this list of conditions and the following disclaimer. -- 2. Redistributions in binary form must reproduce the above copyright -- notice, this list of conditions and the following disclaimer in the -- documentation and/or other materials provided with the distribution. -- -- THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS -- ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED -- TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -- PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS -- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR -- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF -- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS -- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN -- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) -- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE -- POSSIBILITY OF SUCH DAMAGE. -- -- -- Commentary: -- A happy number is a number defined by the following process: Starting with -- any positive integer, replace the number by the sum of the squares of its -- digits, and repeat the process until the number equals 1 (where it will -- stay), or it loops endlessly in a cycle which does not include 1. Those -- numbers for which this process ends in 1 are happy numbers, while those that -- do not end in 1 are unhappy numbers (or sad numbers). -- -- For more information on happy numbers, and the algorithms, see -- http://en.wikipedia.org/wiki/Happy_number -- -- The happy number generator is here only to have something that the user -- can read from our device. Any other arbitrary data generator could -- have been used. The algorithm is not critical to the implementation -- of the module. local HAPPY_NUMBER = 1 -- If n is not happy then its sequence ends in the cycle: -- 4, 16, 37, 58, 89, 145, 42, 20, 4, ... local SAD_NUMBER = 4 -- This following algorithm is designed for numbers of the integer type. -- Integer numbers are used by default in the NetBSD kernel, as there would be -- need for additional overhead in context-switch with support for floats. function dsum(n) local sum = 0 while n > 0 do local x = n % 10 sum = sum + (x * x) n = n / 10 end return sum end function is_happy(n) while true do local total = dsum(n) if total == HAPPY_NUMBER then return 1 end if total == SAD_NUMBER then return 0 end n = total end end @ 1.1.2.1 log @file happy.lua was added on branch bouyer-socketcan on 2017-04-15 04:27:31 +0000 @ text @d1 77 @ 1.1.2.2 log @1043943 @ text @a0 77 -- $NetBSD: happy.lua,v 1.1 2017/04/15 04:27:30 kamil Exp $ -- -- Copyright (c) 2015 The NetBSD Foundation, Inc. -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions -- are met: -- 1. Redistributions of source code must retain the above copyright -- notice, this list of conditions and the following disclaimer. -- 2. Redistributions in binary form must reproduce the above copyright -- notice, this list of conditions and the following disclaimer in the -- documentation and/or other materials provided with the distribution. -- -- THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS -- ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED -- TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -- PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS -- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR -- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF -- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS -- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN -- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) -- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE -- POSSIBILITY OF SUCH DAMAGE. -- -- -- Commentary: -- A happy number is a number defined by the following process: Starting with -- any positive integer, replace the number by the sum of the squares of its -- digits, and repeat the process until the number equals 1 (where it will -- stay), or it loops endlessly in a cycle which does not include 1. Those -- numbers for which this process ends in 1 are happy numbers, while those that -- do not end in 1 are unhappy numbers (or sad numbers). -- -- For more information on happy numbers, and the algorithms, see -- http://en.wikipedia.org/wiki/Happy_number -- -- The happy number generator is here only to have something that the user -- can read from our device. Any other arbitrary data generator could -- have been used. The algorithm is not critical to the implementation -- of the module. local HAPPY_NUMBER = 1 -- If n is not happy then its sequence ends in the cycle: -- 4, 16, 37, 58, 89, 145, 42, 20, 4, ... local SAD_NUMBER = 4 -- This following algorithm is designed for numbers of the integer type. -- Integer numbers are used by default in the NetBSD kernel, as there would be -- need for additional overhead in context-switch with support for floats. function dsum(n) local sum = 0 while n > 0 do local x = n % 10 sum = sum + (x * x) n = n / 10 end return sum end function is_happy(n) while true do local total = dsum(n) if total == HAPPY_NUMBER then return 1 end if total == SAD_NUMBER then return 0 end n = total end end @ 1.1.4.1 log @file happy.lua was added on branch pgoyette-localcount on 2017-04-26 02:53:28 +0000 @ text @d1 77 @ 1.1.4.2 log @Sync with HEAD @ text @a0 77 -- $NetBSD: happy.lua,v 1.1 2017/04/15 04:27:30 kamil Exp $ -- -- Copyright (c) 2015 The NetBSD Foundation, Inc. -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions -- are met: -- 1. Redistributions of source code must retain the above copyright -- notice, this list of conditions and the following disclaimer. -- 2. Redistributions in binary form must reproduce the above copyright -- notice, this list of conditions and the following disclaimer in the -- documentation and/or other materials provided with the distribution. -- -- THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS -- ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED -- TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR -- PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS -- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR -- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF -- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS -- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN -- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) -- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE -- POSSIBILITY OF SUCH DAMAGE. -- -- -- Commentary: -- A happy number is a number defined by the following process: Starting with -- any positive integer, replace the number by the sum of the squares of its -- digits, and repeat the process until the number equals 1 (where it will -- stay), or it loops endlessly in a cycle which does not include 1. Those -- numbers for which this process ends in 1 are happy numbers, while those that -- do not end in 1 are unhappy numbers (or sad numbers). -- -- For more information on happy numbers, and the algorithms, see -- http://en.wikipedia.org/wiki/Happy_number -- -- The happy number generator is here only to have something that the user -- can read from our device. Any other arbitrary data generator could -- have been used. The algorithm is not critical to the implementation -- of the module. local HAPPY_NUMBER = 1 -- If n is not happy then its sequence ends in the cycle: -- 4, 16, 37, 58, 89, 145, 42, 20, 4, ... local SAD_NUMBER = 4 -- This following algorithm is designed for numbers of the integer type. -- Integer numbers are used by default in the NetBSD kernel, as there would be -- need for additional overhead in context-switch with support for floats. function dsum(n) local sum = 0 while n > 0 do local x = n % 10 sum = sum + (x * x) n = n / 10 end return sum end function is_happy(n) while true do local total = dsum(n) if total == HAPPY_NUMBER then return 1 end if total == SAD_NUMBER then return 0 end n = total end end @