Rotating triads of a linked list

Given a linked list a>b>c>d>e>f. We need to rotate each triad. e.g. c>b>a>f>e>d. However data is so large that its movement is a costly operation in terms of memory as well as time. Write a C code to preform the task.