)]}'
{
  "commit": "dc7759ccc3151a1aefefa9f86610e66f6fe9311c",
  "tree": "2e0f7452bd19881895b2c9220a3c4902958267d3",
  "parents": [
    "ad675fa1d6617ff7fe5965845152ba71f33caf61"
  ],
  "author": {
    "name": "Nicolas Capens",
    "email": "capn@google.com",
    "time": "Tue Apr 18 11:14:37 2017 -0400"
  },
  "committer": {
    "name": "Nicolas Capens",
    "email": "capn@google.com",
    "time": "Wed Apr 19 15:30:28 2017 +0000"
  },
  "message": "Fix potential data race in mutex lock implementation.\n\nWriting or reading an ordinary volatile boolean does not provide memory\nordering guarantees. Use atomic\u003cbool\u003e with release and acquire semantics\ninstead. On x86 this should have no impact on the generated code, since\nit architecturally offers strong memory ordering guarantees.\n\nBug chromium:710753\n\nChange-Id: I5aa2a6eeecfcd691a0aa8d06fd067f9d59ab13c3\nReviewed-on: https://swiftshader-review.googlesource.com/9328\nReviewed-by: Corentin Wallez \u003ccwallez@google.com\u003e\nReviewed-by: Nicolas Capens \u003ccapn@google.com\u003e\nTested-by: Nicolas Capens \u003ccapn@google.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "044c15627d0326cd07a6e31e54ffda2e6e206f39",
      "old_mode": 33188,
      "old_path": "src/Common/MutexLock.hpp",
      "new_id": "d9f403441b7fa8679623ed374c9bf2c3aeee8425",
      "new_mode": 33188,
      "new_path": "src/Common/MutexLock.hpp"
    }
  ]
}
