)]}'
{
  "commit": "afff7e2b3b13dbd26a2b9991d3d571df111d92e8",
  "tree": "51142ff8f5160bcd317120ffba604653c9e34455",
  "parents": [
    "951f22d5b1f0eaae35dafc669e3774a0c2084d10"
  ],
  "author": {
    "name": "Martin Schwidefsky",
    "email": "schwidefsky@de.ibm.com",
    "time": "Wed Jul 27 11:44:58 2005 -0700"
  },
  "committer": {
    "name": "Linus Torvalds",
    "email": "torvalds@g5.osdl.org",
    "time": "Wed Jul 27 16:26:04 2005 -0700"
  },
  "message": "[PATCH] s390: find_next_{zero}_bit fixes\n\nThe find_next_{zero}_bit primitives on s390* should never return a bit number\nbigger then the bit field size.  In the case of a bitfield that doesn\u0027t end on\na word boundary, an offset that makes the search start at the last word of the\nbit field and the last word doesn\u0027t contain any zero/one bits the search is\ncontinued with a call to find_first_bit with a negative size.  The search\nnormally ends pretty quickly because the words following the bit field contain\na mix of zeros and ones.  But the bit number that is returned in this case is\ntoo big.\n\nTo fix this and additional if to check for this case is needed.  To make the\ncode easier to read I removed the assembler parts from the\nfind_next_{zero}_bit functions, the C-ified code is as good.\n\nSigned-off-by: Martin Schwidefsky \u003cschwidefsky@de.ibm.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "16bb08499c7ff0d20b2a81d2a6eac3b471e51f2a",
      "old_mode": 33188,
      "old_path": "include/asm-s390/bitops.h",
      "new_id": "8651524217fde5108f6e5ded6ba1f4c4e5100f2c",
      "new_mode": 33188,
      "new_path": "include/asm-s390/bitops.h"
    }
  ]
}