For implementing a hash function, we can use Davies-Meyer Construction. In Katz crypto book it is written:
Let $F$ be a block cipher with $n$-bit key length and $l$-bit block length. We can then define the compression function $h:\{0,1\}^{l+n} \rightarrow \{0,1\}^l$ by $h(k,x)=F_k(x)\oplus x$.
My question is what is the point of XORing $x$ with $F_k(x)$?