recursion – Cyclomatic complexity of the recursive function

My goal is to find the cyclomatic complexity of the code, but that implies recursion, so I do not know if the recursive statement will take it to the beginning in cfg.
Can any one confirm .. I have downloaded my solution.
enter the description of the image here

test (int a, int b, int c) {
B: = C + 5;

DURING (X! = 1) {
X = X - 1;

IF (X = 7) X: = 8;
OTHER TEST (X, 3, X-1);
}
}