{"push_id":576110253,"size":6,"distinct_size":4,"ref":"refs/heads/coverity-issues-5","head":"c5cea839cc73447d89ca76c9824975e740841ae2","before":"b0c31ee8dbb825326d65ae73466c77c14fc498ea","commits":[{"sha":"1b055c54a012fbf1e3758505b382dba7958bed38","author":{"email":"224e6c20330e5fdd86c45c03a865a241c1b7bd00@gmail.com","name":"Justin M. Keyes"},"message":"FEAT_SIGNS: restore :signs wildmenu, and add test.","distinct":false,"url":"https://api.github.com/repos/elmart/neovim/commits/1b055c54a012fbf1e3758505b382dba7958bed38"},{"sha":"fd636fc6dcd8a547daab1544432877bf8efa0c1e","author":{"email":"25a3b6cc85a8cde49f8b0f9aa21c050bc04072d4@sethish.com","name":"Seth Woodworth"},"message":"runtime: make the spellfile creation use .nvim folder #1990","distinct":false,"url":"https://api.github.com/repos/elmart/neovim/commits/fd636fc6dcd8a547daab1544432877bf8efa0c1e"},{"sha":"57a8768a452a041301539fa3d44fcaf2c992240a","author":{"email":"5c31185ebcdcfd329397d45474b62c2634b88685@gmail.com","name":"Eliseo Martínez"},"message":"coverity/72768: Negative array index read: FP.\n\nProblem    : Negative array index read @ 5822.\nDiagnostic : False positive.\nRationale  : Problem occurs if for loop does not find any match, which\n             implies shl->lnum == 0, and then we enter the\n             `if (shl->lnum == lnum)` branch, which implies lnum == 0 as\n             well. That's not possible, as function should not be called\n             with lnum == 0.\nResolution : Assert function precondition.","distinct":true,"url":"https://api.github.com/repos/elmart/neovim/commits/57a8768a452a041301539fa3d44fcaf2c992240a"},{"sha":"e404572302f45c1f234fe8c4f846e737e4d10a2c","author":{"email":"5c31185ebcdcfd329397d45474b62c2634b88685@gmail.com","name":"Eliseo Martínez"},"message":"coverity/13814: Uninitialized scalar variable: FP.\n\nProblem    : Uninitialized scalar variable @ 5511.\nDiagnostic : False positive.\nRationale  : Suggested error path assumes both enc_utf8 and enc_dbcs\n             being true. That shouldn't happen.\nResolution : Assert program invariant.","distinct":true,"url":"https://api.github.com/repos/elmart/neovim/commits/e404572302f45c1f234fe8c4f846e737e4d10a2c"},{"sha":"2f98d544e40ee624af7e582218d536da89d2d97c","author":{"email":"5c31185ebcdcfd329397d45474b62c2634b88685@gmail.com","name":"Eliseo Martínez"},"message":"coverity/13683: Out-of-bounds access: RI.\n\nProblem    : Out-of-bounds access @ 3790.\nDiagnostic : Real issue.\nRationale  : str is constructed step by step, str_l growing each time.\n             str_m is the maximum length of str. So, at every step,\n             avail is computed to see if the piece to be added fits in.\n             If not, piece is truncated to a max of `avail`, so that str\n             stays in bounds. Such blocks where pieces are added are of\n             the form `if (str_l < str_m)`. It then follows that once\n             one of those pieces exhausts available space on str, no\n             other such block should be entered. Formally:\n\n               str_l < strl_m && avail = str_m - str_l && x >= avail\n                                    -->\n                             str_l + x >= str_m\n\n             Now, suggested error path successively enters blocks where\n             str is exhausted. We're not sure if coverity just fails to\n             follow above implications, or, on the contrary, it's aware\n             of them, but it's signaling the more complex possibility of\n             implications not being fulfilled because of possible\n             arithmetic overflows. We opt then to assume this last case,\n             as the possibility is in fact there.\nResolution : Refactor code so that tracked condition doesn't depend on\n             arithmetic implications. Check for overflow.","distinct":true,"url":"https://api.github.com/repos/elmart/neovim/commits/2f98d544e40ee624af7e582218d536da89d2d97c"},{"sha":"c5cea839cc73447d89ca76c9824975e740841ae2","author":{"email":"5c31185ebcdcfd329397d45474b62c2634b88685@gmail.com","name":"Eliseo Martínez"},"message":"coverity/13746: Negative array index write: FP.\n\nProblem    : Negative array index write @ 1042.\nDiagnostic : False positive.\nRationale  : Suggested error path cannot occur: idx should be >= 0, as\n             previous check ensures there's a matching while/for.\nResolution : Assert idx >= 0.","distinct":true,"url":"https://api.github.com/repos/elmart/neovim/commits/c5cea839cc73447d89ca76c9824975e740841ae2"}]}