Skip to content

etcart / RIVet

Go to a project
Commit 41cdd603 by etcart
Options

back that sh** up

parents
Inline Side-by-side
Showing with 2357 additions and 0 deletions
RIVtoolsCPU.h 0 → 100644
#include <stdio.h>
#include <stdlib.h>
#include <strsafe.h>
#define SEEDMASK 25214903917
struct RIVData{
int RIVsize;
int nonZeros;
long long int *masks;
int *h_tempBlock;
int *h_stagingBlock;
int *h_staging_slider;
int *h_staging_stop;
int *h_displacements;
int *d_OpenSlot;
int *d_SlotEnd;
float *d_magnitudes;
int thing;
}RIVKeyData;
typedef struct{
char name[100];
int *values;
int *locations;
int count;
int frequency;
float magnitude;
int boolean;
}sparseRIV;
sparseRIV FileToL2(FILE *data);
void consolidateD2S(sparseRIV *destination, int *denseInput);
void setKeyData(int RIVsize, int nonZeros, int blockSize);
int* mapS2D(int * destination, sparseRIV input);
int* makeSparseLocations(int *seeds, int seedCount);
void makeSeeds(unsigned char* word, int **seeds, int *seedCount);
float* cosineCompare(sparseRIV baseRIV, sparseRIV *multipliers, int multiplierCount, float threshold);
void getMagnitudes(sparseRIV *inputs, int RIVCount);
int *mapI2D(int *locations, int seedCount);
sparseRIV text2L2(unsigned char *text);
unsigned char *sscanAdvance(unsigned char **string, unsigned char *word);
sparseRIV FileToL2(FILE *data){
unsigned char *word = (unsigned char*)calloc(2000, 1);
int *seeds = RIVKeyData.h_tempBlock;
int seedCount = 0;
while(fscanf(data, "%s", word)){
if(feof(data)){
break;
}
if(!(*word)){
break;
}
makeSeeds(word, &seeds, &seedCount);
memset(word, 0, 2000);
}
int *locations = makeSparseLocations(seeds, seedCount);
//printf("mcshittles");
int *L2dense;
L2dense = mapI2D(locations, seedCount);
sparseRIV output;
//printf("tits");
consolidateD2S( &output, L2dense);
free(L2dense);
output.boolean = 1;
RIVKeyData.thing++;
return output;
}
float* cosineCompare(sparseRIV baseRIV, sparseRIV *multipliers, int multiplierCount, float threshold){
int *baseDenseRIV = RIVKeyData.h_tempBlock;
mapS2D(baseDenseRIV, baseRIV);
float *outputs = (float*)malloc((multiplierCount)* sizeof(float));
float *output_slider = outputs;
sparseRIV *multipliersStop = multipliers+multiplierCount;
float minsize = baseRIV.magnitude * .75;
float maxsize = baseRIV.magnitude * 1.25;
while(multipliers<multipliersStop){
if(((*multipliers).boolean) /*&& (((*multipliers).magnitude < maxsize) && ((*multipliers).magnitude > minsize))*/){
int dot = 0;
int *values = (*multipliers).values;
int *locations = (*multipliers).locations;
int *locations_Stop = locations+(*multipliers).count;
while(locations<locations_Stop){
dot += (*values)*(*(baseDenseRIV+(*locations)));
locations++;
values++;
}
*output_slider= dot/((baseRIV.magnitude)*((*multipliers).magnitude));
if(*output_slider>=threshold){
printf("%s\t%s\n%f\n", (*multipliers).name, baseRIV.name, *output_slider);
(*multipliers).boolean = 0;
//RIVKeyData.thing ++;
}
}
multipliers++;
output_slider++;
}
return outputs;
}
void getMagnitudes(sparseRIV *inputs, int RIVCount){
for(int i=0; i<RIVCount; i++){
int temp = 0;
int *values = inputs[i].values;
int *values_stop = values+inputs[i].count;
while(values<values_stop){
temp += (*values)*(*values);
values++;
}
float magnitude = sqrt(temp);
inputs[i].magnitude = magnitude;
//printf("magnitude = %f, \n", magnitude);
}
}
int* mapS2D(int* destination, sparseRIV input){
memset(destination, 0, RIVKeyData.RIVsize*sizeof(int));
int *locations_slider = input.locations;
int *values_slider = input.values;
int *locations_stop = locations_slider+input.count;
while(locations_slider<locations_stop){
destination[*locations_slider] = *values_slider;
locations_slider++;
values_slider++;
}
//HANDLE_ERROR (cudaMemcpy (RIVKeyData.d_OpenSlot, destination, RIVKeyData.RIVsize*sizeof(int), cudaMemcpyHostToDevice));
return destination;
}
int* mapI2D(int *locations, int valueCount){
int *destination = (int*)calloc(RIVKeyData.RIVsize,sizeof(int));
int *locations_slider = locations;
int *locations_stop = locations_slider+valueCount;
int value = 1;
while(locations_slider<locations_stop){
destination[*locations_slider] +=value;
locations_slider++;
value = (value == 1)? -1: 1;
}
return destination;
}
void consolidateD2S(sparseRIV *destination, int *denseInput){
int count = 0;
(*destination).locations = (int*) malloc(RIVKeyData.RIVsize*sizeof(int));
(*destination).values = (int*) malloc(RIVKeyData.RIVsize*sizeof(int));
for(int i=0; i<RIVKeyData.RIVsize; i++){
if(denseInput[i]){
(*destination).locations[count] = i;
(*destination).values[count] = denseInput[i];
count++;
}
}
destination->count = count;
(*destination).locations = (int*) realloc((*destination).locations, (*destination).count*sizeof(int));
(*destination).values = (int*) realloc((*destination).values, (*destination).count*sizeof(int));
}
void setKeyData(int RIVsize, int nonZeros, int blockSize){
RIVKeyData.RIVsize = RIVsize;
if(nonZeros%2){
printf("your nonZeros must be an even number");
nonZeros++;
printf(", changed to %d", nonZeros);
}
RIVKeyData.nonZeros = nonZeros;
RIVKeyData.masks = (long long int*)malloc(nonZeros*sizeof(long long int));
for(int i = 0; i<nonZeros; i++){
RIVKeyData.masks[i] = SEEDMASK>>(5*i);
}
RIVKeyData.h_tempBlock = (int*)malloc(blockSize*sizeof(int));
//RIVKeyData.h_stagingBlock = (int*)malloc(blockSize*sizeof(int));
//RIVKeyData.h_staging_slider = RIVKeyData.h_stagingBlock;
RIVKeyData.thing = 0;
}
void makeSeeds(unsigned char* word, int **seeds, int *seedCount){
int i=0;
int seedbase = 0;
while(*word){
seedbase += (*(word))<<(i*5);
word++;
i++;
}
int *seedTrack = (*seeds)+*seedCount;
for(i =0 ; i<RIVKeyData.nonZeros; i++){
*seedTrack = (seedbase>>i)+(3*i);
seedTrack++;
}
*seedCount+=RIVKeyData.nonZeros;
return;
}
int* makeSparseLocations(int* seeds, int seedCount){
int *locations = RIVKeyData.h_tempBlock;
int *locations_slider = locations;
int *seeds_stop = seeds+seedCount;
long long int *mask = RIVKeyData.masks;
long long int *mask_stop = mask+RIVKeyData.nonZeros;
while(seeds<seeds_stop){
*locations_slider =(((*seeds)^(*mask)) & 2147483647) %(RIVKeyData.RIVsize);
mask++;
locations_slider++;
seeds++;
if(!(mask<mask_stop)) mask-=RIVKeyData.nonZeros;
}
return locations;
}
unsigned char *sscanAdvance(unsigned char **string, unsigned char *word){
unsigned char *word_slider = word;
while(*(*string)){
if(*(*string) == ' ') {
(*string)++;
break;
}
*word_slider = *(*string);
word_slider++;
(*string)++;
}
*word_slider = 0;
return word;
}
sparseRIV text2L2(unsigned char *text){
unsigned char *word = (unsigned char*)calloc(2000, 1);
int *seeds = ( int*)malloc(RIVKeyData.nonZeros*sizeof( int));
unsigned char *text_slider = text;
int seedCount = 0;
while(*text_slider){
sscanAdvance(&text_slider, word);
makeSeeds(word, &seeds, &seedCount);
memset(word, 0, 2000);
}
int *locations = makeSparseLocations(seeds, seedCount);
int *L2dense;
L2dense = mapI2D(locations, seedCount);
free(locations);
sparseRIV output;
consolidateD2S(&output, L2dense);
free(seeds);
return output;
}
RIVtoolsCPUlinux.h 0 → 100644
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define SEEDMASK 25214903917
struct RIVData{
int RIVsize;
int nonZeros;
long long int *masks;
int *h_tempBlock;
int *h_stagingBlock;
int *h_staging_slider;
int *h_staging_stop;
int *h_displacements;
int *d_OpenSlot;
int *d_SlotEnd;
float *d_magnitudes;
int thing;
}RIVKey;
typedef struct{
char name[100];
int *values;
int *locations;
int count;
int frequency;
float magnitude;
int boolean;
}sparseRIV;
typedef struct{
char name[100];
int *values;
int frequency;
float magnitude;
}denseRIV;
int lexPush(denseRIV RIVout);
denseRIV lexPull(int *valuesOut, char* word);
int isWordClean(char* word);
int isLetter(char c);
sparseRIV FileToL2(FILE *data);
sparseRIV FileToL2Clean(FILE *data);
sparseRIV consolidateD2S(int *denseInput);
void setKeyData(int RIVsize, int nonZeros, int blockSize);
int* mapS2D(int * destination, sparseRIV input);
int* makeSparseLocations(int *seeds, int seedCount);
void makeSeeds(unsigned char* word, int **seeds, int *seedCount);
void cosineCompare(sparseRIV baseRIV, sparseRIV *multipliers, int multiplierCount, float threshold);
void getMagnitudes(sparseRIV *inputs, int RIVCount);
int *mapI2D(int *locations, int seedCount);
sparseRIV text2L2(unsigned char *text);
unsigned char *sscanAdvance(unsigned char **string, unsigned char *word);
sparseRIV FileToL2(FILE *data){
unsigned char word[2000] = {0};
int *seeds = RIVKey.h_tempBlock;
int seedCount = 0;
while(fscanf(data, "%s", word)){
if(feof(data)){
break;
}
if(!(*word)){
break;
}
makeSeeds(word, &seeds, &seedCount);
}
int *locations = makeSparseLocations(seeds, seedCount);
int *L2dense;
L2dense = mapI2D(locations, seedCount);
sparseRIV output = consolidateD2S(L2dense);
free(L2dense);
output.frequency = seedCount/RIVKey.nonZeros;
output.boolean = 1;
return output;
}
sparseRIV FileToL2Clean(FILE *data){
unsigned char word[100] = {0};
int *seeds = RIVKey.h_tempBlock;
int seedCount = 0;
while(fscanf(data, "%100s", word)){
if(feof(data)){
break;
}
if(!(*word)){
break;
}
if(!isWordClean((char*)word)) continue;
makeSeeds(word, &seeds, &seedCount);
}
int *locations = makeSparseLocations(seeds, seedCount);
int *L2dense;
L2dense = mapI2D(locations, seedCount);
sparseRIV output = consolidateD2S(L2dense);
free(L2dense);
output.frequency = seedCount/RIVKey.nonZeros;
output.boolean = 1;
return output;
}
void cosineCompare(sparseRIV baseRIV, sparseRIV *multipliers, int multiplierCount, float threshold){
int *baseDenseRIV = RIVKey.h_tempBlock;
mapS2D(baseDenseRIV, baseRIV);
float cosSim;
sparseRIV *multipliersStop = multipliers+multiplierCount;
float minsize = baseRIV.magnitude * .75;
float maxsize = baseRIV.magnitude * 1.25;
while(multipliers<multipliersStop){
if(((*multipliers).boolean)/* && (((*multipliers).magnitude < maxsize) && ((*multipliers).magnitude > minsize))*/){
int dot = 0;
int *values = (*multipliers).values;
int *locations = (*multipliers).locations;
int *locations_Stop = locations+(*multipliers).count;
while(locations<locations_Stop){
dot += (*values)*(*(baseDenseRIV+(*locations)));
locations++;
values++;
}
cosSim= dot/((baseRIV.magnitude)*((*multipliers).magnitude));
//if(cosSim>=threshold){
printf("#######%s\t%s\n%f\n", (*multipliers).name, baseRIV.name, cosSim);
(*multipliers).boolean = 0;
RIVKey.thing ++;
scanf("%d", &RIVKey.thing);
//}
}
multipliers++;
}
}
void getMagnitudes(sparseRIV *inputs, int RIVCount){
for(int i=0; i<RIVCount; i++){
int temp = 0;
int *values = inputs[i].values;
int *values_stop = values+inputs[i].count;
while(values<values_stop){
temp += (*values)*(*values);
values++;
}
float magnitude = sqrt(temp);
inputs[i].magnitude = magnitude;
//printf("magnitude = %f, \n", magnitude);
}
}
int* mapS2D(int* destination, sparseRIV input){
memset(destination, 0, RIVKey.RIVsize*sizeof(int));
int *locations_slider = input.locations;
int *values_slider = input.values;
int *locations_stop = locations_slider+input.count;
while(locations_slider<locations_stop){
destination[*locations_slider] = *values_slider;
locations_slider++;
values_slider++;
}
return destination;
}
int* mapI2D(int *locations, int valueCount){
int *destination = (int*)calloc(RIVKey.RIVsize,sizeof(int));
int *locations_slider = locations;
int *locations_stop = locations_slider+valueCount;
int value = 1;
while(locations_slider<locations_stop){
destination[*locations_slider] +=value;
locations_slider++;
value = (value == 1)? -1: 1;
}
return destination;
}
sparseRIV consolidateD2S(int *denseInput){
sparseRIV output;
output.count = 0;
int* locations = RIVKey.h_tempBlock;
int* values = RIVKey.h_tempBlock+RIVKey.RIVsize;
int* locations_slider = locations;
int* values_slider = values;
for(int i=0; i<RIVKey.RIVsize; i++){
if(denseInput[i]){
*(locations_slider++) = i;
*(values_slider++) = denseInput[i];
output.count++;
}
}
output.locations = (int*) malloc(output.count*sizeof(int));
memcpy(output.locations, locations, output.count*sizeof(int));
output.values = (int*) malloc(output.count*sizeof(int));
memcpy(output.values, values, output.count*sizeof(int));
return output;
}
void setKeyData(int RIVsize, int nonZeros, int blockSize){
RIVKey.RIVsize = RIVsize;
if(nonZeros%2){
printf("your nonZeros must be an even number");
nonZeros++;
printf(", changed to %d", nonZeros);
}
RIVKey.nonZeros = nonZeros;
RIVKey.masks = (long long int*)malloc(nonZeros*sizeof(long long int));
for(int i = 0; i<nonZeros; i++){
RIVKey.masks[i] = SEEDMASK>>(5*i);
}
RIVKey.h_tempBlock = (int*)malloc(blockSize*sizeof(int));
RIVKey.h_stagingBlock = (int*)malloc(blockSize*sizeof(int));
RIVKey.h_staging_slider = RIVKey.h_stagingBlock;
RIVKey.thing = 0;
}
void makeSeeds(unsigned char* word, int **seeds, int *seedCount){
int i=0;
int seedbase = 0;
while(*word){
seedbase += (*(word))<<(i*5);
word++;
i++;
}
int *seedTrack = (*seeds)+*seedCount;
for(i =0 ; i<RIVKey.nonZeros; i++){
*seedTrack = (seedbase>>i)+(3*i);
seedTrack++;
}
*seedCount+=RIVKey.nonZeros;
return;
}
int* makeSparseLocations(int* seeds, int seedCount){
int *locations = RIVKey.h_tempBlock;
int *locations_slider = locations;
int *seeds_stop = seeds+seedCount;
long long int *mask = RIVKey.masks;
long long int *mask_stop = mask+RIVKey.nonZeros;
while(seeds<seeds_stop){
*locations_slider =(((*seeds)^(*mask)) & 2147483647) %(RIVKey.RIVsize);
mask++;
locations_slider++;
seeds++;
if(!(mask<mask_stop)) mask-=RIVKey.nonZeros;
}
return locations;
}
unsigned char *sscanAdvance(unsigned char **string, unsigned char *word){
unsigned char *word_slider = word;
while(*(*string)){
if((*(*string) == ' ')||(*(*string) == '\n')) {
(*string)++;
break;
}
*word_slider = *(*string);
word_slider++;
(*string)++;
}
*word_slider = 0;
return word;
}
sparseRIV text2L2(unsigned char *text){
unsigned char word[2000] = {0};
int *seeds = RIVKey.h_tempBlock;
unsigned char *text_slider = text;
int seedCount = 0;
while(*text_slider){
sscanAdvance(&text_slider, word);
if(word[0]){
makeSeeds(word, &seeds, &seedCount);
}
}
int *locations = makeSparseLocations(seeds, seedCount);
int *L2dense;
L2dense = mapI2D(locations, seedCount);
sparseRIV output = consolidateD2S(L2dense);
free(L2dense);
return output;
}
int isLetter(char c){
if((c>96 && c<123)||(c == 32) || (c == '_')) return 1;
else return 0;
}
int isWordClean(char* word){
char *letter = word;
char *word_stop = word+99;
while(letter<word_stop){
if(!(*letter)) break;
if(!(isLetter(*letter))){
return 0;
}
letter++;
}
return 1;
}
denseRIV lexPull(int *valuesOut, char* word){
denseRIV output;
output.values = valuesOut;
char pathString[200];
FILE *lexWord;
sprintf(pathString, "lexicon/%s", word);
lexWord = fopen(pathString, "r+");
strcpy(output.name, word);
if(lexWord){
fscanf(lexWord, "%d,%f", &output.frequency, &output.magnitude);
int* values_slider = valuesOut;
int* values_stop = valuesOut+RIVKey.RIVsize;
while(values_slider<values_stop){
fscanf(lexWord, ",%d", values_slider);
values_slider++;
}
fclose(lexWord);
}else{
output.frequency = 0;
output.magnitude = 0;
memset(valuesOut, 0, RIVKey.RIVsize*sizeof(int));
}
return output;
}
int lexPush(denseRIV RIVout){
char pathString[1000] = {0};
strcpy(pathString, "lexicon");
strcat(pathString, "/");
strcat(pathString, RIVout.name);
//printf("%s\n", pathString);
FILE *lexWord = fopen(pathString, "w+");
if(!lexWord){
lexWord = fopen(pathString, "w+");
if(!lexWord){
printf("fucked it up big time bro, %s\n", pathString);
printf("%s\n", pathString);
return 1;
}
}
//printf( "%f",RIVout.magnitude);
fprintf(lexWord, "%d,%f", RIVout.frequency, RIVout.magnitude);
int *values_slider = RIVout.values;
int *values_stop = RIVout.values+RIVKey.RIVsize;
while(values_slider<values_stop){
fprintf(lexWord, ",%d", *(values_slider));
values_slider++;
}
fclose(lexWord);
return 0;
}
RIVtoolsGPU.h 0 → 100644
#include <stdio.h>
#include <stdlib.h>
#include <strsafe.h>
#define SEEDMASK 25214903917
#define HANDLE_ERROR(err) (HandleError(err, __FILE__, __LINE__))
static void HandleError(cudaError_t err, const char *file, int line){
if(err !=cudaSuccess)
{
printf("%s in %s at line %d\n", cudaGetErrorString(err), file, line);
exit(EXIT_FAILURE);
}
}
__global__ void squirt(float *d_magnitudes, int N){
int id =(blockIdx.x*blockDim.x + threadIdx.x);
if(id>=N) return;
d_magnitudes[id] = sqrt(d_magnitudes[id]);
}
__global__ void generateLocations(int *d_seeds, long long int mask, int *d_locations, int RIVsize, int team, int seedCount, int nonZeros){
int id =nonZeros*(blockIdx.x*blockDim.x + threadIdx.x)+team;
if(id>=seedCount) return;
d_locations[id] = ((d_seeds[id]^mask) & 2147483647) %(RIVsize);
}
__global__ void D2S( int* d_DenseRIV, int* d_SparseValues, int* d_SparseLocations, int *d_NZCount, int d_DenseSize){
int id =(blockIdx.x*blockDim.x + threadIdx.x);
if(id>=d_DenseSize) return;
int value = *(d_DenseRIV+id);
if(!value) return;
int sparseSlot = atomicAdd(d_NZCount, 1);
*(d_SparseValues+sparseSlot) = value;
*(d_SparseLocations+sparseSlot) = id;
}
__global__ void S2D(int *d_locations, int *d_values, int *d_OpenSlot, int numberOfValues){
int id = blockIdx.x*blockDim.x + threadIdx.x;
if(id>=numberOfValues) return ;
atomicAdd( d_OpenSlot + *(d_locations+id) , *(d_values+id));
}
__global__ void I2D(int *d_locations, int *d_OpenSlot, int numberOfValues){
int id = blockIdx.x*blockDim.x + threadIdx.x;
//bitshift
int value = (id%2) ? -1: 1;
if(id>=numberOfValues) return ;
atomicAdd( d_OpenSlot + *(d_locations+id) , value);
}
void consolidateD2SStaged(sparseRIV *destination, int *denseInput);
void consolidateD2S_d(sparseRIV *destination, int *denseInput);
void setKeyData_d(int RIVsize, int nonZeros, int blockSize);
int* mapS2D_d(int * destination, sparseRIV input);
float *getMagnitudes_d(sparseRIV *inputs, int RIVCount);
int *mapI2D_d(int *locations, int seedCount);
int* makeSparseLocations_d(int* seeds, int seedCount);
float *getMagnitudes_d(sparseRIV *inputs, int RIVCount){
float *magnitudes;
HANDLE_ERROR (cudaMallocHost((float**)&magnitudes,RIVCount*sizeof(float)));
float *magnitudes_slider = magnitudes;
for(int i=0; i<RIVCount; i++){
int temp = 0;
int *values = inputs[i].values;
int *values_stop = values+inputs[i].count;
while(values<values_stop){
temp += (*values)*(*values);
values++;
}
*magnitudes_slider = temp;
magnitudes_slider++;
}
HANDLE_ERROR (cudaMalloc((void**)&RIVKeyData.d_magnitudes, RIVCount*sizeof(float)));
HANDLE_ERROR (cudaMemcpy (RIVKeyData.d_magnitudes, magnitudes, RIVCount*sizeof(float), cudaMemcpyHostToDevice));
int blockSize;
int minGridSize = 0;
int gridSize;
cudaOccupancyMaxPotentialBlockSize( &minGridSize, &blockSize, squirt);
gridSize = ((RIVCount + blockSize -1) / blockSize)+1;
squirt<<<gridSize,blockSize >>> (RIVKeyData.d_magnitudes, RIVCount);
HANDLE_ERROR (cudaMemcpy (magnitudes, RIVKeyData.d_magnitudes, RIVCount*sizeof(float), cudaMemcpyDeviceToHost));
magnitudes_slider = magnitudes;
for(int i=0; i<RIVCount; i++){
inputs[i].magnitude = *magnitudes_slider;
magnitudes_slider++;
}
return magnitudes;
}
int *mapS2D_d(int* destination, sparseRIV input){
int *d_locations = RIVKeyData.d_OpenSlot+RIVKeyData.RIVsize;
int *d_values = d_locations+input.count;
HANDLE_ERROR (cudaMemset (RIVKeyData.d_OpenSlot, 0, RIVKeyData.RIVsize*sizeof(int)));
HANDLE_ERROR (cudaMemcpy (d_locations, input.locations, input.count*sizeof(int), cudaMemcpyHostToDevice));
HANDLE_ERROR (cudaMemcpy (d_values, input.values, input.count*sizeof(int), cudaMemcpyHostToDevice));
int blockSize;
int minGridSize = 0;
int gridSize;
cudaOccupancyMaxPotentialBlockSize( &minGridSize, &blockSize, S2D);
gridSize = ((input.count + blockSize -1) / blockSize)+1;
S2D <<<gridSize,blockSize>>> (d_locations, d_values, RIVKeyData.d_OpenSlot, input.count);
HANDLE_ERROR (cudaMemcpy (destination, RIVKeyData.d_OpenSlot, RIVKeyData.RIVsize*sizeof(int), cudaMemcpyDeviceToHost));
return destination;
}
int* mapI2D_d(int *locations, int valueCount){
int *d_locations = RIVKeyData.d_OpenSlot+RIVKeyData.RIVsize;
HANDLE_ERROR (cudaMemset (RIVKeyData.d_OpenSlot, 0, RIVKeyData.RIVsize*sizeof(int)));
HANDLE_ERROR (cudaMemcpy (d_locations, locations, valueCount*sizeof(int), cudaMemcpyHostToDevice));
int blockSize;
int minGridSize = 0;
int gridSize;
cudaOccupancyMaxPotentialBlockSize( &minGridSize, &blockSize, I2D);
gridSize = ((valueCount + blockSize -1) / blockSize)+1;
I2D <<<gridSize,blockSize>>> (d_locations, RIVKeyData.d_OpenSlot, valueCount);
int* valuesOut = RIVKeyData.h_tempBlock;
HANDLE_ERROR (cudaMemcpy (valuesOut, RIVKeyData.d_OpenSlot, RIVKeyData.RIVsize*sizeof(int), cudaMemcpyDeviceToHost));
return valuesOut;
}
void consolidateD2SStaged(sparseRIV *destination, int *denseInput){
int count = 0;
int *locations = RIVKeyData.h_tempBlock;
int *values = RIVKeyData.h_tempBlock + RIVKeyData.RIVsize;
for(int i=0; i<RIVKeyData.RIVsize; i++){
if(denseInput[i]){
locations[count] = i;
values[count] = denseInput[i];
count++;
}
}
int *locations_slider = locations+count;
while(locations_slider>=locations){
RIVKeyData.h_staging_slider--;
locations_slider--;
*RIVKeyData.h_staging_slider = *locations_slider;
}
(*destination).locations = RIVKeyData.h_staging_slider;
int *values_slider = values+count;
while(values_slider>=values){
RIVKeyData.h_staging_slider--;
values_slider--;
*RIVKeyData.h_staging_slider = *values_slider;
}
(*destination).values = RIVKeyData.h_staging_slider;
RIVKeyData.h_staging_slider--;
*RIVKeyData.h_staging_slider = count;
*RIVKeyData.h_displacements = RIVKeyData.h_staging_slider -RIVKeyData.h_stagingBlock;
RIVKeyData.h_displacements++;
}
void consolidateD2S_d(sparseRIV *destination, int *denseInput){
int *d_valueCount;
HANDLE_ERROR (cudaMalloc((void**)&d_valueCount, sizeof(int)));
HANDLE_ERROR(cudaMemset(d_valueCount, 0, sizeof(int)));
HANDLE_ERROR (cudaMemcpy (RIVKeyData.d_OpenSlot, denseInput, RIVKeyData.RIVsize*sizeof(int), cudaMemcpyHostToDevice));
int *d_outValues = RIVKeyData.d_OpenSlot+RIVKeyData.RIVsize;
int *d_outLocations = d_outValues+RIVKeyData.RIVsize;
int blockSize;
int minGridSize = 0;
int gridSize;
cudaOccupancyMaxPotentialBlockSize( &minGridSize, &blockSize, D2S);
gridSize = ((RIVKeyData.RIVsize + blockSize -1) / blockSize)+1;
D2S <<<gridSize,blockSize>>> (RIVKeyData.d_OpenSlot, d_outValues, d_outLocations, d_valueCount, RIVKeyData.RIVsize);
cudaDeviceSynchronize();
HANDLE_ERROR (cudaMemcpy (&(*destination).count, d_valueCount, sizeof(int), cudaMemcpyDeviceToHost));
(*destination).locations = RIVKeyData.h_staging_slider;
RIVKeyData.h_staging_slider+=(*destination).count;
(*destination).values = RIVKeyData.h_staging_slider;
RIVKeyData.h_staging_slider+=(*destination).count;
HANDLE_ERROR (cudaMemcpy ((*destination).values, d_outValues, ((*destination).count)*sizeof(int), cudaMemcpyDeviceToHost));
HANDLE_ERROR (cudaMemcpy ((*destination).locations, d_outLocations, ((*destination).count)*sizeof(int), cudaMemcpyDeviceToHost));
cudaFree(d_valueCount);
}
void setKeyData_d(int RIVsize, int nonZeros, int blockSize){
RIVKeyData.RIVsize = RIVsize;
if(nonZeros%2){
printf("your nonZeros must be an even number");
nonZeros++;
printf(", changed to %d", nonZeros);
}
RIVKeyData.nonZeros = nonZeros;
RIVKeyData.masks = (long long int*)malloc(nonZeros*sizeof(long long int));
for(int i = 0; i<nonZeros; i++){
RIVKeyData.masks[i] = SEEDMASK>>(5*i);
}
HANDLE_ERROR (cudaMallocHost((void**)&RIVKeyData.h_tempBlock, blockSize*sizeof(int)));
HANDLE_ERROR (cudaMallocHost((void**)&RIVKeyData.h_stagingBlock, blockSize*sizeof(int)));
RIVKeyData.h_staging_stop = RIVKeyData.h_stagingBlock + blockSize;
RIVKeyData.h_staging_slider = RIVKeyData.h_staging_stop;
RIVKeyData.h_displacements = RIVKeyData.h_stagingBlock;
HANDLE_ERROR (cudaMalloc((void**)&RIVKeyData.d_OpenSlot, blockSize*sizeof(int)));
RIVKeyData.d_SlotEnd = RIVKeyData.d_OpenSlot+blockSize;
RIVKeyData.thing = 0;
}
int* makeSparseLocations_d(int* seeds, int seedCount){
int *d_locations = RIVKeyData.d_OpenSlot;
int *d_seeds = d_locations+seedCount;
HANDLE_ERROR (cudaMemcpy(d_seeds, seeds, seedCount*sizeof(int), cudaMemcpyHostToDevice));
int blockSize;
int minGridSize = 0;
int gridSize;
cudaOccupancyMaxPotentialBlockSize( &minGridSize, &blockSize, generateLocations);
gridSize = ((seedCount + blockSize -1) / (RIVKeyData.nonZeros*blockSize))+1;
long long int *mask = RIVKeyData.masks;
for(int team=0; team<RIVKeyData.nonZeros; team++){
generateLocations <<<gridSize,blockSize,team>>> (d_seeds, *mask, d_locations, RIVKeyData.RIVsize, team, seedCount, RIVKeyData.nonZeros);
mask++;
}
cudaDeviceSynchronize();
int *locations = RIVKeyData.h_tempBlock;
HANDLE_ERROR (cudaMemcpy(locations, d_locations, seedCount*sizeof(int), cudaMemcpyDeviceToHost));
return locations;
}
void addS2DsBlocked(int *denseBlock, sparseRIV additive, int RIVCount){
int *d_locations= RIVKeyData.d_OpenSlot+RIVCount*RIVKeyData.RIVsize;
int *d_values = d_locations+additive.count;
HANDLE_ERROR (cudaMemcpy (d_locations, additive.locations, additive.count*sizeof(int), cudaMemcpyHostToDevice));
HANDLE_ERROR (cudaMemcpy (d_values, additive.values, additive.count*sizeof(int), cudaMemcpyHostToDevice));
int blockSize;
int minGridSize = 0;
int gridSize;
cudaOccupancyMaxPotentialBlockSize( &minGridSize, &blockSize, S2Ds);
gridSize = ((additive.count + blockSize -1) / blockSize)+1;
S2Ds<<<additive.count,1>>>(RIVKeyData.d_OpenSlot, d_locations, d_values, additive.count, RIVCount, RIVKeyData.RIVsize);
HANDLE_ERROR (cudaMemcpy (denseBlock, RIVKeyData.d_OpenSlot, RIVCount*RIVKeyData.RIVsize*sizeof(int), cudaMemcpyDeviceToHost));
}
parsing/about 0 → 100644
1
\ No newline at end of file
parsing/absence 0 → 100644
1
\ No newline at end of file
parsing/accessible 0 → 100644
1
\ No newline at end of file
parsing/according 0 → 100644
1
\ No newline at end of file
parsing/acroteres 0 → 100644
0
\ No newline at end of file
parsing/admission 0 → 100644
1
\ No newline at end of file
parsing/advantagious 0 → 100644
1
\ No newline at end of file
parsing/advantagiously 0 → 100644
2advantagious
\ No newline at end of file
parsing/after 0 → 100644
1
\ No newline at end of file
parsing/again 0 → 100644
1
\ No newline at end of file
parsing/against 0 → 100644
1
\ No newline at end of file
parsing/agreable 0 → 100644
2agreeable
\ No newline at end of file
parsing/agreeable 0 → 100644
1
\ No newline at end of file
parsing/air 0 → 100644
1
\ No newline at end of file
parsing/alder 0 → 100644
1
\ No newline at end of file
parsing/all 0 → 100644
1
\ No newline at end of file
parsing/always 0 → 100644
1
\ No newline at end of file
parsing/among 0 → 100644
1
\ No newline at end of file
parsing/an 0 → 100644
0
\ No newline at end of file
parsing/ancient 0 → 100644
1
\ No newline at end of file
parsing/anciently 0 → 100644
2ancient
\ No newline at end of file
parsing/ancients 0 → 100644
2ancient
\ No newline at end of file
parsing/and 0 → 100644
0
\ No newline at end of file
parsing/any 0 → 100644
1
\ No newline at end of file
parsing/apartment 0 → 100644
1
\ No newline at end of file
parsing/apartments 0 → 100644
2apartment
\ No newline at end of file
parsing/appear 0 → 100644
1
\ No newline at end of file
parsing/appreciate 0 → 100644
1
\ No newline at end of file
parsing/arbitrary 0 → 100644
1
\ No newline at end of file
parsing/arch 0 → 100644
1
\ No newline at end of file
parsing/arches 0 → 100644
2arch
\ No newline at end of file
parsing/architect 0 → 100644
1
\ No newline at end of file
parsing/architects 0 → 100644
2architect
\ No newline at end of file
parsing/architecture 0 → 100644
1
\ No newline at end of file
parsing/are 0 → 100644
0
\ No newline at end of file
parsing/areostyle 0 → 100644
1
\ No newline at end of file
parsing/argument 0 → 100644
1
\ No newline at end of file
parsing/arguments 0 → 100644
2argument
\ No newline at end of file
parsing/arithmetic 0 → 100644
1
\ No newline at end of file
parsing/arithmetick 0 → 100644
2arithmetic
\ No newline at end of file
parsing/arrived 0 → 100644
1
\ No newline at end of file
parsing/art 0 → 100644
1
\ No newline at end of file
parsing/article 0 → 100644
1
\ No newline at end of file
parsing/as 0 → 100644
0
\ No newline at end of file
parsing/astronomy 0 → 100644
1
\ No newline at end of file
parsing/at 0 → 100644
0
\ No newline at end of file
parsing/attic 0 → 100644
1
\ No newline at end of file
parsing/away 0 → 100644
1
\ No newline at end of file
parsing/baboo 0 → 100644
1
\ No newline at end of file
parsing/bad 0 → 100644
1
\ No newline at end of file
parsing/badge 0 → 100644
1
\ No newline at end of file
parsing/base 0 → 100644
1
\ No newline at end of file
parsing/bazar 0 → 100644
1
\ No newline at end of file
parsing/be 0 → 100644
0
\ No newline at end of file
parsing/beauty 0 → 100644
1
\ No newline at end of file
parsing/been 0 → 100644
0
\ No newline at end of file
parsing/beg 0 → 100644
1
\ No newline at end of file
parsing/betel 0 → 100644
1
\ No newline at end of file
parsing/between 0 → 100644
1
\ No newline at end of file
parsing/binding 0 → 100644
2bound
\ No newline at end of file
parsing/book 0 → 100644
1
\ No newline at end of file
parsing/books 0 → 100644
2book
\ No newline at end of file
parsing/borne 0 → 100644
1
\ No newline at end of file
parsing/borrowed 0 → 100644
1
\ No newline at end of file
parsing/bound 0 → 100644
1
\ No newline at end of file
parsing/boundless 0 → 100644
1
\ No newline at end of file
parsing/breath 0 → 100644
1
\ No newline at end of file
parsing/brick 0 → 100644
1
\ No newline at end of file
parsing/bricks 0 → 100644
2brick
\ No newline at end of file
parsing/brings 0 → 100644
1
\ No newline at end of file
parsing/brown 0 → 100644
1
\ No newline at end of file
parsing/building 0 → 100644
1
\ No newline at end of file
parsing/buildings 0 → 100644
2building
\ No newline at end of file
parsing/bundal 0 → 100644
0
\ No newline at end of file
parsing/bundle 0 → 100644
1
\ No newline at end of file
parsing/burra 0 → 100644
0
\ No newline at end of file
parsing/business 0 → 100644
1
\ No newline at end of file
parsing/but 0 → 100644
1
\ No newline at end of file
parsing/butress 0 → 100644
1
\ No newline at end of file
parsing/butresses 0 → 100644
2butress
\ No newline at end of file
parsing/by 0 → 100644
1
\ No newline at end of file
parsing/came 0 → 100644
1
\ No newline at end of file
parsing/capital 0 → 100644
1
\ No newline at end of file
parsing/captial 0 → 100644
1
\ No newline at end of file
parsing/care 0 → 100644
2cared
\ No newline at end of file
parsing/cared 0 → 100644
1
\ No newline at end of file
parsing/caw 0 → 100644
1
\ No newline at end of file
parsing/caws 0 → 100644
2caw
\ No newline at end of file
parsing/cedar 0 → 100644
1
\ No newline at end of file
parsing/ceiling 0 → 100644
1
\ No newline at end of file
parsing/chambrant 0 → 100644
1
\ No newline at end of file
parsing/chambrantes 0 → 100644
2chambrant
\ No newline at end of file
parsing/channeling 0 → 100644
1
\ No newline at end of file
parsing/channelings 0 → 100644
2channeling
\ No newline at end of file
parsing/chap 0 → 100644
1
\ No newline at end of file
parsing/cheek 0 → 100644
1
\ No newline at end of file
parsing/choice 0 → 100644
1
\ No newline at end of file
parsing/chorus 0 → 100644
1
\ No newline at end of file
parsing/church 0 → 100644
1
\ No newline at end of file
parsing/cities 0 → 100644
2city
\ No newline at end of file
parsing/city 0 → 100644
1
\ No newline at end of file
parsing/clerk 0 → 100644
1
\ No newline at end of file
parsing/clerks 0 → 100644
2clerk
\ No newline at end of file
parsing/climate 0 → 100644
1
\ No newline at end of file
parsing/closet 0 → 100644
1
\ No newline at end of file
parsing/closets 0 → 100644
2closet
\ No newline at end of file
parsing/coat 0 → 100644
1
\ No newline at end of file
parsing/column 0 → 100644
1
\ No newline at end of file
parsing/columns 0 → 100644
2column
\ No newline at end of file
parsing/comes 0 → 100644
1
\ No newline at end of file
parsing/commanded 0 → 100644
1
\ No newline at end of file
parsing/commissioner 0 → 100644
1
\ No newline at end of file
parsing/commissioners 0 → 100644
2commissioner
\ No newline at end of file
parsing/common 0 → 100644
1
\ No newline at end of file
parsing/concentration 0 → 100644
1
\ No newline at end of file
parsing/consist 0 → 100644
1
\ No newline at end of file
parsing/consistent 0 → 100644
1
\ No newline at end of file
parsing/consists 0 → 100644
2consistent
\ No newline at end of file
parsing/continued 0 → 100644
1
\ No newline at end of file
parsing/convenience 0 → 100644
1
\ No newline at end of file
parsing/convenient 0 → 100644
1
\ No newline at end of file
parsing/cornice 0 → 100644
1
\ No newline at end of file
parsing/cornices 0 → 100644
2cornice
\ No newline at end of file
parsing/could 0 → 100644
1
\ No newline at end of file
parsing/countenance 0 → 100644
1
\ No newline at end of file
parsing/country 0 → 100644
1
\ No newline at end of file
parsing/cousin 0 → 100644
1
\ No newline at end of file
parsing/cousinhe 0 → 100644
2cousin
\ No newline at end of file
parsing/crow 0 → 100644
1
\ No newline at end of file
parsing/crows 0 → 100644
2crow
\ No newline at end of file
parsing/cypress 0 → 100644
1
\ No newline at end of file
parsing/dealer 0 → 100644
1
\ No newline at end of file
parsing/decorum 0 → 100644
1
\ No newline at end of file
parsing/definition 0 → 100644
1
\ No newline at end of file
parsing/depended 0 → 100644
1
\ No newline at end of file
parsing/designed 0 → 100644
1
\ No newline at end of file
parsing/designing 0 → 100644
2designed
\ No newline at end of file
parsing/devoted 0 → 100644
1
\ No newline at end of file
parsing/diastyle 0 → 100644
1
\ No newline at end of file
parsing/difference 0 → 100644
1
\ No newline at end of file
parsing/different 0 → 100644
1
\ No newline at end of file
parsing/dignified 0 → 100644
1
\ No newline at end of file
parsing/diminution 0 → 100644
1
\ No newline at end of file
parsing/diningroom 0 → 100644
1
\ No newline at end of file
parsing/diningrooms 0 → 100644
2diningroom
\ No newline at end of file
parsing/direction 0 → 100644
1
\ No newline at end of file
parsing/disposition 0 → 100644
1
\ No newline at end of file
parsing/dispositions 0 → 100644
2disposition
\ No newline at end of file
parsing/distinction 0 → 100644
1
\ No newline at end of file
parsing/diver 0 → 100644
1
\ No newline at end of file
parsing/divers 0 → 100644
2diver
\ No newline at end of file
parsing/diverse 0 → 100644
1
\ No newline at end of file
parsing/division 0 → 100644
1
\ No newline at end of file
parsing/do 0 → 100644
0
\ No newline at end of file
parsing/door 0 → 100644
1
\ No newline at end of file
parsing/doors 0 → 100644
2door
\ No newline at end of file
parsing/dorick 0 → 100644
1
\ No newline at end of file
parsing/dost 0 → 100644
1
\ No newline at end of file
parsing/down 0 → 100644
1
\ No newline at end of file
parsing/dusted 0 → 100644
1
\ No newline at end of file
parsing/dusty 0 → 100644
1
\ No newline at end of file
parsing/each 0 → 100644
1
\ No newline at end of file
parsing/earth 0 → 100644
1
\ No newline at end of file
parsing/ease 0 → 100644
1
\ No newline at end of file
parsing/economy 0 → 100644
1
\ No newline at end of file
parsing/eight 0 → 100644
0
\ No newline at end of file
parsing/either 0 → 100644
1
\ No newline at end of file
parsing/eleven 0 → 100644
0
\ No newline at end of file
parsing/emotion 0 → 100644
1
\ No newline at end of file
parsing/errands 0 → 100644
1
\ No newline at end of file
parsing/errandshas 0 → 100644
2errands
\ No newline at end of file
parsing/eustyle 0 → 100644
1
\ No newline at end of file
parsing/every 0 → 100644
1
\ No newline at end of file
parsing/exact 0 → 100644
1
\ No newline at end of file
parsing/excellencies 0 → 100644
2excellency
\ No newline at end of file
parsing/excellency 0 → 100644
1
\ No newline at end of file
parsing/exposd 0 → 100644
2exposed
\ No newline at end of file
parsing/exposed 0 → 100644
1
\ No newline at end of file
parsing/fabric 0 → 100644
1
\ No newline at end of file
parsing/fabricks 0 → 100644
2fabric
\ No newline at end of file
parsing/faithful 0 → 100644
1
\ No newline at end of file
parsing/farther 0 → 100644
1
\ No newline at end of file
parsing/fast 0 → 100644
1
\ No newline at end of file
parsing/favour 0 → 100644
1
\ No newline at end of file
parsing/feet 0 → 100644
1
\ No newline at end of file
parsing/felt 0 → 100644
1
\ No newline at end of file
parsing/fertile 0 → 100644
1
\ No newline at end of file
parsing/figure 0 → 100644
1
\ No newline at end of file
parsing/fir 0 → 100644
1
\ No newline at end of file
parsing/first 0 → 100644
1
\ No newline at end of file
parsing/five 0 → 100644
0
\ No newline at end of file
parsing/floor 0 → 100644
1
\ No newline at end of file
parsing/flooring 0 → 100644
2floor
\ No newline at end of file
parsing/for 0 → 100644
0
\ No newline at end of file
parsing/form 0 → 100644
1
\ No newline at end of file
parsing/foundation 0 → 100644
1
\ No newline at end of file
parsing/foundations 0 → 100644
2foundation
\ No newline at end of file
parsing/four 0 → 100644
0
\ No newline at end of file
parsing/fresco 0 → 100644
1
\ No newline at end of file
parsing/from 0 → 100644
1
\ No newline at end of file
parsing/gender 0 → 100644
1
\ No newline at end of file
parsing/genders 0 → 100644
2gender
\ No newline at end of file
parsing/general 0 → 100644
1
\ No newline at end of file
parsing/geometry 0 → 100644
1
\ No newline at end of file
parsing/getting 0 → 100644
2gotten
\ No newline at end of file
parsing/glare 0 → 100644
1
\ No newline at end of file
parsing/gnomonical 0 → 100644
1
\ No newline at end of file
parsing/go 0 → 100644
1
\ No newline at end of file
parsing/gold 0 → 100644
1
\ No newline at end of file
parsing/gone 0 → 100644
1
\ No newline at end of file
parsing/good 0 → 100644
1
\ No newline at end of file
parsing/gotten 0 → 100644
1
\ No newline at end of file
parsing/government 0 → 100644
1
\ No newline at end of file
parsing/grain 0 → 100644
1
\ No newline at end of file
parsing/gravel 0 → 100644
1
\ No newline at end of file
parsing/great 0 → 100644
1
\ No newline at end of file
parsing/greek 0 → 100644
1
\ No newline at end of file
parsing/greeks 0 → 100644
2greek
\ No newline at end of file
parsing/greyblack 0 → 100644
1
\ No newline at end of file
parsing/ground 0 → 100644
1
\ No newline at end of file
parsing/habitual 0 → 100644
1
\ No newline at end of file
parsing/habitually 0 → 100644
2habitual
\ No newline at end of file
parsing/had 0 → 100644
0
\ No newline at end of file
parsing/hall 0 → 100644
1
\ No newline at end of file
parsing/halls 0 → 100644
2hall
\ No newline at end of file
parsing/harm 0 → 100644
1
\ No newline at end of file
parsing/hassimabad 0 → 100644
0
\ No newline at end of file
parsing/hath 0 → 100644
1
\ No newline at end of file
parsing/have 0 → 100644
0
\ No newline at end of file
parsing/hawker 0 → 100644
1
\ No newline at end of file
parsing/he 0 → 100644
0
\ No newline at end of file
parsing/heartshaped 0 → 100644
1
\ No newline at end of file
parsing/heaven 0 → 100644
1
\ No newline at end of file
parsing/heavens 0 → 100644
2heaven
\ No newline at end of file
parsing/heel 0 → 100644
1
\ No newline at end of file
parsing/heels 0 → 100644
2heel
\ No newline at end of file
parsing/higher 0 → 100644
1
\ No newline at end of file
parsing/him 0 → 100644
0
\ No newline at end of file
parsing/himand 0 → 100644
0
\ No newline at end of file
parsing/his 0 → 100644
0
\ No newline at end of file
parsing/history 0 → 100644
1
\ No newline at end of file
parsing/home 0 → 100644
1
\ No newline at end of file
parsing/honour 0 → 100644
1
\ No newline at end of file
parsing/horse 0 → 100644
1
\ No newline at end of file
parsing/house 0 → 100644
1
\ No newline at end of file
parsing/houses 0 → 100644
2house
\ No newline at end of file
parsing/how 0 → 100644
1
\ No newline at end of file
parsing/if 0 → 100644
0
\ No newline at end of file
parsing/ii 0 → 100644
0
\ No newline at end of file
parsing/iii 0 → 100644
0
\ No newline at end of file
parsing/in 0 → 100644
1
\ No newline at end of file
parsing/inconvenience 0 → 100644
1
\ No newline at end of file
parsing/inconveniences 0 → 100644
2inconvenience
\ No newline at end of file
parsing/intensified 0 → 100644
1
\ No newline at end of file
parsing/interposed 0 → 100644
1
\ No newline at end of file
parsing/into 0 → 100644
1
\ No newline at end of file
parsing/inventers 0 → 100644
2inventor
\ No newline at end of file
parsing/inventor 0 → 100644
1
\ No newline at end of file
parsing/is 0 → 100644
0
\ No newline at end of file
parsing/it 0 → 100644
0
\ No newline at end of file
parsing/itcould 0 → 100644
2could
\ No newline at end of file
parsing/its 0 → 100644
0
\ No newline at end of file
parsing/itself 0 → 100644
1
\ No newline at end of file
parsing/iv 0 → 100644
0
\ No newline at end of file
parsing/john 0 → 100644
0
\ No newline at end of file
parsing/juniper 0 → 100644
1
\ No newline at end of file
parsing/keep 0 → 100644
1
\ No newline at end of file
parsing/know 0 → 100644
1
\ No newline at end of file
parsing/knowledge 0 → 100644
1
\ No newline at end of file
parsing/lal 0 → 100644
0
\ No newline at end of file
parsing/larch 0 → 100644
1
\ No newline at end of file
parsing/lat 0 → 100644
0
\ No newline at end of file
parsing/law 0 → 100644
1
\ No newline at end of file
parsing/laws 0 → 100644
2law
\ No newline at end of file
parsing/leaf 0 → 100644
1
\ No newline at end of file
parsing/lean 0 → 100644
1
\ No newline at end of file
parsing/leaves 0 → 100644
2leaf
\ No newline at end of file
parsing/leg 0 → 100644
1
\ No newline at end of file
parsing/legs 0 → 100644
2leg
\ No newline at end of file
parsing/less 0 → 100644
1
\ No newline at end of file
parsing/letter 0 → 100644
1
\ No newline at end of file
parsing/libraries 0 → 100644
2libraryy
\ No newline at end of file
parsing/library 0 → 100644
1
\ No newline at end of file
parsing/life 0 → 100644
1
\ No newline at end of file
parsing/light 0 → 100644
1
\ No newline at end of file
parsing/lightly 0 → 100644
1
\ No newline at end of file
parsing/lights 0 → 100644
2light
\ No newline at end of file
parsing/liked 0 → 100644
1
\ No newline at end of file
parsing/lime 0 → 100644
1
\ No newline at end of file
parsing/little 0 → 100644
1
\ No newline at end of file
parsing/long 0 → 100644
1
\ No newline at end of file
parsing/look 0 → 100644
1
\ No newline at end of file
parsing/looked 0 → 100644
1
\ No newline at end of file
parsing/loss 0 → 100644
1
\ No newline at end of file
parsing/low 0 → 100644
1
\ No newline at end of file
parsing/lunged 0 → 100644
1
\ No newline at end of file
parsing/make 0 → 100644
1
\ No newline at end of file
parsing/man 0 → 100644
1
\ No newline at end of file
parsing/marshy 0 → 100644
1
\ No newline at end of file
parsing/masonry 0 → 100644
1
\ No newline at end of file
parsing/master 0 → 100644
1
\ No newline at end of file
parsing/material 0 → 100644
1
\ No newline at end of file
parsing/materials 0 → 100644
2material
\ No newline at end of file
parsing/may 0 → 100644
1
\ No newline at end of file
parsing/me 0 → 100644
0
\ No newline at end of file
parsing/mechanical 0 → 100644
1
\ No newline at end of file
parsing/men 0 → 100644
2man
\ No newline at end of file
parsing/merchant 0 → 100644
1
\ No newline at end of file
parsing/merchants 0 → 100644
2merchant
\ No newline at end of file
parsing/merit 0 → 100644
1
\ No newline at end of file
parsing/merits 0 → 100644
2merit
\ No newline at end of file
parsing/messenger 0 → 100644
1
\ No newline at end of file
parsing/method 0 → 100644
1
\ No newline at end of file
parsing/might 0 → 100644
1
\ No newline at end of file
parsing/model 0 → 100644
1
\ No newline at end of file
parsing/models 0 → 100644
2model
\ No newline at end of file
parsing/moist 0 → 100644
1
\ No newline at end of file
parsing/moral 0 → 100644
1
\ No newline at end of file
parsing/morning 0 → 100644
1
\ No newline at end of file
parsing/most 0 → 100644
1
\ No newline at end of file
parsing/much 0 → 100644
1
\ No newline at end of file
parsing/mud 0 → 100644
1
\ No newline at end of file
parsing/murmur 0 → 100644
1
\ No newline at end of file
parsing/music 0 → 100644
1
\ No newline at end of file
parsing/musick 0 → 100644
2music
\ No newline at end of file
parsing/my 0 → 100644
0
\ No newline at end of file
parsing/myself 0 → 100644
0
\ No newline at end of file
parsing/natural 0 → 100644
1
\ No newline at end of file
parsing/nevertheless 0 → 100644
1
\ No newline at end of file
parsing/news 0 → 100644
1
\ No newline at end of file
parsing/no 0 → 100644
1
\ No newline at end of file
parsing/not 0 → 100644
1
\ No newline at end of file
parsing/now 0 → 100644
1
\ No newline at end of file
parsing/oak 0 → 100644
1
\ No newline at end of file
parsing/observed 0 → 100644
1
\ No newline at end of file
parsing/observing 0 → 100644
2observed
\ No newline at end of file
parsing/occasion 0 → 100644
1
\ No newline at end of file
parsing/oclock 0 → 100644
0
\ No newline at end of file
parsing/oeconomy 0 → 100644
2economy
\ No newline at end of file
parsing/of 0 → 100644
0
\ No newline at end of file
parsing/office 0 → 100644
1
\ No newline at end of file
parsing/olive 0 → 100644
1
\ No newline at end of file
parsing/on 0 → 100644
1
\ No newline at end of file
parsing/one 0 → 100644
0
\ No newline at end of file
parsing/ones 0 → 100644
1
\ No newline at end of file
parsing/only 0 → 100644
1
\ No newline at end of file
parsing/onlywhich 0 → 100644
2only
\ No newline at end of file
parsing/open 0 → 100644
1
\ No newline at end of file
parsing/opened 0 → 100644
1
\ No newline at end of file
parsing/or 0 → 100644
0
\ No newline at end of file
parsing/order 0 → 100644
1
\ No newline at end of file
parsing/orders 0 → 100644
2order
\ No newline at end of file
parsing/original 0 → 100644
1
\ No newline at end of file
parsing/ornament 0 → 100644
1
\ No newline at end of file
parsing/other 0 → 100644
1
\ No newline at end of file
parsing/ought 0 → 100644
1
\ No newline at end of file
parsing/out 0 → 100644
1
\ No newline at end of file
parsing/outer 0 → 100644
1
\ No newline at end of file
parsing/over 0 → 100644
1
\ No newline at end of file
parsing/overhead 0 → 100644
1
\ No newline at end of file
parsing/own 0 → 100644
2owned
\ No newline at end of file
parsing/owned 0 → 100644
1
\ No newline at end of file
parsing/pace 0 → 100644
1
\ No newline at end of file
parsing/page 0 → 100644
1
\ No newline at end of file
parsing/paper 0 → 100644
1
\ No newline at end of file
parsing/papers 0 → 100644
2paper
\ No newline at end of file
parsing/parsing.c 0 → 100644
#include <stdio.h>
#include <stdlib.h>
int main(){
setKeyData(25000, 4);
FILE *data = fopen("someshit.txt", "r");
if(!data) printf("file doesn't seem to exist");
char word[300] = {0};
FILE *currentWord = 0;
int wordCount = 0;
int key;
fseek(data, 0, SEEK_END);
char *output = (char*)calloc(ftell(data), sizeof(char));
output[0] = ' ';
fseek(data, 0, SEEK_SET);
while(fscanf(data, "%s", word)){
printf("%s\n", word);
currentWord = fopen(word, "r");
if(!currentWord){
printf("%s?\n", word);
scanf("%d", &key);
currentWord = fopen(word, "w");
printf("madeithere");
fprintf(currentWord, "%d", key);
if(key==2){
memset(word, 0, sizeof(word));
scanf("%s", word);
fprintf(currentWord, "2%s", word);
fclose(currentWord);
currentWord = fopen(word, "r");
if(!currentWord){
currentWord = fopen(word, "w");
fprintf(currentWord, "1");
}
}
if(key>2)printf("yafuckedup");
fseek(currentWord, 0, SEEK_SET);
}
fscanf(currentWord, "%d", &key);
if(key == 2){
fscanf(currentWord, "%s", word);
fclose(currentWord);
currentWord= fopen(word, "r");
key = 1;
}
if(key == 1){
strcat(output, " ");
strcat(output, word);
}
fclose(currentWord);
memset(word, 0, sizeof(word));
wordCount++;
if(feof(data)) break;
}
FILE *newFile = fopen("newfile", "w");
fprintf(newFile, "%s", output);
fclose(newFile);
return 0;
}
parsing/parsing.cu 0 → 100644
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int prepWord(char *word);
int main(int argc, char *argv[]){
//setKeyData(25000, 4);
char *filepath = (char*)calloc(30,sizeof(char));
strcpy(filepath, argv[1]);
FILE *data = fopen(argv[1], "r");
if(!data) {
printf("file doesn't seem to exist");
return 1;
}
char word[300] = {0};
FILE *currentWord = 0;
int key;
fseek(data, 0, SEEK_END);
char *output = (char*)calloc(ftell(data), sizeof(char));
output[0] = ' ';
fseek(data, 0, SEEK_SET);
while(fscanf(data, "%s", word)){
if(prepWord(word)){
currentWord = fopen(word, "r");
if(!currentWord){
printf("%s?\n", word);
scanf("%d", &key);
currentWord = fopen(word, "w");
fprintf(currentWord, "%d", key);
if(key==2){
memset(word, 0, sizeof(word));
scanf("%s", word);
fprintf(currentWord, "%s", word);
fclose(currentWord);
//currentWord = 0;
currentWord = fopen(word, "r");
if(!currentWord){
currentWord = fopen(word, "w+");
fprintf(currentWord, "1");
}
}
if(key>2)printf("yafuckedup");
fseek(currentWord, 0, SEEK_SET);
}
printf("^");
fscanf(currentWord, "%d", &key);
if(key == 2){
printf("^");
memset(word, 0, sizeof(word));
fscanf(currentWord, "%s", word);
fclose(currentWord);
currentWord= fopen(word, "r");
key = 1;
}
if(key == 1){
strcat(output, " ");
strcat(output, word);
}
fclose(currentWord);
}
memset(word, 0, sizeof(word));
if(feof(data)) break;
}
FILE *newFile = fopen("newfile.txt", "w");
fprintf(newFile, "%s", output);
fclose(newFile);
return 0;
}
int prepWord(char *word){
int length = strlen(word);
char *output = (char*)malloc((length+1)*sizeof(char));
if(length <2){
printf("skipped word: %s\n", word);
return 0;
}
int j=0;
for(int i=0; i<length; i++){
if ((word[i]<91) && (word[i] >64)){
output[j] = word[i] +32;
j++;
}else if((word[i]<123) && (word[i] >96)){
output[j] = word[i];
j++;
}
}
output[j] = 0;
length = strlen(output);
if(length <2){
printf("skipped word(after processing): %s\n", output);
return 0;
}
memcpy(word, output, length+1);
return 1;
}
parsing/part 0 → 100644
1
\ No newline at end of file
parsing/partition 0 → 100644
1
\ No newline at end of file
parsing/partitions 0 → 100644
2partition
\ No newline at end of file
parsing/parts 0 → 100644
2part
\ No newline at end of file
parsing/pattern 0 → 100644
1
\ No newline at end of file
parsing/patterns 0 → 100644
2pattern
\ No newline at end of file
parsing/pedastals 0 → 100644
2pedestal
\ No newline at end of file
parsing/pedestal 0 → 100644
1
\ No newline at end of file
parsing/people 0 → 100644
1
\ No newline at end of file
parsing/performance 0 → 100644
1
\ No newline at end of file
parsing/permitted 0 → 100644
1
\ No newline at end of file
parsing/perpendicular 0 → 100644
1
\ No newline at end of file
parsing/personal 0 → 100644
1
\ No newline at end of file
parsing/petition 0 → 100644
1
\ No newline at end of file
parsing/philosophy 0 → 100644
1
\ No newline at end of file
parsing/physick 0 → 100644
2physics
\ No newline at end of file
parsing/physics 0 → 100644
1
\ No newline at end of file
parsing/pice 0 → 100644
0
\ No newline at end of file
parsing/piedement 0 → 100644
1
\ No newline at end of file
parsing/piedemont 0 → 100644
1
\ No newline at end of file
parsing/piedments 0 → 100644
1
\ No newline at end of file
parsing/pillar 0 → 100644
1
\ No newline at end of file
parsing/pillars 0 → 100644
2pillar
\ No newline at end of file
parsing/pine 0 → 100644
1
\ No newline at end of file
parsing/pipal 0 → 100644
1
\ No newline at end of file
parsing/pit 0 → 100644
1
\ No newline at end of file
parsing/place 0 → 100644
1
\ No newline at end of file
parsing/places 0 → 100644
2place
\ No newline at end of file
parsing/plaistering 0 → 100644
2plaster
\ No newline at end of file
parsing/plaster 0 → 100644
1
\ No newline at end of file
parsing/poplar 0 → 100644
1
\ No newline at end of file
parsing/positive 0 → 100644
1
\ No newline at end of file
parsing/pozzalane 0 → 100644
1
\ No newline at end of file
parsing/prasannad 0 → 100644
1
\ No newline at end of file
parsing/precaution 0 → 100644
1
\ No newline at end of file
parsing/precautions 0 → 100644
2precaution
\ No newline at end of file
parsing/preparation 0 → 100644
1
\ No newline at end of file
parsing/principal 0 → 100644
1
\ No newline at end of file
parsing/private 0 → 100644
1
\ No newline at end of file
parsing/privilege 0 → 100644
1
\ No newline at end of file
parsing/process 0 → 100644
1
\ No newline at end of file
parsing/prodigal 0 → 100644
1
\ No newline at end of file
parsing/proper 0 → 100644
1
\ No newline at end of file
parsing/proportion 0 → 100644
1
\ No newline at end of file
parsing/provided 0 → 100644
1
\ No newline at end of file
parsing/providing 0 → 100644
2provided
\ No newline at end of file
parsing/prudence 0 → 100644
1
\ No newline at end of file
parsing/public 0 → 100644
1
\ No newline at end of file
parsing/publicity 0 → 100644
1
\ No newline at end of file
parsing/publick 0 → 100644
2public
\ No newline at end of file
parsing/pycnostyle 0 → 100644
1
\ No newline at end of file
parsing/queen 0 → 100644
1
\ No newline at end of file
parsing/queenempress 0 → 100644
2queen
\ No newline at end of file
parsing/queens 0 → 100644
2queen
\ No newline at end of file
parsing/quickly 0 → 100644
1
\ No newline at end of file
parsing/quid 0 → 100644
1
\ No newline at end of file
parsing/ram 0 → 100644
1
\ No newline at end of file
parsing/ran 0 → 100644
1
\ No newline at end of file
parsing/rapidly 0 → 100644
1
\ No newline at end of file
parsing/reason 0 → 100644
1
\ No newline at end of file
parsing/red 0 → 100644
1
\ No newline at end of file
parsing/refuse 0 → 100644
1
\ No newline at end of file
parsing/regularity 0 → 100644
1
\ No newline at end of file
parsing/remarked 0 → 100644
1
\ No newline at end of file
parsing/respect 0 → 100644
1
\ No newline at end of file
parsing/result 0 → 100644
1
\ No newline at end of file
parsing/river 0 → 100644
1
\ No newline at end of file
parsing/road 0 → 100644
1
\ No newline at end of file
parsing/roman 0 → 100644
1
\ No newline at end of file
parsing/romans 0 → 100644
2roman
\ No newline at end of file
parsing/roof 0 → 100644
1
\ No newline at end of file
parsing/room 0 → 100644
1
\ No newline at end of file
parsing/runner 0 → 100644
1
\ No newline at end of file
parsing/rupee 0 → 100644
1
\ No newline at end of file
parsing/sahib 0 → 100644
1
\ No newline at end of file
parsing/said 0 → 100644
1
\ No newline at end of file
parsing/sand 0 → 100644
1
\ No newline at end of file
parsing/sat 0 → 100644
1
\ No newline at end of file
parsing/savour 0 → 100644
1
\ No newline at end of file
parsing/scituation 0 → 100644
2situation
\ No newline at end of file
parsing/second 0 → 100644
1
\ No newline at end of file
parsing/seemed 0 → 100644
1
\ No newline at end of file
parsing/seen 0 → 100644
1
\ No newline at end of file
parsing/sent 0 → 100644
1
\ No newline at end of file
parsing/seven 0 → 100644
0
\ No newline at end of file
parsing/several 0 → 100644
1
\ No newline at end of file
parsing/shaft 0 → 100644
1
\ No newline at end of file
parsing/shafts 0 → 100644
2shaft
\ No newline at end of file
parsing/sharpcut 0 → 100644
1
\ No newline at end of file
parsing/shifted 0 → 100644
1
\ No newline at end of file
parsing/short 0 → 100644
1
\ No newline at end of file
parsing/signified 0 → 100644
1
\ No newline at end of file
parsing/signifies 0 → 100644
2signified
\ No newline at end of file
parsing/silence 0 → 100644
1
\ No newline at end of file
parsing/since 0 → 100644
1
\ No newline at end of file
parsing/singh 0 → 100644
0
\ No newline at end of file
parsing/sits 0 → 100644
2sat
\ No newline at end of file
parsing/situation 0 → 100644
1
\ No newline at end of file
parsing/six 0 → 100644
0
\ No newline at end of file
parsing/smote 0 → 100644
1
\ No newline at end of file
parsing/solid 0 → 100644
1
\ No newline at end of file
parsing/solidity 0 → 100644
1
\ No newline at end of file
parsing/some 0 → 100644
1
\ No newline at end of file
parsing/someshit.txt 0 → 100644
This source diff could not be displayed because it is too large. You can view the blob instead.
parsing/something 0 → 100644
1
\ No newline at end of file
parsing/son 0 → 100644
1
\ No newline at end of file
parsing/sort 0 → 100644
1
\ No newline at end of file
parsing/sorts 0 → 100644
2sort
\ No newline at end of file
parsing/speaks 0 → 100644
2spoken
\ No newline at end of file
parsing/spoken 0 → 100644
1
\ No newline at end of file
parsing/st 0 → 100644
0
\ No newline at end of file
parsing/stair 0 → 100644
1
\ No newline at end of file
parsing/stairs 0 → 100644
2stair
\ No newline at end of file
parsing/step 0 → 100644
1
\ No newline at end of file
parsing/steps 0 → 100644
2step
\ No newline at end of file
parsing/still 0 → 100644
1
\ No newline at end of file
parsing/stillness 0 → 100644
1
\ No newline at end of file
parsing/stone 0 → 100644
1
\ No newline at end of file
parsing/stood 0 → 100644
1
\ No newline at end of file
parsing/stories 0 → 100644
2story
\ No newline at end of file
parsing/story 0 → 100644
1
\ No newline at end of file
parsing/street 0 → 100644
1
\ No newline at end of file
parsing/streets 0 → 100644
2street
\ No newline at end of file
parsing/strength 0 → 100644
1
\ No newline at end of file
parsing/strengthen 0 → 100644
2strengthened
\ No newline at end of file
parsing/strengthened 0 → 100644
1
\ No newline at end of file
parsing/strenuous 0 → 100644
1
\ No newline at end of file
parsing/stretched 0 → 100644
1
\ No newline at end of file
parsing/stucco 0 → 100644
1
\ No newline at end of file
parsing/suggested 0 → 100644
1
\ No newline at end of file
parsing/sun 0 → 100644
1
\ No newline at end of file
parsing/sunlight 0 → 100644
1
\ No newline at end of file
parsing/sweetmeats 0 → 100644
1
\ No newline at end of file
parsing/swiftly 0 → 100644
1
\ No newline at end of file
parsing/symmetry 0 → 100644
1
\ No newline at end of file
parsing/systile 0 → 100644
1
\ No newline at end of file
parsing/take 0 → 100644
2taken
\ No newline at end of file
parsing/taken 0 → 100644
1
\ No newline at end of file
parsing/talk 0 → 100644
1
\ No newline at end of file
parsing/ten 0 → 100644
0
\ No newline at end of file
parsing/tendered 0 → 100644
1
\ No newline at end of file
parsing/terrace 0 → 100644
1
\ No newline at end of file
parsing/terrass 0 → 100644
2terrace
\ No newline at end of file
parsing/than 0 → 100644
1
\ No newline at end of file
parsing/that 0 → 100644
0
\ No newline at end of file
parsing/the 0 → 100644
0
\ No newline at end of file
parsing/their 0 → 100644
0
\ No newline at end of file
parsing/them 0 → 100644
0
\ No newline at end of file
parsing/then 0 → 100644
1
\ No newline at end of file
parsing/there 0 → 100644
0
\ No newline at end of file
parsing/these 0 → 100644
0
\ No newline at end of file
parsing/they 0 → 100644
0
\ No newline at end of file
parsing/thing 0 → 100644
1
\ No newline at end of file
parsing/things 0 → 100644
2thing
\ No newline at end of file
parsing/think 0 → 100644
2thought
\ No newline at end of file
parsing/this 0 → 100644
0
\ No newline at end of file
parsing/thou 0 → 100644
1
\ No newline at end of file
parsing/though 0 → 100644
1
\ No newline at end of file
parsing/thought 0 → 100644
1
\ No newline at end of file
parsing/three 0 → 100644
0
\ No newline at end of file
parsing/threw 0 → 100644
1
\ No newline at end of file
parsing/throat 0 → 100644
1
\ No newline at end of file
parsing/through 0 → 100644
1
\ No newline at end of file
parsing/timber 0 → 100644
1
\ No newline at end of file
parsing/time 0 → 100644
1
\ No newline at end of file
parsing/times 0 → 100644
2time
\ No newline at end of file
parsing/to 0 → 100644
0
\ No newline at end of file
parsing/together 0 → 100644
1
\ No newline at end of file
parsing/treat 0 → 100644
1
\ No newline at end of file
parsing/treats 0 → 100644
2treat
\ No newline at end of file
parsing/tree 0 → 100644
1
\ No newline at end of file
parsing/trees 0 → 100644
1
\ No newline at end of file
parsing/try 0 → 100644
1
\ No newline at end of file
parsing/tuscane 0 → 100644
1
\ No newline at end of file
parsing/two 0 → 100644
0
\ No newline at end of file
parsing/umbrella 0 → 100644
1
\ No newline at end of file
parsing/understand 0 → 100644
1
\ No newline at end of file
parsing/undertaken 0 → 100644
1
\ No newline at end of file
parsing/up 0 → 100644
1
\ No newline at end of file
parsing/upon 0 → 100644
1
\ No newline at end of file
parsing/us 0 → 100644
0
\ No newline at end of file
parsing/use 0 → 100644
1
\ No newline at end of file
parsing/used 0 → 100644
1
\ No newline at end of file
parsing/verandah 0 → 100644
1
\ No newline at end of file
parsing/very 0 → 100644
1
\ No newline at end of file
parsing/vitruvius 0 → 100644
0
\ No newline at end of file
parsing/viz 0 → 100644
0
\ No newline at end of file
parsing/voice 0 → 100644
1
\ No newline at end of file
parsing/wailed 0 → 100644
1
\ No newline at end of file
parsing/wailing 0 → 100644
2wailed
\ No newline at end of file
parsing/walk 0 → 100644
1
\ No newline at end of file
parsing/walked 0 → 100644
1
\ No newline at end of file
parsing/walking 0 → 100644
2walked
\ No newline at end of file
parsing/walks 0 → 100644
2walked
\ No newline at end of file
parsing/wall 0 → 100644
1
\ No newline at end of file
parsing/walls 0 → 100644
2wall
\ No newline at end of file
parsing/wanted 0 → 100644
1
\ No newline at end of file
parsing/was 0 → 100644
0
\ No newline at end of file
parsing/weight 0 → 100644
1
\ No newline at end of file
parsing/well 0 → 100644
1
\ No newline at end of file
parsing/went 0 → 100644
1
\ No newline at end of file
parsing/were 0 → 100644
0
\ No newline at end of file
parsing/what 0 → 100644
1
\ No newline at end of file
parsing/when 0 → 100644
1
\ No newline at end of file
parsing/whereof 0 → 100644
1
\ No newline at end of file
parsing/which 0 → 100644
1
\ No newline at end of file
parsing/whitewashed 0 → 100644
1
\ No newline at end of file
parsing/who 0 → 100644
1
\ No newline at end of file
parsing/whole 0 → 100644
1
\ No newline at end of file
parsing/wholesome 0 → 100644
1
\ No newline at end of file
parsing/wholsom 0 → 100644
2wholesome
\ No newline at end of file
parsing/will 0 → 100644
0
\ No newline at end of file
parsing/wind 0 → 100644
1
\ No newline at end of file
parsing/window 0 → 100644
1
\ No newline at end of file
parsing/windows 0 → 100644
2window
\ No newline at end of file
parsing/with 0 → 100644
1
\ No newline at end of file
parsing/without 0 → 100644
1
\ No newline at end of file
parsing/wood 0 → 100644
1
\ No newline at end of file
parsing/word 0 → 100644
1
\ No newline at end of file
parsing/wore 0 → 100644
1
\ No newline at end of file
parsing/work 0 → 100644
1
\ No newline at end of file
parsing/works 0 → 100644
2work
\ No newline at end of file
parsing/world 0 → 100644
1
\ No newline at end of file
parsing/worthy 0 → 100644
1
\ No newline at end of file
parsing/would 0 → 100644
1
\ No newline at end of file
parsing/wound 0 → 100644
1
\ No newline at end of file
parsing/writing 0 → 100644
2written
\ No newline at end of file
parsing/written 0 → 100644
1
\ No newline at end of file
parsing/your 0 → 100644
1
\ No newline at end of file
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or sign in to comment