)]}'
{
  "commit": "a8092c021d27f27f4b323b7d49979ca01b3fc19d",
  "tree": "6abca9359bef605709b18b85ecde8d0d0dc1cb97",
  "parents": [
    "48ea623eae8674793372e3e7c95e72e5a44d7a95"
  ],
  "author": {
    "name": "Haavard Skinnemoen",
    "email": "haavard.skinnemoen@atmel.com",
    "time": "Mon May 26 12:19:10 2008 +0200"
  },
  "committer": {
    "name": "Haavard Skinnemoen",
    "email": "haavard.skinnemoen@atmel.com",
    "time": "Tue May 27 15:27:31 2008 +0200"
  },
  "message": "avr32: Fix theoretical race in udelay()\n\nIf the specified delay is very short, the cycle counter may go past the\n\"end\" time we are waiting for before we get around to reading it.\n\nFix it by checking the different between the cycle count \"now\" and the\ncycle count at the beginning. This will work as long as the delay\nmeasured in number of cycles is below 2^31.\n\nSigned-off-by: Haavard Skinnemoen \u003chaavard.skinnemoen@atmel.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "bef1f30d79d3414cd7e53b8f8e126ff57d80ec43",
      "old_mode": 33188,
      "old_path": "cpu/at32ap/interrupts.c",
      "new_id": "160838eeeb3b1d3d12e36fb67f911b3ae1b95547",
      "new_mode": 33188,
      "new_path": "cpu/at32ap/interrupts.c"
    }
  ]
}