Many real-world applications can be modelled as dynamic constrained optimization problems (DCOPs). Due to the fact that objective function and/or constraints change over time, solving DCOPs is a challenging task. Although solving DCOPs by evolutionary algorithms has attracted increasing interest in the community of evolutionary computation, the design of benchmark test functions of DCOPs is still insufficient. Therefore, we propose a test suite for DCOPs. A dynamic unconstrained optimization benchmark with good time-varying characteristics, called moving peaks benchmark, is chosen to be the objective function of our test suite. In addition, we design adjustable dynamic constraints, by which the size, number, and change severity of the feasible regions can be flexibly controlled.