annotate _FullBNT/BNT/potentials/Tables/divide_by_sparse_table.c @ 9:4ea6619cb3f5 tip

removed log files
author matthiasm
date Fri, 11 Apr 2014 15:55:11 +0100
parents b5b38998ef3b
children
rev   line source
matthiasm@8 1 /* divide_by_sparse_table.c ../potential/tables*/
matthiasm@8 2
matthiasm@8 3 /******************************************/
matthiasm@8 4 /* 6 input & 1 output */
matthiasm@8 5 /* Big table [0] */
matthiasm@8 6 /* Big domain [1] */
matthiasm@8 7 /* big sizes [2] */
matthiasm@8 8 /* Small table [3] */
matthiasm@8 9 /* small domain [4] */
matthiasm@8 10 /* small sizes [5] */
matthiasm@8 11 /* */
matthiasm@8 12 /* New big table[0] */
matthiasm@8 13 /******************************************/
matthiasm@8 14
matthiasm@8 15 #include <math.h>
matthiasm@8 16 #include <stdlib.h>
matthiasm@8 17 #include "mex.h"
matthiasm@8 18
matthiasm@8 19 int compare(const void* src1, const void* src2){
matthiasm@8 20 int i1 = *(int*)src1 ;
matthiasm@8 21 int i2 = *(int*)src2 ;
matthiasm@8 22 return i1-i2 ;
matthiasm@8 23 }
matthiasm@8 24
matthiasm@8 25 void ind_subv(int index, const int *cumprod, int n, int *bsubv){
matthiasm@8 26 int i;
matthiasm@8 27
matthiasm@8 28 for (i = n-1; i >= 0; i--) {
matthiasm@8 29 bsubv[i] = ((int)floor(index / cumprod[i]));
matthiasm@8 30 index = index % cumprod[i];
matthiasm@8 31 }
matthiasm@8 32 }
matthiasm@8 33
matthiasm@8 34 int subv_ind(const int n, const int *cumprod, const int *subv){
matthiasm@8 35 int i, index=0;
matthiasm@8 36
matthiasm@8 37 for(i=0; i<n; i++){
matthiasm@8 38 index += subv[i] * cumprod[i];
matthiasm@8 39 }
matthiasm@8 40 return index;
matthiasm@8 41 }
matthiasm@8 42
matthiasm@8 43 void mexFunction(int nlhs, mxArray *plhs[], int nrhs, const mxArray *prhs[]){
matthiasm@8 44 int i, j, count, bdim, sdim, NB, NZB, NZS, position, bindex, sindex;
matthiasm@8 45 int *mask, *result, *bir, *sir, *bjc, *sjc, *bCumprod, *sCumprod, *bsubv, *ssubv;
matthiasm@8 46 double *pbDomain, *psDomain, *pbSize, *psSize, *bpr, *spr, value;
matthiasm@8 47
matthiasm@8 48 plhs[0] = mxDuplicateArray(prhs[0]);
matthiasm@8 49 pbDomain = mxGetPr(prhs[1]);
matthiasm@8 50 bdim = mxGetNumberOfElements(prhs[1]);
matthiasm@8 51 psDomain = mxGetPr(prhs[4]);
matthiasm@8 52 sdim = mxGetNumberOfElements(prhs[4]);
matthiasm@8 53
matthiasm@8 54 pbSize = mxGetPr(prhs[2]);
matthiasm@8 55 psSize = mxGetPr(prhs[5]);
matthiasm@8 56
matthiasm@8 57 NB = 1;
matthiasm@8 58 for(i=0; i<bdim; i++){
matthiasm@8 59 NB *= (int)pbSize[i];
matthiasm@8 60 }
matthiasm@8 61
matthiasm@8 62 bpr = mxGetPr(plhs[0]);
matthiasm@8 63 bir = mxGetIr(plhs[0]);
matthiasm@8 64 bjc = mxGetJc(plhs[0]);
matthiasm@8 65 NZB = bjc[1];
matthiasm@8 66
matthiasm@8 67 spr = mxGetPr(prhs[3]);
matthiasm@8 68 sir = mxGetIr(prhs[3]);
matthiasm@8 69 sjc = mxGetJc(prhs[3]);
matthiasm@8 70 NZS = sjc[1];
matthiasm@8 71
matthiasm@8 72 if(sdim == 0){
matthiasm@8 73 value = *spr;
matthiasm@8 74 if(value == 0)value = 1;
matthiasm@8 75 for(i=0; i<NZB; i++){
matthiasm@8 76 bpr[i] /= value;
matthiasm@8 77 }
matthiasm@8 78 return;
matthiasm@8 79 }
matthiasm@8 80
matthiasm@8 81 mask = malloc(sdim * sizeof(int));
matthiasm@8 82 bCumprod = malloc(bdim * sizeof(int));
matthiasm@8 83 sCumprod = malloc(sdim * sizeof(int));
matthiasm@8 84 bsubv = malloc(bdim * sizeof(int));
matthiasm@8 85 ssubv = malloc(sdim * sizeof(int));
matthiasm@8 86
matthiasm@8 87 count = 0;
matthiasm@8 88 for(i=0; i<sdim; i++){
matthiasm@8 89 for(j=0; j<bdim; j++){
matthiasm@8 90 if(psDomain[i] == pbDomain[j]){
matthiasm@8 91 mask[count] = j;
matthiasm@8 92 count++;
matthiasm@8 93 break;
matthiasm@8 94 }
matthiasm@8 95 }
matthiasm@8 96 }
matthiasm@8 97
matthiasm@8 98 bCumprod[0] = 1;
matthiasm@8 99 for(i=0; i<bdim-1; i++){
matthiasm@8 100 bCumprod[i+1] = bCumprod[i] * (int)pbSize[i];
matthiasm@8 101 }
matthiasm@8 102 sCumprod[0] = 1;
matthiasm@8 103 for(i=0; i<sdim-1; i++){
matthiasm@8 104 sCumprod[i+1] = sCumprod[i] * (int)psSize[i];
matthiasm@8 105 }
matthiasm@8 106
matthiasm@8 107 for(i=0; i<NZB; i++){
matthiasm@8 108 bindex = bir[i];
matthiasm@8 109 ind_subv(bindex, bCumprod, bdim, bsubv);
matthiasm@8 110 for(j=0; j<sdim; j++){
matthiasm@8 111 ssubv[j] = bsubv[mask[j]];
matthiasm@8 112 }
matthiasm@8 113 sindex = subv_ind(sdim, sCumprod, ssubv);
matthiasm@8 114 result = (int *) bsearch(&sindex, sir, NZS, sizeof(int), compare);
matthiasm@8 115 if(result){
matthiasm@8 116 position = result - sir;
matthiasm@8 117 bpr[i] /= spr[position];
matthiasm@8 118 }
matthiasm@8 119 }
matthiasm@8 120
matthiasm@8 121 free(mask);
matthiasm@8 122 free(bCumprod);
matthiasm@8 123 free(sCumprod);
matthiasm@8 124 free(bsubv);
matthiasm@8 125 free(ssubv);
matthiasm@8 126 }