Testing divisibility of multivariate polynomials

Is there a function to test whether a (multivariate) polynomial f divides another polynomial p? Of course, one can compute the reduction of p modulo f. As it happens, for many variables and fairly sparse p (and quite simple f, say of total degree 1 for instance), computing the reduction is pretty fast when f does divide p, but may take a very long time if f does not divide p. (I have the impression that this is due to the fact that p%f can be very dense in such case.) Actually, in case f does not divide p, one can often give the answer very early (as soon as one begins to "fill" the remainder). So my question: Is there a function in Singular which implements this (fairly trivial and naive) optimization?

P.S.: I use Singular through Sage. In Sage, the method f.divides(p) simply calls p%f and tests it for zero. If a function as I ask for exists in Singular, I'll do my best to use it in the method "divides" of Sage.

see
http://www.singular.uni-kl.de/Manual/4-0-3/sing_383.htm.
For such tests use
which computes only the leading term of p%f completely,
usually much faster if only the divisibility test is needed.

Thanks for the pointer. I have trouble to find the source code corresponding to this function, do you have any hint?

for version 3-1-7:
reduce is internally

from kernel/kstd1.cc, i.e. one have to use (the additional argument 1 maps to lazyReduce)

Analog for version 4-0-3: kNF is now in kernel/GBEngine/kstd1.cc

Thank you very much. I implemented a method `divides` for multivariate polynomials in Sage based on kNF. See ticket #20588.