MOOCHO (Single Doxygen Collection) Version of the Day
RTOp_ROp_max.c
Go to the documentation of this file.
00001 /*
00002 // @HEADER
00003 // ***********************************************************************
00004 // 
00005 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
00006 //                  Copyright (2003) Sandia Corporation
00007 // 
00008 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
00009 // license for use of this work by or on behalf of the U.S. Government.
00010 // 
00011 // Redistribution and use in source and binary forms, with or without
00012 // modification, are permitted provided that the following conditions are
00013 // met:
00014 //
00015 // 1. Redistributions of source code must retain the above copyright
00016 // notice, this list of conditions and the following disclaimer.
00017 //
00018 // 2. Redistributions in binary form must reproduce the above copyright
00019 // notice, this list of conditions and the following disclaimer in the
00020 // documentation and/or other materials provided with the distribution.
00021 //
00022 // 3. Neither the name of the Corporation nor the names of the
00023 // contributors may be used to endorse or promote products derived from
00024 // this software without specific prior written permission.
00025 //
00026 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
00027 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00028 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00029 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
00030 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00031 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00032 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00033 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00034 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00035 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00036 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00037 //
00038 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov) 
00039 // 
00040 // ***********************************************************************
00041 // @HEADER
00042 */
00043 
00044 /* ///////////////////////////////////////////// */
00045 /* RTOp_ROp_max.c */
00046 
00047 /* */
00048 /* Note: This file was created automatically by 'new_rtop.pl' */
00049 /*       on 7/15/2002 at 17:33 */
00050 /* */
00051 
00052 #define max(a,b) ( (a) > (b) ? (a) : (b) )
00053 #define min(a,b) ( (a) < (b) ? (a) : (b) )
00054 
00055 #include "RTOp_ROp_max.h"
00056 #include "RTOp_obj_null_vtbl.h"  /* vtbl for operator object instance data */
00057 #include "RTOp_reduct_max_value.h"
00058 
00059 
00060 /* Implementation functions for RTOp_RTOp */
00061 
00062 static int RTOp_ROp_max_apply_op(
00063   const struct RTOp_RTOp_vtbl_t* vtbl, const void* obj_data
00064   , const int num_vecs, const struct RTOp_SubVector vecs[]
00065   , const int num_targ_vecs, const struct RTOp_MutableSubVector targ_vecs[]
00066   , RTOp_ReductTarget reduct_obj )
00067 {
00068   /* */
00069   /* Declare local variables */
00070   /* */
00071 
00072   /* Access to the reduction object data */
00073   RTOp_value_type *max_ele = (RTOp_value_type*)reduct_obj;
00074   /* Vector data */
00075   RTOp_index_type           sub_dim;
00076   /* v0 */
00077   const RTOp_value_type     *v0_val;
00078   ptrdiff_t                 v0_val_s;
00079 
00080   /* Automatic temporary variables */
00081   register RTOp_index_type  k;
00082   /* Temporary element-wise reduction object */
00083   RTOp_value_type max_ele_ith;
00084 
00085   /* */
00086   /* Validate the input */
00087   /* */
00088   if( num_vecs != 1 || ( num_vecs && vecs == NULL ) )
00089     return RTOp_ERR_INVALID_NUM_VECS;
00090   if( num_targ_vecs != 0 || ( num_targ_vecs && targ_vecs == NULL ) )
00091     return RTOp_ERR_INVALID_NUM_TARG_VECS;
00092   assert(reduct_obj);
00093 
00094 
00095   /* */
00096   /* Get pointers to data */
00097   /* */
00098   sub_dim       = vecs[0].sub_dim;
00099   /* v0 */
00100   v0_val        = vecs[0].values;
00101   v0_val_s      = vecs[0].values_stride;
00102 
00103 
00104   /* */
00105   /* Apply the operator: */
00106   /* */
00107   for( k = 0; k < sub_dim; ++k, v0_val += v0_val_s )
00108   {
00109     /* Element-wise reduction */
00110     max_ele_ith = (*v0_val);
00111     /* Reduction of intermediates */
00112     (*max_ele) = max( (*max_ele), max_ele_ith );
00113   }
00114 
00115   return 0; /* success? */
00116 }
00117 
00118 static int RTOp_ROp_max_reduct_obj_reinit(
00119   const struct RTOp_RTOp_vtbl_t* vtbl, const void* obj_data
00120   ,RTOp_ReductTarget reduct_obj
00121   )
00122 {
00123   RTOp_value_type *max_ele = (RTOp_value_type*)reduct_obj;
00124   *max_ele = -1e+50;
00125   return 0;
00126 }
00127 
00128 /* Virtual function table */
00129 const struct RTOp_RTOp_vtbl_t RTOp_ROp_max_vtbl =
00130 {
00131   &RTOp_obj_null_vtbl
00132   ,&RTOp_obj_value_vtbl
00133   ,"ROp_max"
00134   ,RTOp_ROp_max_reduct_obj_reinit
00135   ,RTOp_ROp_max_apply_op
00136   ,RTOp_reduct_max_value
00137   ,RTOp_get_reduct_max_value_op
00138 };
00139 
00140 /* Class specific functions */
00141 
00142 int RTOp_ROp_max_construct(  struct RTOp_RTOp* op )
00143 {
00144 #ifdef RTOp_DEBUG
00145   assert(op);
00146 #endif
00147   op->obj_data  = NULL;
00148   op->vtbl      = &RTOp_ROp_max_vtbl;
00149   op->vtbl->obj_data_vtbl->obj_create(NULL,NULL,&op->obj_data);
00150   return 0;
00151 }
00152 
00153 int RTOp_ROp_max_destroy( struct RTOp_RTOp* op )
00154 {
00155   op->vtbl->obj_data_vtbl->obj_free(NULL,NULL,&op->obj_data);
00156   op->obj_data  = NULL;
00157   op->vtbl      = NULL;
00158   return 0;
00159 }
00160 
00161 
00162 RTOp_value_type RTOp_ROp_max_val(RTOp_ReductTarget reduct_obj)
00163 {
00164   return *((RTOp_value_type*)reduct_obj);
00165 }
00166 
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines