Self-describing numbers

You are encouraged to solve this task according to the task description, using any language you may know.
There are several so-called "self-describing" or "self-descriptive" integers.

An integer is said to be "self-describing" if it has the property that, when digit positions are labeled 0 to N-1, the digit in each position is equal to the number of times that that digit appears in the number.

For example,   2020   is a four-digit self describing number:

   position   0   has value   2   and there are two 0s in the number;
   position   1   has value   0   and there are no 1s in the number;
   position   2   has value   2   and there are two 2s;
   position   3   has value   0   and there are zero 3s.


Self-describing numbers < 100.000.000  are:     1210,   2020,   21200,   3211000,   42101000.



Task Description
 Write a function/routine/method/... that will check whether a given positive integer is self-describing.
 As an optional stretch goal - generate and display the set of self-describing numbers.


Related tasks

   Fours is the number of letters in the ...
   Look-and-say sequence
   Number names
   Self-referential sequence
   Spelling of ordinal numbers


with javascript_semantics
function self_desc(integer i)
    sequence digits = repeat(0,10), 
             counts = repeat(0,10)
    integer n = 0, digit
    while 1 do
        digit := mod(i,10)
        digits[10-n] := digit
        digit += 1
        counts[digit] += 1
        i = floor(i/10)
        if i=0 then exit end if
        n += 1
    end while
    return digits[10-n..10] = counts[1..n+1]
end function
 
atom t0 = time()
for i=10 to 100_000_000 by 10 do
    if self_desc(i) then ?i end if
end for
printf(1,"done (%s)\n",{elapsed(time()-t0)})
