RTOpPack: Extra C/C++ Code for Vector Reduction/Transformation Operators  Version of the Day
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
RTOp_ROp_log_bound_barrier.c
1 /*
2 // @HEADER
3 // ***********************************************************************
4 //
5 // Moocho: Multi-functional Object-Oriented arCHitecture for Optimization
6 // Copyright (2003) Sandia Corporation
7 //
8 // Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
9 // license for use of this work by or on behalf of the U.S. Government.
10 //
11 // Redistribution and use in source and binary forms, with or without
12 // modification, are permitted provided that the following conditions are
13 // met:
14 //
15 // 1. Redistributions of source code must retain the above copyright
16 // notice, this list of conditions and the following disclaimer.
17 //
18 // 2. Redistributions in binary form must reproduce the above copyright
19 // notice, this list of conditions and the following disclaimer in the
20 // documentation and/or other materials provided with the distribution.
21 //
22 // 3. Neither the name of the Corporation nor the names of the
23 // contributors may be used to endorse or promote products derived from
24 // this software without specific prior written permission.
25 //
26 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
27 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
30 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
31 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
32 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
33 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
34 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
35 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
36 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
37 //
38 // Questions? Contact Roscoe A. Bartlett (rabartl@sandia.gov)
39 //
40 // ***********************************************************************
41 // @HEADER
42 */
43 
44 #include <math.h>
45 
46 /* */
47 /* Note: This file was created automatically by 'new_rtop.pl' */
48 /* on 6/26/2002 at 21:9 */
49 /* */
50 
51 #define max(a,b) ( (a) > (b) ? (a) : (b) )
52 #define min(a,b) ( (a) < (b) ? (a) : (b) )
53 
55 #include "RTOp_obj_null_vtbl.h" /* vtbl for operator object instance data */
56 #include "RTOp_reduct_sum_value.h" /* Reduction of intermediate reduction objects */
57 
58 
59 
60 /* Implementation functions for RTOp_RTOp */
61 
62 static int RTOp_ROp_log_bound_barrier_apply_op(
63  const struct RTOp_RTOp_vtbl_t* vtbl, const void* obj_data
64  , const int num_vecs, const struct RTOp_SubVector vecs[]
65  , const int num_targ_vecs, const struct RTOp_MutableSubVector targ_vecs[]
66  , RTOp_ReductTarget reduct_obj )
67 {
68  /* */
69  /* Declare local variables */
70  /* */
71 
72  /* Access to the reduction object data */
73  RTOp_value_type *log_result = (RTOp_value_type*)reduct_obj;
74  /* Vector data */
75  RTOp_index_type sub_dim;
76  /* v0 */
77  const RTOp_value_type *v0_val;
78  ptrdiff_t v0_val_s;
79  /* v1 */
80  const RTOp_value_type *v1_val;
81  ptrdiff_t v1_val_s;
82  /* v2 */
83  const RTOp_value_type *v2_val;
84  ptrdiff_t v2_val_s;
85 
86  register RTOp_index_type k;
87 
88  /* */
89  /* Validate the input */
90  /* */
91  if( num_vecs != 3 || ( num_vecs && vecs == NULL ) )
92  return RTOp_ERR_INVALID_NUM_VECS;
93  if( num_targ_vecs != 0 || ( num_targ_vecs && targ_vecs == NULL ) )
94  return RTOp_ERR_INVALID_NUM_TARG_VECS;
95  if( /* Validate sub_dim */
96  vecs[1].sub_dim != vecs[0].sub_dim
97  || vecs[2].sub_dim != vecs[0].sub_dim
98  )
99  return RTOp_ERR_INCOMPATIBLE_VECS;
100  assert(reduct_obj);
101 
102 
103  /* */
104  /* Get pointers to data */
105  /* */
106  sub_dim = vecs[0].sub_dim;
107  /* v0 */
108  v0_val = vecs[0].values;
109  v0_val_s = vecs[0].values_stride;
110  /* v1 */
111  v1_val = vecs[1].values;
112  v1_val_s = vecs[1].values_stride;
113  /* v2 */
114  v2_val = vecs[2].values;
115  v2_val_s = vecs[2].values_stride;
116 
117 
118  /* */
119  /* Apply the operator: */
120  /* */
121  /* element-wise reduction : log_result += log(v0 - v1) + log(v2 - v0); */
122  /* */
123  for( k = 0; k < sub_dim; ++k, v0_val += v0_val_s, v1_val += v1_val_s, v2_val += v2_val_s )
124  {
125  /* Element-wise reduction */
126  (*log_result) += log((*v0_val) - (*v1_val)) + log((*v2_val) - (*v0_val));
127  }
128 
129  return 0; /* success? */
130 }
131 
132 /* Virtual function table */
133 const struct RTOp_RTOp_vtbl_t RTOp_ROp_log_bound_barrier_vtbl =
134 {
135  &RTOp_obj_null_vtbl
136  ,&RTOp_obj_value_vtbl
137  ,"ROp_log_bound_barrier"
138  ,NULL
139  ,RTOp_ROp_log_bound_barrier_apply_op
140  ,RTOp_reduct_sum_value
141  ,RTOp_get_reduct_sum_value_op
142 };
143 
144 /* Class specific functions */
145 
146 int RTOp_ROp_log_bound_barrier_construct( struct RTOp_RTOp* op )
147 {
148 #ifdef RTOp_DEBUG
149  assert(op);
150 #endif
151  op->obj_data = NULL;
152  op->vtbl = &RTOp_ROp_log_bound_barrier_vtbl;
153  op->vtbl->obj_data_vtbl->obj_create(NULL,NULL,&op->obj_data);
154  return 0;
155 }
156 
157 int RTOp_ROp_log_bound_barrier_destroy( struct RTOp_RTOp* op )
158 {
159  op->vtbl->obj_data_vtbl->obj_free(NULL,NULL,&op->obj_data);
160  op->obj_data = NULL;
161  op->vtbl = NULL;
162  return 0;
163 }
164 
165 
166 RTOp_value_type RTOp_ROp_log_bound_barrier_val(RTOp_ReductTarget reduct_obj)
167 {
168  return *((RTOp_value_type*)reduct_obj);
169 }
170 
int(* obj_create)(const struct RTOp_obj_type_vtbl_t *vtbl, const void *instance_data, void **obj)
Definition: RTOp.h:941
int(* obj_free)(const struct RTOp_obj_type_vtbl_t *vtbl, const void *instance_data, void **obj)
Definition: RTOp.h:1019