--- 
:name: ssfrk
:md5sum: 5b5f4cafc518b82b9b7304e9cd5c0721
:category: :subroutine
:arguments: 
- transr: 
    :type: char
    :intent: input
- uplo: 
    :type: char
    :intent: input
- trans: 
    :type: char
    :intent: input
- n: 
    :type: integer
    :intent: input
- k: 
    :type: integer
    :intent: input
- alpha: 
    :type: real
    :intent: input
- a: 
    :type: real
    :intent: input
    :dims: 
    - lda
    - "(lsame_(&trans,\"N\") || lsame_(&trans,\"n\")) ? k : n"
- lda: 
    :type: integer
    :intent: input
- beta: 
    :type: real
    :intent: input
- c: 
    :type: real
    :intent: input/output
    :dims: 
    - nt
:substitutions: {}

:fortran_help: "      SUBROUTINE SSFRK( TRANSR, UPLO, TRANS, N, K, ALPHA, A, LDA, BETA, C )\n\n\
  *  Purpose\n\
  *  =======\n\
  *\n\
  *  Level 3 BLAS like routine for C in RFP Format.\n\
  *\n\
  *  SSFRK performs one of the symmetric rank--k operations\n\
  *\n\
  *     C := alpha*A*A' + beta*C,\n\
  *\n\
  *  or\n\
  *\n\
  *     C := alpha*A'*A + beta*C,\n\
  *\n\
  *  where alpha and beta are real scalars, C is an n--by--n symmetric\n\
  *  matrix and A is an n--by--k matrix in the first case and a k--by--n\n\
  *  matrix in the second case.\n\
  *\n\n\
  *  Arguments\n\
  *  ==========\n\
  *\n\
  *  TRANSR   (input) CHARACTER*1\n\
  *          = 'N':  The Normal Form of RFP A is stored;\n\
  *          = 'T':  The Transpose Form of RFP A is stored.\n\
  *\n\
  *  UPLO     (input) CHARACTER*1\n\
  *           On  entry, UPLO specifies whether the upper or lower\n\
  *           triangular part of the array C is to be referenced as\n\
  *           follows:\n\
  *\n\
  *              UPLO = 'U' or 'u'   Only the upper triangular part of C\n\
  *                                  is to be referenced.\n\
  *\n\
  *              UPLO = 'L' or 'l'   Only the lower triangular part of C\n\
  *                                  is to be referenced.\n\
  *\n\
  *           Unchanged on exit.\n\
  *\n\
  *  TRANS    (input) CHARACTER*1\n\
  *           On entry, TRANS specifies the operation to be performed as\n\
  *           follows:\n\
  *\n\
  *              TRANS = 'N' or 'n'   C := alpha*A*A' + beta*C.\n\
  *\n\
  *              TRANS = 'T' or 't'   C := alpha*A'*A + beta*C.\n\
  *\n\
  *           Unchanged on exit.\n\
  *\n\
  *  N       (input) INTEGER\n\
  *           On entry, N specifies the order of the matrix C. N must be\n\
  *           at least zero.\n\
  *           Unchanged on exit.\n\
  *\n\
  *  K       (input) INTEGER\n\
  *           On entry with TRANS = 'N' or 'n', K specifies the number\n\
  *           of  columns of the matrix A, and on entry with TRANS = 'T'\n\
  *           or 't', K specifies the number of rows of the matrix A. K\n\
  *           must be at least zero.\n\
  *           Unchanged on exit.\n\
  *\n\
  *  ALPHA   (input) REAL\n\
  *           On entry, ALPHA specifies the scalar alpha.\n\
  *           Unchanged on exit.\n\
  *\n\
  *  A       (input) REAL array of DIMENSION (LDA,ka)\n\
  *           where KA\n\
  *           is K  when TRANS = 'N' or 'n', and is N otherwise. Before\n\
  *           entry with TRANS = 'N' or 'n', the leading N--by--K part of\n\
  *           the array A must contain the matrix A, otherwise the leading\n\
  *           K--by--N part of the array A must contain the matrix A.\n\
  *           Unchanged on exit.\n\
  *\n\
  *  LDA     (input) INTEGER\n\
  *           On entry, LDA specifies the first dimension of A as declared\n\
  *           in  the  calling  (sub)  program.   When  TRANS = 'N' or 'n'\n\
  *           then  LDA must be at least  max( 1, n ), otherwise  LDA must\n\
  *           be at least  max( 1, k ).\n\
  *           Unchanged on exit.\n\
  *\n\
  *  BETA    (input) REAL\n\
  *           On entry, BETA specifies the scalar beta.\n\
  *           Unchanged on exit.\n\
  *\n\
  *\n\
  *  C       (input/output) REAL array, dimension (NT)\n\
  *           NT = N*(N+1)/2. On entry, the symmetric matrix C in RFP\n\
  *           Format. RFP Format is described by TRANSR, UPLO and N.\n\
  *\n\
  *  Arguments\n\
  *  ==========\n\
  *\n\
  *     ..\n"
