{"push_id":636057222,"size":139,"distinct_size":139,"ref":"refs/heads/master","head":"54e514b91b95d6441c12a7955addfb9f9d2afc65","before":"4fc8adcfec3da639da76e8314c9ccefe5bf9a045","commits":[{"sha":"396ada68acefc4f90cf1f05d4275913834af5d93","author":{"email":"320bca71fc381a4a025636043ca86e734e31cf8b@nod.at","name":"Richard Weinberger"},"message":"alpha: forward declare struct pt_regs in processor.h\n\nRemoval of exec domains uncovered this new warning.  processor.h re-used\nstruct pt_regs from personality.h which is now gone.\n\n  ./arch/alpha/include/asm/processor.h:47:33: warning: 'struct pt_regs' declared inside parameter list [enabled by default]\n\nSigned-off-by: Richard Weinberger <richard@nod.at>\nCc: Richard Henderson <rth@twiddle.net>\nCc: Ivan Kokshaysky <ink@jurassic.park.msu.ru>\nCc: Matt Turner <mattst88@gmail.com>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/396ada68acefc4f90cf1f05d4275913834af5d93"},{"sha":"2c57a0e233d72f8c2e2404560dcf0188ac3cf5d7","author":{"email":"d4c98dcfb8a2d1a780b73ae0523ba1408042900b@gmail.com","name":"Yury Norov"},"message":"lib: find_*_bit reimplementation\n\nThis patchset does rework to find_bit function family to achieve better\nperformance, and decrease size of text.  All rework is done in patch 1.\nPatches 2 and 3 are about code moving and renaming.\n\nIt was boot-tested on x86_64 and MIPS (big-endian) machines.\nPerformance tests were ran on userspace with code like this:\n\n\t/* addr[] is filled from /dev/urandom */\n\tstart = clock();\n\twhile (ret < nbits)\n\t\tret = find_next_bit(addr, nbits, ret + 1);\n\n\tend = clock();\n\tprintf(\"%ld\\t\", (unsigned long) end - start);\n\nOn Intel(R) Core(TM) i7-3770 CPU @ 3.40GHz measurements are: (for\nfind_next_bit, nbits is 8M, for find_first_bit - 80K)\n\n\tfind_next_bit:\t\tfind_first_bit:\n\tnew\tcurrent\t\tnew\tcurrent\n\t26932\t43151\t\t14777\t14925\n\t26947\t43182\t\t14521\t15423\n\t26507\t43824\t\t15053\t14705\n\t27329\t43759\t\t14473\t14777\n\t26895\t43367\t\t14847\t15023\n\t26990\t43693\t\t15103\t15163\n\t26775\t43299\t\t15067\t15232\n\t27282\t42752\t\t14544\t15121\n\t27504\t43088\t\t14644\t14858\n\t26761\t43856\t\t14699\t15193\n\t26692\t43075\t\t14781\t14681\n\t27137\t42969\t\t14451\t15061\n\t...\t\t\t...\n\nfind_next_bit performance gain is 35-40%;\nfind_first_bit - no measurable difference.\n\nOn ARM machine, there is arch-specific implementation for find_bit.\n\nThanks a lot to George Spelvin and Rasmus Villemoes for hints and\nhelpful discussions.\n\nThis patch (of 3):\n\nNew implementations takes less space in source file (see diffstat) and in\nobject.  For me it's 710 vs 453 bytes of text.  It also shows better\nperformance.\n\nfind_last_bit description fixed due to obvious typo.\n\n[akpm@linux-foundation.org: include linux/bitmap.h, per Rasmus]\nSigned-off-by: Yury Norov <yury.norov@gmail.com>\nReviewed-by: Rasmus Villemoes <linux@rasmusvillemoes.dk>\nReviewed-by: George Spelvin <linux@horizon.com>\nCc: Alexey Klimov <klimov.linux@gmail.com>\nCc: David S. Miller <davem@davemloft.net>\nCc: Daniel Borkmann <dborkman@redhat.com>\nCc: Hannes Frederic Sowa <hannes@stressinduktion.org>\nCc: Lai Jiangshan <laijs@cn.fujitsu.com>\nCc: Mark Salter <msalter@redhat.com>\nCc: AKASHI Takahiro <takahiro.akashi@linaro.org>\nCc: Thomas Graf <tgraf@suug.ch>\nCc: Valentin Rothberg <valentinrothberg@gmail.com>\nCc: Chris Wilson <chris@chris-wilson.co.uk>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/2c57a0e233d72f8c2e2404560dcf0188ac3cf5d7"},{"sha":"8f6f19dd5143aa59139deeb885a8ed5e2d937e21","author":{"email":"d4c98dcfb8a2d1a780b73ae0523ba1408042900b@gmail.com","name":"Yury Norov"},"message":"lib: move find_last_bit to lib/find_next_bit.c\n\nCurrently all 'find_*_bit' family is located in lib/find_next_bit.c,\nexcept 'find_last_bit', which is in lib/find_last_bit.c. It seems,\nthere's no major benefit to have it separated.\n\nSigned-off-by: Yury Norov <yury.norov@gmail.com>\nReviewed-by: Rasmus Villemoes <linux@rasmusvillemoes.dk>\nReviewed-by: George Spelvin <linux@horizon.com>\nCc: Alexey Klimov <klimov.linux@gmail.com>\nCc: David S. Miller <davem@davemloft.net>\nCc: Daniel Borkmann <dborkman@redhat.com>\nCc: Hannes Frederic Sowa <hannes@stressinduktion.org>\nCc: Lai Jiangshan <laijs@cn.fujitsu.com>\nCc: Mark Salter <msalter@redhat.com>\nCc: AKASHI Takahiro <takahiro.akashi@linaro.org>\nCc: Thomas Graf <tgraf@suug.ch>\nCc: Valentin Rothberg <valentinrothberg@gmail.com>\nCc: Chris Wilson <chris@chris-wilson.co.uk>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/8f6f19dd5143aa59139deeb885a8ed5e2d937e21"},{"sha":"840620a1596a90636a44d6a593db4041bb28d52e","author":{"email":"d4c98dcfb8a2d1a780b73ae0523ba1408042900b@gmail.com","name":"Yury Norov"},"message":"lib: rename lib/find_next_bit.c to lib/find_bit.c\n\nThis file contains implementation for all find_*_bit{,_le}\nSo giving it more generic name looks reasonable.\n\nSigned-off-by: Yury Norov <yury.norov@gmail.com>\nReviewed-by: Rasmus Villemoes <linux@rasmusvillemoes.dk>\nReviewed-by: George Spelvin <linux@horizon.com>\nCc: Alexey Klimov <klimov.linux@gmail.com>\nCc: David S. Miller <davem@davemloft.net>\nCc: Daniel Borkmann <dborkman@redhat.com>\nCc: Hannes Frederic Sowa <hannes@stressinduktion.org>\nCc: Lai Jiangshan <laijs@cn.fujitsu.com>\nCc: Mark Salter <msalter@redhat.com>\nCc: AKASHI Takahiro <takahiro.akashi@linaro.org>\nCc: Thomas Graf <tgraf@suug.ch>\nCc: Valentin Rothberg <valentinrothberg@gmail.com>\nCc: Chris Wilson <chris@chris-wilson.co.uk>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/840620a1596a90636a44d6a593db4041bb28d52e"},{"sha":"7c43d9a30c527d9e06e2c55f82b56f28df43caed","author":{"email":"ba324ca7b1c77fc20bb970d5aff6eea9377918a5@rasmusvillemoes.dk","name":"Rasmus Villemoes"},"message":"lib/vsprintf.c: even faster binary to decimal conversion\n\nThe most expensive part of decimal conversion is the divisions by 10\n(albeit done using reciprocal multiplication with appropriately chosen\nconstants).  I decided to see if one could eliminate around half of\nthese multiplications by emitting two digits at a time, at the cost of a\n200 byte lookup table, and it does indeed seem like there is something\nto be gained, especially on 64 bits.  Microbenchmarking shows\nimprovements ranging from -50% (for numbers uniformly distributed in [0,\n2^64-1]) to -25% (for numbers heavily biased toward the smaller end, a\nmore realistic distribution).\n\nOn a larger scale, perf shows that top, one of the big consumers of /proc\ndata, uses 0.5-1.0% fewer cpu cycles.\n\nI had to jump through some hoops to get the 32 bit code to compile and run\non my 64 bit machine, so I'm not sure how relevant these numbers are, but\njust for comparison the microbenchmark showed improvements between -30%\nand -10%.\n\nThe bloat-o-meter costs are around 150 bytes (the generated code is a\nlittle smaller, so it's not the full 200 bytes) on both 32 and 64 bit.\nI'm aware that extra cache misses won't show up in a microbenchmark as\nused above, but on the other hand decimal conversions often happen in bulk\n(for example in the case of top).\n\nI have of course tested that the new code generates the same output as the\nold, for both the first and last 1e10 numbers in [0,2^64-1] and 4e9\n'random' numbers in-between.\n\nTest and verification code on github: https://github.com/Villemoes/dec.\n\nSigned-off-by: Rasmus Villemoes <linux@rasmusvillemoes.dk>\nTested-by: Jeff Epler <jepler@unpythonic.net>\nCc: \"Peter Zijlstra (Intel)\" <peterz@infradead.org>\nCc: Tejun Heo <tj@kernel.org>\nCc: Joe Perches <joe@perches.com>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/7c43d9a30c527d9e06e2c55f82b56f28df43caed"},{"sha":"a7a2c02a40151811609ad8cd3bf5c4fc516fece5","author":{"email":"34be3ca399e9e73d80098c083a5b58614c3ca6da@linux.vnet.ibm.com","name":"Sebastian Ott"},"message":"lib/dma-debug: fix bucket_find_contain()\n\nbucket_find_contain() will search the bucket list for a dma_debug_entry.\nWhen the entry isn't found it needs to search other buckets too, since\nonly the start address of a dma range is hashed (which might be in a\ndifferent bucket).\n\nA copy of the dma_debug_entry is used to get the previous hash bucket\nbut when its list is searched the original dma_debug_entry is to be used\nnot its modified copy.\n\nThis fixes false \"device driver tries to sync DMA memory it has not allocated\"\nwarnings.\n\nSigned-off-by: Sebastian Ott <sebott@linux.vnet.ibm.com>\nCc: Florian Fainelli <f.fainelli@gmail.com>\nCc: Horia Geanta <horia.geanta@freescale.com>\nCc: Jiri Kosina <jkosina@suse.cz>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/a7a2c02a40151811609ad8cd3bf5c4fc516fece5"},{"sha":"95d119528b0b8440a63bc13904e9873fc3a70503","author":{"email":"e5d45fddd9040473413b909b802f629a971ad04c@baylibre.com","name":"Bartosz Golaszewski"},"message":"util_macros.h: add find_closest() macro\n\nThis series unduplicates the code used to find the member in an array\nclosest to 'x'.\n\nThe first patch adds a macro implementing the algorithm in two flavors -\nfor arrays sorted in ascending and descending order.  The second updates\nDocumentation/CodingStyle on the naming convention for local variables in\nmacros resembling functions.  Other three patches replace duplicated code\nwith calls to one of these macros in some hwmon drivers.\n\nThis patch (of 5):\n\nSearching for the member of an array closest to 'x' is duplicated in\nseveral places.\n\nAdd a new include - util_macros.h - and two macros that implement this\nalgorithm for arrays sorted both in ascending and descending order.\n\nUses linear search.\n\nSigned-off-by: Bartosz Golaszewski <bgolaszewski@baylibre.com>\nCc: Guenter Roeck <linux@roeck-us.net>\nCc: Steven Rostedt <rostedt@goodmis.org>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/95d119528b0b8440a63bc13904e9873fc3a70503"},{"sha":"f2027543b9cb47e1853d8c34fe931e2fcee5cb65","author":{"email":"e5d45fddd9040473413b909b802f629a971ad04c@baylibre.com","name":"Bartosz Golaszewski"},"message":"documentation: update CodingStyle on local variables naming in macros\n\nDescribe proper naming convention for local variables in macros\nresembling functions.\n\nSigned-off-by: Bartosz Golaszewski <bgolaszewski@baylibre.com>\nCc: Guenter Roeck <linux@roeck-us.net>\nCc: Steven Rostedt <rostedt@goodmis.org>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/f2027543b9cb47e1853d8c34fe931e2fcee5cb65"},{"sha":"d38df34e3f0ea1e65c7db5d33d132dc14da0009a","author":{"email":"e5d45fddd9040473413b909b802f629a971ad04c@baylibre.com","name":"Bartosz Golaszewski"},"message":"hwmon: (ina2xx) replace ina226_avg_bits() with find_closest()\n\nUse find_closest() to locate the closest average in ina226_avg_tab.\n\nSigned-off-by: Bartosz Golaszewski <bgolaszewski@baylibre.com>\nCc: Guenter Roeck <linux@roeck-us.net>\nCc: Steven Rostedt <rostedt@goodmis.org>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/d38df34e3f0ea1e65c7db5d33d132dc14da0009a"},{"sha":"0f3721c51ec5643e00f07dd3bbc5712c72fc62b2","author":{"email":"e5d45fddd9040473413b909b802f629a971ad04c@baylibre.com","name":"Bartosz Golaszewski"},"message":"hwmon: (lm85) use find_closest() in x_TO_REG() functions\n\nReplace RANGE_TO_REG() and FREQ_TO_REG() implementations with\ncalls to find_closest().\n\nSigned-off-by: Bartosz Golaszewski <bgolaszewski@baylibre.com>\nCc: Guenter Roeck <linux@roeck-us.net>\nCc: Steven Rostedt <rostedt@goodmis.org>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/0f3721c51ec5643e00f07dd3bbc5712c72fc62b2"},{"sha":"cdb1dc3f1ca5c5899e5fa186afe20390bd8c00dc","author":{"email":"e5d45fddd9040473413b909b802f629a971ad04c@baylibre.com","name":"Bartosz Golaszewski"},"message":"hwmon: (w83795) use find_closest_descending() in pwm_freq_to_reg()\n\nReplace the loop iterating over pwm_freq_cksel0 with a call to\nfind_closest_descending().\n\nSigned-off-by: Bartosz Golaszewski <bgolaszewski@baylibre.com>\nCc: Guenter Roeck <linux@roeck-us.net>\nCc: Steven Rostedt <rostedt@goodmis.org>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/cdb1dc3f1ca5c5899e5fa186afe20390bd8c00dc"},{"sha":"675cf53c1deaffadc7b6a0b4afe6cdafec86bedb","author":{"email":"ba324ca7b1c77fc20bb970d5aff6eea9377918a5@rasmusvillemoes.dk","name":"Rasmus Villemoes"},"message":"lib/vsprintf.c: improve put_dec_trunc8 slightly\n\nI hadn't had enough coffee when I wrote this. Currently, the final\nincrement of buf depends on the value loaded from the table, and\ncauses gcc to emit a cmov immediately before the return. It is smarter\nto let it depend on r, since the increment can then be computed in\nparallel with the final load/store pair. It also shaves 16 bytes of\n.text.\n\nSigned-off-by: Rasmus Villemoes <linux@rasmusvillemoes.dk>\nCc: Tejun Heo <tj@kernel.org>\nCc: Peter Zijlstra <a.p.zijlstra@chello.nl>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/675cf53c1deaffadc7b6a0b4afe6cdafec86bedb"},{"sha":"f766093ecb647f5a87bfa456715abbbccee547ce","author":{"email":"cc0c468e3dcd5ee425259d298d905a60f8330bcf@arm.com","name":"Javi Merino"},"message":"kernel.h: implement DIV_ROUND_CLOSEST_ULL\n\nWe have grown a number of different implementations of\nDIV_ROUND_CLOSEST_ULL throughout the kernel.  Move the i915 one to\nkernel.h so that it can be reused.\n\nSigned-off-by: Javi Merino <javi.merino@arm.com>\nReviewed-by: Jeff Epler <jepler@unpythonic.net>\nCc: Jani Nikula <jani.nikula@linux.intel.com>\nCc: David Airlie <airlied@linux.ie>\nCc: Guenter Roeck <linux@roeck-us.net>\nAcked-by: Daniel Vetter <daniel.vetter@ffwll.ch>\nCc: \"Rafael J. Wysocki\" <rafael.j.wysocki@intel.com>\nCc: Alex Elder <elder@linaro.org>\nCc: Antti Palosaari <crope@iki.fi>\nCc: Javi Merino <javi.merino@arm.com>\nCc: Mauro Carvalho Chehab <mchehab@osg.samsung.com>\nCc: Mel Gorman <mgorman@suse.de>\nCc: Mike Turquette <mturquette@linaro.org>\nCc: Stephen Boyd <sboyd@codeaurora.org>\nCc: Stephen Hemminger <shemminger@linux-foundation.org>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/f766093ecb647f5a87bfa456715abbbccee547ce"},{"sha":"aa7762010a4340a12a87a54b7a402adcdce8cfa9","author":{"email":"cc0c468e3dcd5ee425259d298d905a60f8330bcf@arm.com","name":"Javi Merino"},"message":"clk: bcm/kona: use DIV_ROUND_CLOSEST_ULL()\n\nNow that the kernel provides DIV_ROUND_CLOSEST_ULL(), drop the internal\nimplementation and use the kernel one.\n\nSigned-off-by: Javi Merino <javi.merino@arm.com>\nCc: Mike Turquette <mturquette@linaro.org>\nCc: Stephen Boyd <sboyd@codeaurora.org>\nAcked-by: Alex Elder <elder@linaro.org>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/aa7762010a4340a12a87a54b7a402adcdce8cfa9"},{"sha":"ee3c86f356b4dfc130442d0bd68ff2da2bd60538","author":{"email":"cc0c468e3dcd5ee425259d298d905a60f8330bcf@arm.com","name":"Javi Merino"},"message":"cpuidle: menu: use DIV_ROUND_CLOSEST_ULL()\n\nNow that the kernel provides DIV_ROUND_CLOSEST_ULL(), drop the internal\nimplementation and use the kernel one.\n\nSigned-off-by: Javi Merino <javi.merino@arm.com>\nAcked-by: Rafael J. Wysocki <rafael.j.wysocki@intel.com>\nCc: Mel Gorman <mgorman@suse.de>\nCc: Stephen Hemminger <shemminger@linux-foundation.org>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/ee3c86f356b4dfc130442d0bd68ff2da2bd60538"},{"sha":"512eb720c9892261d68f86ba880a55cdbb74710d","author":{"email":"cc0c468e3dcd5ee425259d298d905a60f8330bcf@arm.com","name":"Javi Merino"},"message":"media: cxd2820r: use DIV_ROUND_CLOSEST_ULL()\n\nNow that the kernel provides DIV_ROUND_CLOSEST_ULL(), drop the internal\nimplementation and use the kernel one.\n\nSigned-off-by: Javi Merino <javi.merino@arm.com>\nCc: Mauro Carvalho Chehab <mchehab@osg.samsung.com>\nAcked-by: Antti Palosaari <crope@iki.fi>\nReviewed-by: Antti Palosaari <crope@iki.fi>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/512eb720c9892261d68f86ba880a55cdbb74710d"},{"sha":"d48502eacd8934b79c3e62f7858c79fa6422398b","author":{"email":"cc0c468e3dcd5ee425259d298d905a60f8330bcf@arm.com","name":"Javi Merino"},"message":"ASoC: pcm512x: use DIV_ROUND_CLOSEST_ULL() from kernel.h\n\nNow that the kernel provides DIV_ROUND_CLOSEST_ULL(), drop the internal\nimplementation and use the kernel one.\n\nSigned-off-by: Javi Merino <javi.merino@arm.com>\nReported-by: kbuild test robot <fengguang.wu@intel.com>\nCc: Peter Rosin <peda@axentia.se>\nAcked-by: Mark Brown <broonie@kernel.org>\nCc: Liam Girdwood <lgirdwood@gmail.com>\nCc: Jaroslav Kysela <perex@perex.cz>\nCc: Takashi Iwai <tiwai@suse.de>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/d48502eacd8934b79c3e62f7858c79fa6422398b"},{"sha":"2afe27c718b669b551895595873611ac39cc31e3","author":{"email":"d4c98dcfb8a2d1a780b73ae0523ba1408042900b@gmail.com","name":"Yury Norov"},"message":"lib/bitmap.c: bitmap_[empty,full]: remove code duplication\n\nbitmap_empty() has its own implementation.  But it's clearly as simple as:\n\n\tfind_first_bit(src, nbits) == nbits\n\nThe same is true for 'bitmap_full'.\n\nSigned-off-by: Yury Norov <yury.norov@gmail.com>\nCc: George Spelvin <linux@horizon.com>\nCc: Alexey Klimov <klimov.linux@gmail.com>\nCc: Rasmus Villemoes <linux@rasmusvillemoes.dk>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/2afe27c718b669b551895595873611ac39cc31e3"},{"sha":"d43698e8abb58a6ac47d16e0f47bb55f452e4fc4","author":{"email":"55afd0fb1f1ce5f067f0822840bbfc35c48fdecb@m4x.org","name":"Nicolas Iooss"},"message":"firmware/ihex2fw.c: restore missing default in switch statement\n\nCommit 2473238eac95 (\"ihex: add support for CS:IP/EIP records\") removes\nthe \"default:\" statement in the switch block, making the \"return\nusage();\" line dead code and ihex2fw silently ignoring unknown options.\nRestore this statement.\n\nThis bug was found by building with HOSTCC=clang and adding\n-Wunreachable-code-return to HOSTCFLAGS.\n\nFixes: 2473238eac95 (\"ihex: add support for CS:IP/EIP records\")\nSigned-off-by: Nicolas Iooss <nicolas.iooss_linux@m4x.org>\nCc: Mark Brown <broonie@opensource.wolfsonmicro.com>\nCc: David Woodhouse <dwmw2@infradead.org>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/d43698e8abb58a6ac47d16e0f47bb55f452e4fc4"},{"sha":"6ab3a9701e00c2a085bac6a7a9bdcf8fc5eca6c5","author":{"email":"16a9a54ddf4259952e3c118c763138e83693d7fd@perches.com","name":"Joe Perches"},"message":"checkpatch: improve \"no space is necessary after a cast\" test\n\nThe \"no space is necessary after a cast\" sizeof exclusion doesn't work\nproperly.\n\nThe test reports a false positive for code like:\n\n\tBUILD_BUG_ON(sizeof(struct batadv_bla_claim_dst) != 6);\n\nMake it work, simplify the exclusions, and add some comments.\n\nSigned-off-by: Joe Perches <joe@perches.com>\nReported-by: Marek Lindner <mareklindner@neomailbox.ch>\nSigned-off-by: Andrew Morton <akpm@linux-foundation.org>\nSigned-off-by: Linus Torvalds <torvalds@linux-foundation.org>","distinct":true,"url":"https://api.github.com/repos/torvalds/linux/commits/6ab3a9701e00c2a085bac6a7a9bdcf8fc5eca6c5"}]}