2005-07-13 05:51:33 +08:00
|
|
|
//===-- examples/ParallelJIT/ParallelJIT.cpp - Exercise threaded-safe JIT -===//
|
|
|
|
//
|
2019-01-19 16:50:56 +08:00
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
2005-07-13 05:51:33 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// Parallel JIT
|
|
|
|
//
|
2005-07-27 14:12:32 +08:00
|
|
|
// This test program creates two LLVM functions then calls them from three
|
2005-07-13 05:51:33 +08:00
|
|
|
// separate threads. It requires the pthreads library.
|
|
|
|
// The three threads are created and then block waiting on a condition variable.
|
|
|
|
// Once all threads are blocked on the conditional variable, the main thread
|
|
|
|
// wakes them up. This complicated work is performed so that all three threads
|
|
|
|
// call into the JIT at the same time (or the best possible approximation of the
|
|
|
|
// same time). This test had assertion errors until I got the locking right.
|
2016-05-25 09:18:36 +08:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2005-07-13 05:51:33 +08:00
|
|
|
|
2016-05-25 09:18:36 +08:00
|
|
|
#include "llvm/ADT/APInt.h"
|
2015-03-02 09:04:34 +08:00
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2016-05-25 09:18:36 +08:00
|
|
|
#include "llvm/ExecutionEngine/ExecutionEngine.h"
|
2005-07-13 05:51:33 +08:00
|
|
|
#include "llvm/ExecutionEngine/GenericValue.h"
|
2016-05-25 09:18:36 +08:00
|
|
|
#include "llvm/IR/Argument.h"
|
|
|
|
#include "llvm/IR/BasicBlock.h"
|
2013-01-02 19:56:33 +08:00
|
|
|
#include "llvm/IR/Constants.h"
|
|
|
|
#include "llvm/IR/DerivedTypes.h"
|
2016-05-25 09:18:36 +08:00
|
|
|
#include "llvm/IR/Function.h"
|
|
|
|
#include "llvm/IR/InstrTypes.h"
|
|
|
|
#include "llvm/IR/Instruction.h"
|
2013-01-02 19:56:33 +08:00
|
|
|
#include "llvm/IR/Instructions.h"
|
|
|
|
#include "llvm/IR/LLVMContext.h"
|
|
|
|
#include "llvm/IR/Module.h"
|
2016-05-25 09:18:36 +08:00
|
|
|
#include "llvm/IR/Type.h"
|
|
|
|
#include "llvm/Support/Casting.h"
|
2011-08-25 02:08:43 +08:00
|
|
|
#include "llvm/Support/TargetSelect.h"
|
2016-05-25 09:18:36 +08:00
|
|
|
#include <algorithm>
|
|
|
|
#include <cassert>
|
|
|
|
#include <cstddef>
|
|
|
|
#include <cstdint>
|
2005-07-13 05:51:33 +08:00
|
|
|
#include <iostream>
|
2016-05-25 09:18:36 +08:00
|
|
|
#include <memory>
|
|
|
|
#include <vector>
|
2012-12-04 18:16:57 +08:00
|
|
|
#include <pthread.h>
|
2015-09-30 02:02:48 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
using namespace llvm;
|
|
|
|
|
2007-01-07 15:40:09 +08:00
|
|
|
static Function* createAdd1(Module *M) {
|
2019-02-01 11:23:42 +08:00
|
|
|
LLVMContext &Context = M->getContext();
|
2005-07-13 05:51:33 +08:00
|
|
|
// Create the add1 function entry and insert this entry into module M. The
|
|
|
|
// function will have a return type of "int" and take an argument of "int".
|
2007-01-07 15:40:09 +08:00
|
|
|
Function *Add1F =
|
[opaque pointer types] Add a FunctionCallee wrapper type, and use it.
Recommit r352791 after tweaking DerivedTypes.h slightly, so that gcc
doesn't choke on it, hopefully.
Original Message:
The FunctionCallee type is effectively a {FunctionType*,Value*} pair,
and is a useful convenience to enable code to continue passing the
result of getOrInsertFunction() through to EmitCall, even once pointer
types lose their pointee-type.
Then:
- update the CallInst/InvokeInst instruction creation functions to
take a Callee,
- modify getOrInsertFunction to return FunctionCallee, and
- update all callers appropriately.
One area of particular note is the change to the sanitizer
code. Previously, they had been casting the result of
`getOrInsertFunction` to a `Function*` via
`checkSanitizerInterfaceFunction`, and storing that. That would report
an error if someone had already inserted a function declaraction with
a mismatching signature.
However, in general, LLVM allows for such mismatches, as
`getOrInsertFunction` will automatically insert a bitcast if
needed. As part of this cleanup, cause the sanitizer code to do the
same. (It will call its functions using the expected signature,
however they may have been declared.)
Finally, in a small number of locations, callers of
`getOrInsertFunction` actually were expecting/requiring that a brand
new function was being created. In such cases, I've switched them to
Function::Create instead.
Differential Revision: https://reviews.llvm.org/D57315
llvm-svn: 352827
2019-02-01 10:28:03 +08:00
|
|
|
Function::Create(FunctionType::get(Type::getInt32Ty(Context),
|
|
|
|
{Type::getInt32Ty(Context)}, false),
|
|
|
|
Function::ExternalLinkage, "add1", M);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Add a basic block to the function. As before, it automatically inserts
|
|
|
|
// because of the last argument.
|
2019-02-01 11:23:42 +08:00
|
|
|
BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", Add1F);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Get pointers to the constant `1'.
|
2019-02-01 11:23:42 +08:00
|
|
|
Value *One = ConstantInt::get(Type::getInt32Ty(Context), 1);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Get pointers to the integer argument of the add1 function...
|
|
|
|
assert(Add1F->arg_begin() != Add1F->arg_end()); // Make sure there's an arg
|
2015-11-07 08:55:46 +08:00
|
|
|
Argument *ArgX = &*Add1F->arg_begin(); // Get the arg
|
2005-07-13 05:51:33 +08:00
|
|
|
ArgX->setName("AnArg"); // Give it a nice symbolic name for fun.
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Create the add instruction, inserting it into the end of BB.
|
2008-05-17 03:29:10 +08:00
|
|
|
Instruction *Add = BinaryOperator::CreateAdd(One, ArgX, "addresult", BB);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Create the return instruction and add it to the basic block
|
2019-02-01 11:23:42 +08:00
|
|
|
ReturnInst::Create(Context, Add, BB);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
|
|
|
// Now, function add1 is ready.
|
2005-07-13 05:51:33 +08:00
|
|
|
return Add1F;
|
|
|
|
}
|
|
|
|
|
2007-01-07 15:40:09 +08:00
|
|
|
static Function *CreateFibFunction(Module *M) {
|
2019-02-01 11:23:42 +08:00
|
|
|
LLVMContext &Context = M->getContext();
|
2005-07-13 05:51:33 +08:00
|
|
|
// Create the fib function and insert it into module M. This function is said
|
|
|
|
// to return an int and take an int parameter.
|
[opaque pointer types] Add a FunctionCallee wrapper type, and use it.
Recommit r352791 after tweaking DerivedTypes.h slightly, so that gcc
doesn't choke on it, hopefully.
Original Message:
The FunctionCallee type is effectively a {FunctionType*,Value*} pair,
and is a useful convenience to enable code to continue passing the
result of getOrInsertFunction() through to EmitCall, even once pointer
types lose their pointee-type.
Then:
- update the CallInst/InvokeInst instruction creation functions to
take a Callee,
- modify getOrInsertFunction to return FunctionCallee, and
- update all callers appropriately.
One area of particular note is the change to the sanitizer
code. Previously, they had been casting the result of
`getOrInsertFunction` to a `Function*` via
`checkSanitizerInterfaceFunction`, and storing that. That would report
an error if someone had already inserted a function declaraction with
a mismatching signature.
However, in general, LLVM allows for such mismatches, as
`getOrInsertFunction` will automatically insert a bitcast if
needed. As part of this cleanup, cause the sanitizer code to do the
same. (It will call its functions using the expected signature,
however they may have been declared.)
Finally, in a small number of locations, callers of
`getOrInsertFunction` actually were expecting/requiring that a brand
new function was being created. In such cases, I've switched them to
Function::Create instead.
Differential Revision: https://reviews.llvm.org/D57315
llvm-svn: 352827
2019-02-01 10:28:03 +08:00
|
|
|
FunctionType *FibFTy = FunctionType::get(Type::getInt32Ty(Context),
|
|
|
|
{Type::getInt32Ty(Context)}, false);
|
|
|
|
Function *FibF =
|
|
|
|
Function::Create(FibFTy, Function::ExternalLinkage, "fib", M);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Add a basic block to the function.
|
2019-02-01 11:23:42 +08:00
|
|
|
BasicBlock *BB = BasicBlock::Create(Context, "EntryBlock", FibF);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Get pointers to the constants.
|
2019-02-01 11:23:42 +08:00
|
|
|
Value *One = ConstantInt::get(Type::getInt32Ty(Context), 1);
|
|
|
|
Value *Two = ConstantInt::get(Type::getInt32Ty(Context), 2);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Get pointer to the integer argument of the add1 function...
|
2015-11-07 08:55:46 +08:00
|
|
|
Argument *ArgX = &*FibF->arg_begin(); // Get the arg.
|
2005-07-13 05:51:33 +08:00
|
|
|
ArgX->setName("AnArg"); // Give it a nice symbolic name for fun.
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Create the true_block.
|
2019-02-01 11:23:42 +08:00
|
|
|
BasicBlock *RetBB = BasicBlock::Create(Context, "return", FibF);
|
2005-07-13 05:51:33 +08:00
|
|
|
// Create an exit block.
|
2019-02-01 11:23:42 +08:00
|
|
|
BasicBlock *RecurseBB = BasicBlock::Create(Context, "recurse", FibF);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Create the "if (arg < 2) goto exitbb"
|
2009-07-10 07:48:35 +08:00
|
|
|
Value *CondInst = new ICmpInst(*BB, ICmpInst::ICMP_SLE, ArgX, Two, "cond");
|
2008-04-07 04:25:17 +08:00
|
|
|
BranchInst::Create(RetBB, RecurseBB, CondInst, BB);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Create: ret int 1
|
2019-02-01 11:23:42 +08:00
|
|
|
ReturnInst::Create(Context, One, RetBB);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// create fib(x-1)
|
2008-05-17 03:29:10 +08:00
|
|
|
Value *Sub = BinaryOperator::CreateSub(ArgX, One, "arg", RecurseBB);
|
2008-04-07 04:25:17 +08:00
|
|
|
Value *CallFibX1 = CallInst::Create(FibF, Sub, "fibx1", RecurseBB);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// create fib(x-2)
|
2008-05-17 03:29:10 +08:00
|
|
|
Sub = BinaryOperator::CreateSub(ArgX, Two, "arg", RecurseBB);
|
2008-04-07 04:25:17 +08:00
|
|
|
Value *CallFibX2 = CallInst::Create(FibF, Sub, "fibx2", RecurseBB);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// fib(x-1)+fib(x-2)
|
2005-07-27 14:12:32 +08:00
|
|
|
Value *Sum =
|
2008-05-17 03:29:10 +08:00
|
|
|
BinaryOperator::CreateAdd(CallFibX1, CallFibX2, "addresult", RecurseBB);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Create the return instruction and add it to the basic block
|
2019-02-01 11:23:42 +08:00
|
|
|
ReturnInst::Create(Context, Sum, RecurseBB);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
return FibF;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct threadParams {
|
|
|
|
ExecutionEngine* EE;
|
|
|
|
Function* F;
|
|
|
|
int value;
|
|
|
|
};
|
|
|
|
|
|
|
|
// We block the subthreads just before they begin to execute:
|
|
|
|
// we want all of them to call into the JIT at the same time,
|
|
|
|
// to verify that the locking is working correctly.
|
|
|
|
class WaitForThreads
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
WaitForThreads()
|
|
|
|
{
|
|
|
|
n = 0;
|
|
|
|
waitFor = 0;
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2015-09-30 02:02:48 +08:00
|
|
|
int result = pthread_cond_init( &condition, nullptr );
|
2017-07-19 23:06:31 +08:00
|
|
|
(void)result;
|
2005-07-13 05:51:33 +08:00
|
|
|
assert( result == 0 );
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2015-09-30 02:02:48 +08:00
|
|
|
result = pthread_mutex_init( &mutex, nullptr );
|
2005-07-13 05:51:33 +08:00
|
|
|
assert( result == 0 );
|
|
|
|
}
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
~WaitForThreads()
|
|
|
|
{
|
|
|
|
int result = pthread_cond_destroy( &condition );
|
2014-03-06 14:35:46 +08:00
|
|
|
(void)result;
|
2005-07-13 05:51:33 +08:00
|
|
|
assert( result == 0 );
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
result = pthread_mutex_destroy( &mutex );
|
|
|
|
assert( result == 0 );
|
|
|
|
}
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// All threads will stop here until another thread calls releaseThreads
|
|
|
|
void block()
|
|
|
|
{
|
|
|
|
int result = pthread_mutex_lock( &mutex );
|
2014-03-06 14:35:46 +08:00
|
|
|
(void)result;
|
2005-07-13 05:51:33 +08:00
|
|
|
assert( result == 0 );
|
|
|
|
n ++;
|
|
|
|
//~ std::cout << "block() n " << n << " waitFor " << waitFor << std::endl;
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
assert( waitFor == 0 || n <= waitFor );
|
2005-07-27 14:12:32 +08:00
|
|
|
if ( waitFor > 0 && n == waitFor )
|
2005-07-13 05:51:33 +08:00
|
|
|
{
|
|
|
|
// There are enough threads blocked that we can release all of them
|
|
|
|
std::cout << "Unblocking threads from block()" << std::endl;
|
|
|
|
unblockThreads();
|
2005-07-27 14:12:32 +08:00
|
|
|
}
|
|
|
|
else
|
2005-07-13 05:51:33 +08:00
|
|
|
{
|
|
|
|
// We just need to wait until someone unblocks us
|
|
|
|
result = pthread_cond_wait( &condition, &mutex );
|
|
|
|
assert( result == 0 );
|
|
|
|
}
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// unlock the mutex before returning
|
|
|
|
result = pthread_mutex_unlock( &mutex );
|
|
|
|
assert( result == 0 );
|
|
|
|
}
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// If there are num or more threads blocked, it will signal them all
|
|
|
|
// Otherwise, this thread blocks until there are enough OTHER threads
|
|
|
|
// blocked
|
|
|
|
void releaseThreads( size_t num )
|
|
|
|
{
|
|
|
|
int result = pthread_mutex_lock( &mutex );
|
2014-03-06 14:35:46 +08:00
|
|
|
(void)result;
|
2005-07-13 05:51:33 +08:00
|
|
|
assert( result == 0 );
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
if ( n >= num ) {
|
|
|
|
std::cout << "Unblocking threads from releaseThreads()" << std::endl;
|
|
|
|
unblockThreads();
|
2005-07-27 14:12:32 +08:00
|
|
|
}
|
|
|
|
else
|
2005-07-13 05:51:33 +08:00
|
|
|
{
|
|
|
|
waitFor = num;
|
|
|
|
pthread_cond_wait( &condition, &mutex );
|
|
|
|
}
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// unlock the mutex before returning
|
|
|
|
result = pthread_mutex_unlock( &mutex );
|
|
|
|
assert( result == 0 );
|
|
|
|
}
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
private:
|
|
|
|
void unblockThreads()
|
|
|
|
{
|
|
|
|
// Reset the counters to zero: this way, if any new threads
|
|
|
|
// enter while threads are exiting, they will block instead
|
|
|
|
// of triggering a new release of threads
|
|
|
|
n = 0;
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Reset waitFor to zero: this way, if waitFor threads enter
|
|
|
|
// while threads are exiting, they will block instead of
|
|
|
|
// triggering a new release of threads
|
|
|
|
waitFor = 0;
|
|
|
|
|
|
|
|
int result = pthread_cond_broadcast( &condition );
|
2012-02-20 08:02:49 +08:00
|
|
|
(void)result;
|
|
|
|
assert(result == 0);
|
2005-07-13 05:51:33 +08:00
|
|
|
}
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
size_t n;
|
|
|
|
size_t waitFor;
|
|
|
|
pthread_cond_t condition;
|
|
|
|
pthread_mutex_t mutex;
|
|
|
|
};
|
|
|
|
|
|
|
|
static WaitForThreads synchronize;
|
|
|
|
|
|
|
|
void* callFunc( void* param )
|
|
|
|
{
|
|
|
|
struct threadParams* p = (struct threadParams*) param;
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Call the `foo' function with no arguments:
|
|
|
|
std::vector<GenericValue> Args(1);
|
2007-03-07 01:24:31 +08:00
|
|
|
Args[0].IntVal = APInt(32, p->value);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
synchronize.block(); // wait until other threads are at this point
|
|
|
|
GenericValue gv = p->EE->runFunction(p->F, Args);
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2007-03-07 01:24:31 +08:00
|
|
|
return (void*)(intptr_t)gv.IntVal.getZExtValue();
|
2005-07-13 05:51:33 +08:00
|
|
|
}
|
|
|
|
|
2009-06-18 00:48:44 +08:00
|
|
|
int main() {
|
|
|
|
InitializeNativeTarget();
|
2009-07-02 00:58:40 +08:00
|
|
|
LLVMContext Context;
|
2009-06-18 00:48:44 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Create some module to put our function into it.
|
2019-08-15 23:54:37 +08:00
|
|
|
std::unique_ptr<Module> Owner = std::make_unique<Module>("test", Context);
|
2014-08-19 12:04:25 +08:00
|
|
|
Module *M = Owner.get();
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
Function* add1F = createAdd1( M );
|
|
|
|
Function* fibF = CreateFibFunction( M );
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Now we create the JIT.
|
2014-08-19 12:04:25 +08:00
|
|
|
ExecutionEngine* EE = EngineBuilder(std::move(Owner)).create();
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
//~ std::cout << "We just constructed this LLVM module:\n\n" << *M;
|
|
|
|
//~ std::cout << "\n\nRunning foo: " << std::flush;
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
// Create one thread for add1 and two threads for fib
|
|
|
|
struct threadParams add1 = { EE, add1F, 1000 };
|
|
|
|
struct threadParams fib1 = { EE, fibF, 39 };
|
|
|
|
struct threadParams fib2 = { EE, fibF, 42 };
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
pthread_t add1Thread;
|
2015-09-30 02:02:48 +08:00
|
|
|
int result = pthread_create( &add1Thread, nullptr, callFunc, &add1 );
|
2005-07-13 05:51:33 +08:00
|
|
|
if ( result != 0 ) {
|
|
|
|
std::cerr << "Could not create thread" << std::endl;
|
|
|
|
return 1;
|
|
|
|
}
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
pthread_t fibThread1;
|
2015-09-30 02:02:48 +08:00
|
|
|
result = pthread_create( &fibThread1, nullptr, callFunc, &fib1 );
|
2005-07-13 05:51:33 +08:00
|
|
|
if ( result != 0 ) {
|
|
|
|
std::cerr << "Could not create thread" << std::endl;
|
|
|
|
return 1;
|
|
|
|
}
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
pthread_t fibThread2;
|
2015-09-30 02:02:48 +08:00
|
|
|
result = pthread_create( &fibThread2, nullptr, callFunc, &fib2 );
|
2005-07-13 05:51:33 +08:00
|
|
|
if ( result != 0 ) {
|
|
|
|
std::cerr << "Could not create thread" << std::endl;
|
|
|
|
return 1;
|
|
|
|
}
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
synchronize.releaseThreads(3); // wait until other threads are at this point
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
void* returnValue;
|
|
|
|
result = pthread_join( add1Thread, &returnValue );
|
|
|
|
if ( result != 0 ) {
|
|
|
|
std::cerr << "Could not join thread" << std::endl;
|
|
|
|
return 1;
|
|
|
|
}
|
2005-07-14 07:20:24 +08:00
|
|
|
std::cout << "Add1 returned " << intptr_t(returnValue) << std::endl;
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
result = pthread_join( fibThread1, &returnValue );
|
|
|
|
if ( result != 0 ) {
|
|
|
|
std::cerr << "Could not join thread" << std::endl;
|
|
|
|
return 1;
|
|
|
|
}
|
2005-07-14 07:20:24 +08:00
|
|
|
std::cout << "Fib1 returned " << intptr_t(returnValue) << std::endl;
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
result = pthread_join( fibThread2, &returnValue );
|
|
|
|
if ( result != 0 ) {
|
|
|
|
std::cerr << "Could not join thread" << std::endl;
|
|
|
|
return 1;
|
|
|
|
}
|
2005-07-14 07:20:24 +08:00
|
|
|
std::cout << "Fib2 returned " << intptr_t(returnValue) << std::endl;
|
2005-07-27 14:12:32 +08:00
|
|
|
|
2005-07-13 05:51:33 +08:00
|
|
|
return 0;
|
|
|
|
}
|