text: /*
  
     BLIS    
     An object-based framework for developing high-performance BLAS-like
     libraries.
  
     Copyright (C) 2014, The University of Texas at Austin
  
     Redistribution and use in source and binary forms, with or without
     modification, are permitted provided that the following conditions are
     met:
      - Redistributions of source code must retain the above copyright
        notice, this list of conditions and the following disclaimer.
      - Redistributions in binary form must reproduce the above copyright
        notice, this list of conditions and the following disclaimer in the
        documentation and/or other materials provided with the distribution.
      - Neither the name of The University of Texas at Austin nor the names
        of its contributors may be used to endorse or promote products
        derived from this software without specific prior written permission.
  
     THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
     "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
     LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
     A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
     HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
     SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
     LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
     OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  
  */
  
  #include "blis.h"
  
  void bli_hemv_blk_var3( conj_t  conjh,
                          obj_t*  alpha,
                          obj_t*  a,
                          obj_t*  x,
                          obj_t*  beta,
                          obj_t*  y,
                          hemv_t* cntl )
  {
  	obj_t   a11, a11_pack;
  	obj_t   a21;
  	obj_t   x1, x1_pack;
  	obj_t   x2;
  	obj_t   y1, y1_pack;
  	obj_t   y2;
  
  	dim_t   mn;
  	dim_t   ij;
  	dim_t   b_alg;
  
  	// Even though this blocked algorithm is expressed only in terms of the
  	// lower triangular case, the upper triangular case is still supported:
  	// when bli_acquire_mpart_tl2br() is passed a matrix that is stored in
  	// in the upper triangle, and the requested subpartition resides in the
  	// lower triangle (as is the case for this algorithm), the routine fills
  	// the request as if the caller had actually requested the corresponding
  	// "mirror" subpartition in the upper triangle, except that it marks the
  	// subpartition for transposition (and conjugation).
  
  	// Initialize objects for packing.
  	bli_obj_init_pack( &a11_pack );
  	bli_obj_init_pack( &x1_pack );
  	bli_obj_init_pack( &y1_pack );
  
  	// Query dimension.
  	mn = bli_obj_length( *a );
  
  	// y = beta * y;
  	bli_scalv_int( beta,
  	               y,
  	               cntl_sub_scalv( cntl ) );
  
  	// Partition diagonally.
  	for ( ij = 0; ij < mn; ij += b_alg )
  	{
  		// Determine the current algorithmic blocksize.
  		b_alg = bli_determine_blocksize_f( ij, mn, a,
  		                                   cntl_blocksize( cntl ) );
  
  		// Acquire partitions for A11, A10, x1, x0, y1, and y0.
  		bli_acquire_mpart_tl2br( BLIS_SUBPART11,
  		                         ij, b_alg, a, &a11 );
  		bli_acquire_mpart_tl2br( BLIS_SUBPART21,
  		                         ij, b_alg, a, &a21 );
  		bli_acquire_vpart_f2b( BLIS_SUBPART1,
  		                       ij, b_alg, x, &x1 );
  		bli_acquire_vpart_f2b( BLIS_SUBPART2,
  		                       ij, b_alg, x, &x2 );
  		bli_acquire_vpart_f2b( BLIS_SUBPART1,
  		                       ij, b_alg, y, &y1 );
  		bli_acquire_vpart_f2b( BLIS_SUBPART2,
  		                       ij, b_alg, y, &y2 );
  
  		// Initialize objects for packing A11, x1, and y1 (if needed).
  		bli_packm_init( &a11, &a11_pack,
  		                cntl_sub_packm_a11( cntl ) );
  		bli_packv_init( &x1, &x1_pack,
  		                cntl_sub_packv_x1( cntl ) );
  		bli_packv_init( &y1, &y1_pack,
  		                cntl_sub_packv_y1( cntl ) );
  
  		// Copy/pack A11, x1, y1 (if needed).
  		bli_packm_int( &a11, &a11_pack,
  		               cntl_sub_packm_a11( cntl ),
                         &BLIS_PACKM_SINGLE_THREADED );
  		bli_packv_int( &x1, &x1_pack,
  		               cntl_sub_packv_x1( cntl ) );
  		bli_packv_int( &y1, &y1_pack,
  		               cntl_sub_packv_y1( cntl ) );
  
  		// y1 = y1 + alpha * A21' * x2;
  		bli_gemv_int( bli_apply_conj( conjh, BLIS_TRANSPOSE ),
  		              BLIS_NO_CONJUGATE,
  	                  alpha,
  		              &a21,
  		              &x2,
  		              &BLIS_ONE,
  		              &y1_pack,
  		              cntl_sub_gemv_t_cp( cntl ) );
  
  		// y1 = y1 + alpha * A11 * x1;
  		bli_hemv_int( conjh,
  		              alpha,
  		              &a11_pack,
  		              &x1_pack,
  		              &BLIS_ONE,
  		              &y1_pack,
  		              cntl_sub_hemv( cntl ) );
  
  		// y2 = y2 + alpha * A21 * x1;
  		bli_gemv_int( BLIS_NO_TRANSPOSE,
  		              BLIS_NO_CONJUGATE,
  	                  alpha,
  		              &a21,
  		              &x1_pack,
  		              &BLIS_ONE,
  		              &y2,
  		              cntl_sub_gemv_n_cp( cntl ) );
  
  		// Copy/unpack y1 (if y1 was packed).
  		bli_unpackv_int( &y1_pack, &y1,
  		                 cntl_sub_unpackv_y1( cntl ) );
  	}
  
  	// If any packing buffers were acquired within packm, release them back
  	// to the memory manager.
  	bli_packm_release( &a11_pack, cntl_sub_packm_a11( cntl ) );
  	bli_packv_release( &x1_pack, cntl_sub_packv_x1( cntl ) );
  	bli_packv_release( &y1_pack, cntl_sub_packv_y1( cntl ) );
  }
  
  