)]}'
{
  "commit": "f4b0373b26567cafd421d91101852ed7a34e9e94",
  "tree": "35607b1c1d28429bb275ca3472cd0065fbde2f14",
  "parents": [
    "83d349f35e1ae72268c5104dbf9ab2ae635425d4"
  ],
  "author": {
    "name": "Linus Torvalds",
    "email": "torvalds@linux-foundation.org",
    "time": "Fri Aug 21 09:26:15 2009 -0700"
  },
  "committer": {
    "name": "Linus Torvalds",
    "email": "torvalds@linux-foundation.org",
    "time": "Fri Aug 21 09:26:15 2009 -0700"
  },
  "message": "Make bitmask \u0027and\u0027 operators return a result code\n\nWhen \u0027and\u0027ing two bitmasks (where \u0027andnot\u0027 is a variation on it), some\ncases want to know whether the result is the empty set or not.  In\nparticular, the TLB IPI sending code wants to do cpumask operations and\ndetermine if there are any CPU\u0027s left in the final set.\n\nSo this just makes the bitmask (and cpumask) functions return a boolean\nfor whether the result has any bits set.\n\nCc: stable@kernel.org (2.6.30, needed by TLB shootdown fix)\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "2878811c61346f09520ffdc086742c77943e91ea",
      "old_mode": 33188,
      "old_path": "include/linux/bitmap.h",
      "new_id": "756d78b8c1c5e52195fc4b0db951c883c1a07122",
      "new_mode": 33188,
      "new_path": "include/linux/bitmap.h"
    },
    {
      "type": "modify",
      "old_id": "c5ac87ca7bc647d32caef606c9c26ab0bb606090",
      "old_mode": 33188,
      "old_path": "include/linux/cpumask.h",
      "new_id": "796df12091b7687a450d26e57c4acf6ecc15b34d",
      "new_mode": 33188,
      "new_path": "include/linux/cpumask.h"
    },
    {
      "type": "modify",
      "old_id": "35a1f7ff414988d86c6c081d7bbf3671733a15d6",
      "old_mode": 33188,
      "old_path": "lib/bitmap.c",
      "new_id": "702565821c9976fb4588dac793d84008bf93b229",
      "new_mode": 33188,
      "new_path": "lib/bitmap.c"
    }
  ]
}