/usr/share/sdpa/mex/mexDisAggSDPsol.cpp is in sdpam 7.3.9+dfsg-1build2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 | /* -------------------------------------------------------------
This file is a component of SDPA
Copyright (C) 2004-2013 SDPA Project
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
------------------------------------------------------------- */
/*
mexDisAggSol.cpp
[x0] = mexDisAggSol(x1,K0s,Ks)
*/
// #include <string>
#include <iostream>
#include "mex.h"
using namespace std;
/* gateway function */
void mexFunction( int nlhs, mxArray *plhs[],
int nrhs, const mxArray *prhs[] )
{
/* [A,c,Ks] = mexAggregateSDPcone(A0,c0,K0s,Ks) */
/* ************************************************** */
/* Check for proper number of input and output arguments */
if (nrhs != 3) {
mexErrMsgTxt("3 input arguments required.");
}
if(nlhs != 1){
mexErrMsgTxt("1 output argument required");
}
/* ---> */
/* reading the dense column vector x1 */
const mxArray* x1_ptr = prhs[0];
if (mxIsSparse(x1_ptr) == 1) {
mexErrMsgTxt("x1 must be a dense column vector.");
}
mwSize x1colSize = mxGetN(x1_ptr);
if (x1colSize > 1) {
mexErrMsgTxt("x1 must be a column vector.");
}
// mwSize x1Size = mxGetM(x1_ptr);
double* x1pr = mxGetPr(x1_ptr);
// std::cout << "x1pr = ";
// for (mwSize j=0; j < x1Size; j++)
// std::cout << x1pr[j] << " ";
// std::cout << std::endl;
/* reading the dense mex vector K0s */
const mxArray* K0s_ptr = prhs[1];
if (mxIsSparse(K0s_ptr) == 1) {
mexErrMsgTxt("K0s must be a dense column vector.");
}
mwSize K0colSize = mxGetN(K0s_ptr);
if (K0colSize > 1) {
mexErrMsgTxt("K0s must be a column vector.");
}
mwSize K0sSize = mxGetM(K0s_ptr);
double* K0spr = mxGetPr(K0s_ptr);
// std::cout << "K0spr = ";
// for (mwSize k0=0; k0 < K0sSize; k0++)
// std::cout << K0spr[k0] << " ";
// std::cout << std::endl;
/* reading the dense mex vector K1s */
const mxArray* K1s_ptr = prhs[2];
if (mxIsSparse(K1s_ptr) == 1) {
mexErrMsgTxt("K1s must be a dense column vector.");
}
mwSize K1colSize = mxGetN(K1s_ptr);
if (K1colSize > 1) {
mexErrMsgTxt("K1s must be a column vector.");
}
// mwSize K1sSize = mxGetM(K1s_ptr);
double* K1spr = mxGetPr(K1s_ptr);
// std::cout << "K1spr = ";
// for (mwSize k1=0; k1 < K1sSize; k1++)
// std::cout << K1spr[k1] << " ";
// std::cout << std::endl;
/* Constructing the dense column vector x0 */
/* the column size of x0 be constructed */
mwSize x0Size = 0;
for (mwSize k0 = 0; k0 < K0sSize; k0++)
x0Size += (mwSize)(K0spr[k0]*K0spr[k0]);
// std::cout << "x0Size = " << x0Size << std::endl;
plhs[0] = mxCreateDoubleMatrix(x0Size,1,mxREAL);
double* x0pr = mxGetPr(plhs[0]);
/* Construction of x0 */
int k1 = -1;
int topNDblks = 0;
int bottomNDblks = 0;
mwSize c0colPt = 0;
mwSize c1colPt = 0;
for (mwSize k0 = 0; k0 < K0sSize; k0++) {
bottomNDblks -= (int) K0spr[k0];
if (bottomNDblks < 0) {
k1++;
topNDblks = 0;
bottomNDblks = (int) (K1spr[k1] - K0spr[k0]);
}
else {
topNDblks += (int) K0spr[k0-1];
}
// std::cout << " k0 = " << k0 << " topNDblks = " << topNDblks << " bottomNDblks = " << bottomNDblks << std::endl;
for (mwSize j0 = 0; j0 < K0spr[k0]; j0++) {
c1colPt += topNDblks;
for (mwSize i0 = 0; i0 < K0spr[k0]; i0++) {
x0pr[c0colPt+i0] = x1pr[c1colPt+i0];
}
c0colPt += (int) K0spr[k0];
c1colPt += (int) (K0spr[k0]+bottomNDblks);
}
}
// for (mwSize j=0; j < x0Size; j++)
// std::cout << x0pr[j] << " ";
// std::cout << std::endl;
return;
}
|