同じlistRoot(すべてのスレッド)、、、および;sturct dataBlock
を含むスレッドにを送信しています。リストのノードには、処理されるashのint値と、nrOfListElements%nrOfWorkers(Threads)のintワーカーがあります。しかし、どういうわけか、私が各スレッドに送信する構造体は同じであると思いますが、それぞれがindexFromForLoopを持つ1つの異なるint変数を持つべきではありません。私は何が間違っているのですか?a pointer
int indexInForLoop
int listSize
ターミナル出力:
node #1 worker: 1 value: 86
node #2 worker: 0 value: 77
node #3 worker: 1 value: 15
node #4 worker: 0 value: 93
node #5 worker: 1 value: 35
? List got populated
workersInput: 2
in for, ret= 0
in for, ret= 0
* Thread start: id: 3067579200^
forID_ 1
->val: 86
valid for sqrt
* Thread start: id: 3075971904^
forID_ 1
->val: 86
valid for sqrt
コード:
#include <stdio.h>
#include <stdlib.h>
#include <pthread.h>
#include <unistd.h>
#include <math.h>
#define workTime 5
#define workersLimitNr 3
struct dataBlock{
struct node *root;
int listSize;
int forIndex;
};
struct node { // std linked list node
int value;
int worker;
struct node *next;
};
int slots = 0; // only 3 threads are allowed to access the list
int availableCheck(){ // check if thread can acces the list
if(slots < 3) return 0;
else return -1;
}
pthread_mutex_t mutp = PTHREAD_MUTEX_INITIALIZER; //condvar mutex
pthread_cond_t condvar = PTHREAD_COND_INITIALIZER; //condvar
void * worker( void *data ){
struct dataBlock *inData = (struct dataBlock *) data;
struct node *root = inData->root;
int listSize = inData->listSize;
int forIndex = inData ->forIndex;
printf( "* Thread start: ^\n");
pthread_mutex_lock( &mutp );
if(availableCheck() < 0){
printf( " ^^^ List not available yet... \n" );
pthread_cond_wait( &condvar, &mutp );
}
struct node *it = root;
printf("forID_ %d \n", forIndex);
while(it->next != NULL){
if(forIndex == it->worker){
printf("valid for sqrt \n");
if(it->value > 2){
sqrt(it->value);
break;
}
}
it = it->next;
printf("->val: %d \n", it->value);
}
pthread_cond_signal( &condvar ); //
pthread_mutex_unlock( &mutp );
return NULL;
}
int main( int argc, char *argv[] ){
if ( argc != 3 ){
printf( "Programm must be called with \n NR of elements and NR of workers! \n " );
exit( 1 );
}
int i;
struct node *root;
struct node *iterator;
//prepare list for task
int listSize = atoi(argv[1]);
int nrWorkers = atoi(argv[2]);
root = malloc(sizeof( struct node) );
root->value = rand() % 100;
root->worker = 0;
iterator = root;
for( i=1; i<listSize; i++ ){
iterator->next = malloc(sizeof(struct node));
iterator = iterator->next;
iterator->value = rand() % 100;
iterator->worker = i % nrWorkers;
printf("node #%d worker: %d value: %d\n", i, iterator->worker,iterator->value);
}
printf("? List got populated\n");
// Create all threads to parse the link list
int ret;
printf("workersInput: %d\n",nrWorkers);
pthread_t w_thread;
pthread_t* w_threads = malloc(nrWorkers * sizeof(w_thread));
struct dataBlock *data = malloc(sizeof(struct dataBlock));
data->root = root;
data->listSize = listSize;
for( i=0; i < nrWorkers; i++ ){
data->forIndex = i;
ret = pthread_create ( &w_threads[i], NULL, worker, (void *) data );
if( ret ) {
perror("Thread creation fail");
exit(2);
}
printf("in for, ret= %d\n",ret);
}
for ( i = 0; i < nrWorkers; i++){
pthread_join(w_threads[i],NULL);
}
free(root);
free(iterator);
return 0;
}
編集:pthread_self()を使用しましたが、さまざまな脅威があることを確認しました