  We combine two generalizations of ordinary Tur\'an problems. Given graphs $H$
and $F$ and a positive integer $n$, we study $rex(n, H, F )$, which is the
largest number of copies of $H$ in $F$-free regular $n$-vertex graphs.
