MOOCHO (Single Doxygen Collection) Version of the Day
RTOp_ROp_comp_err_with_mu.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 #include <math.h>
00045 
00046 /* ///////////////////////////////////////////// */
00047 /* RTOp_ROp_comp_err_with_mu.c */
00048 
00049 /* */
00050 /* Note: This file was created automatically by 'new_rtop.pl' */
00051 /*       on 7/24/2002 at 23:46 */
00052 /* */
00053 
00054 #define max(a,b) ( (a) > (b) ? (a) : (b) )
00055 #define min(a,b) ( (a) < (b) ? (a) : (b) )
00056 
00057 #include "RTOp_ROp_comp_err_with_mu.h"
00058 #include "RTOp_obj_value_value_vtbl.h"  /* vtbl for operator object instance data */
00059 #include "RTOp_reduct_max_value.h"
00060 
00061 
00062 /* Implementation functions for RTOp_RTOp */
00063 
00064 static int RTOp_ROp_comp_err_with_mu_apply_op(
00065   const struct RTOp_RTOp_vtbl_t* vtbl, const void* obj_data
00066   , const int num_vecs, const struct RTOp_SubVector vecs[]
00067   , const int num_targ_vecs, const struct RTOp_MutableSubVector targ_vecs[]
00068   , RTOp_ReductTarget reduct_obj )
00069 {
00070   /* */
00071   /* Declare local variables */
00072   /* */
00073 
00074   /* Access to the operator object instance data */
00075   struct RTOp_value_value_type *data_cntr = (struct RTOp_value_value_type*)obj_data;
00076   RTOp_value_type *mu = &data_cntr->value1;
00077   RTOp_value_type *inf_bound = &data_cntr->value2;
00078   /* Access to the reduction object data */
00079   RTOp_value_type *comp_err = (RTOp_value_type*)reduct_obj;
00080   /* Vector data */
00081   RTOp_index_type           sub_dim;
00082   /* v0 */
00083   const RTOp_value_type     *v0_val;
00084   ptrdiff_t                 v0_val_s;
00085   /* v1 */
00086   const RTOp_value_type     *v1_val;
00087   ptrdiff_t                 v1_val_s;
00088   /* v2 */
00089   const RTOp_value_type     *v2_val;
00090   ptrdiff_t                 v2_val_s;
00091   /* v3 */
00092   const RTOp_value_type     *v3_val;
00093   ptrdiff_t                 v3_val_s;
00094   /* v4 */
00095   const RTOp_value_type     *v4_val;
00096   ptrdiff_t                 v4_val_s;
00097 
00098   /* Automatic temporary variables */
00099   register RTOp_index_type  k;
00100   /* Temporary element-wise reduction object */
00101   RTOp_value_type comp_err_ith;
00102 
00103   /* */
00104   /* Validate the input */
00105   /* */
00106   if( num_vecs != 5 || ( num_vecs && vecs == NULL ) )
00107     return RTOp_ERR_INVALID_NUM_VECS;
00108   if( num_targ_vecs != 0 || ( num_targ_vecs && targ_vecs == NULL ) )
00109     return RTOp_ERR_INVALID_NUM_TARG_VECS;
00110   if( /* Validate sub_dim */
00111     vecs[1].sub_dim != vecs[0].sub_dim
00112     || vecs[2].sub_dim != vecs[0].sub_dim
00113     || vecs[3].sub_dim != vecs[0].sub_dim
00114     || vecs[4].sub_dim != vecs[0].sub_dim
00115     )
00116     return RTOp_ERR_INCOMPATIBLE_VECS;
00117   assert(obj_data);
00118   assert(reduct_obj);
00119 
00120 
00121   /* */
00122   /* Get pointers to data */
00123   /* */
00124   sub_dim       = vecs[0].sub_dim;
00125   /* v0 */
00126   v0_val        = vecs[0].values;
00127   v0_val_s      = vecs[0].values_stride;
00128   /* v1 */
00129   v1_val        = vecs[1].values;
00130   v1_val_s      = vecs[1].values_stride;
00131   /* v2 */
00132   v2_val        = vecs[2].values;
00133   v2_val_s      = vecs[2].values_stride;
00134   /* v3 */
00135   v3_val        = vecs[3].values;
00136   v3_val_s      = vecs[3].values_stride;
00137   /* v4 */
00138   v4_val        = vecs[4].values;
00139   v4_val_s      = vecs[4].values_stride;
00140 
00141 
00142   /* */
00143   /* Apply the operator: */
00144   /* */
00145   for( k = 0; k < sub_dim; ++k, v0_val += v0_val_s, v1_val += v1_val_s, v2_val += v2_val_s, v3_val += v3_val_s, v4_val += v4_val_s )
00146   {
00147     /* Element-wise reduction */
00148   comp_err_ith = 0;
00149   if ((*v1_val) > -(*inf_bound))
00150     { comp_err_ith = fabs((*v3_val)*((*v0_val)-(*v1_val))-(*mu)); }
00151 
00152   if ((*v2_val) < (*inf_bound))
00153     { comp_err_ith = max(comp_err_ith, fabs((*v4_val)*((*v2_val)-(*v0_val))-(*mu))); }
00154 
00155     /* Reduction of intermediates */
00156     (*comp_err) = max( (*comp_err), comp_err_ith );
00157   }
00158 
00159   return 0; /* success? */
00160 }
00161 
00162 /* Virtual function table */
00163 const struct RTOp_RTOp_vtbl_t RTOp_ROp_comp_err_with_mu_vtbl =
00164 {
00165   &RTOp_obj_value_value_vtbl
00166   ,&RTOp_obj_value_vtbl
00167   ,"ROp_comp_err_with_mu"
00168   ,NULL
00169   ,RTOp_ROp_comp_err_with_mu_apply_op
00170   ,RTOp_reduct_max_value
00171   ,RTOp_get_reduct_max_value_op
00172 };
00173 
00174 /* Class specific functions */
00175 
00176 int RTOp_ROp_comp_err_with_mu_construct( RTOp_value_type mu, RTOp_value_type inf_bound,  struct RTOp_RTOp* op )
00177 {
00178 #ifdef RTOp_DEBUG
00179   assert(op);
00180 #endif
00181   op->obj_data  = NULL;
00182   op->vtbl      = &RTOp_ROp_comp_err_with_mu_vtbl;
00183   op->vtbl->obj_data_vtbl->obj_create(NULL,NULL,&op->obj_data);
00184   return RTOp_ROp_comp_err_with_mu_init(mu,inf_bound,op);
00185 }
00186 
00187 int RTOp_ROp_comp_err_with_mu_destroy( struct RTOp_RTOp* op )
00188 {
00189   op->vtbl->obj_data_vtbl->obj_free(NULL,NULL,&op->obj_data);
00190   op->obj_data  = NULL;
00191   op->vtbl      = NULL;
00192   return 0;
00193 }
00194 
00195 int RTOp_ROp_comp_err_with_mu_init( RTOp_value_type mu, RTOp_value_type inf_bound, struct RTOp_RTOp* op )
00196 {
00197   struct RTOp_value_value_type *ptr_data_cntr = (struct RTOp_value_value_type*)op->obj_data;
00198   RTOp_value_type *ptr_mu = &ptr_data_cntr->value1;
00199   RTOp_value_type *ptr_inf_bound = &ptr_data_cntr->value2;
00200   *ptr_mu = mu;
00201   *ptr_inf_bound = inf_bound;
00202   return 0;
00203 }
00204 RTOp_value_type RTOp_ROp_comp_err_with_mu_val(RTOp_ReductTarget reduct_obj)
00205 {
00206   return *((RTOp_value_type*)reduct_obj);
00207 }
00208 
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines