Since the value of each digit is restricted to $\{1,2, \ldots, 7\}$, there is exactly one digit representative of each residue class modulo 7. Note that $7 \mid \overline{a b c}$ if and only if $100 a+10 b+c \equiv 0(\bmod 7)$ or equivalently $2 a+3 b+c \equiv 0$. So we want the number of triples of residues $(a, b, c)$ such that at least one of $2 a+3 b+c \equiv 0,2 b+3 c+a \equiv 0$, $2 c+3 a+b \equiv 0$ holds. Let the solution sets of these three equations be $S_{1}, S_{2}, S_{3}$ respectively, so by PIE and cyclic symmetry we want to find $3\left|S_{1}\right|-3\left|S_{1} \cap S_{2}\right|+\left|S_{1} \cap S_{2} \cap S_{3}\right|$. Clearly $\left|S_{1}\right|=7^{2}$, since for each of $a$ and $b$ there is a unique $c$ that satisfies the equation. For $S_{1} \cap S_{2}$, we may eliminate $a$ to get the system $0 \equiv 2(2 b+3 c)-(3 b+c)=b+5 c$ (and $\left.a \equiv-2 b-3 c\right)$, which has 7 solutions (one for each choice of $c$). For $S_{1} \cap S_{2} \cap S_{3} \subseteq S_{1} \cap S_{2}$, we have from the previous paragraph that $b \equiv-5 c$ and $a \equiv 10 c-3 c \equiv 0$. By cyclic symmetry, $b, c \equiv 0$ as well, so there's exactly 1 solution in this case. Thus the answer is $3 \cdot 7^{2}-3 \cdot 7+1=127$.