rt-thread.git/src/memheap.c, branch v4.0.0 Unnamed repository; edit this file 'description' to name the repository. http://cgit.235523.xyz/rt-thread.git/atom/src/memheap.c?h=v4.0.0 2018-12-13T06:54:26Z Fix the value width issue under 32/64 bit arch. 2018-12-13T06:54:26Z Bernard Xiong bernard.xiong@gmail.com 2018-12-13T06:54:26Z urn:sha1:1f37de29c4ee4dac488aa9c4f8f0990263f94c1a [Kernel] Add 64bit CPU support. 2018-10-25T22:35:42Z Bernard Xiong bernard.xiong@gmail.com 2018-10-25T22:35:42Z urn:sha1:484afe9d2cb07c9e552ff905328eecb7170e8c8a [Kernel] Update to Apache License v2.0 2018-09-14T14:37:43Z Bernard Xiong bernard.xiong@gmail.com 2018-09-14T14:37:43Z urn:sha1:41f7f2c28411472cf99cdedf0abaaab823ba185f Update license for RT-Thread kernel. [kernel] add assert to memheap object 2018-07-11T10:02:25Z liang yongxiang tanekliang@gmail.com 2018-07-10T02:10:45Z urn:sha1:0509af9319377bdd60d5fdc0ce780d247093b3fc [Kernel][memheap] fix rt_realloc bugs 2018-03-28T02:19:32Z liang yongxiang tanekliang@gmail.com 2018-03-28T02:17:24Z urn:sha1:b09445cbfe1e8105b244a9e1819c2826d1be14e9 - missing free old memory after malloc new - free memory when new size is zero [Kernel] Use rt_object_get_information to get object chain 2017-12-11T23:36:37Z Bernard Xiong bernard.xiong@gmail.com 2017-12-11T23:36:37Z urn:sha1:2f409c85f1faf3662c9ee99eed78e460286ec046 根据documentation/coding_style_cn.txt约定 对内核src和include目录下的文件代码进行格式化 2017-09-15T03:02:24Z emlslxl emlslxl@126.com 2017-09-15T03:02:24Z urn:sha1:e521decf2eaf88c662fba12b2d9f07b68bd4979c memheap: check the USED bit in rt_memheap_free 2015-04-08T08:39:50Z Grissiom chaos.proton@gmail.com 2015-04-08T08:37:10Z urn:sha1:2d3b2f1e9466b7759ab2a663a2b56e49e3f9852d This will ease the debugging of double-free bug. memheap: check against over written in rt_memheap_free 2015-01-16T03:41:20Z Grissiom chaos.proton@gmail.com 2015-01-16T03:41:20Z urn:sha1:f8c171d5ad752045a243e846718585ec1c671771 memheap: dont alloc/memcpy when there is next node is enough for realloc 2013-07-15T03:47:55Z Grissiom chaos.proton@gmail.com 2013-07-15T03:29:58Z urn:sha1:c3a39444daaa72c3c9b3e0001d0550cf56cca74d When realloc a bigger space and the next node is free and big enough, we should directly relocate the next node instead of doing alloc/memcpy. The new method not only faster in this cases, it would avoid memory fragment as well.