Find all functions $f:\mathbb{N}^* \rightarrow \mathbb{N}$ such that

[list]
[*] $f(x \cdot y) = f(x) + f(y)$
[*] $f(30) = 0$
[*] $f(x)=0$ always when the units digit of $x$ is $7$
[/list]
1. **Given Conditions:**
   - \( f(x \cdot y) = f(x) + f(y) \)
   - \( f(30) = 0 \)
   - \( f(x) = 0 \) always when the units digit of \( x \) is \( 7 \)

2. **Analyzing \( f(30) = 0 \):**
   - \( 30 = 2 \cdot 3 \cdot 5 \)
   - Using the functional equation \( f(x \cdot y) = f(x) + f(y) \), we get:
     \[
     f(30) = f(2 \cdot 3 \cdot 5) = f(2) + f(3) + f(5)
     \]
   - Given \( f(30) = 0 \), we have:
     \[
     f(2) + f(3) + f(5) = 0
     \]
   - Since \( f \) maps to \(\mathbb{N}\), and \(\mathbb{N}\) includes \(0\), the only solution is:
     \[
     f(2) = 0, \quad f(3) = 0, \quad f(5) = 0
     \]

3. **Analyzing \( f(x) = 0 \) for units digit \( 7 \):**
   - For any \( x \) with units digit \( 7 \), \( f(x) = 0 \).

4. **Considering other primes \( p \notin \{2, 5\} \):**
   - Let \( p \) be a prime not in \(\{2, 5\}\).
   - There exists \( q \) such that \( pq \equiv 1 \pmod{10} \). This means \( 7pq \equiv 7 \pmod{10} \), so \( 7pq \) has units digit \( 7 \).
   - Therefore, \( f(7pq) = 0 \) because the units digit of \( 7pq \) is \( 7 \).
   - Using the functional equation:
     \[
     f(7pq) = f(7) + f(p) + f(q)
     \]
   - Given \( f(7) = 0 \), we have:
     \[
     0 = f(7) + f(p) + f(q) = 0 + f(p) + f(q)
     \]
   - Thus:
     \[
     f(p) + f(q) = 0
     \]
   - Since \( f \) maps to \(\mathbb{N}\), the only solution is:
     \[
     f(p) = 0 \quad \text{and} \quad f(q) = 0
     \]

5. **Conclusion for all primes:**
   - Since \( f(p) = 0 \) for all primes \( p \), and any positive integer \( n \) can be expressed as a product of primes, we have:
     \[
     f(n) = \sum_{i} n_i f(p_i) = 0
     \]
   - Therefore, \( f(n) = 0 \) for all \( n \in \mathbb{N}^* \).

\(\blacksquare\)

The final answer is \( \boxed{ f(n) = 0 \quad \forall n \in \mathbb{N}^* } \)