Is there a systematic method to rewrite a recursive function as a tail-recursive function?

Question

Specifying the question I would like to know if there is indeed a series of unambiguous steps to convert recursive functions to tail-recursive functions; maybe by creating auxiliary helper functions if necessary.

If I was not clear in the above question, here is an example of a non-tail-recursive and an equivalent tail-recursive function:

int factorial (int x) {
  if (x == 1) {
    return 1;
  }
  int y = factorial (x-1);
  return x * y;
}

int factorial_tailrec (int acc, int x) {
  if (x == 0) {
    return acc;
  }  
  return factorial_tailrec (acc * x, x-1);
}