{"payload":{"feedbackUrl":"https://github.com/orgs/community/discussions/53140","repo":{"id":613307734,"defaultBranch":"master","name":"fibdrv","ownerLogin":"ericlai1021","currentUserCanPush":false,"isFork":true,"isEmpty":false,"createdAt":"2023-03-13T10:15:15.000Z","ownerAvatar":"https://avatars.githubusercontent.com/u/53555490?v=4","public":true,"private":false,"isOrgOwned":false},"refInfo":{"name":"","listCacheKey":"v0:1678702522.752865","currentOid":""},"activityList":{"items":[{"before":"3a662bbfef3dcd622ee7798a7d27245cc1800289","after":"7da1e70a5fe46e06f633032244696611f6a554bc","ref":"refs/heads/master","pushedAt":"2024-03-16T15:34:13.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ericlai1021","name":null,"path":"/ericlai1021","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/53555490?s=80&v=4"},"commit":{"message":"Refactor left shift operation\n\nadd bn_swap() to replace bn_cpy() in bn_lshift()","shortMessageHtmlLink":"Refactor left shift operation"}},{"before":"77b412ad73c6197e4fdd7b6c67bbd08fe292b7e4","after":"3a662bbfef3dcd622ee7798a7d27245cc1800289","ref":"refs/heads/master","pushedAt":"2024-03-12T03:59:03.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ericlai1021","name":null,"path":"/ericlai1021","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/53555490?s=80&v=4"},"commit":{"message":"Refactor fast doubling calculation\n\nmake fast doubling calculation more concise.","shortMessageHtmlLink":"Refactor fast doubling calculation"}},{"before":"112cf1bda83bb727ec23fc80a3308174584cfd53","after":"77b412ad73c6197e4fdd7b6c67bbd08fe292b7e4","ref":"refs/heads/master","pushedAt":"2024-02-02T07:28:33.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ericlai1021","name":null,"path":"/ericlai1021","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/53555490?s=80&v=4"},"commit":{"message":"Add kernel time estimation\n\nuse ktime APIs.","shortMessageHtmlLink":"Add kernel time estimation"}},{"before":"6b38aaa3ae0248ab2bd14ad17aba2cc0ebe50aae","after":"112cf1bda83bb727ec23fc80a3308174584cfd53","ref":"refs/heads/master","pushedAt":"2024-02-02T06:25:52.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ericlai1021","name":null,"path":"/ericlai1021","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/53555490?s=80&v=4"},"commit":{"message":"Refactor kernel module code\n\nfix module building failed for kernel version >= v6.4.\nflush kernel messages immediately.\nsimplify character device registration.","shortMessageHtmlLink":"Refactor kernel module code"}},{"before":"dfbf59f1f81c56b9c16c491eda02ab1ad1c58389","after":"6b38aaa3ae0248ab2bd14ad17aba2cc0ebe50aae","ref":"refs/heads/master","pushedAt":"2023-05-12T16:36:08.399Z","pushType":"push","commitsCount":1,"pusher":{"login":"ericlai1021","name":null,"path":"/ericlai1021","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/53555490?s=80&v=4"},"commit":{"message":"Refactor fast doubling algorithm\n\nUpdated the fast doubling algorithm to utilize the big number API for handling larger numbers. This enhancement ensures accurate calculations of Fibonacci numbers up to the 3000th term.","shortMessageHtmlLink":"Refactor fast doubling algorithm"}},{"before":"32fe183018bd55aac75fef11c4b2cd56b4e605c3","after":"dfbf59f1f81c56b9c16c491eda02ab1ad1c58389","ref":"refs/heads/master","pushedAt":"2023-05-12T05:51:45.767Z","pushType":"push","commitsCount":1,"pusher":{"login":"ericlai1021","name":null,"path":"/ericlai1021","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/53555490?s=80&v=4"},"commit":{"message":"Implement the big number API\n\nTo address the issue of overflow when calculating the Fibonacci number, I have introduced the concept of big numbers. This involves breaking down the number into multiple unsigned integers and developing essential operations to support big numbers, such as bn_add, bn_sub, bn_mul, and others.\n\nWith the inclusion of the bignum APIs, the Fibonacci device driver can now accurately calculate Fibonacci numbers up to at least the 3000th term (subject to available memory). The bignum APIs are defined in bn.h, and the corresponding source code can be found in bn.c.\n\nMoreover, the read file operation to /dev/fibonacci has been updated to read the nth Fibonacci number into the user buffer, represented as a decimal string. It also returns the number of bytes that could not be copied.","shortMessageHtmlLink":"Implement the big number API"}},{"before":"7bb7912a3f4265467fab6dc1edbd3d42913aca2e","after":"32fe183018bd55aac75fef11c4b2cd56b4e605c3","ref":"refs/heads/master","pushedAt":"2023-04-16T08:08:43.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ericlai1021","name":null,"path":"/ericlai1021","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/53555490?s=80&v=4"},"commit":{"message":"Implement fast doubling algorithm\n\nTo improve the performance of calculating Fibonacci numbers, I implemented the fast doubling algorithm.\n\nIn addition, I used the clz (count leading zeros) instruction to count the input number's leading 0's bit, further optimizing the calculation.\n\nAs some systems may not support the clz instruction, I also added a version of the code that does not use it. This can be found in the comment section of the code.","shortMessageHtmlLink":"Implement fast doubling algorithm"}},{"before":"ce1ed33d7a3b2da6d8d2ca73577bf5f86d62d748","after":"7bb7912a3f4265467fab6dc1edbd3d42913aca2e","ref":"refs/heads/master","pushedAt":"2023-04-16T05:23:31.000Z","pushType":"push","commitsCount":1,"pusher":{"login":"ericlai1021","name":null,"path":"/ericlai1021","primaryAvatarUrl":"https://avatars.githubusercontent.com/u/53555490?s=80&v=4"},"commit":{"message":"Initial commit\n\nUse high-resolution timer API to measure the time when calculating Fibonacci number","shortMessageHtmlLink":"Initial commit"}}],"hasNextPage":false,"hasPreviousPage":false,"activityType":"all","actor":null,"timePeriod":"all","sort":"DESC","perPage":30,"cursor":"djE6ks8AAAAEF2v_XgA","startCursor":null,"endCursor":null}},"title":"Activity · ericlai1021/fibdrv"}