Complexity of clique‐coloring odd‐hole‐free graphs