CircuitPython - a Python implementation for teaching coding with microcontrollers https://git.suspectdevices.com/suspect-devices/circuitpython/atom?h=6.0.1 2020-07-06T18:16:25+00:00 2020-07-06T18:16:25+00:00 Diego Elio Pettenò flameeyes@flameeyes.com 2020-06-03T22:40:05+00:00 urn:sha1:34b4993d63a6b576f29d624385c681f679b4124c 2020-01-13T04:32:51+00:00 Dan Halbert halbert@halwitz.org 2020-01-13T04:32:51+00:00 urn:sha1:9e7f8743c2725c1818033e348e8d542ec7539045 2019-11-22T18:47:13+00:00 David Grimes dgrimes@navisite.com 2019-11-22T18:47:13+00:00 urn:sha1:f13ba7e8d9048802e960b45264f7d85cc16a1a4d 2019-06-06T21:49:32+00:00 Dan Halbert halbert@halwitz.org 2019-06-06T21:49:32+00:00 urn:sha1:62de2506e47c14a71c7a9fe04360697ccb966aeb 2019-04-08T23:58:50+00:00 Scott Shawcroft scott@tannewt.org 2019-04-08T23:58:50+00:00 urn:sha1:0f003ac5b8312fafb120e86e05eefd2431014d8c 2019-03-12T18:18:26+00:00 Scott Shawcroft scott@tannewt.org 2019-03-08T23:29:14+00:00 urn:sha1:03be42ab847f04a89d207d98fdb28048cfedf72d 2018-07-11T20:45:30+00:00 Dan Halbert halbert@halwitz.org 2018-07-11T20:45:30+00:00 urn:sha1:7c219600a246d8956d0b23ea3f5d125a820e6b6a 2018-06-12T01:55:29+00:00 Damien George damien.p.george@gmail.com 2018-05-31T13:10:48+00:00 urn:sha1:522ea80f06a80fd799bd57de351373ceaeeae325 This patch adds the gc_sweep_all() function which does a garbage collection without tracing any root pointers, so frees all the memory, and most importantly runs any remaining finalisers. This helps primarily for soft reset: it will close any open files, any open sockets, and help to get the system back to a clean state upon soft reset. 2018-01-24T18:33:46+00:00 Scott Shawcroft scott.shawcroft@gmail.com 2018-01-24T00:22:05+00:00 urn:sha1:416abe33ed44e44d8f75342731080217e123278b This adapts the allocation process to start from either end of the heap when searching for free space. The default behavior is identical to the existing behavior where it starts with the lowest block and looks higher. Now it can also look from the highest block and lower depending on the long_lived parameter to gc_alloc. As the heap fills, the two sections may overlap. When they overlap, a collect may be triggered in order to keep the long lived section compact. However, free space is always eligable for each type of allocation. By starting from either of the end of the heap we have ability to separate short lived objects from long lived ones. This separation reduces heap fragmentation because long lived objects are easy to densely pack. Most objects are short lived initially but may be made long lived when they are referenced by a type or module. This involves copying the memory and then letting the collect phase free the old portion. QSTR pools and chunks are always long lived because they are never freed. The reallocation, collection and free processes are largely unchanged. They simply also maintain an index to the highest free block as well as the lowest. These indices are used to speed up the allocation search until the next collect. In practice, this change may slightly slow down import statements with the benefit that memory is much less fragmented afterwards. For example, a test import into a 20k heap that leaves ~6k free previously had the largest continuous free space of ~400 bytes. After this change, the largest continuous free space is over 3400 bytes. 2017-07-31T08:35:40+00:00 Alexander Steffen devel.20.webmeister@spamgourmet.com 2017-06-30T07:22:17+00:00 urn:sha1:55f33240f3d7051d4213629e92437a36f1fac50e There were several different spellings of MicroPython present in comments, when there should be only one.