)]}'
{
  "commit": "d642eec78fc94ef3c5266dc0b10b8c51ea046e7a",
  "tree": "53ab4ac4a285f04fef4579d564dafd494c01ef6f",
  "parents": [
    "64f67f870d6eb866bef6b49a8388915c73db40bc"
  ],
  "author": {
    "name": "aankit-ca",
    "email": "quic_aankit@quicinc.com",
    "time": "Thu Mar 13 12:48:31 2025 -0700"
  },
  "committer": {
    "name": "GitHub",
    "email": "noreply@github.com",
    "time": "Thu Mar 13 14:48:31 2025 -0500"
  },
  "message": "[HEXAGON] Fix semantics of ordered FP compares (#131089)\n\nFor the ordered FP compare bitcode instructions, the Hexagon backend was\nassuming that no operand could be a NaN. This assumption is flawed. This\npatch fixes the code-generation to produce fpcmp.uo and and appropriate\nbit comparison operators to account for the case when an operand to a FP\ncompare is a NaN.\n\nFix for https://github.com/llvm/llvm-project/issues/129391\n\nCo-authored-by: aankit-quic \u003caankit@quicinc.com\u003e",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "cba5ff1ab0d9b5385ec1ab6acbdabae2d64e7597",
      "old_mode": 33188,
      "old_path": "llvm/lib/Target/Hexagon/HexagonPatterns.td",
      "new_id": "244f204539c898de3dd02d38a63dd11c63c62cd5",
      "new_mode": 33188,
      "new_path": "llvm/lib/Target/Hexagon/HexagonPatterns.td"
    },
    {
      "type": "add",
      "old_id": "0000000000000000000000000000000000000000",
      "old_mode": 0,
      "old_path": "/dev/null",
      "new_id": "1469402911601a2a65fc987ede9c337637841124",
      "new_mode": 33188,
      "new_path": "llvm/test/CodeGen/Hexagon/fcmp-nan.ll"
    }
  ]
}