/* ARGSUSED */
static int
px_double_buffer(ncio *const nciop, off_t to, off_t from,
size_t nbytes, int rflags)
{
ncio_px *const pxp = (ncio_px *)nciop->pvt;
int status = ENOERR;
void *src;
void *dest;
(void)rflags;
#if INSTRUMENT
fprintf(stderr, "\tdouble_buffr %ld %ld %ld\n",
(long)to, (long)from, (long)nbytes);
#endif
status = px_get(nciop, pxp, to, nbytes, RGN_WRITE,
&dest);
if(status != ENOERR)
return status;
if(pxp->slave == NULL)
{
pxp->slave = (ncio_px *) malloc(sizeof(ncio_px));
if(pxp->slave == NULL)
return ENOMEM;
pxp->slave->blksz = pxp->blksz;
/* pos done below */
pxp->slave->bf_offset = pxp->bf_offset;
pxp->slave->bf_extent = pxp->bf_extent;
pxp->slave->bf_cnt = pxp->bf_cnt;
pxp->slave->bf_base = malloc(2 * pxp->blksz);
if(pxp->slave->bf_base == NULL)
return ENOMEM;
(void) memcpy(pxp->slave->bf_base, pxp->bf_base,
pxp->bf_extent);
pxp->slave->bf_rflags = 0;
pxp->slave->bf_refcount = 0;
pxp->slave->slave = NULL;
}
pxp->slave->pos = pxp->pos;
status = px_get(nciop, pxp->slave, from, nbytes, 0,
&src);
if(status != ENOERR)
return status;
if(pxp->pos != pxp->slave->pos)
{
/* position changed, sync */
pxp->pos = pxp->slave->pos;
}
(void) memcpy(dest, src, nbytes);
(void)px_rel(pxp->slave, from, 0);
(void)px_rel(pxp, to, RGN_MODIFIED);
return status;
}
/* Request that the region (offset, extent) be made available through
*vpp.
This function converts a file region specified by an offset and
extent to a memory pointer. The region may be locked until the
corresponding call to rel().
For POSIX systems, without NC_SHARE. This function gets a page of
size extent?
This is a wrapper for the function px_get, which does all the heavy
lifting.
nciop - pointer to ncio struct for this file.
offset - offset (from beginning of file?) to the data we want to
read.
extent - the number of bytes to read from the file.
rflags - One of the RGN_* flags defined in ncio.h.
vpp - handle to point at data when it's been read.
*/
static int
ncio_px_get(ncio *const nciop,
off_t offset, size_t extent,
int rflags,
void **const vpp)
{
ncio_px *const pxp = (ncio_px *)nciop->pvt;
if(fIsSet(rflags, RGN_WRITE) && !fIsSet(nciop->ioflags, NC_WRITE))
return EPERM; /* attempt to write readonly file */
/* reclaim space used in move */
if(pxp->slave != NULL)
{
if(pxp->slave->bf_base != NULL)
{
free(pxp->slave->bf_base);
pxp->slave->bf_base = NULL;
pxp->slave->bf_extent = 0;
pxp->slave->bf_offset = OFF_NONE;
}
free(pxp->slave);
pxp->slave = NULL;
}
return px_get(nciop, pxp, offset, extent, rflags, vpp);
}
MAT *m_inverse(const MAT *A, MAT *out)
{
unsigned int i;
char MatrixTempBuffer[ 4000 ];
VEC *tmp = VNULL, *tmp2 = VNULL;
MAT *A_cp = MNULL;
PERM *pivot = PNULL;
if ( ! A )
error(E_NULL,"m_inverse");
if ( A->m != A->n )
error(E_SQUARE,"m_inverse");
if ( ! out || out->m < A->m || out->n < A->n )
out = m_resize(out,A->m,A->n);
if( SET_MAT_SIZE( A->m, A->n ) < 1000 )
mat_get( &A_cp, (void *)( MatrixTempBuffer + 2000 ), A->m, A->n );
else
A_cp = matrix_get( A->m, A->n );
A_cp = m_copy( A, A_cp );
if( SET_VEC_SIZE( A->m ) < 1000 ) {
vec_get( &tmp, (void *)MatrixTempBuffer, A->m );
vec_get( &tmp2, (void *)(MatrixTempBuffer + 1000), A->m );
} else {
tmp = v_get( A->m );
tmp2 = v_get( A->m );
}
if( SET_PERM_SIZE( A->m ) < 1000 ) {
perm_get( &pivot, (void *)( MatrixTempBuffer + 3000 ), A->m );
} else {
pivot = px_get( A->m );
}
LUfactor(A_cp,pivot);
//tracecatch_matrix(LUfactor(A_cp,pivot),"m_inverse");
for ( i = 0; i < A->n; i++ ){
v_zero(tmp);
tmp->ve[i] = 1.0;
LUsolve(A_cp,pivot,tmp,tmp2);
//tracecatch_matrix(LUsolve(A_cp,pivot,tmp,tmp2),"m_inverse");
set_col(out,i,tmp2);
}
if( tmp != (VEC *)(MatrixTempBuffer ) ) // память выделялась, надо освободить
V_FREE(tmp);
if( tmp2 != (VEC *)(MatrixTempBuffer + 1000) ) // память выделялась, надо освободить
V_FREE(tmp2);
if( A_cp != (MAT *)(MatrixTempBuffer + 2000) ) // память выделялась, надо освободить
M_FREE(A_cp);
if( pivot != (PERM *)(MatrixTempBuffer + 3000) ) // память выделялась, надо освободить
PX_FREE( pivot );
return out;
}
extern int px_get_vars(int dim,...)
{
va_list ap;
int i=0;
PERM **par;
va_start(ap, dim);
while (par = va_arg(ap,PERM **)) { /* NULL ends the list*/
*par = px_get(dim);
i++;
}
va_end(ap);
return i;
}
/* px_resize -- returns the permutation px with size new_size
-- px is set to the identity permutation */
extern PERM *px_resize(PERM *px, int new_size)
{
int i;
if (new_size < 0)
error(E_NEG,"px_resize");
if ( ! px )
return px_get(new_size);
/* nothing is changed */
if (new_size == px->size)
return px;
if ( new_size > px->max_size )
{
if (mem_info_is_on()) {
mem_bytes(TYPE_PERM,px->max_size*sizeof(u_int),
new_size*sizeof(u_int));
}
px->pe = RENEW(px->pe,new_size,u_int);
if ( ! px->pe )
error(E_MEM,"px_resize");
px->max_size = new_size;
}
if ( px->size <= new_size )
/* extend permutation */
for ( i = px->size; i < new_size; i++ )
px->pe[i] = i;
else
for ( i = 0; i < new_size; i++ )
px->pe[i] = i;
px->size = new_size;
return px;
}
/* Like memmove(), safely move possibly overlapping data.
Copy one region to another without making anything available to
higher layers. May be just implemented in terms of get() and rel(),
or may be tricky to be efficient. Only used in by nc_enddef()
after redefinition.
nciop - pointer to ncio struct with file info.
to - src for move?
from - dest for move?
nbytes - number of bytes to move.
rflags - One of the RGN_* flags defined in ncio.h. The only
reasonable flag value is RGN_NOLOCK.
*/
static int
ncio_px_move(ncio *const nciop, off_t to, off_t from,
size_t nbytes, int rflags)
{
ncio_px *const pxp = (ncio_px *)nciop->pvt;
int status = ENOERR;
off_t lower;
off_t upper;
char *base;
size_t diff;
size_t extent;
if(to == from)
return ENOERR; /* NOOP */
if(fIsSet(rflags, RGN_WRITE) && !fIsSet(nciop->ioflags, NC_WRITE))
return EPERM; /* attempt to write readonly file */
rflags &= RGN_NOLOCK; /* filter unwanted flags */
if(to > from)
{
/* growing */
lower = from;
upper = to;
}
else
{
/* shrinking */
lower = to;
upper = from;
}
diff = (size_t)(upper - lower);
extent = diff + nbytes;
#if INSTRUMENT
fprintf(stderr, "ncio_px_move %ld %ld %ld %ld %ld\n",
(long)to, (long)from, (long)nbytes, (long)lower, (long)extent);
#endif
if(extent > pxp->blksz)
{
size_t remaining = nbytes;
if(to > from)
{
off_t frm = from + nbytes;
off_t toh = to + nbytes;
for(;;)
{
size_t loopextent = MIN(remaining, pxp->blksz);
frm -= loopextent;
toh -= loopextent;
status = px_double_buffer(nciop, toh, frm,
loopextent, rflags) ;
if(status != ENOERR)
return status;
remaining -= loopextent;
if(remaining == 0)
break; /* normal loop exit */
}
}
else
{
for(;;)
{
size_t loopextent = MIN(remaining, pxp->blksz);
status = px_double_buffer(nciop, to, from,
loopextent, rflags) ;
if(status != ENOERR)
return status;
remaining -= loopextent;
if(remaining == 0)
break; /* normal loop exit */
to += loopextent;
from += loopextent;
}
}
return ENOERR;
}
#if INSTRUMENT
fprintf(stderr, "\tncio_px_move small\n");
#endif
status = px_get(nciop, pxp, lower, extent, RGN_WRITE|rflags,
(void **)&base);
if(status != ENOERR)
return status;
if(to > from)
(void) memmove(base + diff, base, nbytes);
else
(void) memmove(base, base + diff, nbytes);
(void) px_rel(pxp, lower, RGN_MODIFIED);
return status;
}
//FIXME: add LOCALFUNC? (OR GLOBAL?)
BYTE* RECURSIVE_SUBROUTINE(BYTE t, list *cur_guess, list *guesses, list_node *first_guess)
{
if ( t == key_length)
{
unsigned char* key=NULL;
// generate key from the cur_guess (push guesses into a matrix and use some matrix solving library?)
MAT* A;
VEC *x,*b;
PERM* pivot;
A=m_get(key_length,key_length);
b=v_get(key_length);
x=v_get(key_length);
int c=0,r=0;
for(list_node* iter=list_head(cur_guess); iter != NULL && r<key_length; iter=list_node_next(iter)){
for(c=list_node_data_ptr(iter,byte_sum_guess_t)->i1;
c <= list_node_data_ptr(iter,byte_sum_guess_t)->i2;
++c){
A->me[r][c]=1;
}
b->ve[r]=list_node_data_ptr(iter,byte_sum_guess_t)->value;
++r;
}
//Calculate matrix determinant
SQRMATRIX A_det;
SQRMATRIX_CreateMatrix(&A_det,key_length);
for(r=0;r<key_length;++r){
for(c=0;c<key_length;++c){
A_det.array[r][c]=A->me[r][c];
}
}
int det;
det=SQRMATRIX_CalcDeterminant(&A_det);
//TODO: return this later
SQRMATRIX_DestroyMatrix(&A_det);
if(det==0){//If determinant is 0 continue to next guess
++count_bad_matrix;
#ifdef __DEBUG
//SQRMATRIX_DisplayMatrix(&A_det);
v_output(b);
#endif
DEBUG_PRINT("Matrix determinant is 0\n");
}else{
++count_guesses;
pivot = px_get(A->m);
LUfactor(A,pivot);
x=LUsolve(A,pivot,b,VNULL);
PX_FREE(pivot);
//test key (use our RC4 impl)
key=(unsigned char*)malloc(sizeof(unsigned char)*key_length);
for(int i=0;i<key_length;++i){
key[i]=x->ve[i];
}
int res=rc4_test_key(key);
if(res){
printf("MAZAL TOV! we got the right key.\n");
print_key(key);
printf("\n");
}else{
printf("Tried key: ");
print_key(key);
printf("\n");
free(key);key=NULL;
}
}
//release matrix vars
M_FREE(A);
V_FREE(x);
V_FREE(b);
return key;
}
byte_sum_guess_t cur;
//list *new_list_head=guesses;
//TODO: (later) add a for loop running along the "lambeda_t" values here, for the initial impl we'll try the best guess
//for ()
//{
for(int i=0; i<LAMBDA_T; ++i){
cur = *(list_node_data_ptr(first_guess, byte_sum_guess_t));
list_node *biatch = list_add_head(cur_guess, &cur);
BYTE* res=RECURSIVE_SUBROUTINE(t+1, cur_guess, guesses, list_node_next(first_guess));
if(res!=NULL){
return res;
}
list_del(cur_guess,biatch);
first_guess = list_node_next(first_guess);
}
return NULL;
//TODO: do something to find the next guess and link it to the current guess
//when I say something I mean find best guess (i.e best weight) of all the guesses that give us new information
//(i.e not linearily dependent in our byte values and sums matrix that can be deduced from the cur_guess)
//see also the note above (intuition)
//IMPORTANT!
//explaination how cur_guess is a matrix: each entry in cur_guess contains a list of bytes that are part of the sum and a
//guess as to the value of the sum. if this matrix is solvable then solving it should give us a value for each byte of the
//key thus the entire key
//note: we probably should change cur_guess to a smarter database (for example a (L)x(L+1) matrix as an array?) but we
//need to consider that we need to keep the ability to backtrack without making it too expensive
//TODO: if weight of the guess is too small -> return FAIL (section 4.6)
//These are based on section 4.4
//correct suggestions (this can be done later, basic alg should work without it)
//adjust weights (this can be done later, basic alg should work without it)
//merge counters (section 4.2), also skip for initial impl? need to check
//go to next iteration in the recurtion
//RECURSIVE_SUBROUTINE(t+1, cur_guess, );
//} end of for
}
void generate_fractal(double cx, double cy, double rwidth, double rheight, Pixmap* out, int iters, long long points)
{
printf("generate\n");
const int width = out->width;
const int height = out->height;
const double pixelWidth = rwidth / width;
const double pixelHeight = rheight / height;
#pragma omp parallel
{
unsigned* priv_px = calloc(width * height, sizeof(unsigned));
double* trace = calloc(iters * 2, sizeof(double));
#pragma omp for
for (long long i = 0; i < points; i++) {
// 'C' in mandelbrot formula
const double sx = rand_double();
const double sy = rand_double();
double x = 0.0;
double y = 0.0;
for (int j = 0; j < iters; j++) {
// Mandelbrot formulas in R
const double nx = x * x - y * y + sx;
const double ny = 2 * x * y + sy;
x = nx;
y = ny;
// Store point in trace
trace[2 * j] = x;
trace[2 * j + 1] = y;
if (x * x + y * y > 6.0) {
// Draw trace
const int length = j * 2;
for (int k = 0; k < length; k += 2) {
const int qx = (int) (((trace[k] - cx) + rwidth * 0.5) / pixelWidth);
const int qy = (int) (((trace[k + 1] - cy) + rheight * 0.5) / pixelHeight);
if (qx >= 0 && qy >= 0 && qx < width && qy < height) {
priv_px[width * qy + qx]++;
}
}
break;
}
}
}
#pragma omp critical
{
for (int y = 0; y < height; y++) {
for (int x = 0; x < width; x++) {
px_set(out, x, y, px_get(out, x, y) + priv_px[width * y + x]);
}
}
}
free(trace);
free(priv_px);
}
}
void
test(const int n, const int lb, const int ub, bool dumpfull) {
// Generate a special-band-matrix mfull With lb lower diagonals, ub upper
// diagonals and the elements of the highest upper diagonal extended across
// each row
MAT *mfull = m_get(n, n);
//m_rand(mfull);
randlist(mfull->base, (mfull->n)*(mfull->n));
double **me = mfull->me;
for(int i = 0; i < n; i++) {
for(int j = 0; j < i - lb; j++)
me[i][j] = 0.0;
for(int j = i+ub+1; j < n; j++)
me[i][j] = me[i][i+ub];
}
// Copy matrix mfull to a compactly stored version
// mcmpct
// First lb columns padding for later use
// Next lb columns for lower diagonals
// Next column for diagonal
// Next ub columns for upper diagonals
// as the highest upper diagonal of the same row
const int mm = 2*lb+ub+1;
double mcmpct[n][mm];
zero(&mcmpct[0][0], n*mm);
for(int i = 0; i < n; i++)
for(int j = MAX(i-lb, 0); j < MIN(i+ub+1, n); j++)
mcmpct[i][j-i+lb+lb] = me[i][j];
// Replace unused values with NAN to be sure they aren't used
for(int k = 0; k < n; k++)
for(int i = 0; i < lb; i++)
mcmpct[k][i] = NAN;
for(int k = 0; k < lb; k++)
for(int i = 0; i < lb-k; i++)
mcmpct[k][i+lb] = NAN;
for(int k=n-1; k >= n-ub; k--)
for(int i = n-1-k+1+lb; i < mm; i++)
mcmpct[k][i+lb] = NAN;
// Generate start vector x1 for test
VEC *x1 = v_get(n);
randlist(x1->ve, n);
// Calculate mfull*x1 = dfull
VEC *dfull = v_get(n);
mv_mlt(mfull, x1, dfull);
// Calculate mcmpct*x1 = dcmpct
double dcmpct[n];
bdspecLUmlt(&mcmpct[0][0], n, lb, ub, x1->ve, dcmpct);
if(dumpfull) {
printf("Vector x (random values)\n");
printf("========================\n");
v_out(x1->ve, n);
printf("Matrix A (random values)\n");
printf("========================\n");
printf("Full NxN Meschach Matrix\n");
m_out(mfull->base, n, n);
printf("Compact bdspec Array\n");
m_out(&mcmpct[0][0], n, mm);
printf("Vector d = A*x\n");
printf("==============\n");
printf("Calculated from Full Meschach Matrix:\n");
v_out(dfull->ve, n);
printf("Calculated from Compact bdspec Array:\n");
v_out(dcmpct, n);
printf("L2 norm of difference between Meschach and bdspec calculations of d\n");
}
double ddiff = v_diff(dfull->ve, dcmpct, n);
printf("d diff=%6.0E ", ddiff);
if(ddiff*ddiff > DBL_EPSILON*v_normsq(dfull->ve, n))
printf("FAIL,");
else
printf("PASS,");
PERM *p = px_get(n);
LUfactor(mfull, p);
int indx[n];
bdspecLUfactormeschscale(&mcmpct[0][0], n, lb, ub, indx);
VEC *yfull = v_get(n);
catchall(LUsolve(mfull, p, dfull, yfull), printf("--matrix singular--:\n"));
double ycmpct[n];
for(int i = 0; i < n; i++)
ycmpct[i] = dcmpct[i];
bdspecLUsolve(&mcmpct[0][0], n, lb, ub, indx, ycmpct);
if(dumpfull) {
printf("\n\n");
printf("LU Factorization\n");
printf("================\n");
printf("Meschach LU Array\n");
m_out(mfull->base, n, n);
printf("Compact bdspec LU Array\n");
m_out(&mcmpct[0][0], n, mm);
printf("Permutation\n");
printf("===========\n");
printf("Meschach permutation vector\n");
p_out((int *) p->pe, n);
printf("bdspec indx vector\n");
p_out(indx, n);
printf("A*y = d Solved for y\n");
printf("====================\n");
printf("Meschach result\n");
v_out(yfull->ve, n);
printf("bdspec result\n");
v_out(ycmpct, n);
printf("L2 norm of difference between Meschach and bdspec calculations of y:\n");
}
double ydiff = v_diff(yfull->ve, ycmpct, n);
printf("y diff=%6.0E ", ydiff);
if(ydiff*ydiff > DBL_EPSILON*v_normsq(yfull->ve, n))
printf("FAIL,");
else
printf("PASS,");
if(dumpfull) {
printf("\n\n");
printf("L2 norm of error = y-x\n");
printf("======================\n");
}
double x1normsq = v_normsq(x1->ve, n);
double mescherr = v_diff(yfull->ve, x1->ve, n);
printf("mesch err=%6.0E ", mescherr);
if(mescherr*mescherr > DBL_EPSILON*x1normsq)
printf("FAIL,");
else
printf("PASS,");
double bdspecerr = v_diff(ycmpct, x1->ve, n);
printf("bdspec err=%6.0E ", bdspecerr);
if(bdspecerr*bdspecerr > DBL_EPSILON*x1normsq)
printf("FAIL ");
else
printf("PASS ");
if(dumpfull) {
printf("\n\n");
}
fflush(stdout);
}
