If a graph embeds in the torus or the projective plane is there an upper bound on the number of edge crossings it has in the plane?

No, there is no upper bound. For any $n$, if you take a sufficiently fine mesh on a torus or projective plane, deleting $n$ edges will still result in a graph with a $K_7$ or $K_5$ minor, respectively. 


There are two ways to read this question. (I'll just ignore the projective plane part.) Zare's reading: Suppose that a graph $G$ embeds in the torus. Is there an upper bound on the number of edge crossings of $G$ when drawn in the plane? The answer is "no". You can draw $K_7$ in the torus and then take many parallel edges. All of these graphs embed in the torus, but there is no bound on their crossing number when drawn in the plane. My reading: What is the largest $k$ so that any graph $G$, with at most $k$ crossings in the plane, embeds in the torus? Is there an upper bound on $k$? The answer is "yes". Note, if $k < 2$ then $G$ embeds in the torus. However $K_8$ does not embed in the torus, and can be drawn in the plane with only $18$ crossings. So $18$ is an upper bound. I'll guess that this can be improved to $k = 2$. 


Regarding Andrew D. King's interpretation: Djidjev and Vrto showed that the crossing number of a graph with $n$ vertices and maximum degree $d$ embedded in a genus $g$ surface is $O(gdn)$, which improves an earlier result by Pach and Toth. This is tight up to a constant multiplicative factor. 

