# QCLP constraint positive semidefinite

I have quadratically constrained linear program where one objective is of the form $x_1.x_2 \leq x_1k_1 + k_2$, $k_1, k_2$ are constants. I know that QCLP is NP-Hard in general but can be solved in PTIME if the matrix for the quadratic constraint is positive semidefinite. For my problem, the matrix is $\begin{bmatrix} 0 & 1/2 \\ 1/2 & 0 \end{bmatrix}$. By the design of my problem, $x, y > 0$. Is positive semidefinite condition $x^T M x \geq 0$ satisfied for all $x$ or only over the the constraints that vector $x > 0$ (in which case, the matrix is positive semidefinite)?