void CNumRange::MinorMerge( const CNumRange& other )
{
m_minor = max(other.m_minor,m_minor);
m_max = min(other.m_max,m_max);
}
void BufferSenderUGenInternal::processBlock(bool& shouldDelete, const unsigned int blockID, const int /*channel*/) throw()
{
float duration = *(inputs[Duration].processBlock(shouldDelete, blockID, 0));
int audioBufferSizeRequired = max(1, (int)(duration * UGen::getSampleRate() + 0.5));
int audioBufferAllocatedSize = audioBuffer.size();
if(audioBufferSizeRequired > audioBufferAllocatedSize)
{
if((audioBufferAllocatedSize > 1) && (bufferIndex >= audioBufferAllocatedSize))
{
sendBuffer(audioBuffer.getRegion(0, audioBufferAllocatedSize-1), samplesProcessed);
}
audioBufferAllocatedSize = audioBufferSizeRequired;
audioBuffer = Buffer::withSize(audioBufferAllocatedSize, inputs[Input].getNumChannels(), false);
audioBufferSizeUsed = audioBufferSizeRequired;
bufferIndex = 0;
}
else if(audioBufferSizeRequired < audioBufferAllocatedSize)
{
audioBufferSizeUsed = audioBufferSizeRequired;
if(bufferIndex >= audioBufferSizeUsed)
{
if(audioBufferSizeUsed == audioBuffer.size())
{
sendBuffer(audioBuffer, samplesProcessed);
}
else
{
sendBuffer(audioBuffer.getRegion(0, audioBufferSizeUsed-1), samplesProcessed);
audioBufferAllocatedSize = audioBufferSizeRequired;
audioBuffer = Buffer::withSize(audioBufferAllocatedSize, inputs[Input].getNumChannels(), false);
}
bufferIndex = 0;
}
}
int numSamplesRemaining = uGenOutput.getBlockSize();
int offset = 0;
while(numSamplesRemaining > 0)
{
const int bufferSamplesToProcess = audioBufferSizeUsed - bufferIndex;
const int numSamplesThisTime = min(bufferSamplesToProcess, numSamplesRemaining);
for(int channel = 0; channel < audioBuffer.getNumChannels(); channel++)
{
int numSamplesToProcess = numSamplesThisTime;
const float* inputSamples = inputs[Input].processBlock(shouldDelete, blockID, channel) + offset;
float* bufferSamples = audioBuffer.getData(channel) + bufferIndex;
while(numSamplesToProcess--)
*bufferSamples++ = *inputSamples++;
}
numSamplesRemaining -= numSamplesThisTime;
bufferIndex += numSamplesThisTime;
samplesProcessed += numSamplesThisTime;
offset += numSamplesThisTime;
if(bufferIndex >= audioBufferSizeUsed)
{
if(audioBufferSizeUsed == audioBuffer.size())
{
sendBuffer(audioBuffer, samplesProcessed);
}
else
{
sendBuffer(audioBuffer.getRegion(0, audioBufferSizeUsed-1), samplesProcessed);
audioBufferAllocatedSize = audioBufferSizeRequired;
audioBuffer = Buffer::withSize(audioBufferAllocatedSize, inputs[Input].getNumChannels(), false);
}
bufferIndex = 0;
}
}
}
//-----------------------------------------------------------------------------
// Purpose:
// Input : &origin -
// &normal -
// scale -
//-----------------------------------------------------------------------------
void StriderBlood( const Vector &origin, const Vector &normal, float scale )
{
VPROF_BUDGET( "StriderBlood", VPROF_BUDGETGROUP_PARTICLE_RENDERING );
Vector offset;
CSmartPtr<CSplashParticle> pSimple = CSplashParticle::Create( "splish" );
pSimple->SetSortOrigin( origin );
Vector color[3];
color[0] = color[1] = color[2] = Vector( 1, 1, 1 );
float colorRamp;
int i;
float flScale = scale / 8.0f;
PMaterialHandle hMaterial = ParticleMgr()->GetPMaterial( "effects/slime1" );
float length = 0.1f;
Vector vForward, vRight, vUp;
Vector offDir;
TrailParticle *tParticle;
CSmartPtr<CTrailParticles> sparkEmitter = CTrailParticles::Create( "splash" );
if ( !sparkEmitter )
return;
sparkEmitter->SetSortOrigin( origin );
sparkEmitter->m_ParticleCollision.SetGravity( 800.0f );
sparkEmitter->SetFlag( bitsPARTICLE_TRAIL_VELOCITY_DAMPEN );
sparkEmitter->SetVelocityDampen( 2.0f );
//Dump out drops
for ( i = 0; i < 64; i++ )
{
offset = origin;
offset[0] += random->RandomFloat( -16.0f, 16.0f ) * flScale;
offset[1] += random->RandomFloat( -16.0f, 16.0f ) * flScale;
tParticle = (TrailParticle *) sparkEmitter->AddParticle( sizeof(TrailParticle), hMaterial, offset );
if ( tParticle == NULL )
break;
tParticle->m_flLifetime = 0.0f;
tParticle->m_flDieTime = 1.0f;
offDir = normal + RandomVector( -1.0f, 1.0f );
tParticle->m_vecVelocity = offDir * random->RandomFloat( BLOOD_MIN_SPEED * flScale * 2.0f, BLOOD_MAX_SPEED * flScale * 2.0f );
tParticle->m_vecVelocity[2] += random->RandomFloat( 8.0f, 32.0f ) * flScale;
tParticle->m_flWidth = random->RandomFloat( 12.0f, 16.0f ) * flScale;
tParticle->m_flLength = random->RandomFloat( length*0.5f, length ) * flScale;
colorRamp = random->RandomFloat( 0.5f, 2.0f );
int randomColor = random->RandomInt( 0, 2 );
tParticle->m_color.r = min( 1.0f, color[randomColor].x * colorRamp ) * 255;
tParticle->m_color.g = min( 1.0f, color[randomColor].y * colorRamp ) * 255;
tParticle->m_color.b = min( 1.0f, color[randomColor].z * colorRamp ) * 255;
tParticle->m_color.a = 255;
}
}
static void bios_reinitbyswitch(void) {
UINT8 prxcrt;
UINT8 prxdupd;
UINT8 biosflag;
UINT8 extmem;
UINT8 boot;
if (!(pccore.dipsw[2] & 0x80)) {
#if defined(CPUCORE_IA32)
mem[MEMB_SYS_TYPE] = 0x03; // 80386〜
#else
mem[MEMB_SYS_TYPE] = 0x01; // 80286
#endif
}
else {
mem[MEMB_SYS_TYPE] = 0x00; // V30
}
mem[MEMB_BIOS_FLAG0] = 0x01;
prxcrt = 0x08;
if (!(pccore.dipsw[0] & 0x01)) { // dipsw1-1 on
prxcrt |= 0x40;
}
if (gdc.display & (1 << GDCDISP_ANALOG)) {
prxcrt |= 0x04; // color16
}
if (!(pccore.dipsw[0] & 0x80)) { // dipsw1-8 on
prxcrt |= 0x01;
}
if (grcg.chip) {
prxcrt |= 0x02;
}
mem[MEMB_PRXCRT] = prxcrt;
prxdupd = 0x18;
if (grcg.chip >= 3) {
prxdupd |= 0x40;
}
if (!(pccore.dipsw[1] & 0x80)) { // dipsw2-8 on
prxdupd |= 0x20;
}
mem[MEMB_PRXDUPD] = prxdupd;
biosflag = 0x20;
if (pccore.cpumode & CPUMODE_8MHZ) {
biosflag |= 0x80;
}
biosflag |= mem[0xa3fea] & 7;
if (pccore.dipsw[2] & 0x80) {
biosflag |= 0x40;
}
mem[MEMB_BIOS_FLAG1] = biosflag;
extmem = pccore.extmem;
extmem = min(extmem, 14);
mem[MEMB_EXPMMSZ] = (UINT8)(extmem << 3);
if (pccore.extmem >= 15) {
mem[0x0594] = pccore.extmem - 15;
}
mem[MEMB_CRT_RASTER] = 0x0f;
// FDD initialize
SETBIOSMEM32(MEMD_F2DD_POINTER, 0xfd801ad7);
SETBIOSMEM32(MEMD_F2HD_POINTER, 0xfd801aaf);
boot = mem[MEMB_MSW5] & 0xf0;
if (boot != 0x20) { // 1MB
fddbios_equip(3, TRUE);
mem[MEMB_BIOS_FLAG0] |= 0x02;
}
else { // 640KB
fddbios_equip(0, TRUE);
mem[MEMB_BIOS_FLAG0] &= ~0x02;
}
mem[MEMB_F2HD_MODE] = 0xff;
mem[MEMB_F2DD_MODE] = 0xff;
#if defined(SUPPORT_CRT31KHZ)
mem[MEMB_CRT_BIOS] |= 0x80;
#endif
#if defined(SUPPORT_PC9821)
mem[MEMB_CRT_BIOS] |= 0x04; // 05/02/03
mem[0x45c] = 0x40;
#endif
// FDC
if (fdc.support144) {
mem[MEMB_F144_SUP] |= fdc.equip;
}
// IDE initialize
if (pccore.hddif & PCHDD_IDE) {
mem[MEMB_SYS_TYPE] |= 0x80; // IDE
CPU_AX = 0x8300;
sasibios_operate();
}
}
internal long fill_ring_buf(struct audio_ring_buffer *audio_ring_buf,
struct game_memory *mem,
struct audio_buffer *audio_buf)
{
unsigned int bytes_per_sample_all_chans,
bytes_to_write, region_1_bytes, region_2_bytes, sample_count, i,
buf_pos, starting_buf_pos, left_sample_value, right_sample_value;
unsigned long sample_pos;
if (!audio_buf->samples) {
debug(0, "no audio_buf->samples\n");
return -1;
}
bytes_per_sample_all_chans =
HANDMAIDEN_AUDIO_BYTES_PER_SAMPLE * HANDMAIDEN_AUDIO_CHANNELS;
if ((audio_ring_buf->write_cursor - audio_ring_buf->play_cursor) >=
audio_ring_buf->buf_len) {
debug(1, "fill: no room to write more sound data\n");
return 0;
}
if (((audio_ring_buf->write_cursor % audio_ring_buf->buf_len) >
(audio_ring_buf->play_cursor % audio_ring_buf->buf_len))
|| (audio_ring_buf->write_cursor == audio_ring_buf->play_cursor)) {
bytes_to_write =
audio_ring_buf->buf_len - (audio_ring_buf->write_cursor -
audio_ring_buf->play_cursor);
} else {
bytes_to_write =
(audio_ring_buf->play_cursor % audio_ring_buf->buf_len) -
(audio_ring_buf->write_cursor % audio_ring_buf->buf_len);
}
if (bytes_to_write > audio_buf->buf_len) {
debug(0, "bytes_to_write > audio_buf->buf_len (%u > %u)\n",
bytes_to_write, audio_buf->buf_len);
bytes_to_write = audio_buf->buf_len;
}
debug(2, "bytes_to_write: %u\n", bytes_to_write);
audio_buf->stream_pos =
(audio_ring_buf->write_cursor / bytes_per_sample_all_chans);
audio_buf->num_samples = bytes_to_write / bytes_per_sample_all_chans;
update_audio_buf(mem, audio_buf);
if ((audio_ring_buf->play_cursor % audio_ring_buf->buf_len) >=
(audio_ring_buf->write_cursor % audio_ring_buf->buf_len)) {
region_1_bytes = bytes_to_write;
region_2_bytes = 0;
if ((audio_ring_buf->play_cursor !=
audio_ring_buf->write_cursor)
&& (region_1_bytes >
((audio_ring_buf->play_cursor %
audio_ring_buf->buf_len) -
(audio_ring_buf->write_cursor %
audio_ring_buf->buf_len)))) {
debug(0, "region 1 over-writing play_cursor\n");
return -1;
}
} else {
region_1_bytes =
min(bytes_to_write,
(audio_ring_buf->buf_len -
((audio_ring_buf->play_cursor %
audio_ring_buf->buf_len))));
region_2_bytes = bytes_to_write - region_1_bytes;
if (region_2_bytes >
((audio_ring_buf->play_cursor % audio_ring_buf->buf_len))) {
debug(0, "region 2 over-writing play_cursor\n");
return -1;
}
}
debug(1,
"fill: (in) play_cursor: %u (%u) write_cursor: %u (%u) bytes to write: %u\n",
audio_ring_buf->play_cursor % audio_ring_buf->buf_len,
audio_ring_buf->play_cursor,
audio_ring_buf->write_cursor % audio_ring_buf->buf_len,
audio_ring_buf->write_cursor, bytes_to_write);
debug(1, "fill: region_1_bytes: %u region_2_bytes: %u\n",
region_1_bytes, region_2_bytes);
if (audio_ring_buf->write_cursor % HANDMAIDEN_AUDIO_BYTES_PER_SAMPLE) {
debug(0, "fill: unexpected audio position\n");
}
buf_pos = audio_ring_buf->write_cursor % audio_ring_buf->buf_len;
starting_buf_pos = buf_pos;
sample_count = region_1_bytes / bytes_per_sample_all_chans;
for (i = 0; i < sample_count; i++) {
sample_pos = (i * 2);
left_sample_value = *(audio_buf->samples + sample_pos);
right_sample_value = *(audio_buf->samples + sample_pos + 1);
*(int *)(((unsigned char *)audio_ring_buf->buf) + buf_pos) =
left_sample_value;
buf_pos += HANDMAIDEN_AUDIO_BYTES_PER_SAMPLE;
*(int *)(((unsigned char *)audio_ring_buf->buf) + buf_pos) =
right_sample_value;
buf_pos += HANDMAIDEN_AUDIO_BYTES_PER_SAMPLE;
}
debug(1, "fill: region 1 wrote %u bytes (%u samples)\n",
(buf_pos - starting_buf_pos), sample_count);
audio_ring_buf->write_cursor += (buf_pos - starting_buf_pos);
debug(1, "fill: write cursor moved to %u (%u)\n",
audio_ring_buf->write_cursor,
audio_ring_buf->write_cursor % audio_ring_buf->buf_len);
sample_count = region_2_bytes / bytes_per_sample_all_chans;
buf_pos = 0;
starting_buf_pos = buf_pos;
for (i = 0; i < sample_count; i++) {
sample_pos = (i * 2);
left_sample_value = *(audio_buf->samples + sample_pos);
right_sample_value = *(audio_buf->samples + sample_pos + 1);
*(int *)(((unsigned char *)audio_ring_buf->buf) + buf_pos) =
left_sample_value;
buf_pos += HANDMAIDEN_AUDIO_BYTES_PER_SAMPLE;
*(int *)(((unsigned char *)audio_ring_buf->buf) + buf_pos) =
right_sample_value;
buf_pos += HANDMAIDEN_AUDIO_BYTES_PER_SAMPLE;
}
debug(1, "fill: region 2 wrote %u bytes (%u samples)\n",
(buf_pos - starting_buf_pos), sample_count);
audio_ring_buf->write_cursor += (buf_pos - starting_buf_pos);
debug(1, "fill: write cursor moved to %u (%u)\n",
audio_ring_buf->write_cursor,
audio_ring_buf->write_cursor % audio_ring_buf->buf_len);
debug(1,
"fill: (out) play_cursor: %u (%u) write_cursor: %u (%u) bytes avail: %u\n",
audio_ring_buf->play_cursor % audio_ring_buf->buf_len,
audio_ring_buf->play_cursor,
audio_ring_buf->write_cursor % audio_ring_buf->buf_len,
audio_ring_buf->write_cursor,
audio_ring_buf->write_cursor - audio_ring_buf->play_cursor);
if ((audio_ring_buf->write_cursor - audio_ring_buf->play_cursor) >
audio_ring_buf->buf_len) {
debug(0,
"write_cursor: %u, play_cursor: %u diff: %d, bufsize: %u\n",
audio_ring_buf->write_cursor, audio_ring_buf->play_cursor,
(audio_ring_buf->write_cursor -
audio_ring_buf->play_cursor), audio_ring_buf->buf_len);
return -1;
}
debug(1, "fill: done.\n");
return (long)(region_1_bytes + region_2_bytes);
}
static int isight_firmware_load(struct usb_interface *intf,
const struct usb_device_id *id)
{
struct usb_device *dev = interface_to_usbdev(intf);
int llen, len, req, ret = 0;
const struct firmware *firmware;
unsigned char *buf = kmalloc(50, GFP_KERNEL);
unsigned char data[4];
const u8 *ptr;
if (!buf)
return -ENOMEM;
if (request_firmware(&firmware, "isight.fw", &dev->dev) != 0) {
printk(KERN_ERR "Unable to load isight firmware\n");
ret = -ENODEV;
goto out;
}
ptr = firmware->data;
buf[0] = 0x01;
if (usb_control_msg
(dev, usb_sndctrlpipe(dev, 0), 0xa0, 0x40, 0xe600, 0, buf, 1,
300) != 1) {
printk(KERN_ERR
"Failed to initialise isight firmware loader\n");
ret = -ENODEV;
goto out;
}
while (ptr+4 <= firmware->data+firmware->size) {
memcpy(data, ptr, 4);
len = (data[0] << 8 | data[1]);
req = (data[2] << 8 | data[3]);
ptr += 4;
if (len == 0x8001)
break; /* success */
else if (len == 0)
continue;
for (; len > 0; req += 50) {
llen = min(len, 50);
len -= llen;
if (ptr+llen > firmware->data+firmware->size) {
printk(KERN_ERR
"Malformed isight firmware");
ret = -ENODEV;
goto out;
}
memcpy(buf, ptr, llen);
ptr += llen;
if (usb_control_msg
(dev, usb_sndctrlpipe(dev, 0), 0xa0, 0x40, req, 0,
buf, llen, 300) != llen) {
printk(KERN_ERR
"Failed to load isight firmware\n");
ret = -ENODEV;
goto out;
}
}
}
buf[0] = 0x00;
if (usb_control_msg
(dev, usb_sndctrlpipe(dev, 0), 0xa0, 0x40, 0xe600, 0, buf, 1,
300) != 1) {
printk(KERN_ERR "isight firmware loading completion failed\n");
ret = -ENODEV;
}
out:
kfree(buf);
release_firmware(firmware);
return ret;
}
Foam::sixDoFRigidBodyMotionSolver::sixDoFRigidBodyMotionSolver
(
const polyMesh& mesh,
const dictionary& dict
)
:
displacementMotionSolver(mesh, dict, typeName),
motion_
(
coeffDict(),
IOobject
(
"sixDoFRigidBodyMotionState",
mesh.time().timeName(),
"uniform",
mesh
).typeHeaderOk<IOdictionary>(true)
? IOdictionary
(
IOobject
(
"sixDoFRigidBodyMotionState",
mesh.time().timeName(),
"uniform",
mesh,
IOobject::READ_IF_PRESENT,
IOobject::NO_WRITE,
false
)
)
: coeffDict()
),
patches_(wordReList(coeffDict().lookup("patches"))),
patchSet_(mesh.boundaryMesh().patchSet(patches_)),
di_(readScalar(coeffDict().lookup("innerDistance"))),
do_(readScalar(coeffDict().lookup("outerDistance"))),
test_(coeffDict().lookupOrDefault<Switch>("test", false)),
rhoInf_(1.0),
rhoName_(coeffDict().lookupOrDefault<word>("rho", "rho")),
scale_
(
IOobject
(
"motionScale",
mesh.time().timeName(),
mesh,
IOobject::NO_READ,
IOobject::NO_WRITE,
false
),
pointMesh::New(mesh),
dimensionedScalar(dimless, 0)
),
curTimeIndex_(-1)
{
if (rhoName_ == "rhoInf")
{
rhoInf_ = readScalar(coeffDict().lookup("rhoInf"));
}
// Calculate scaling factor everywhere
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
{
const pointMesh& pMesh = pointMesh::New(mesh);
pointPatchDist pDist(pMesh, patchSet_, points0());
// Scaling: 1 up to di then linear down to 0 at do away from patches
scale_.primitiveFieldRef() =
min
(
max
(
(do_ - pDist.primitiveField())/(do_ - di_),
scalar(0)
),
scalar(1)
);
// Convert the scale function to a cosine
scale_.primitiveFieldRef() =
min
(
max
(
0.5
- 0.5
*cos(scale_.primitiveField()
*Foam::constant::mathematical::pi),
scalar(0)
),
scalar(1)
);
pointConstraints::New(pMesh).constrain(scale_);
scale_.write();
}
}
magma_int_t
magmablas_zhemv_mgpu( magma_int_t num_gpus, magma_int_t k, char uplo,
magma_int_t n, magma_int_t nb,
magmaDoubleComplex alpha,
magmaDoubleComplex **da, magma_int_t ldda, magma_int_t offset,
magmaDoubleComplex **dx, magma_int_t incx,
magmaDoubleComplex beta,
magmaDoubleComplex **dy, magma_int_t incy,
magmaDoubleComplex **dwork, magma_int_t ldwork,
magmaDoubleComplex *work, magmaDoubleComplex *w,
magma_queue_t stream[][10] )
{
#define dX(id, i) (dx[(id)]+incx*(i))
#define dY(id, i, j) (dy[(id)]+incy*(i)+n*(j))
magma_int_t id;
#ifdef MAGMABLAS_ZHEMV_MGPU
for( id=0; id<num_gpus; id++ ) {
magma_setdevice(id);
magmablasSetKernelStream(stream[id][0]);
trace_gpu_start( id, 0, "memset", "memset" );
cudaMemset( dwork[id], 0, ldwork*sizeof(magmaDoubleComplex) );
trace_gpu_end( id, 0 );
trace_gpu_start( id, 0, "symv", "symv" );
}
if( nb == 32 ) {
magmablas_zhemv_mgpu_32_offset( uplo, offset+n, alpha, da, ldda,
dx, incx,
beta,
dy, incy,
dwork, ldwork,
num_gpus, nb, offset,
stream );
} else {
magmablas_zhemv_mgpu_offset( uplo, offset+n, alpha, da, ldda,
dx, incx,
beta,
dy, incy,
dwork, ldwork,
num_gpus, nb, offset,
stream );
}
for( id=0; id<num_gpus; id++ ) {
magma_setdevice(id);
trace_gpu_end( id, 0 );
magmablasSetKernelStream(NULL);
}
//magma_setdevice(0);
//magmablasSetKernelStream(stream[0][0]);
//magma_zhemv('L', n, alpha, &da[0][offset+offset*ldda], ldda, &dx[0][offset], incx, beta, &dy[0][offset], incy );
//magmablasSetKernelStream(NULL);
/* send to CPU */
magma_setdevice(0);
trace_gpu_start( 0, 0, "comm", "comm" );
magma_zgetvector_async( n, dY(0, offset, 0), 1, w, 1, stream[0][0] );
trace_gpu_end( 0, 0 );
magmablasSetKernelStream(NULL);
for( id=1; id<num_gpus; id++ ) {
magma_setdevice(id);
trace_gpu_start( id, 0, "comm", "comm" );
magma_zgetvector_async( n, dY(id, offset, 0), 1, &work[id*n], 1, stream[id][0] );
trace_gpu_end( id, 0 );
magmablasSetKernelStream(NULL);
}
#else
magmaDoubleComplex c_one = MAGMA_Z_ONE;
char uplo_[2] = {uplo, 0};
magma_int_t i, ii, j, kk, ib, ib0, i_1, i_local, idw;
magma_int_t i_0=n;
magma_int_t loffset0 = nb*(offset/(nb*num_gpus));
magma_int_t loffset1 = offset%nb;
magma_int_t loffset;
//magma_zhemv(uplo, n, alpha, da, ldda, dx, incx, beta, dy, incy );
idw = (offset/nb)%num_gpus;
for( id=0; id<num_gpus; id++ ) {
magma_setdevice(id);
magmablasSetKernelStream(stream[id][0]);
cudaMemset( dy[id], 0, n*k*sizeof(magmaDoubleComplex) );
}
if( lapackf77_lsame( uplo_, "L" ) ) {
/* the first block */
if( loffset1 > 0 ) {
id = idw;
kk = 0;
magma_setdevice(id);
magmablasSetKernelStream(stream[id][kk]);
loffset = loffset0+loffset1;
ib0 = min(nb-loffset1,n);
// diagonal
magma_zhemv(MagmaLower, ib0, c_one, dA(id, 0, 0 ), ldda,
dX(id, 0), incx, c_one, dY(id, 0, kk), incy);
// off-diagonl
if( ib0 < n ) {
for( j=ib0; j<n; j+= i_0 ) {
i_1 = min(i_0, n-j);
magma_zgemv(MagmaNoTrans, i_1, ib0, c_one, dA(id, j, 0), ldda,
dX(id, 0), incx, c_one, dY(id, j, kk), incy);
magma_zgemv(MagmaConjTrans, i_1, ib0, c_one, dA(id, j, 0), ldda,
dX(id, j), incx, c_one, dY(id, 0, kk), incy);
}
}
}
else {
ib0 = 0;
}
/* diagonal */
for( i=ib0; i<n; i+=nb ) {
id = ((i+offset)/nb)%num_gpus;
kk = ((i+loffset1)/(nb*num_gpus))%k;
magma_setdevice(id);
magmablasSetKernelStream(stream[id][kk]);
i_local = (i+loffset1)/(nb*num_gpus);
ib = min(nb,n-i);
ii = nb*i_local;
loffset = loffset0;
if( id < idw ) loffset += nb;
magma_zhemv(MagmaLower, ib, c_one, dA(id, i, ii), ldda,
dX(id, i), incx, c_one, dY(id, i, kk), incy);
}
/* off-diagonal */
for( i=ib0; i<n-nb; i+=nb ) {
id = ((i+offset)/nb)%num_gpus;
kk = ((i+loffset1)/(nb*num_gpus))%k;
magma_setdevice(id);
magmablasSetKernelStream(stream[id][kk]);
i_local = ((i+loffset1)/nb)/num_gpus;
ii = nb*i_local;
ib = min(nb,n-i);
loffset = loffset0;
if( id < idw ) loffset += nb;
for( j=i+ib; j<n; j+= i_0 ) {
i_1 = min(i_0, n-j);
magma_zgemv(MagmaNoTrans, i_1, ib, c_one, dA(id, j, ii), ldda,
dX(id, i), incx, c_one, dY(id, j, kk), incy);
magma_zgemv(MagmaConjTrans, i_1, ib, c_one, dA(id, j, ii), ldda,
dX(id, j), incx, c_one, dY(id, i, kk), incy);
}
}
} else { /* upper-triangular storage */
loffset = 0;
/* diagonal */
for( i=0; i<n; i+=nb ) {
id = (i/nb)%num_gpus;
kk = (i/(nb*num_gpus))%k;
ib = min(nb,n-i);
magma_setdevice(id);
magmablasSetKernelStream(stream[id][kk]);
i_local = i/(nb*num_gpus);
ii = nb*i_local;
magma_zhemv(MagmaUpper, ib, c_one, dA(id, i, ii), ldda,
dX(id, i), incx, c_one, dY(id, i, kk), incy);
}
/* off-diagonal */
for( i=nb; i<n; i+=nb ) {
id = (i/nb)%num_gpus;
kk = (i/(nb*num_gpus))%k;
magma_setdevice(id);
magmablasSetKernelStream(stream[id][kk]);
i_local = (i/nb)/num_gpus;
ii = nb*i_local;
ib = min(nb,n-i);
magma_zgemv(MagmaNoTrans, i, ib, c_one, dA(id, 0, ii), ldda,
dX(id, i), incx, c_one, dY(id, 0, kk), incy);
magma_zgemv(MagmaConjTrans, i, ib, c_one, dA(id, 0, ii), ldda,
dX(id, 0), incx, c_one, dY(id, i, kk), incy);
}
}
/* send to CPU */
magma_setdevice(0);
magma_zgetvector_async( n, dY(0, 0, 0), 1, w, 1, stream[0][0] );
for( kk=1; kk<k; kk++ ) {
magma_zgetvector_async( n, dY(0, 0, kk), 1, &work[kk*n], 1, stream[0][kk] );
}
magmablasSetKernelStream(NULL);
for( id=1; id<num_gpus; id++ ) {
magma_setdevice(id);
for( kk=0; kk<k; kk++ ) {
magma_zgetvector_async( n, dY(id, 0, kk), 1, &work[id*k*n + kk*n], 1, stream[id][kk] );
}
magmablasSetKernelStream(NULL);
}
#endif
return 0;
}
static unsigned int tiny_spi_baud(struct spi_device *spi, unsigned int hz)
{
struct tiny_spi *hw = tiny_spi_to_hw(spi);
return min(DIV_ROUND_UP(hw->freq, hz * 2), (1U << hw->baudwidth)) - 1;
}
void CTCPConnection::Process (void)
{
if (m_bTimedOut)
{
m_nErrno = -1;
NEW_STATE (TCPStateClosed);
m_Event.Set ();
return;
}
switch (m_State)
{
case TCPStateClosed:
case TCPStateListen:
case TCPStateFinWait2:
case TCPStateTimeWait:
return;
case TCPStateSynSent:
case TCPStateSynReceived:
if (m_bSendSYN)
{
m_bSendSYN = FALSE;
if (m_State == TCPStateSynSent)
{
SendSegment (TCP_FLAG_SYN, m_nISS);
}
else
{
SendSegment (TCP_FLAG_SYN | TCP_FLAG_ACK, m_nISS, m_nRCV_NXT);
}
m_RTOCalculator.SegmentSent (m_nISS);
StartTimer (TCPTimerRetransmission, m_RTOCalculator.GetRTO ());
}
return;
case TCPStateEstablished:
case TCPStateFinWait1:
case TCPStateCloseWait:
case TCPStateClosing:
case TCPStateLastAck:
if ( m_RetransmissionQueue.IsEmpty ()
&& m_TxQueue.IsEmpty ()
&& m_bFINQueued)
{
SendSegment (TCP_FLAG_FIN | TCP_FLAG_ACK, m_nSND_NXT, m_nRCV_NXT);
m_RTOCalculator.SegmentSent (m_nSND_NXT);
m_nSND_NXT++;
NEW_STATE (m_StateAfterFIN);
m_bFINQueued = FALSE;
StartTimer (TCPTimerRetransmission, m_RTOCalculator.GetRTO ());
}
break;
}
assert (m_pTempBuffer != 0);
unsigned nLength;
while ( m_RetransmissionQueue.GetFreeSpace () >= FRAME_BUFFER_SIZE
&& (nLength = m_TxQueue.Dequeue (m_pTempBuffer)) > 0)
{
#ifdef TCP_DEBUG
CLogger::Get ()->Write (FromTCP, LogDebug, "Transfering %u bytes into RT buffer", nLength);
#endif
m_RetransmissionQueue.Write (m_pTempBuffer, nLength);
}
if (m_bRetransmit)
{
#ifdef TCP_DEBUG
CLogger::Get ()->Write (FromTCP, LogDebug, "Retransmission (nxt %u, una %u)", m_nSND_NXT-m_nISS, m_nSND_UNA-m_nISS);
#endif
m_bRetransmit = FALSE;
m_RetransmissionQueue.Reset ();
m_nSND_NXT = m_nSND_UNA;
}
u32 nBytesAvail;
u32 nWindowLeft;
while ( (nBytesAvail = m_RetransmissionQueue.GetBytesAvailable ()) > 0
&& (nWindowLeft = m_nSND_UNA+m_nSND_WND-m_nSND_NXT) > 0)
{
nLength = min (nBytesAvail, nWindowLeft);
nLength = min (nLength, m_nSND_MSS);
#ifdef TCP_DEBUG
CLogger::Get ()->Write (FromTCP, LogDebug, "Transfering %u bytes into TX buffer", nLength);
#endif
assert (nLength <= FRAME_BUFFER_SIZE);
m_RetransmissionQueue.Read (m_pTempBuffer, nLength);
unsigned nFlags = TCP_FLAG_ACK;
if ( m_RetransmissionQueue.IsEmpty ()
&& m_TxQueue.IsEmpty ())
{
nFlags |= TCP_FLAG_PUSH;
}
SendSegment (nFlags, m_nSND_NXT, m_nRCV_NXT, m_pTempBuffer, nLength);
m_RTOCalculator.SegmentSent (m_nSND_NXT, nLength);
m_nSND_NXT += nLength;
StartTimer (TCPTimerRetransmission, m_RTOCalculator.GetRTO ());
}
}
extern "C" double
magma_zlatrd_mgpu(magma_int_t num_gpus, char uplo,
magma_int_t n0, magma_int_t n, magma_int_t nb, magma_int_t nb0,
magmaDoubleComplex *a, magma_int_t lda,
double *e, magmaDoubleComplex *tau,
magmaDoubleComplex *w, magma_int_t ldw,
magmaDoubleComplex **da, magma_int_t ldda, magma_int_t offset,
magmaDoubleComplex **dw, magma_int_t lddw,
magmaDoubleComplex *dwork[MagmaMaxGPUs], magma_int_t ldwork,
magma_int_t k,
magmaDoubleComplex *dx[MagmaMaxGPUs], magmaDoubleComplex *dy[MagmaMaxGPUs],
magmaDoubleComplex *work,
magma_queue_t stream[][10],
double *times)
{
/* -- MAGMA (version 1.4.1) --
Univ. of Tennessee, Knoxville
Univ. of California, Berkeley
Univ. of Colorado, Denver
December 2013
Purpose
=======
ZLATRD reduces NB rows and columns of a complex Hermitian matrix A to
Hermitian tridiagonal form by an orthogonal similarity
transformation Q' * A * Q, and returns the matrices V and W which are
needed to apply the transformation to the unreduced part of A.
If UPLO = 'U', ZLATRD reduces the last NB rows and columns of a
matrix, of which the upper triangle is supplied;
if UPLO = 'L', ZLATRD reduces the first NB rows and columns of a
matrix, of which the lower triangle is supplied.
This is an auxiliary routine called by ZHETRD.
Arguments
=========
UPLO (input) CHARACTER*1
Specifies whether the upper or lower triangular part of the
Hermitian matrix A is stored:
= 'U': Upper triangular
= 'L': Lower triangular
N (input) INTEGER
The order of the matrix A.
NB (input) INTEGER
The number of rows and columns to be reduced.
A (input/output) COMPLEX_16 array, dimension (LDA,N)
On entry, the Hermitian matrix A. If UPLO = 'U', the leading
n-by-n upper triangular part of A contains the upper
triangular part of the matrix A, and the strictly lower
triangular part of A is not referenced. If UPLO = 'L', the
leading n-by-n lower triangular part of A contains the lower
triangular part of the matrix A, and the strictly upper
triangular part of A is not referenced.
On exit:
if UPLO = 'U', the last NB columns have been reduced to
tridiagonal form, with the diagonal elements overwriting
the diagonal elements of A; the elements above the diagonal
with the array TAU, represent the orthogonal matrix Q as a
product of elementary reflectors;
if UPLO = 'L', the first NB columns have been reduced to
tridiagonal form, with the diagonal elements overwriting
the diagonal elements of A; the elements below the diagonal
with the array TAU, represent the orthogonal matrix Q as a
product of elementary reflectors.
See Further Details.
LDA (input) INTEGER
The leading dimension of the array A. LDA >= (1,N).
E (output) COMPLEX_16 array, dimension (N-1)
If UPLO = 'U', E(n-nb:n-1) contains the superdiagonal
elements of the last NB columns of the reduced matrix;
if UPLO = 'L', E(1:nb) contains the subdiagonal elements of
the first NB columns of the reduced matrix.
TAU (output) COMPLEX_16 array, dimension (N-1)
The scalar factors of the elementary reflectors, stored in
TAU(n-nb:n-1) if UPLO = 'U', and in TAU(1:nb) if UPLO = 'L'.
See Further Details.
W (output) COMPLEX_16 array, dimension (LDW,NB)
The n-by-nb matrix W required to update the unreduced part
of A.
LDW (input) INTEGER
The leading dimension of the array W. LDW >= max(1,N).
Further Details
===============
If UPLO = 'U', the matrix Q is represented as a product of elementary
reflectors
Q = H(n) H(n-1) . . . H(n-nb+1).
Each H(i) has the form
H(i) = I - tau * v * v'
where tau is a complex scalar, and v is a complex vector with
v(i:n) = 0 and v(i-1) = 1; v(1:i-1) is stored on exit in A(1:i-1,i),
and tau in TAU(i-1).
If UPLO = 'L', the matrix Q is represented as a product of elementary
reflectors
Q = H(1) H(2) . . . H(nb).
Each H(i) has the form
H(i) = I - tau * v * v'
where tau is a complex scalar, and v is a complex vector with
v(1:i) = 0 and v(i+1) = 1; v(i+1:n) is stored on exit in A(i+1:n,i),
and tau in TAU(i).
The elements of the vectors v together form the n-by-nb matrix V
which is needed, with W, to apply the transformation to the unreduced
part of the matrix, using a Hermitian rank-2k update of the form:
A := A - V*W' - W*V'.
The contents of A on exit are illustrated by the following examples
with n = 5 and nb = 2:
if UPLO = 'U': if UPLO = 'L':
( a a a v4 v5 ) ( d )
( a a v4 v5 ) ( 1 d )
( a 1 v5 ) ( v1 1 a )
( d 1 ) ( v1 v2 a a )
( d ) ( v1 v2 a a a )
where d denotes a diagonal element of the reduced matrix, a denotes
an element of the original matrix that is unchanged, and vi denotes
an element of the vector defining H(i).
===================================================================== */
char uplo_[2] = {uplo, 0};
double mv_time = 0.0;
magma_int_t i;
#ifndef MAGMABLAS_ZHEMV_MGPU
magma_int_t loffset = nb0*((offset/nb0)/num_gpus);
#endif
magmaDoubleComplex c_neg_one = MAGMA_Z_NEG_ONE;
magmaDoubleComplex c_one = MAGMA_Z_ONE;
magmaDoubleComplex c_zero = MAGMA_Z_ZERO;
magmaDoubleComplex value = MAGMA_Z_ZERO;
magma_int_t id, idw, i_one = 1;
//magma_int_t kk;
magma_int_t ione = 1;
magma_int_t i_n, i_1, iw;
magmaDoubleComplex alpha;
magmaDoubleComplex *dx2[MagmaMaxGPUs];
magmaDoubleComplex *f = (magmaDoubleComplex *)malloc(n*sizeof(magmaDoubleComplex ));
if (n <= 0) {
return 0;
}
//#define PROFILE_SYMV
#ifdef PROFILE_SYMV
magma_event_t start, stop;
float etime;
magma_timestr_t cpu_start, cpu_end;
magma_setdevice(0);
magma_event_create( &start );
magma_event_create( &stop );
#endif
if (lapackf77_lsame(uplo_, "U")) {
/* Reduce last NB columns of upper triangle */
for (i = n-1; i >= n - nb ; --i) {
i_1 = i + 1;
i_n = n - i - 1;
iw = i - n + nb;
if (i < n-1) {
/* Update A(1:i,i) */
magmaDoubleComplex wii = *W(i, iw+1);
#if defined(PRECISION_z) || defined(PRECISION_c)
lapackf77_zlacgv(&i_one, &wii, &ldw);
#endif
wii = -wii;
blasf77_zaxpy(&i_1, &wii, A(0, i+1), &i_one, A(0, i), &ione);
wii = *A(i, i+1);
#if defined(PRECISION_z) || defined(PRECISION_c)
lapackf77_zlacgv(&i_one, &wii, &ldw);
#endif
wii = -wii;
blasf77_zaxpy(&i_1, &wii, W(0, iw+1), &i_one, A(0, i), &ione);
}
if (i > 0) {
/* Generate elementary reflector H(i) to annihilate A(1:i-2,i) */
alpha = *A(i-1, i);
lapackf77_zlarfg(&i, &alpha, A(0, i), &ione, &tau[i - 1]);
e[i-1] = MAGMA_Z_REAL( alpha );
*A(i-1,i) = MAGMA_Z_MAKE( 1, 0 );
for( id=0; id<num_gpus; id++ ) {
magma_setdevice(id);
dx2[id] = dW1(id, 0, iw);
magma_zsetvector_async( n, A(0,i), 1, dW1(id, 0, iw), 1, stream[id][0]);
#ifndef MAGMABLAS_ZHEMV_MGPU
magma_zsetvector_async( i, A(0,i), 1, dx[id], 1, stream[id][0] );
#endif
}
magmablas_zhemv_mgpu(num_gpus, k, 'U', i, nb0, c_one, da, ldda, 0,
dx2, ione, c_zero, dy, ione, dwork, ldwork,
work, W(0, iw), stream );
if (i < n-1) {
blasf77_zgemv(MagmaConjTransStr, &i, &i_n, &c_one, W(0, iw+1), &ldw,
A(0, i), &ione, &c_zero, W(i+1, iw), &ione);
}
/* overlap update */
if( i < n-1 && i-1 >= n - nb )
{
magma_int_t im1_1 = i_1 - 1;
magma_int_t im1 = i-1;
/* Update A(1:i,i) */
#if defined(PRECISION_z) || defined(PRECISION_c)
magma_int_t im1_n = i_n + 1;
lapackf77_zlacgv(&im1_n, W(im1, iw+1), &ldw);
#endif
blasf77_zgemv("No transpose", &im1_1, &i_n, &c_neg_one, A(0, i+1), &lda,
W(im1, iw+1), &ldw, &c_one, A(0, i-1), &ione);
#if defined(PRECISION_z) || defined(PRECISION_c)
lapackf77_zlacgv(&im1_n, W(im1, iw+1), &ldw);
lapackf77_zlacgv(&im1_n, A(im1, i +1), &lda);
#endif
blasf77_zgemv("No transpose", &im1_1, &i_n, &c_neg_one, W(0, iw+1), &ldw,
A(im1, i+1), &lda, &c_one, A(0, i-1), &ione);
#if defined(PRECISION_z) || defined(PRECISION_c)
lapackf77_zlacgv(&im1_n, A(im1, i+1), &lda);
#endif
}
// 3. Here is where we need it // TODO find the right place
magmablas_zhemv_sync(num_gpus, k, i, work, W(0, iw), stream );
if (i < n-1) {
blasf77_zgemv("No transpose", &i, &i_n, &c_neg_one, A(0, i+1), &lda,
W(i+1, iw), &ione, &c_one, W(0, iw), &ione);
blasf77_zgemv(MagmaConjTransStr, &i, &i_n, &c_one, A(0, i+1), &lda,
A(0, i), &ione, &c_zero, W(i+1, iw), &ione);
blasf77_zgemv("No transpose", &i, &i_n, &c_neg_one, W(0, iw+1), &ldw,
W(i+1, iw), &ione, &c_one, W(0, iw), &ione);
}
blasf77_zscal(&i, &tau[i - 1], W(0, iw), &ione);
#if defined(PRECISION_z) || defined(PRECISION_c)
cblas_zdotc_sub( i, W(0,iw), ione, A(0,i), ione, &value );
#else
value = cblas_zdotc( i, W(0,iw), ione, A(0,i), ione );
#endif
alpha = tau[i - 1] * -.5f * value;
blasf77_zaxpy(&i, &alpha, A(0, i), &ione, W(0, iw), &ione);
for( id=0; id<num_gpus; id++ ) {
magma_setdevice(id);
if( k > 1 ) {
magma_zsetvector_async( n, W(0,iw), 1, dW(id, 0, iw), 1, stream[id][1] );
} else {
magma_zsetvector_async( n, W(0,iw), 1, dW(id, 0, iw), 1, stream[id][0] );
}
}
}
}
} else {
/* Reduce first NB columns of lower triangle */
for (i = 0; i < nb; ++i) {
/* Update A(i:n,i) */
i_n = n - i;
idw = ((offset+i)/nb)%num_gpus;
if( i > 0 ) {
trace_cpu_start( 0, "gemv", "gemv" );
magmaDoubleComplex wii = *W(i, i-1);
#if defined(PRECISION_z) || defined(PRECISION_c)
lapackf77_zlacgv(&i_one, &wii, &ldw);
#endif
wii = -wii;
blasf77_zaxpy( &i_n, &wii, A(i, i-1), &ione, A(i, i), &ione);
wii = *A(i, i-1);
#if defined(PRECISION_z) || defined(PRECISION_c)
lapackf77_zlacgv(&i_one, &wii, &lda);
#endif
wii = -wii;
blasf77_zaxpy( &i_n, &wii, W(i, i-1), &ione, A(i, i), &ione);
}
if (i < n-1) {
/* Generate elementary reflector H(i) to annihilate A(i+2:n,i) */
i_n = n - i - 1;
trace_cpu_start( 0, "larfg", "larfg" );
alpha = *A(i+1, i);
#ifdef PROFILE_SYMV
cpu_start = get_current_time();
#endif
lapackf77_zlarfg(&i_n, &alpha, A(min(i+2,n-1), i), &ione, &tau[i]);
#ifdef PROFILE_SYMV
cpu_end = get_current_time();
times[0] += GetTimerValue(cpu_start,cpu_end)/1000.0;
#endif
e[i] = MAGMA_Z_REAL( alpha );
*A(i+1,i) = MAGMA_Z_MAKE( 1, 0 );
trace_cpu_end( 0 );
/* Compute W(i+1:n,i) */
// 1. Send the block reflector A(i+1:n,i) to the GPU
//trace_gpu_start( idw, 0, "comm", "comm1" );
#ifndef MAGMABLAS_ZHEMV_MGPU
magma_setdevice(idw);
magma_zsetvector( i_n, A(i+1,i), 1, dA(idw, i+1, i), 1 );
#endif
for( id=0; id<num_gpus; id++ ) {
magma_setdevice(id);
trace_gpu_start( id, 0, "comm", "comm" );
#ifdef MAGMABLAS_ZHEMV_MGPU
dx2[id] = dW1(id, 0, i)-offset;
#else
dx2[id] = dx[id];
magma_zsetvector( i_n, A(i+1,i), 1, dx[id], 1 );
#endif
magma_zsetvector_async( n, A(0,i), 1, dW1(id, 0, i), 1, stream[id][0] );
trace_gpu_end( id, 0 );
}
/* mat-vec on multiple GPUs */
#ifdef PROFILE_SYMV
magma_setdevice(0);
magma_event_record(start, stream[0][0]);
#endif
magmablas_zhemv_mgpu(num_gpus, k, 'L', i_n, nb0, c_one, da, ldda, offset+i+1,
dx2, ione, c_zero, dy, ione, dwork, ldwork,
work, W(i+1,i), stream );
#ifdef PROFILE_SYMV
magma_setdevice(0);
magma_event_record(stop, stream[0][0]);
#endif
trace_cpu_start( 0, "gemv", "gemv" );
blasf77_zgemv(MagmaConjTransStr, &i_n, &i, &c_one, W(i+1, 0), &ldw,
A(i+1, i), &ione, &c_zero, W(0, i), &ione);
blasf77_zgemv("No transpose", &i_n, &i, &c_neg_one, A(i+1, 0), &lda,
W(0, i), &ione, &c_zero, f, &ione);
blasf77_zgemv(MagmaConjTransStr, &i_n, &i, &c_one, A(i+1, 0), &lda,
A(i+1, i), &ione, &c_zero, W(0, i), &ione);
trace_cpu_end( 0 );
/* overlap update */
if( i > 0 && i+1 < n )
{
magma_int_t ip1 = i+1;
trace_cpu_start( 0, "gemv", "gemv" );
#if defined(PRECISION_z) || defined(PRECISION_c)
lapackf77_zlacgv(&i, W(ip1, 0), &ldw);
#endif
blasf77_zgemv("No transpose", &i_n, &i, &c_neg_one, A(ip1, 0), &lda,
W(ip1, 0), &ldw, &c_one, A(ip1, ip1), &ione);
#if defined(PRECISION_z) || defined(PRECISION_c)
lapackf77_zlacgv(&i, W(ip1, 0), &ldw);
lapackf77_zlacgv(&i, A(ip1 ,0), &lda);
#endif
blasf77_zgemv("No transpose", &i_n, &i, &c_neg_one, W(ip1, 0), &ldw,
A(ip1, 0), &lda, &c_one, A(ip1, ip1), &ione);
#if defined(PRECISION_z) || defined(PRECISION_c)
lapackf77_zlacgv(&i, A(ip1, 0), &lda);
#endif
trace_cpu_end( 0 );
}
/* synchronize */
magmablas_zhemv_sync(num_gpus, k, i_n, work, W(i+1,i), stream );
#ifdef PROFILE_SYMV
cudaEventElapsedTime(&etime, start, stop);
mv_time += (etime/1000.0);
times[1+(i_n/(n0/10))] += (etime/1000.0);
#endif
trace_cpu_start( 0, "axpy", "axpy" );
if (i!=0)
blasf77_zaxpy(&i_n, &c_one, f, &ione, W(i+1, i), &ione);
blasf77_zgemv("No transpose", &i_n, &i, &c_neg_one, W(i+1, 0), &ldw,
W(0, i), &ione, &c_one, W(i+1, i), &ione);
blasf77_zscal(&i_n, &tau[i], W(i+1,i), &ione);
#if defined(PRECISION_z) || defined(PRECISION_c)
cblas_zdotc_sub( i_n, W(i+1,i), ione, A(i+1,i), ione, &value );
#else
value = cblas_zdotc( i_n, W(i+1,i), ione, A(i+1,i), ione );
#endif
alpha = tau[i]* -.5f * value;
blasf77_zaxpy(&i_n, &alpha, A(i+1, i), &ione, W(i+1,i), &ione);
trace_cpu_end( 0 );
for( id=0; id<num_gpus; id++ ) {
magma_setdevice(id);
if( k > 1 ) {
magma_zsetvector_async( n, W(0,i), 1, dW(id, 0, i), 1, stream[id][1] );
} else {
magma_zsetvector_async( n, W(0,i), 1, dW(id, 0, i), 1, stream[id][0] );
}
}
}
}
}
#ifdef PROFILE_SYMV
magma_setdevice(0);
magma_event_destory( start );
magma_event_destory( stop );
#endif
for( id=0; id<num_gpus; id++ ) {
magma_setdevice(id);
if( k > 1) magma_queue_sync(stream[id][1]);
}
free(f);
return mv_time;
} /* zlatrd_ */
static void sas_scsi_task_done(struct sas_task *task)
{
struct task_status_struct *ts = &task->task_status;
struct scsi_cmnd *sc = task->uldd_task;
int hs = 0, stat = 0;
if (unlikely(task->task_state_flags & SAS_TASK_STATE_ABORTED)) {
/* Aborted tasks will be completed by the error handler */
SAS_DPRINTK("task done but aborted\n");
return;
}
if (unlikely(!sc)) {
SAS_DPRINTK("task_done called with non existing SCSI cmnd!\n");
list_del_init(&task->list);
sas_free_task(task);
return;
}
if (ts->resp == SAS_TASK_UNDELIVERED) {
/* transport error */
hs = DID_NO_CONNECT;
} else { /* ts->resp == SAS_TASK_COMPLETE */
/* task delivered, what happened afterwards? */
switch (ts->stat) {
case SAS_DEV_NO_RESPONSE:
case SAS_INTERRUPTED:
case SAS_PHY_DOWN:
case SAS_NAK_R_ERR:
case SAS_OPEN_TO:
hs = DID_NO_CONNECT;
break;
case SAS_DATA_UNDERRUN:
scsi_set_resid(sc, ts->residual);
if (scsi_bufflen(sc) - scsi_get_resid(sc) < sc->underflow)
hs = DID_ERROR;
break;
case SAS_DATA_OVERRUN:
hs = DID_ERROR;
break;
case SAS_QUEUE_FULL:
hs = DID_SOFT_ERROR; /* retry */
break;
case SAS_DEVICE_UNKNOWN:
hs = DID_BAD_TARGET;
break;
case SAS_SG_ERR:
hs = DID_PARITY;
break;
case SAS_OPEN_REJECT:
if (ts->open_rej_reason == SAS_OREJ_RSVD_RETRY)
hs = DID_SOFT_ERROR; /* retry */
else
hs = DID_ERROR;
break;
case SAS_PROTO_RESPONSE:
SAS_DPRINTK("LLDD:%s sent SAS_PROTO_RESP for an SSP "
"task; please report this\n",
task->dev->port->ha->sas_ha_name);
break;
case SAS_ABORTED_TASK:
hs = DID_ABORT;
break;
case SAM_STAT_CHECK_CONDITION:
memcpy(sc->sense_buffer, ts->buf,
min(SCSI_SENSE_BUFFERSIZE, ts->buf_valid_size));
stat = SAM_STAT_CHECK_CONDITION;
break;
default:
stat = ts->stat;
break;
}
}
ASSIGN_SAS_TASK(sc, NULL);
sc->result = (hs << 16) | stat;
list_del_init(&task->list);
sas_free_task(task);
sc->scsi_done(sc);
}
/**
Purpose
-------
DGETRF_NOPIV computes an LU factorization of a general M-by-N
matrix A without pivoting.
The factorization has the form
A = L * U
where L is lower triangular with unit diagonal elements (lower
trapezoidal if m > n), and U is upper triangular (upper
trapezoidal if m < n).
This is the right-looking Level 3 BLAS version of the algorithm.
Arguments
---------
@param[in]
m INTEGER
The number of rows of the matrix A. M >= 0.
@param[in]
n INTEGER
The number of columns of the matrix A. N >= 0.
@param[in,out]
A DOUBLE_PRECISION array, dimension (LDA,N)
On entry, the M-by-N matrix to be factored.
On exit, the factors L and U from the factorization
A = P*L*U; the unit diagonal elements of L are not stored.
@param[in]
lda INTEGER
The leading dimension of the array A. LDA >= max(1,M).
@param[out]
info INTEGER
- = 0: successful exit
- < 0: if INFO = -i, the i-th argument had an illegal value
- > 0: if INFO = i, U(i,i) is exactly zero. The factorization
has been completed, but the factor U is exactly
singular, and division by zero will occur if it is used
to solve a system of equations.
@ingroup magma_dgesv_comp
********************************************************************/
extern "C" magma_int_t
magma_dgetrf_nopiv(
magma_int_t m, magma_int_t n,
double *A, magma_int_t lda,
magma_int_t *info)
{
#define A(i_,j_) (A + (i_) + (j_)*lda)
double c_one = MAGMA_D_ONE;
double c_neg_one = MAGMA_D_NEG_ONE;
magma_int_t min_mn, i__3, i__4;
magma_int_t j, jb, nb, iinfo;
A -= 1 + lda;
/* Function Body */
*info = 0;
if (m < 0) {
*info = -1;
} else if (n < 0) {
*info = -2;
} else if (lda < max(1,m)) {
*info = -4;
}
if (*info != 0) {
magma_xerbla( __func__, -(*info) );
return *info;
}
/* Quick return if possible */
if (m == 0 || n == 0) {
return *info;
}
/* Determine the block size for this environment. */
nb = 128;
min_mn = min(m,n);
if (nb <= 1 || nb >= min_mn) {
/* Use unblocked code. */
magma_dgetf2_nopiv( m, n, A(1,1), lda, info );
}
else {
/* Use blocked code. */
for (j = 1; j <= min_mn; j += nb) {
jb = min( min_mn - j + 1, nb );
/* Factor diagonal and subdiagonal blocks and test for exact
singularity. */
i__3 = m - j + 1;
//magma_dgetf2_nopiv( i__3, jb, A(j,j), lda, &iinfo );
i__3 -= jb;
magma_dgetf2_nopiv( jb, jb, A(j,j), lda, &iinfo );
blasf77_dtrsm( "R", "U", "N", "N", &i__3, &jb, &c_one,
A(j,j), &lda,
A(j+jb,j), &lda );
/* Adjust INFO */
if (*info == 0 && iinfo > 0)
*info = iinfo + j - 1;
if (j + jb <= n) {
/* Compute block row of U. */
i__3 = n - j - jb + 1;
blasf77_dtrsm( "Left", "Lower", "No transpose", "Unit",
&jb, &i__3, &c_one,
A(j,j), &lda,
A(j,j+jb), &lda );
if (j + jb <= m) {
/* Update trailing submatrix. */
i__3 = m - j - jb + 1;
i__4 = n - j - jb + 1;
blasf77_dgemm( "No transpose", "No transpose",
&i__3, &i__4, &jb, &c_neg_one,
A(j+jb,j), &lda,
A(j,j+jb), &lda, &c_one,
A(j+jb,j+jb), &lda );
}
}
}
}
return *info;
} /* magma_dgetrf_nopiv */
void ClassUnit::Modify(bool tag) {
//0表示人数不够，需要从当前包含的模式当中抽取一定数量的学生来平衡这个班级的人数
//1表示人数过多，需要把当前的学生数量放一部分到其他的班级当中
//对于每个模式而言，都有一个不在当前的班级的表，只有当该班级在这些模式当中存在可以替换的班级列表才能将这个模式选中
cout << unit_id_ << " " << tag << " " << stu_num_ << endl;
//int neednum = tag ? (stu_num_ - stu_upper_) : (stu_lower_ - stu_num_);
int neednum = stu_num_ - course_.stu_upper_;
vector<Pattern* > avlpatque;
map<Pattern*, int> avlinpat;
map<Pattern*, bool>::iterator it = patterns_.begin();
for (; it != patterns_.end(); it++) {
if (it->first->not_in_table_.find(this) != it->first->not_in_table_.end()) {
avlpatque.push_back(it->first);
}
}
//根据具体的是人数不够还是超过来进行分类讨论
//1.选出可以供认出的人的去处
int temp, avlstusum = 0;
for (int i = 0; i < avlpatque.size(); i++) {
temp = avlpatque[i]->GetAvlStuNum(this, tag);
//如果人数过多，想要移走，也只能把属于该pat的学生都移走
if (tag)temp = min(temp, patterns_stus_[avlpatque[i]]);
if (temp) {
avlinpat[avlpatque[i]] = temp;
avlstusum += temp;
}
}
cout << "end of get avl stu num" << endl;
cout << avlstusum << " " << neednum << endl;
//2.选出哪些学生需要被扔出去
//如果供应人数多那么就随机选择需求数量，如果不够就全部都用来满足需求
/*if (tag)DecreaseStuNum(neednum, avlstusum, avlstunum, avlnumpat);
else IncreaseStuNum(neednum, avlstusum, avlstunum, avlnumpat);*/
int i = 0;
vector<int> needused = vector<int>(avlpatque.size(), 0);
map<Pattern*, int>::iterator ita = avlinpat.begin();
map<Pattern*, int> patused;
if (tag) {
if (avlstusum > neednum) {
//要先选中哪些学生需要被换出去
while (neednum) {
if (ita->second) {
temp = rand() % (ita->second + 1);
if (temp > neednum)temp = neednum;
ita->second -= temp;
if (patused.find(ita->first) == patused.end())patused[ita->first] = 0;
patused[ita->first] += temp;
neednum -= temp;
}
ita++;
if (ita == avlinpat.end())ita = avlinpat.begin();
}
}
else {
for (; ita != avlinpat.end(); ita++) {
patused[ita->first] = ita->second;
}
}
GetSelectedStus(patused);
}
else {
//依然用selected来装每个pat能存放的最大的人员数量
map<Pattern*, bool>::iterator itp = patterns_.begin();
while (itp != patterns_.end()) {
selected_stus_[itp->first].insert(itp->first->GetMxStuNum(this));
}
}
cout << "end of get needused" << endl;
//3.将扔出去的人进行数据交换
//对每个模式进行人员的分配
map<Pattern*, int>::iterator itp = patused.begin();
for (; itp != patused.end(); itp++) {
if(itp->second)itp->first->ModifyStuNum(tag, this, itp->second);
}
cout << "end of modify stu num" << endl;
//如果人数不够就把人数加进来
if (!tag)AddStu2Path(patused);
//如果人数超过还要把当前的人数搬出去
if (tag) {
map<Pattern*, map<int, int> >::iterator its = selected_stus_.begin();
while (its != selected_stus_.end()) {
map<int, int>::iterator itm = its->second.begin();
//int psum = 0;
while (itm != its->second.end()) {
//psum += itm->second;
its->first->DecreaseStuNum(itm->first, itm->second);
//pat_path_stus_num_[its->first][itm->first] -= itm->second;
itm++;
}
//patterns_stus_[its->first] -= psum;
its++;
}
}
cout << "end of motify stu num" << endl;
}
//---------------------------------------------------------------
// START FUNC DECL
int
percentiles(
char *src_tbl,
char *src_fld,
char *dst_tbl,
char *str_n_out
)
// STOP FUNC DECL
{
int status = 0;
char *src_fld_X = NULL; size_t src_fld_nX = 0;
TBL_REC_TYPE src_tbl_rec; int src_tbl_id = -1; long long src_nR = -1;
TBL_REC_TYPE dst_tbl_rec; int dst_tbl_id = -1; long long dst_nR = -1;
FLD_REC_TYPE src_fld_rec; int src_fld_id = -1;
FLD_REC_TYPE nn_src_fld_rec; int nn_src_fld_id = -1;
FLD_REC_TYPE min_rec; int min_id = -1;
FLD_REC_TYPE max_rec; int max_id = -1;
FLD_REC_TYPE avg_rec; int avg_id = -1;
FLD_REC_TYPE cnt_rec; int cnt_id = -1;
char *minX = NULL; size_t min_nX = 0; int min_ddir_id = -1, min_fileno = 0;
char *maxX = NULL; size_t max_nX = 0; int max_ddir_id = -1, max_fileno = 0;
char *cntX = NULL; size_t cnt_nX = 0; int cnt_ddir_id = -1, cnt_fileno = 0;
char *avgX = NULL; size_t avg_nX = 0; int avg_ddir_id = -1, avg_fileno = 0;
int fldsz = 0; long long filesz = 0;
int bin_size;
//----------------------------------------------------------------
if ( ( src_tbl == NULL ) || ( *src_tbl == '\0' ) ) { go_BYE(-1); }
if ( ( src_fld == NULL ) || ( *src_fld == '\0' ) ) { go_BYE(-1); }
if ( ( dst_tbl == NULL ) || ( *dst_tbl == '\0' ) ) { go_BYE(-1); }
if ( strcmp(src_tbl, dst_tbl) == 0 ) { go_BYE(-1); }
//--------------------------------------------------------
status = stoI8(str_n_out, &dst_nR); cBYE(status);
if ( ( dst_nR >= MAX_BINS_FOR_PERCENTILE ) || ( dst_nR <= 1 ) ) {
fprintf(stderr, "num_bins = %s not in valid range [2, %d] \n",
str_n_out, MAX_BINS_FOR_PERCENTILE);
go_BYE(-1);
}
//--------------------------------------------------------
status = is_tbl(src_tbl, &src_tbl_id, &src_tbl_rec); cBYE(status);
if (src_tbl_id < 0 ) { go_BYE(-1); }
src_nR = src_tbl_rec.nR;
if ( dst_nR >= src_nR ) {
fprintf(stderr, "Source Table [%s] has insufficient rows [%lld]\n",
src_tbl, src_nR);
go_BYE(-1);
}
status = is_fld(NULL, src_tbl_id, src_fld, &src_fld_id, &src_fld_rec,
&nn_src_fld_id, &nn_src_fld_rec);
if ( src_fld_id < 0 ) { go_BYE(-1); }
switch ( src_fld_rec.fldtype ) {
case I4 : case I8 : case F4 : case F8 : break;
default : go_BYE(-1); break;
}
if ( nn_src_fld_id >= 0 ) { go_BYE(-1); }
/* Make sure src_fld field is sorted ascending */
char srttype[32]; zero_string(srttype, 32);
status = f_to_s(src_tbl, src_fld, "is_sorted", srttype, 32); cBYE(status);
if ( strcmp(srttype, "ascending") != 0 ) {
fprintf(stderr, "Field [%s] in Table [%s] not sorted ascending\n",
src_fld, src_tbl);
go_BYE(-1);
}
//--------------------------------------------------------
status = get_data(src_fld_rec, &src_fld_X, &src_fld_nX, 0); cBYE(status);
//--------------------------------------------------------
// Create 4 files for the 4 fields to be created
// min, max, cnt, avg
int n1, n2;
status = get_fld_sz(I8, &n1); cBYE(status);
status = get_fld_sz(F8, &n2); cBYE(status);
if ( n1 != n2 ) { go_BYE(-1); }
status = get_fld_sz(I8, &fldsz); cBYE(status);
filesz = fldsz * dst_nR;
status = mk_temp_file(filesz, &min_ddir_id, &min_fileno); cBYE(status);
status = mk_temp_file(filesz, &max_ddir_id, &max_fileno); cBYE(status);
status = mk_temp_file(filesz, &cnt_ddir_id, &cnt_fileno); cBYE(status);
status = get_fld_sz(F8, &fldsz); cBYE(status);
filesz = fldsz * dst_nR;
status = mk_temp_file(filesz, &avg_ddir_id, &avg_fileno); cBYE(status);
status = q_mmap(min_ddir_id, min_fileno, &minX, &min_nX, 1); cBYE(status);
status = q_mmap(max_ddir_id, max_fileno, &maxX, &max_nX, 1); cBYE(status);
status = q_mmap(cnt_ddir_id, cnt_fileno, &cntX, &cnt_nX, 1); cBYE(status);
status = q_mmap(avg_ddir_id, avg_fileno, &avgX, &avg_nX, 1); cBYE(status);
//------------------------------------------------------
/* Delete table if it exists. Create brand new table */
status = is_tbl(dst_tbl, &dst_tbl_id , &dst_tbl_rec); cBYE(status);
if ( dst_tbl_id >= 0 ) {
status = del_tbl(NULL, dst_tbl_id); cBYE(status);
}
zero_tbl_rec(&dst_tbl_rec);
status = add_tbl(dst_tbl, str_n_out, &dst_tbl_id, &dst_tbl_rec); cBYE(status);
//-----------------------------------------------------------
// START: Here starts the processing
/* b is the bin number */
long long *minI8 = (long long *)minX;
long long *maxI8 = (long long *)maxX;
double *minF8 = (double *)minX;
double *maxF8 = (double *)maxX;
long long *cntI8 = (long long *)cntX;
double *avgF8 = (double *)avgX;
bin_size = src_nR / dst_nR;
cilkfor ( int b = 0; b < dst_nR; b++ ) {
long long lb = b * bin_size;
long long ub = lb + bin_size;
if ( b == ( dst_nR -1 ) ) { ub = src_nR; }
int *valsI4 = (int *) src_fld_X; valsI4 += lb;
float *valsF4 = (float *) src_fld_X; valsF4 += lb;
long long *valsI8 = (long long *) src_fld_X; valsI8 += lb;
double *valsF8 = (double *) src_fld_X; valsF8 += lb;
//-----------------------------------------------
double lvalF8 = 0; long long lvalI8 = 0;
double lsumF8 = 0; long long lsumI8 = 0;
long long lminI8 = LLONG_MAX, lmaxI8 = LLONG_MIN;
double lminF8 = DBL_MIN, lmaxF8 = DBL_MIN;
//-----------------------------------------------
for ( long long i = 0; i < (ub - lb); i++ ) {
switch ( src_fld_rec.fldtype ) {
case I4 : lvalI8 = valsI4[i]; break;
case I8 : lvalI8 = valsI8[i]; break;
case F4 : lvalF8 = valsI4[i]; break;
case F8 : lvalF8 = valsI8[i]; break;
default : status = -1; continue; break;
}
switch ( src_fld_rec.fldtype ) {
case I4 : case I8 :
lminI8 = min(lminI8 , lvalI8);
lmaxI8 = max(lmaxI8 , lvalI8);
lsumI8 += lvalI8;
break;
case F4 : case F8 :
lminF8 = min(lminF8 , lvalF8);
lmaxF8 = max(lmaxF8 , lvalF8);
lsumF8 += lvalF8;
break;
default : status = -1; continue; break;
}
}
// Write out the values
cntI8[b] = (ub - lb);
double n = ub - lb;
switch ( src_fld_rec.fldtype ) {
case I4 : case I8 :
minI8[b] = lminI8;
maxI8[b] = lmaxI8;
avgF8[b] = (double)lsumI8 / n;
break;
case F4 : case F8 :
minF8[b] = lminF8;
maxF8[b] = lmaxF8;
avgF8[b] = (double)lsumF8 / n;
break;
default : status = -1; continue; break;
}
}
//-----------------------------------------------------------
status = add_tbl(dst_tbl, str_n_out, &dst_tbl_id, &dst_tbl_rec); cBYE(status);
// Add output field(s) to meta data
zero_fld_rec(&min_rec); zero_fld_rec(&max_rec);
switch ( src_fld_rec.fldtype ) {
case I4 : case I8 : min_rec.fldtype = I8; max_rec.fldtype = I8; break;
case F4 : case F8 : min_rec.fldtype = F8; max_rec.fldtype = F8; break;
default : go_BYE(-1); break;
}
status = add_fld(dst_tbl_id, "min", min_ddir_id, min_fileno,
&min_id, &min_rec); cBYE(status);
status = add_fld(dst_tbl_id, "max", max_ddir_id, max_fileno,
&max_id, &max_rec); cBYE(status);
zero_fld_rec(&avg_rec); avg_rec.fldtype = F8;
status = add_fld(dst_tbl_id, "avg", avg_ddir_id, avg_fileno,
&avg_id, &avg_rec); cBYE(status);
zero_fld_rec(&cnt_rec); cnt_rec.fldtype = I8;
status = add_fld(dst_tbl_id, "cnt", cnt_ddir_id, cnt_fileno,
&cnt_id, &cnt_rec); cBYE(status);
//-----------------------------------------------------------
BYE:
rs_munmap(src_fld_X, src_fld_nX);
rs_munmap(minX, min_nX);
rs_munmap(maxX, max_nX);
rs_munmap(cntX, cnt_nX);
rs_munmap(avgX, avg_nX);
return(status);
}
/**
Purpose
-------
DGELS solves the overdetermined, least squares problem
min || A*X - C ||
using the QR factorization A.
The underdetermined problem (m < n) is not currently handled.
Arguments
---------
@param[in]
trans magma_trans_t
- = MagmaNoTrans: the linear system involves A.
Only TRANS=MagmaNoTrans is currently handled.
@param[in]
m INTEGER
The number of rows of the matrix A. M >= 0.
@param[in]
n INTEGER
The number of columns of the matrix A. M >= N >= 0.
@param[in]
nrhs INTEGER
The number of columns of the matrix C. NRHS >= 0.
@param[in,out]
A DOUBLE PRECISION array, dimension (LDA,N)
On entry, the M-by-N matrix A.
On exit, A is overwritten by details of its QR
factorization as returned by DGEQRF.
@param[in]
lda INTEGER
The leading dimension of the array A, LDA >= M.
@param[in,out]
B DOUBLE PRECISION array, dimension (LDDB,NRHS)
On entry, the M-by-NRHS matrix C.
On exit, the N-by-NRHS solution matrix X.
@param[in]
ldb INTEGER
The leading dimension of the array B. LDB >= M.
@param[out]
hwork (workspace) DOUBLE PRECISION array, dimension MAX(1,LWORK).
On exit, if INFO = 0, HWORK[0] returns the optimal LWORK.
@param[in]
lwork INTEGER
The dimension of the array HWORK,
LWORK >= max( N*NB, 2*NB*NB ),
where NB is the blocksize given by magma_get_dgeqrf_nb( M, N ).
\n
If LWORK = -1, then a workspace query is assumed; the routine
only calculates the optimal size of the HWORK array, returns
this value as the first entry of the HWORK array.
@param[out]
info INTEGER
- = 0: successful exit
- < 0: if INFO = -i, the i-th argument had an illegal value
@ingroup magma_dgels_driver
********************************************************************/
extern "C" magma_int_t
magma_dgels(
magma_trans_t trans, magma_int_t m, magma_int_t n, magma_int_t nrhs,
magmaDouble_ptr A, magma_int_t lda,
magmaDouble_ptr B, magma_int_t ldb,
double *hwork, magma_int_t lwork,
magma_int_t *info)
{
/* Constants */
const double c_one = MAGMA_D_ONE;
/* Local variables */
double *tau;
magma_int_t min_mn;
magma_int_t nb = magma_get_dgeqrf_nb( m, n );
magma_int_t lwkopt = max( n*nb, 2*nb*nb ); // (m - n + nb)*(nrhs + nb) + nrhs*nb;
bool lquery = (lwork == -1);
hwork[0] = magma_dmake_lwork( lwkopt );
*info = 0;
/* For now, N is the only case working */
if ( trans != MagmaNoTrans )
*info = -1;
else if (m < 0)
*info = -2;
else if (n < 0 || m < n) /* LQ is not handle for now */
*info = -3;
else if (nrhs < 0)
*info = -4;
else if (lda < max(1,m))
*info = -6;
else if (ldb < max(1,m))
*info = -8;
else if (lwork < lwkopt && ! lquery)
*info = -10;
if (*info != 0) {
magma_xerbla( __func__, -(*info) );
return *info;
}
else if (lquery)
return *info;
min_mn = min(m,n);
if (min_mn == 0) {
hwork[0] = c_one;
return *info;
}
magma_dmalloc_cpu( &tau, min_mn );
if ( tau == NULL ) {
*info = MAGMA_ERR_HOST_ALLOC;
return *info;
}
magma_dgeqrf( m, n, A, lda, tau, hwork, lwork, info );
if ( *info == 0 ) {
// B := Q' * B
lapackf77_dormqr( MagmaLeftStr, MagmaTransStr, &m, &nrhs, &n,
A, &lda, tau, B, &ldb, hwork, &lwork, info );
// Solve R*X = B(1:n,:)
blasf77_dtrsm( MagmaLeftStr, MagmaUpperStr, MagmaNoTransStr, MagmaNonUnitStr,
&n, &nrhs, &c_one, A, &lda, B, &ldb );
}
magma_free_cpu( tau );
return *info;
}
static struct sk_buff *fq_dequeue(struct Qdisc *sch)
{
struct fq_sched_data *q = qdisc_priv(sch);
u64 now = ktime_get_ns();
struct fq_flow_head *head;
struct sk_buff *skb;
struct fq_flow *f;
u32 rate, plen;
skb = fq_dequeue_head(sch, &q->internal);
if (skb)
goto out;
fq_check_throttled(q, now);
begin:
head = &q->new_flows;
if (!head->first) {
head = &q->old_flows;
if (!head->first) {
if (q->time_next_delayed_flow != ~0ULL)
qdisc_watchdog_schedule_ns(&q->watchdog,
q->time_next_delayed_flow);
return NULL;
}
}
f = head->first;
if (f->credit <= 0) {
f->credit += q->quantum;
head->first = f->next;
fq_flow_add_tail(&q->old_flows, f);
goto begin;
}
skb = f->head;
if (unlikely(skb && now < f->time_next_packet &&
!skb_is_tcp_pure_ack(skb))) {
head->first = f->next;
fq_flow_set_throttled(q, f);
goto begin;
}
skb = fq_dequeue_head(sch, f);
if (!skb) {
head->first = f->next;
/* force a pass through old_flows to prevent starvation */
if ((head == &q->new_flows) && q->old_flows.first) {
fq_flow_add_tail(&q->old_flows, f);
} else {
fq_flow_set_detached(f);
q->inactive_flows++;
}
goto begin;
}
prefetch(&skb->end);
f->credit -= qdisc_pkt_len(skb);
if (!q->rate_enable)
goto out;
/* Do not pace locally generated ack packets */
if (skb_is_tcp_pure_ack(skb))
goto out;
rate = q->flow_max_rate;
if (skb->sk)
rate = min(skb->sk->sk_pacing_rate, rate);
if (rate <= q->low_rate_threshold) {
f->credit = 0;
plen = qdisc_pkt_len(skb);
} else {
plen = max(qdisc_pkt_len(skb), q->quantum);
if (f->credit > 0)
goto out;
}
if (rate != ~0U) {
u64 len = (u64)plen * NSEC_PER_SEC;
if (likely(rate))
do_div(len, rate);
/* Since socket rate can change later,
* clamp the delay to 1 second.
* Really, providers of too big packets should be fixed !
*/
if (unlikely(len > NSEC_PER_SEC)) {
len = NSEC_PER_SEC;
q->stat_pkts_too_long++;
}
/* Account for schedule/timers drifts.
* f->time_next_packet was set when prior packet was sent,
* and current time (@now) can be too late by tens of us.
*/
if (f->time_next_packet)
len -= min(len/2, now - f->time_next_packet);
f->time_next_packet = now + len;
}
out:
qdisc_bstats_update(sch, skb);
return skb;
}
//--------------------------------------------------------------------------------
int ContourFinder::findContours( ofxCvGrayscaleImage& input,
int minArea,
int maxArea,
int nConsidered,
bool bFindHoles,
bool bUseApproximation)
{
reset();
// opencv will clober the image it detects contours on, so we want to
// copy it into a copy before we detect contours. That copy is allocated
// if necessary (necessary = (a) not allocated or (b) wrong size)
// so be careful if you pass in different sized images to "findContours"
// there is a performance penalty, but we think there is not a memory leak
// to worry about better to create mutiple contour finders for different
// sizes, ie, if you are finding contours in a 640x480 image but also a
// 320x240 image better to make two ContourFinder objects then to use
// one, because you will get penalized less.
if( inputCopy.width == 0 )
{
inputCopy.allocate( input.width, input.height );
inputCopy = input;
}
else
{
if( inputCopy.width == input.width && inputCopy.height == input.height )
inputCopy = input;
else
{
// we are allocated, but to the wrong size --
// been checked for memory leaks, but a warning:
// be careful if you call this function with alot of different
// sized "input" images!, it does allocation every time
// a new size is passed in....
//inputCopy.clear();
inputCopy.allocate( input.width, input.height );
inputCopy = input;
}
}
CvSeq* contour_list = NULL;
contour_storage = cvCreateMemStorage( 1000 );
storage = cvCreateMemStorage( 1000 );
CvContourRetrievalMode retrieve_mode
= (bFindHoles) ? CV_RETR_LIST : CV_RETR_EXTERNAL;
cvFindContours( inputCopy.getCvImage(), contour_storage, &contour_list,
sizeof(CvContour), retrieve_mode, bUseApproximation ? CV_CHAIN_APPROX_SIMPLE : CV_CHAIN_APPROX_NONE );
CvSeq* contour_ptr = contour_list;
nCvSeqsFound = 0;
// put the contours from the linked list, into an array for sorting
while( (contour_ptr != NULL) )
{
CvBox2D box=cvMinAreaRect2(contour_ptr);
int objectId; // If the contour is an object, then objectId is its ID
objectId=(bTrackObjects)? templates->getTemplateId(box.size.width,box.size.height): -1;
if(objectId != -1 ) //If the blob is a object
{
Blob blob = Blob();
blob.id = objectId;
blob.isObject = true;
float area = cvContourArea( contour_ptr, CV_WHOLE_SEQ );
cvMoments( contour_ptr, myMoments );
// this is if using non-angle bounding box
CvRect rect = cvBoundingRect( contour_ptr, 0 );
blob.boundingRect.x = rect.x;
blob.boundingRect.y = rect.y;
blob.boundingRect.width = rect.width;
blob.boundingRect.height = rect.height;
//For anglebounding rectangle
blob.angleBoundingBox=box;
blob.angleBoundingRect.x = box.center.x;
blob.angleBoundingRect.y = box.center.y;
blob.angleBoundingRect.width = box.size.height;
blob.angleBoundingRect.height = box.size.width;
blob.angle = box.angle;
//TEMPORARY INITIALIZATION TO 0, Will be calculating afterwards.This is to prevent sending wrong data
blob.D.x = 0;
blob.D.y = 0;
blob.maccel = 0;
// assign other parameters
blob.area = fabs(area);
blob.hole = area < 0 ? true : false;
blob.length = cvArcLength(contour_ptr);
blob.centroid.x = (myMoments->m10 / myMoments->m00);
blob.centroid.y = (myMoments->m01 / myMoments->m00);
blob.lastCentroid.x = 0;
blob.lastCentroid.y = 0;
// get the points for the blob:
CvPoint pt;
CvSeqReader reader;
cvStartReadSeq( contour_ptr, &reader, 0 );
for( int j=0; j < contour_ptr->total; j++ )
{
CV_READ_SEQ_ELEM( pt, reader );
blob.pts.push_back( ofPoint((float)pt.x, (float)pt.y) );
}
blob.nPts = blob.pts.size();
objects.push_back(blob);
}
else if(bTrackFingers)
{
float area = fabs( cvContourArea(contour_ptr, CV_WHOLE_SEQ) );
if( (area > minArea) && (area < maxArea) )
{
Blob blob=Blob();
float area = cvContourArea( contour_ptr, CV_WHOLE_SEQ );
cvMoments( contour_ptr, myMoments );
// this is if using non-angle bounding box
CvRect rect = cvBoundingRect( contour_ptr, 0 );
blob.boundingRect.x = rect.x;
blob.boundingRect.y = rect.y;
blob.boundingRect.width = rect.width;
blob.boundingRect.height = rect.height;
//Angle Bounding rectangle
blob.angleBoundingRect.x = box.center.x;
blob.angleBoundingRect.y = box.center.y;
blob.angleBoundingRect.width = box.size.height;
blob.angleBoundingRect.height = box.size.width;
blob.angle = box.angle;
// assign other parameters
blob.area = fabs(area);
blob.hole = area < 0 ? true : false;
blob.length = cvArcLength(contour_ptr);
// AlexP
// The cast to int causes errors in tracking since centroids are calculated in
// floats and they migh land between integer pixel values (which is what we really want)
// This not only makes tracking more accurate but also more fluid
blob.centroid.x = (myMoments->m10 / myMoments->m00);
blob.centroid.y = (myMoments->m01 / myMoments->m00);
blob.lastCentroid.x = 0;
blob.lastCentroid.y = 0;
// get the points for the blob:
CvPoint pt;
CvSeqReader reader;
cvStartReadSeq( contour_ptr, &reader, 0 );
for( int j=0; j < min(TOUCH_MAX_CONTOUR_LENGTH, contour_ptr->total); j++ )
{
CV_READ_SEQ_ELEM( pt, reader );
blob.pts.push_back( ofPoint((float)pt.x, (float)pt.y) );
}
blob.nPts = blob.pts.size();
blobs.push_back(blob);
}
}
contour_ptr = contour_ptr->h_next;
}
nBlobs = blobs.size();
nObjects = objects.size();
// Free the storage memory.
// Warning: do this inside this function otherwise a strange memory leak
if( contour_storage != NULL ) { cvReleaseMemStorage(&contour_storage); }
if( storage != NULL ) { cvReleaseMemStorage(&storage); }
//printf("Number of objects : %d\n",nObjects);
return nBlobs;
}
void HTMLTextFormControlElement::setSelectionEnd(int end)
{
setSelectionRange(min(end, selectionStart()), end, selectionDirection());
}
LRESULT CALLBACK WndProc (HWND hwnd, UINT message, WPARAM wParam, LPARAM lParam)
{
static BOOL bOpened = FALSE ;
HDC hdc ;
HMENU hMenu ;
int i, iNumDevs, iPitchBend, cxClient, cyClient ;
MIDIOUTCAPS moc ;
PAINTSTRUCT ps ;
SIZE size ;
TCHAR szBuffer [16] ;
switch (message)
{
case WM_CREATE:
// Get size of capital letters in system font
hdc = GetDC (hwnd) ;
GetTextExtentPoint (hdc, TEXT ("M"), 1, &size) ;
cxCaps = size.cx ;
cyChar = size.cy ;
ReleaseDC (hwnd, hdc) ;
// Initialize "Volume" scroll bar
SetScrollRange (hwnd, SB_HORZ, 1, 127, FALSE) ;
SetScrollPos (hwnd, SB_HORZ, iVelocity, TRUE) ;
// Initialize "Pitch Bend" scroll bar
SetScrollRange (hwnd, SB_VERT, 0, 16383, FALSE) ;
SetScrollPos (hwnd, SB_VERT, 8192, TRUE) ;
// Get number of MIDI output devices and set up menu
if (0 == (iNumDevs = midiOutGetNumDevs ()))
{
MessageBeep (MB_ICONSTOP) ;
MessageBox (hwnd, TEXT ("No MIDI output devices!"),
szAppName, MB_OK | MB_ICONSTOP) ;
return -1 ;
}
SetMenu (hwnd, CreateTheMenu (iNumDevs)) ;
return 0 ;
case WM_SIZE:
cxClient = LOWORD (lParam) ;
cyClient = HIWORD (lParam) ;
xOffset = (cxClient - 25 * 3 * cxCaps / 2) / 2 ;
yOffset = (cyClient - 11 * cyChar) / 2 + 5 * cyChar ;
return 0 ;
case WM_COMMAND:
hMenu = GetMenu (hwnd) ;
// "Open" menu command
if (LOWORD (wParam) == IDM_OPEN && !bOpened)
{
if (midiOutOpen (&hMidiOut, iDevice, 0, 0, 0))
{
MessageBeep (MB_ICONEXCLAMATION) ;
MessageBox (hwnd, TEXT ("Cannot open MIDI device"),
szAppName, MB_OK | MB_ICONEXCLAMATION) ;
}
else
{
CheckMenuItem (hMenu, IDM_OPEN, MF_CHECKED) ;
CheckMenuItem (hMenu, IDM_CLOSE, MF_UNCHECKED) ;
MidiSetPatch (hMidiOut, iChannel, iVoice) ;
bOpened = TRUE ;
}
}
// "Close" menu command
else if (LOWORD (wParam) == IDM_CLOSE && bOpened)
{
CheckMenuItem (hMenu, IDM_OPEN, MF_UNCHECKED) ;
CheckMenuItem (hMenu, IDM_CLOSE, MF_CHECKED) ;
// Turn all keys off and close device
for (i = 0 ; i < 16 ; i++)
MidiOutMessage (hMidiOut, 0xB0, i, 123, 0) ;
midiOutClose (hMidiOut) ;
bOpened = FALSE ;
}
// Change MIDI "Device" menu command
else if (LOWORD (wParam) >= IDM_DEVICE - 1 &&
LOWORD (wParam) < IDM_CHANNEL)
{
CheckMenuItem (hMenu, IDM_DEVICE + iDevice, MF_UNCHECKED) ;
iDevice = LOWORD (wParam) - IDM_DEVICE ;
CheckMenuItem (hMenu, IDM_DEVICE + iDevice, MF_CHECKED) ;
// Close and reopen MIDI device
if (bOpened)
{
SendMessage (hwnd, WM_COMMAND, IDM_CLOSE, 0L) ;
SendMessage (hwnd, WM_COMMAND, IDM_OPEN, 0L) ;
}
}
// Change MIDI "Channel" menu command
else if (LOWORD (wParam) >= IDM_CHANNEL &&
LOWORD (wParam) < IDM_VOICE)
{
CheckMenuItem (hMenu, IDM_CHANNEL + iChannel, MF_UNCHECKED);
iChannel = LOWORD (wParam) - IDM_CHANNEL ;
CheckMenuItem (hMenu, IDM_CHANNEL + iChannel, MF_CHECKED) ;
if (bOpened)
MidiSetPatch (hMidiOut, iChannel, iVoice) ;
}
// Change MIDI "Voice" menu command
else if (LOWORD (wParam) >= IDM_VOICE)
{
CheckMenuItem (hMenu, IDM_VOICE + iVoice, MF_UNCHECKED) ;
iVoice = LOWORD (wParam) - IDM_VOICE ;
CheckMenuItem (hMenu, IDM_VOICE + iVoice, MF_CHECKED) ;
if (bOpened)
MidiSetPatch (hMidiOut, iChannel, iVoice) ;
}
InvalidateRect (hwnd, NULL, TRUE) ;
return 0 ;
// Process a Key Up or Key Down message
case WM_KEYUP:
case WM_KEYDOWN:
hdc = GetDC (hwnd) ;
if (bOpened)
ProcessKey (hdc, message, lParam) ;
ReleaseDC (hwnd, hdc) ;
return 0 ;
// For Escape, turn off all notes and repaint
case WM_CHAR:
if (bOpened && wParam == 27)
{
for (i = 0 ; i < 16 ; i++)
MidiOutMessage (hMidiOut, 0xB0, i, 123, 0) ;
InvalidateRect (hwnd, NULL, TRUE) ;
}
return 0 ;
// Horizontal scroll: Velocity
case WM_HSCROLL:
switch (LOWORD (wParam))
{
case SB_LINEUP: iVelocity -= 1 ; break ;
case SB_LINEDOWN: iVelocity += 1 ; break ;
case SB_PAGEUP: iVelocity -= 8 ; break ;
case SB_PAGEDOWN: iVelocity += 8 ; break ;
case SB_THUMBPOSITION: iVelocity = HIWORD (wParam) ; break ;
default: return 0 ;
}
iVelocity = max (1, min (iVelocity, 127)) ;
SetScrollPos (hwnd, SB_HORZ, iVelocity, TRUE) ;
return 0 ;
// Vertical scroll: Pitch Bend
case WM_VSCROLL:
switch (LOWORD (wParam))
{
case SB_THUMBTRACK: iPitchBend = 16383 - HIWORD (wParam) ; break ;
case SB_THUMBPOSITION: iPitchBend = 8191 ; break ;
default: return 0 ;
}
iPitchBend = max (0, min (iPitchBend, 16383)) ;
SetScrollPos (hwnd, SB_VERT, 16383 - iPitchBend, TRUE) ;
if (bOpened)
MidiPitchBend (hMidiOut, iChannel, iPitchBend) ;
return 0 ;
case WM_PAINT:
hdc = BeginPaint (hwnd, &ps) ;
for (i = 0 ; i < NUMSCANS ; i++)
if (key[i].xPos != -1)
DrawKey (hdc, i, FALSE) ;
midiOutGetDevCaps (iDevice, &moc, sizeof (MIDIOUTCAPS)) ;
wsprintf (szBuffer, TEXT ("Channel %i"), iChannel + 1) ;
TextOut (hdc, cxCaps, 1 * cyChar,
bOpened ? TEXT ("Open") : TEXT ("Closed"),
bOpened ? 4 : 6) ;
TextOut (hdc, cxCaps, 2 * cyChar, moc.szPname,
lstrlen (moc.szPname)) ;
TextOut (hdc, cxCaps, 3 * cyChar, szBuffer, lstrlen (szBuffer)) ;
TextOut (hdc, cxCaps, 4 * cyChar,
fam[iVoice / 8].inst[iVoice % 8].szInst,
lstrlen (fam[iVoice / 8].inst[iVoice % 8].szInst)) ;
EndPaint (hwnd, &ps) ;
return 0 ;
case WM_DESTROY :
SendMessage (hwnd, WM_COMMAND, IDM_CLOSE, 0L) ;
PostQuitMessage (0) ;
return 0 ;
}
return DefWindowProc (hwnd, message, wParam, lParam) ;
}
/*
============
Cbuf_Execute
============
*/
void Cbuf_ExecuteEx (cbuf_t *cbuf)
{
int i, j, cursize;
char *text;
char line[1024], *src, *dest;
qbool comment, quotes;
cbuf_current = cbuf;
while (cbuf->text_end > cbuf->text_start)
{
// find a \n or ; line break
text = (char *)cbuf->text_buf + cbuf->text_start;
cursize = cbuf->text_end - cbuf->text_start;
comment = quotes = false;
for (i = 0; i < cursize; i++)
{
if (text[i] == '\n')
break;
if (text[i] == '"')
quotes = !quotes;
if (comment || quotes)
continue;
if (text[i] == '/' && (i + 1) < cursize && text[i + 1] == '/')
comment = true;
else if (text[i] == ';')
break;
}
// don't execute lines without ending \n; this fixes problems with
// partially stuffed aliases not being executed properly
#ifndef SERVERONLY
if (cbuf_current == &cbuf_svc && i == cursize)
break;
#endif
// Copy text to line, skipping carriage return chars
src = text;
dest = line;
j = min (i, sizeof(line)-1);
for ( ; j ; j--, src++) {
if (*src != 13)
*dest++ = *src;
}
*dest = 0;
// delete the text from the command buffer and move remaining commands down
// this is necessary because commands (exec, alias) can insert data at the
// beginning of the text buffer
if (i == cursize)
{
cbuf->text_start = cbuf->text_end = cbuf->maxsize/2;
}
else
{
i++;
cbuf->text_start += i;
}
// execute the command line
Cmd_ExecuteString (line);
if (cbuf->wait)
{ // skip out while text still remains in buffer, leaving it
// for next frame
cbuf->wait = false;
break;
}
}
cbuf_current = NULL;
}
static int avalon_panel_init(void)
{
int err;
struct resource *res;
mutex_init(&lcd_lock);
ast_carveouts[1].base = tegra_carveout_start;
ast_carveouts[1].size = tegra_carveout_size;
err = gpio_request(AST_LVDS_SHUTDOWN, "lvds_shutdown");
if (err < 0)
return err;
gpio_direction_output(AST_LVDS_SHUTDOWN, 1);
tegra_gpio_enable(AST_LVDS_SHUTDOWN);
/* hdmi software enable pin */
/* tegra_gpio_enable(AST_HDMI_ENB);*/
/* gpio_request(AST_HDMI_ENB, "ast_hdmi_enb");*/
/* gpio_direction_output(AST_HDMI_ENB, 1);*/
gpio_request(AST_HDMI_HPD, "hdmi_hpd");
gpio_direction_input(AST_HDMI_HPD);
tegra_gpio_enable(AST_HDMI_HPD);
#ifdef CONFIG_HAS_EARLYSUSPEND
ast_panel_early_suspender.suspend = ast_panel_early_suspend;
ast_panel_early_suspender.resume = ast_panel_late_resume;
ast_panel_early_suspender.level = EARLY_SUSPEND_LEVEL_DISABLE_FB;
register_early_suspend(&ast_panel_early_suspender);
#endif
err = platform_add_devices(ast_gfx_devices,
ARRAY_SIZE(ast_gfx_devices));
res = nvhost_get_resource_byname(&ast_disp1_device,
IORESOURCE_MEM, "fbmem");
res->start = tegra_fb_start;
res->end = tegra_fb_start + tegra_fb_size - 1;
/* Copy the bootloader fb to the fb. */
tegra_move_framebuffer(tegra_fb_start, tegra_bootloader_fb_start,
min(tegra_fb_size, tegra_bootloader_fb_size));
if (!err)
err = nvhost_device_register(&ast_disp1_device);
res = nvhost_get_resource_byname(&ast_disp2_device,
IORESOURCE_MEM, "fbmem");
res->start = tegra_fb2_start;
res->end = tegra_fb2_start + tegra_fb2_size - 1;
if (!err)
err = nvhost_device_register(&ast_disp2_device);
#if defined(CONFIG_TEGRA_NVAVP)
if (!err)
err = nvhost_device_register(&nvavp_device);
#endif
return err;
}
/* Subroutine */ int cungrq_(integer *m, integer *n, integer *k, complex *a,
integer *lda, complex *tau, complex *work, integer *lwork, integer *
info)
{
/* System generated locals */
integer a_dim1, a_offset, i__1, i__2, i__3, i__4, i__5;
/* Local variables */
integer i__, j, l, ib, nb, ii, kk, nx, iws, nbmin, iinfo;
extern /* Subroutine */ int cungr2_(integer *, integer *, integer *,
complex *, integer *, complex *, complex *, integer *), clarfb_(
char *, char *, char *, char *, integer *, integer *, integer *,
complex *, integer *, complex *, integer *, complex *, integer *,
complex *, integer *), clarft_(
char *, char *, integer *, integer *, complex *, integer *,
complex *, complex *, integer *), xerbla_(char *,
integer *);
extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
integer *, integer *);
integer ldwork, lwkopt;
logical lquery;
/* -- LAPACK routine (version 3.2) -- */
/* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd.. */
/* November 2006 */
/* .. Scalar Arguments .. */
/* .. */
/* .. Array Arguments .. */
/* .. */
/* Purpose */
/* ======= */
/* CUNGRQ generates an M-by-N complex matrix Q with orthonormal rows, */
/* which is defined as the last M rows of a product of K elementary */
/* reflectors of order N */
/* Q = H(1)' H(2)' . . . H(k)' */
/* as returned by CGERQF. */
/* Arguments */
/* ========= */
/* M (input) INTEGER */
/* The number of rows of the matrix Q. M >= 0. */
/* N (input) INTEGER */
/* The number of columns of the matrix Q. N >= M. */
/* K (input) INTEGER */
/* The number of elementary reflectors whose product defines the */
/* matrix Q. M >= K >= 0. */
/* A (input/output) COMPLEX array, dimension (LDA,N) */
/* On entry, the (m-k+i)-th row must contain the vector which */
/* defines the elementary reflector H(i), for i = 1,2,...,k, as */
/* returned by CGERQF in the last k rows of its array argument */
/* A. */
/* On exit, the M-by-N matrix Q. */
/* LDA (input) INTEGER */
/* The first dimension of the array A. LDA >= max(1,M). */
/* TAU (input) COMPLEX array, dimension (K) */
/* TAU(i) must contain the scalar factor of the elementary */
/* reflector H(i), as returned by CGERQF. */
/* WORK (workspace/output) COMPLEX array, dimension (MAX(1,LWORK)) */
/* On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
/* LWORK (input) INTEGER */
/* The dimension of the array WORK. LWORK >= max(1,M). */
/* For optimum performance LWORK >= M*NB, where NB is the */
/* optimal blocksize. */
/* If LWORK = -1, then a workspace query is assumed; the routine */
/* only calculates the optimal size of the WORK array, returns */
/* this value as the first entry of the WORK array, and no error */
/* message related to LWORK is issued by XERBLA. */
/* INFO (output) INTEGER */
/* = 0: successful exit */
/* < 0: if INFO = -i, the i-th argument has an illegal value */
/* ===================================================================== */
/* .. Parameters .. */
/* .. */
/* .. Local Scalars .. */
/* .. */
/* .. External Subroutines .. */
/* .. */
/* .. Intrinsic Functions .. */
/* .. */
/* .. External Functions .. */
/* .. */
/* .. Executable Statements .. */
/* Test the input arguments */
/* Parameter adjustments */
a_dim1 = *lda;
a_offset = 1 + a_dim1;
a -= a_offset;
--tau;
--work;
/* Function Body */
*info = 0;
lquery = *lwork == -1;
if (*m < 0) {
*info = -1;
} else if (*n < *m) {
*info = -2;
} else if (*k < 0 || *k > *m) {
*info = -3;
} else if (*lda < max(1,*m)) {
*info = -5;
}
if (*info == 0) {
if (*m <= 0) {
lwkopt = 1;
} else {
nb = ilaenv_(&c__1, "CUNGRQ", " ", m, n, k, &c_n1);
lwkopt = *m * nb;
}
work[1].r = (real) lwkopt, work[1].i = 0.f;
if (*lwork < max(1,*m) && ! lquery) {
*info = -8;
}
}
if (*info != 0) {
i__1 = -(*info);
xerbla_("CUNGRQ", &i__1);
return 0;
} else if (lquery) {
return 0;
}
/* Quick return if possible */
if (*m <= 0) {
return 0;
}
nbmin = 2;
nx = 0;
iws = *m;
if (nb > 1 && nb < *k) {
/* Determine when to cross over from blocked to unblocked code. */
/* Computing MAX */
i__1 = 0, i__2 = ilaenv_(&c__3, "CUNGRQ", " ", m, n, k, &c_n1);
nx = max(i__1,i__2);
if (nx < *k) {
/* Determine if workspace is large enough for blocked code. */
ldwork = *m;
iws = ldwork * nb;
if (*lwork < iws) {
/* Not enough workspace to use optimal NB: reduce NB and */
/* determine the minimum value of NB. */
nb = *lwork / ldwork;
/* Computing MAX */
i__1 = 2, i__2 = ilaenv_(&c__2, "CUNGRQ", " ", m, n, k, &c_n1);
nbmin = max(i__1,i__2);
}
}
}
if (nb >= nbmin && nb < *k && nx < *k) {
/* Use blocked code after the first block. */
/* The last kk rows are handled by the block method. */
/* Computing MIN */
i__1 = *k, i__2 = (*k - nx + nb - 1) / nb * nb;
kk = min(i__1,i__2);
/* Set A(1:m-kk,n-kk+1:n) to zero. */
i__1 = *n;
for (j = *n - kk + 1; j <= i__1; ++j) {
i__2 = *m - kk;
for (i__ = 1; i__ <= i__2; ++i__) {
i__3 = i__ + j * a_dim1;
a[i__3].r = 0.f, a[i__3].i = 0.f;
/* L10: */
}
/* L20: */
}
} else {
kk = 0;
}
/* Use unblocked code for the first or only block. */
i__1 = *m - kk;
i__2 = *n - kk;
i__3 = *k - kk;
cungr2_(&i__1, &i__2, &i__3, &a[a_offset], lda, &tau[1], &work[1], &iinfo)
;
if (kk > 0) {
/* Use blocked code */
i__1 = *k;
i__2 = nb;
for (i__ = *k - kk + 1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ +=
i__2) {
/* Computing MIN */
i__3 = nb, i__4 = *k - i__ + 1;
ib = min(i__3,i__4);
ii = *m - *k + i__;
if (ii > 1) {
/* Form the triangular factor of the block reflector */
/* H = H(i+ib-1) . . . H(i+1) H(i) */
i__3 = *n - *k + i__ + ib - 1;
clarft_("Backward", "Rowwise", &i__3, &ib, &a[ii + a_dim1],
lda, &tau[i__], &work[1], &ldwork);
/* Apply H' to A(1:m-k+i-1,1:n-k+i+ib-1) from the right */
i__3 = ii - 1;
i__4 = *n - *k + i__ + ib - 1;
clarfb_("Right", "Conjugate transpose", "Backward", "Rowwise",
&i__3, &i__4, &ib, &a[ii + a_dim1], lda, &work[1], &
ldwork, &a[a_offset], lda, &work[ib + 1], &ldwork);
}
/* Apply H' to columns 1:n-k+i+ib-1 of current block */
i__3 = *n - *k + i__ + ib - 1;
cungr2_(&ib, &i__3, &ib, &a[ii + a_dim1], lda, &tau[i__], &work[1]
, &iinfo);
/* Set columns n-k+i+ib:n of current block to zero */
i__3 = *n;
for (l = *n - *k + i__ + ib; l <= i__3; ++l) {
i__4 = ii + ib - 1;
for (j = ii; j <= i__4; ++j) {
i__5 = j + l * a_dim1;
a[i__5].r = 0.f, a[i__5].i = 0.f;
/* L30: */
}
/* L40: */
}
/* L50: */
}
}
work[1].r = (real) iws, work[1].i = 0.f;
return 0;
/* End of CUNGRQ */
} /* cungrq_ */
static double Int2HLS (UINT n)
{
return min (1., (double) (.5 + n) / 255.);
}
void ScopeGUI::calculateBuffers()
{
if(tryLock() == true)
{
const int audioBufferSize = audioBuffer.size();
const int drawBufferSize = getDisplayBufferSize();
if(audioBufferSize > 0 && minDrawBuffer.size() > 0 && maxDrawBuffer.size() > 0)
{
minDrawBuffer.clear();
maxDrawBuffer.clear();
const double drawIndexInc = min(1.0, (double)drawBufferSize / (double)audioBufferSize);
const double audioIndexInc = min(1.0, (double)audioBufferSize / (double)drawBufferSize);
for(int channel = 0; channel < audioBuffer.getNumChannels(); channel++)
{
if(drawIndexInc < 1.0)
{
double drawIndex = 0.0;
int previousDrawIndex = -1;
float minimum = 0.f, maximum = 0.f;
for(int sample = 0; sample < audioBufferSize; sample++, drawIndex += drawIndexInc)
{
const int iDrawIndex = (int)drawIndex;
float value = audioBuffer.getSampleUnchecked(channel, sample);
if(previousDrawIndex != iDrawIndex)
{
if(previousDrawIndex >= 0)
{
minDrawBuffer.setSampleUnchecked(channel, previousDrawIndex, minimum);
maxDrawBuffer.setSampleUnchecked(channel, previousDrawIndex, maximum);
}
minimum = maximum = value;
previousDrawIndex = iDrawIndex;
}
else
{
minimum = min(minimum, value);
maximum = max(maximum, value);
}
}
}
else
{
double audioIndex = 0.0;
for(int horiz = 0; horiz < drawBufferSize; horiz++, audioIndex += audioIndexInc)
{
float value = audioBuffer.getSampleUnchecked(channel, (int)audioIndex);
minDrawBuffer.setSampleUnchecked(channel, horiz, value);
maxDrawBuffer.setSampleUnchecked(channel, horiz, value);
}
}
}
}
unlock();
}
}
static UINT HLS2Int (double n)
{
return min (255, (UINT) (.5 + n * 255.));
}
/* Subroutine */ int dgebrd_(integer *m, integer *n, doublereal *a, integer *
lda, doublereal *d__, doublereal *e, doublereal *tauq, doublereal *
taup, doublereal *work, integer *lwork, integer *info)
{
/* System generated locals */
integer a_dim1, a_offset, i__1, i__2, i__3, i__4;
/* Local variables */
static integer i__, j, nb, nx;
static doublereal ws;
extern /* Subroutine */ int dgemm_(char *, char *, integer *, integer *,
integer *, doublereal *, doublereal *, integer *, doublereal *,
integer *, doublereal *, doublereal *, integer *, ftnlen, ftnlen);
static integer nbmin, iinfo, minmn;
extern /* Subroutine */ int dgebd2_(integer *, integer *, doublereal *,
integer *, doublereal *, doublereal *, doublereal *, doublereal *,
doublereal *, integer *), dlabrd_(integer *, integer *, integer *
, doublereal *, integer *, doublereal *, doublereal *, doublereal
*, doublereal *, doublereal *, integer *, doublereal *, integer *)
, xerbla_(char *, integer *, ftnlen);
extern integer ilaenv_(integer *, char *, char *, integer *, integer *,
integer *, integer *, ftnlen, ftnlen);
static integer ldwrkx, ldwrky, lwkopt;
static logical lquery;
/* -- LAPACK routine (version 3.0) -- */
/* Univ. of Tennessee, Univ. of California Berkeley, NAG Ltd., */
/* Courant Institute, Argonne National Lab, and Rice University */
/* June 30, 1999 */
/* .. Scalar Arguments .. */
/* .. */
/* .. Array Arguments .. */
/* .. */
/* Purpose */
/* ======= */
/* DGEBRD reduces a general real M-by-N matrix A to upper or lower */
/* bidiagonal form B by an orthogonal transformation: Q**T * A * P = B. */
/* If m >= n, B is upper bidiagonal; if m < n, B is lower bidiagonal. */
/* Arguments */
/* ========= */
/* M (input) INTEGER */
/* The number of rows in the matrix A. M >= 0. */
/* N (input) INTEGER */
/* The number of columns in the matrix A. N >= 0. */
/* A (input/output) DOUBLE PRECISION array, dimension (LDA,N) */
/* On entry, the M-by-N general matrix to be reduced. */
/* On exit, */
/* if m >= n, the diagonal and the first superdiagonal are */
/* overwritten with the upper bidiagonal matrix B; the */
/* elements below the diagonal, with the array TAUQ, represent */
/* the orthogonal matrix Q as a product of elementary */
/* reflectors, and the elements above the first superdiagonal, */
/* with the array TAUP, represent the orthogonal matrix P as */
/* a product of elementary reflectors; */
/* if m < n, the diagonal and the first subdiagonal are */
/* overwritten with the lower bidiagonal matrix B; the */
/* elements below the first subdiagonal, with the array TAUQ, */
/* represent the orthogonal matrix Q as a product of */
/* elementary reflectors, and the elements above the diagonal, */
/* with the array TAUP, represent the orthogonal matrix P as */
/* a product of elementary reflectors. */
/* See Further Details. */
/* LDA (input) INTEGER */
/* The leading dimension of the array A. LDA >= max(1,M). */
/* D (output) DOUBLE PRECISION array, dimension (min(M,N)) */
/* The diagonal elements of the bidiagonal matrix B: */
/* D(i) = A(i,i). */
/* E (output) DOUBLE PRECISION array, dimension (min(M,N)-1) */
/* The off-diagonal elements of the bidiagonal matrix B: */
/* if m >= n, E(i) = A(i,i+1) for i = 1,2,...,n-1; */
/* if m < n, E(i) = A(i+1,i) for i = 1,2,...,m-1. */
/* TAUQ (output) DOUBLE PRECISION array dimension (min(M,N)) */
/* The scalar factors of the elementary reflectors which */
/* represent the orthogonal matrix Q. See Further Details. */
/* TAUP (output) DOUBLE PRECISION array, dimension (min(M,N)) */
/* The scalar factors of the elementary reflectors which */
/* represent the orthogonal matrix P. See Further Details. */
/* WORK (workspace/output) DOUBLE PRECISION array, dimension (LWORK) */
/* On exit, if INFO = 0, WORK(1) returns the optimal LWORK. */
/* LWORK (input) INTEGER */
/* The length of the array WORK. LWORK >= max(1,M,N). */
/* For optimum performance LWORK >= (M+N)*NB, where NB */
/* is the optimal blocksize. */
/* If LWORK = -1, then a workspace query is assumed; the routine */
/* only calculates the optimal size of the WORK array, returns */
/* this value as the first entry of the WORK array, and no error */
/* message related to LWORK is issued by XERBLA. */
/* INFO (output) INTEGER */
/* = 0: successful exit */
/* < 0: if INFO = -i, the i-th argument had an illegal value. */
/* Further Details */
/* =============== */
/* The matrices Q and P are represented as products of elementary */
/* reflectors: */
/* If m >= n, */
/* Q = H(1) H(2) . . . H(n) and P = G(1) G(2) . . . G(n-1) */
/* Each H(i) and G(i) has the form: */
/* H(i) = I - tauq * v * v' and G(i) = I - taup * u * u' */
/* where tauq and taup are real scalars, and v and u are real vectors; */
/* v(1:i-1) = 0, v(i) = 1, and v(i+1:m) is stored on exit in A(i+1:m,i); */
/* u(1:i) = 0, u(i+1) = 1, and u(i+2:n) is stored on exit in A(i,i+2:n); */
/* tauq is stored in TAUQ(i) and taup in TAUP(i). */
/* If m < n, */
/* Q = H(1) H(2) . . . H(m-1) and P = G(1) G(2) . . . G(m) */
/* Each H(i) and G(i) has the form: */
/* H(i) = I - tauq * v * v' and G(i) = I - taup * u * u' */
/* where tauq and taup are real scalars, and v and u are real vectors; */
/* v(1:i) = 0, v(i+1) = 1, and v(i+2:m) is stored on exit in A(i+2:m,i); */
/* u(1:i-1) = 0, u(i) = 1, and u(i+1:n) is stored on exit in A(i,i+1:n); */
/* tauq is stored in TAUQ(i) and taup in TAUP(i). */
/* The contents of A on exit are illustrated by the following examples: */
/* m = 6 and n = 5 (m > n): m = 5 and n = 6 (m < n): */
/* ( d e u1 u1 u1 ) ( d u1 u1 u1 u1 u1 ) */
/* ( v1 d e u2 u2 ) ( e d u2 u2 u2 u2 ) */
/* ( v1 v2 d e u3 ) ( v1 e d u3 u3 u3 ) */
/* ( v1 v2 v3 d e ) ( v1 v2 e d u4 u4 ) */
/* ( v1 v2 v3 v4 d ) ( v1 v2 v3 e d u5 ) */
/* ( v1 v2 v3 v4 v5 ) */
/* where d and e denote diagonal and off-diagonal elements of B, vi */
/* denotes an element of the vector defining H(i), and ui an element of */
/* the vector defining G(i). */
/* ===================================================================== */
/* .. Parameters .. */
/* .. */
/* .. Local Scalars .. */
/* .. */
/* .. External Subroutines .. */
/* .. */
/* .. Intrinsic Functions .. */
/* .. */
/* .. External Functions .. */
/* .. */
/* .. Executable Statements .. */
/* Test the input parameters */
/* Parameter adjustments */
a_dim1 = *lda;
a_offset = 1 + a_dim1;
a -= a_offset;
--d__;
--e;
--tauq;
--taup;
--work;
/* Function Body */
*info = 0;
/* Computing MAX */
i__1 = 1, i__2 = ilaenv_(&c__1, "DGEBRD", " ", m, n, &c_n1, &c_n1, (
ftnlen)6, (ftnlen)1);
nb = max(i__1,i__2);
lwkopt = (*m + *n) * nb;
work[1] = (doublereal) lwkopt;
lquery = *lwork == -1;
if (*m < 0) {
*info = -1;
} else if (*n < 0) {
*info = -2;
} else if (*lda < max(1,*m)) {
*info = -4;
} else /* if(complicated condition) */ {
/* Computing MAX */
i__1 = max(1,*m);
if (*lwork < max(i__1,*n) && ! lquery) {
*info = -10;
}
}
if (*info < 0) {
i__1 = -(*info);
xerbla_("DGEBRD", &i__1, (ftnlen)6);
return 0;
} else if (lquery) {
return 0;
}
/* Quick return if possible */
minmn = min(*m,*n);
if (minmn == 0) {
work[1] = 1.;
return 0;
}
ws = (doublereal) max(*m,*n);
ldwrkx = *m;
ldwrky = *n;
if (nb > 1 && nb < minmn) {
/* Set the crossover point NX. */
/* Computing MAX */
i__1 = nb, i__2 = ilaenv_(&c__3, "DGEBRD", " ", m, n, &c_n1, &c_n1, (
ftnlen)6, (ftnlen)1);
nx = max(i__1,i__2);
/* Determine when to switch from blocked to unblocked code. */
if (nx < minmn) {
ws = (doublereal) ((*m + *n) * nb);
if ((doublereal) (*lwork) < ws) {
/* Not enough work space for the optimal NB, consider using */
/* a smaller block size. */
nbmin = ilaenv_(&c__2, "DGEBRD", " ", m, n, &c_n1, &c_n1, (
ftnlen)6, (ftnlen)1);
if (*lwork >= (*m + *n) * nbmin) {
nb = *lwork / (*m + *n);
} else {
nb = 1;
nx = minmn;
}
}
}
} else {
nx = minmn;
}
i__1 = minmn - nx;
i__2 = nb;
for (i__ = 1; i__2 < 0 ? i__ >= i__1 : i__ <= i__1; i__ += i__2) {
/* Reduce rows and columns i:i+nb-1 to bidiagonal form and return */
/* the matrices X and Y which are needed to update the unreduced */
/* part of the matrix */
i__3 = *m - i__ + 1;
i__4 = *n - i__ + 1;
dlabrd_(&i__3, &i__4, &nb, &a[i__ + i__ * a_dim1], lda, &d__[i__], &e[
i__], &tauq[i__], &taup[i__], &work[1], &ldwrkx, &work[ldwrkx
* nb + 1], &ldwrky);
/* Update the trailing submatrix A(i+nb:m,i+nb:n), using an update */
/* of the form A := A - V*Y' - X*U' */
i__3 = *m - i__ - nb + 1;
i__4 = *n - i__ - nb + 1;
dgemm_("No transpose", "Transpose", &i__3, &i__4, &nb, &c_b21, &a[i__
+ nb + i__ * a_dim1], lda, &work[ldwrkx * nb + nb + 1], &
ldwrky, &c_b22, &a[i__ + nb + (i__ + nb) * a_dim1], lda, (
ftnlen)12, (ftnlen)9);
i__3 = *m - i__ - nb + 1;
i__4 = *n - i__ - nb + 1;
dgemm_("No transpose", "No transpose", &i__3, &i__4, &nb, &c_b21, &
work[nb + 1], &ldwrkx, &a[i__ + (i__ + nb) * a_dim1], lda, &
c_b22, &a[i__ + nb + (i__ + nb) * a_dim1], lda, (ftnlen)12, (
ftnlen)12);
/* Copy diagonal and off-diagonal elements of B back into A */
if (*m >= *n) {
i__3 = i__ + nb - 1;
for (j = i__; j <= i__3; ++j) {
a[j + j * a_dim1] = d__[j];
a[j + (j + 1) * a_dim1] = e[j];
/* L10: */
}
} else {
i__3 = i__ + nb - 1;
for (j = i__; j <= i__3; ++j) {
a[j + j * a_dim1] = d__[j];
a[j + 1 + j * a_dim1] = e[j];
/* L20: */
}
}
/* L30: */
}
/* Use unblocked code to reduce the remainder of the matrix */
i__2 = *m - i__ + 1;
i__1 = *n - i__ + 1;
dgebd2_(&i__2, &i__1, &a[i__ + i__ * a_dim1], lda, &d__[i__], &e[i__], &
tauq[i__], &taup[i__], &work[1], &iinfo);
work[1] = ws;
return 0;
/* End of DGEBRD */
} /* dgebrd_ */
/*
* Assign samples to the procedures to which they belong.
*
* There are three cases as to where pcl and pch can be
* with respect to the routine entry addresses svalue0 and svalue1
* as shown in the following diagram. overlap computes the
* distance between the arrows, the fraction of the sample
* that is to be credited to the routine which starts at svalue0.
*
* svalue0 svalue1
* | |
* v v
*
* +-----------------------------------------------+
* | |
* | ->| |<- ->| |<- ->| |<- |
* | | | | | |
* +---------+ +---------+ +---------+
*
* ^ ^ ^ ^ ^ ^
* | | | | | |
* pcl pch pcl pch pcl pch
*
* For the vax we assert that samples will never fall in the first
* two bytes of any routine, since that is the entry mask,
* thus we give call alignentries() to adjust the entry points if
* the entry mask falls in one bucket but the code for the routine
* doesn't start until the next bucket. In conjunction with the
* alignment of routine addresses, this should allow us to have
* only one sample for every four bytes of text space and never
* have any overlap (the two end cases, above).
*/
asgnsamples(void)
{
int j;
UNIT ccnt;
double time;
unsigned long pcl, pch;
int i;
unsigned long overlap;
unsigned long svalue0, svalue1;
/* read samples and assign to namelist symbols */
scale = highpc - lowpc;
scale /= nsamples;
alignentries();
for (i = 0, j = 1; i < nsamples; i++) {
ccnt = samples[i];
if (ccnt == 0)
continue;
pcl = lowpc + (unsigned long)(scale * i);
pch = lowpc + (unsigned long)(scale * (i + 1));
time = ccnt;
# ifdef DEBUG
if ( debug & SAMPLEDEBUG ) {
printf( "[asgnsamples] pcl 0x%x pch 0x%x ccnt %d\n" ,
pcl , pch , ccnt );
}
# endif /* DEBUG */
totime += time;
for (j = j - 1; j < nname; j++) {
svalue0 = nl[j].svalue;
svalue1 = nl[j+1].svalue;
/*
* if high end of tick is below entry address,
* go for next tick.
*/
if (pch < svalue0)
break;
/*
* if low end of tick into next routine,
* go for next routine.
*/
if (pcl >= svalue1)
continue;
overlap = min(pch, svalue1) - max(pcl, svalue0);
if (overlap > 0) {
# ifdef DEBUG
if (debug & SAMPLEDEBUG) {
printf("[asgnsamples] (0x%x->0x%x-0x%x) %s gets %f ticks %d overlap\n",
nl[j].value/sizeof(UNIT), svalue0, svalue1,
nl[j].name,
overlap * time / scale, overlap);
}
# endif /* DEBUG */
nl[j].time += overlap * time / scale;
}
}
}
# ifdef DEBUG
if (debug & SAMPLEDEBUG) {
printf("[asgnsamples] totime %f\n", totime);
}
# endif /* DEBUG */
}
/**
* Read data from the file.
*
* Read len bytes from the current seek position in the file, into the
* buffer. On each invocation to read, the seek position of the file
* handle is incremented atomically, by the number of bytes returned.
*
* @param fd File handle, obtained with open()
* @param buffer to store data
* @param size number of bytes to read
* @return number of bytes read on success, MICROBIT_NOT_SUPPORTED if the file
* system is not initialised, or this file was not opened with the
* MB_READ flag set, MICROBIT_INVALID_PARAMETER if the given file handle
* is invalid.
*
* @code
* MicroBitFileSystem f;
* int fd = f.open("read.txt", MB_READ);
* if(f.read(fd, buffer, 100) != 100)
* print("read error");
* @endcode
*/
int MicroBitFileSystem::read(int fd, uint8_t* buffer, int size)
{
FileDescriptor *file;
uint16_t block;
uint8_t *readPointer;
uint8_t *writePointer;
uint32_t offset;
uint32_t position = 0;
int bytesCopied = 0;
int segmentLength;
// Protect against accidental re-initialisation
if ((status & MBFS_STATUS_INITIALISED) == 0)
return MICROBIT_NOT_SUPPORTED;
// Ensure the file is open.
file = getFileDescriptor(fd);
if (file == NULL || buffer == NULL || size == 0)
return MICROBIT_INVALID_PARAMETER;
// Flush any data in the writeback cache before we change the seek pointer.
writeBack(file);
// Validate the read length.
size = min(size, file->length - file->seek);
// Find the read position.
block = file->dirent->first_block;
// Walk the file table until we reach the start block
while (file->seek - position > MBFS_BLOCK_SIZE)
{
block = getNextFileBlock(block);
position += MBFS_BLOCK_SIZE;
}
// Once we have the correct start block, handle the byte offset.
offset = file->seek - position;
// Now, start copying bytes into the requested buffer.
writePointer = buffer;
while (bytesCopied < size)
{
// First, determine if we need to write a partial block.
readPointer = (uint8_t *)getBlock(block) + offset;
segmentLength = min(size - bytesCopied, MBFS_BLOCK_SIZE - offset);
if(segmentLength > 0)
memcpy(writePointer, readPointer, segmentLength);
bytesCopied += segmentLength;
writePointer += segmentLength;
offset += segmentLength;
if (offset == MBFS_BLOCK_SIZE)
{
block = getNextFileBlock(block);
offset = 0;
}
}
file->seek += bytesCopied;
return bytesCopied;
}
// `J` Job Brothel - Sleazy Bar
bool cJobManager::WorkSleazyWaitress(sGirl* girl, sBrothel* brothel, bool Day0Night1, string& summary)
{
int actiontype = ACTION_WORKCLUB;
stringstream ss; string girlName = girl->m_Realname; ss << girlName;
if (g_Girls.DisobeyCheck(girl, actiontype, brothel))
{
ss << " refused to work during the " << (Day0Night1 ? "night" : "day") << " shift.";
girl->m_Events.AddMessage(ss.str(), IMGTYPE_PROFILE, EVENT_NOWORK);
return true;
}
ss << " worked as a waitress in the strip club.\n\n";
g_Girls.UnequipCombat(girl); // put that shit away, you'll scare off the customers!
int imagetype = IMGTYPE_ECCHI;
sGirl* barmaidonduty = g_Brothels.GetRandomGirlOnJob(0, JOB_SLEAZYBARMAID, Day0Night1);
string barmaidname = (barmaidonduty ? "Barmaid " + barmaidonduty->m_Realname + "" : "the Barmaid");
int roll = g_Dice.d100(), roll_d = g_Dice.d100();
double wages = 25, tips = 0;
int work = 0, anal = 0, health = 0, happy = 0, oral = 0, hand = 0;
double jobperformance = JP_SleazyWaitress(girl, false);
// `CRAZY`
/*default*/ int dick_type = 1; string dick_type_text = "normal sized";
/* */if (roll_d <= 10) { dick_type = 2; dick_type_text = "huge"; }
else if (roll_d >= 90) { dick_type = 0; dick_type_text = "small"; }
if (jobperformance >= 245)
{
ss << " She must be the perfect waitress customers go on and on about her and always come to see her when she works.\n\n";
wages += 155;
}
else if (jobperformance >= 185)
{
ss << " She's unbelievable at this and is always getting praised by the customers for her work.\n\n";
wages += 95;
}
else if (jobperformance >= 135)
{
ss << " She's good at this job and gets praised by the customers often.\n\n";
wages += 55;
}
else if (jobperformance >= 85)
{
ss << " She made a few mistakes but overall she is okay at this.\n\n";
wages += 15;
}
else if (jobperformance >= 70)
{
ss << " She was nervous and made a few mistakes. She isn't that good at this.\n\n";
wages -= 5;
}
else
{
ss << " She was nervous and constantly making mistakes. She really isn't very good at this job.\n\n";
wages -= 15;
}
//base tips, aprox 10-20% of base wages
tips += (((10 + jobperformance / 22) * wages) / 100);
//try and add randomness here
if (g_Girls.GetStat(girl, STAT_BEAUTY) > 85 && g_Dice.percent(20))
{
ss << "Stunned by her beauty a customer left her a great tip.\n\n"; tips += 25;
}
if (g_Girls.HasTrait(girl, "Clumsy") && g_Dice.percent(15))
{
ss << "Her clumsy nature cause her to spill food on a customer resulting in them storming off without paying.\n"; wages -= 25;
}
if (g_Girls.HasTrait(girl, "Pessimist") && g_Dice.percent(5))
{
if (jobperformance < 125)
{
ss << "Her pessimistic mood depressed the customers making them tip less.\n"; tips -= 10;
}
else
{
ss << girlName << " was in a poor mood so the patrons gave her a bigger tip to try and cheer her up.\n"; tips += 10;
}
}
if (g_Girls.HasTrait(girl, "Optimist") && g_Dice.percent(5))
{
if (jobperformance < 125)
{
ss << girlName << " was in a cheerful mood but the patrons thought she needed to work more on her services.\n"; tips -= 10;
}
else
{
ss << "Her optimistic mood made patrons cheer up increasing the amount they tip.\n"; tips += 10;
}
}
if (g_Girls.HasTrait(girl, "Great Arse") && g_Dice.percent(15))
{
if (jobperformance >= 185) //great
{
ss << "A patron reached out to grab her ass. But she skillfully avoided it";
if (g_Girls.GetStat(girl, STAT_LIBIDO) > 70 && !g_Girls.HasTrait(girl, "Lesbian"))
{
ss << " and said that's only on the menu if your willing to pay up. He jumped at the chance to get to try her ass out and bent her over the table and whiping out his " << dick_type_text << " dick.";
wages += g_Girls.GetStat(girl, STAT_ASKPRICE) + 50;
imagetype = IMGTYPE_ANAL;
g_Girls.UpdateStatTemp(girl, STAT_LIBIDO, -20);
if (roll_d >= 90)//small
{
if (g_Girls.GetSkill(girl, SKILL_ANAL) >= 70)
{
ss << " It slide right in her well trained ass with no problems."; anal += 1;
if (g_Girls.HasTrait(girl, "Fast O*****s"))
{
ss << " Thankfully she is fast to o*****s or she wouldn't have got much out of this.\n";
}
else if (g_Girls.HasTrait(girl, "Slow O*****s"))
{
ss << " She got nothing out of this as his dick was to small and its hard to get her off anyway.\n";
}
else
{
ss << " She slightly enjoyed herself.\n";
}
}
else if (g_Girls.GetSkill(girl, SKILL_ANAL) >= 40)
{
ss << " It slide into her ass with little trouble as she is slight trained in the anal arts."; anal += 2;
if (g_Girls.HasTrait(girl, "Fast O*****s"))
{
ss << " She was able to get off on his small c**k a few times thanks to her fast o****m ability.\n";
}
else if (g_Girls.HasTrait(girl, "Slow O*****s"))
{
ss << " Didn't get much out of his small c**k as she is so slow to o****m.\n";
}
else
{
ss << " Enjoyed his small c**k even if she didn't get off.\n";
}
}
else
{
ss << " Despite the fact that it was small it was still a tight fit in her inexperienced ass."; anal += 3;
if (g_Girls.HasTrait(girl, "Fast O*****s"))
{
ss << " Her lack of skill at anal and the fact that she is fast to o****m she had a great time even with the small c**k.\n";
}
else if (g_Girls.HasTrait(girl, "Slow O*****s"))
{
ss << " Her tight ass help her get off on the small c**k even though it is hard for her to get off.\n";
}
else
{
ss << " Her tight ass help her get off on his small c**k.\n";
}
}
}
else if (roll_d <= 10)//huge
{
if (g_Girls.GetSkill(girl, SKILL_ANAL) >= 70)
{
ss << " Her well trained ass was able to take the huge dick with little trouble."; anal += 3;
if (g_Girls.HasTrait(girl, "Fast O*****s"))
{
ss << " She orgasmed over and over on his huge c**k and when he finally finished she was left a gasping for air in a state of ecstasy.\n";
}
else if (g_Girls.HasTrait(girl, "Slow O*****s"))
{
ss << " Despite the fact that she is slow to o****m his huge c**k still got her off many times before he was finished with her.\n";
}
else
{
ss << " She orgasmed many times and loved every inch of his huge dick.\n";
}
}
else if (g_Girls.GetSkill(girl, SKILL_ANAL) >= 40)
{
if (g_Girls.HasItemJ(girl, "Booty Lube") != -1 && g_Girls.GetStat(girl, STAT_INTELLIGENCE) >= 60)
{
ss << " Upon seeing his huge dick she grabbed her Booty Lube and lubed up so that it could fit in easier."; anal += 3;
if (g_Girls.HasTrait(girl, "Fast O*****s"))
{
ss << " With the help of her Booty Lube she was able to enjoy every inch of his huge dick and orgasmed many times. When he was done she was left shacking with pleasure.\n";
}
else if (g_Girls.HasTrait(girl, "Slow O*****s"))
{
ss << " With the help of her Booty Lube and despite the fact that she is slow to o****m his huge c**k still got her off many times before he was finished with her.\n";
}
else
{
ss << " With the help of her Booty Lube she was able to o****m many times and loved every inch of his huge dick.\n";
}
}
else
{
ss << " Her slighted trained ass was able to take the huge dick with only a little pain at the start."; anal += 2;
if (g_Girls.HasTrait(girl, "Fast O*****s"))
{
ss << " After a few minutes of letting her ass get used to his big c**k she was finally able to enjoy it and orgasmed many times screaming in pleasure.\n";
}
else if (g_Girls.HasTrait(girl, "Slow O*****s"))
{
ss << " After a few minutes of letting her ass get used to his big c**k she was able to o****m.\n";
}
else
{
ss << " After a few minutes of letting her ass get used to his big c**k she was able to take the whole thing and orgasmed a few times.\n";
}
}
}
else
{
if (g_Girls.HasItemJ(girl, "Booty Lube") != -1 && g_Girls.GetStat(girl, STAT_INTELLIGENCE) >= 60)
{
ss << " Upon seeing his huge dick she grabbed her Booty Lube and lubed up so that it could fit in her tight ass easier."; anal += 3;
if (g_Girls.HasTrait(girl, "Fast O*****s"))
{
ss << " Luck for her she had her Booty Lube and was able to enjoy his big dick and orgasmed many times.\n";
}
else if (g_Girls.HasTrait(girl, "Slow O*****s"))
{
ss << " Luck for her she had her Booty Lube and was able to enjoy his big dick and orgasmed one time.\n";
}
else
{
ss << " Luck for her she had her Booty Lube and was able to enjoy his big dick and orgasmed a few times.\n";
}
}
else
{
ss << " She screamed in pain as he stuffed his huge dick in her tight ass.\n"; anal += 1;
if (g_Girls.HasTrait(girl, "Fast O*****s"))
{
ss << " She was able to get some joy out of it in the end as she is fast to o****m.\n";
}
else
{
ss << " It was nothing but a painful experience for her. He finished up and left her crying his huge dick was just to much for her tight ass.\n";
}
}
}
}
else//normal
{
if (g_Girls.GetSkill(girl, SKILL_ANAL) >= 70)
{
ss << " It slide right in her well trained ass."; anal += 2;
if (g_Girls.HasTrait(girl, "Fast O*****s"))
{
ss << " She was able to get off a few times as she is fast to o****m.\n";
}
else if (g_Girls.HasTrait(girl, "Slow O*****s"))
{
ss << " She was getting close to done when he pulled out and shot his wade all over her back. Its to bad she is slow to o****m.\n";
}
else
{
ss << " She was able to get off by the end.\n";
}
}
else if (g_Girls.GetSkill(girl, SKILL_ANAL) >= 40)
{
ss << " It was a good fit for her slightly trained ass."; anal += 3;
if (g_Girls.HasTrait(girl, "Fast O*****s"))
{
ss << " His c**k being a good fit for her ass she was able to o****m many times and was screaming in pleasure before to long.\n";
}
else if (g_Girls.HasTrait(girl, "Slow O*****s"))
{
ss << " His c**k being a good fit for her ass he was able to bring her to o****m if a bit slowly.\n";
}
else
{
ss << " His c**k being a good fit for her ass she orgasmed a few times. When he was done she was left with a smile on her face.\n";
}
}
else
{
if (g_Girls.HasItemJ(girl, "Booty Lube") != -1 && g_Girls.GetStat(girl, STAT_INTELLIGENCE) >= 60)
{
ss << " Upon seeing his dick she grabbed her Booty Lube and lubed up so that it could fit in her tight ass easier."; anal += 3;
if (g_Girls.HasTrait(girl, "Fast O*****s"))
{
ss << " Thanks to her lube she was able to enjoy it much faster and reached o****m a few times.\n";
}
else if (g_Girls.HasTrait(girl, "Slow O*****s"))
{
ss << " Thanks to her lube she was able to enjoy it much faster and was able to o****m.\n";
}
else
{
ss << " Thanks to her lube she was able to enjoy it much faster and reached o****m a few times.\n";
}
}
else
{
ss << " Despite the fact that it was normal sized it was still a very tight fit in her inexperienced ass."; anal += 2;
if (g_Girls.HasTrait(girl, "Fast O*****s"))
{
ss << " It was slightly painful at first but after a few minutes it wasn't a problem and she was able to o****m.\n";
}
else if (g_Girls.HasTrait(girl, "Slow O*****s"))
{
ss << " It was slightly painful at first but after a few minutes it wasn't a problem. But she wasn't able to o****m in the end.\n";
}
else
{
ss << " It was slightly painful at first but after a few minutes it wasn't a problem she enjoyed it in the end.\n";
}
}
}
}
}
else
{
ss << " and with a laugh and told him that her ass wasn't on the menu. He laughed so hard he increased her tip!\n"; tips += 25;
}
}
else if (jobperformance >= 135) //decent or good
{
ss << "A patron reached out and grabbed her ass. She's use to this and skilled enough so she didn't drop anything.\n";
}
else if (jobperformance >= 85) //bad
{
ss << "A patron reached out and grabbed her ass. She was startled and ended up dropping half an order.\n"; wages -= 10;
}
else //very bad
{
ss << "A patron reached out and grabbed her ass. She was startled and ended up dropping a whole order\n"; wages -= 15;
}
}
if (g_Girls.HasTrait(girl, "Great Figure") && g_Dice.percent(25))
{
if (jobperformance < 125)
{
ss << girlName << "'s amazing figure wasn't enough to keep the patrons happy when her service was so bad.\n"; tips -= 10;
}
else
{
ss << "Not only does she have an amazing figure but she is also an amazing waitress the patrons really love her and her tips prove it.\n"; tips += 20;
}
}
if ((g_Girls.HasTrait(girl, "Meek") || g_Girls.HasTrait(girl, "Shy")) && g_Dice.percent(5))
{
ss << girlName << " was taking an order from a rather rude patron when he decide to grope her. She isn't the kind of girl to resist this and had a bad day at work because of this.\n";
work -= 5;
}
if (g_Girls.HasTrait(girl, "Nymphomaniac") && !g_Girls.HasTrait(girl, "Lesbian") && g_Girls.GetStat(girl, STAT_LIBIDO) > 90 && g_Girls.GetSkill(girl, SKILL_ORALSEX) > 80 && g_Dice.percent(25))
{
ss << girlName << " thought she deserved a short break and disappeared under one of the tables when nobody was looking, in order to give one of the clients a b*****b. Kneeling under the table, she devoured his c**k with ease and deepthroated him as he came to make sure she didn't make a mess. The client himself was wasted out of his mind and didn't catch as much as a glimpse of her, but he left the locale with a big tip on the table.\n";
tips += 50;
imagetype = IMGTYPE_ORAL;
oral += 2;
g_Girls.UpdateStatTemp(girl, STAT_LIBIDO, -20);
}
if (g_Girls.HasTrait(girl, "Nymphomaniac") && !g_Girls.HasTrait(girl, "Lesbian") && g_Girls.GetStat(girl, STAT_LIBIDO) > 90 && g_Girls.GetSkill(girl, SKILL_HANDJOB) > 80 && g_Dice.percent(25))
{
ss << "During her shift, " << girlName << " unnoticeably dived under the table belonging to a lonely-looking fellow, quickly unzipped his pants and started jacking him off enthusiastically. She skillfully wiped herself when he came all over her face. The whole event took no longer than two minutes, but was well worth the time spent on it, since the patron left with a heavy tip.\n";
tips += 50;
imagetype = IMGTYPE_HAND;
hand += 2;
g_Girls.UpdateStatTemp(girl, STAT_LIBIDO, -20);
}
if (g_Girls.GetStat(girl, STAT_DIGNITY) <= -20 && g_Dice.percent(20))
{
if (roll <= 50) //I'm not sure if it's ok so I won't touch it
{
ss << "During her shift, " << girlName << " deliberately dropped the pen she uses to write down orders in front of one of the customers. Exploiting her skimpy outfit, she made sure to bend over to pick it up in a way that allowed her to directly flash her butt on the sitting client's eye level. This earned her an extra tip.\n"; tips += 20;
}
else
{
ss << "An inebriated patron said half-jokingly to " << girlName << " that he'll leave a heavy tip if she takes his order while sitting on his lap. Much to his surprise, " << girlName << " was almost too eager to comply, sitting directly on his crotch instead, making sure to grind her butt into it. The customer lived up to his word and " << girlName << " left the table with some extra cash.\n"; tips += 30;
}
}
if (g_Girls.GetStat(girl, STAT_DIGNITY) <= -20 && g_Dice.percent(20) && (g_Girls.HasTrait(girl, "Big Boobs") || g_Girls.HasTrait(girl, "Giant Juggs") || g_Girls.HasTrait(girl, "Massive Melons") || g_Girls.HasTrait(girl, "Abnormally Large Boobs") || g_Girls.HasTrait(girl, "Titanic T**s"))) //updated for the new breast traits
{
ss << "A drunk patron \"accidentally\" fell onto " << girlName << " and buried his face between her breasts. To his joy and surprise, " << girlName << " flirtatiously encouraged him to motorboat them for awhile, which he gladly did, before slipping some cash between the titties and staggering out on his way.\n"; tips += 40;
}
if (g_Girls.HasTrait(girl, "Futanari") && g_Girls.GetStat(girl, STAT_LIBIDO) > 80 && g_Dice.percent(5))
{
if (g_Girls.HasTrait(girl, "Open Minded") || g_Girls.GetStat(girl, STAT_CONFIDENCE) > 35 && g_Girls.GetStat(girl, STAT_DIGNITY) < 35)
{
ss << "Noticing the bulge under her skirt one of the customers asked for a very special service: He wanted some \"cream\" in his drink. " << girlName << " took her already hard c**k out and sprinkled the drink with some of her j**z. The customer thanked her and slipped a good tip under her panties.\n";
g_Girls.UpdateSkill(girl, SKILL_SERVICE, 2);
g_Girls.UpdateStatTemp(girl, STAT_LIBIDO, -30);
tips += 30 + (g_Girls.GetSkill(girl, SKILL_SERVICE) / 5); //Not sure if this will work fine
imagetype = IMGTYPE_MAST;
}
else
{
ss << "Noticing the bulge under her skirt one of the customers asked " << girlName << " to spill some of her \"cream\" in his drink, but she refused, blushing.\n";
}
}
if (g_Brothels.GetNumGirlsOnJob(0, JOB_SLEAZYBARMAID, false) >= 1 && g_Dice.percent(25))
{
if (jobperformance > 100)
{
ss << "\nWith the help from " << barmaidname << " " << girlName << " provided a better service to the customers, increasing her tips.\n";
tips *= 1.2;
}
}
else
{
ss << "\n" << girlName << " had a hard time attending all the customers without the help of a barmaid.\n";
tips *= 0.9;
}
if (wages < 0)
wages = 0;
if (tips < 0)
tips = 0;
//enjoyed the work or not
if (roll <= 5)
{
ss << "\nSome of the patrons abused her during the shift."; work -= 1;
}
else if (roll <= 25)
{
ss << "\nShe had a pleasant time working."; work += 3;
}
else
{
ss << "\nOtherwise, the shift passed uneventfully."; work += 1;
}
g_Girls.UpdateSkill(girl, SKILL_ORALSEX, oral);
g_Girls.UpdateSkill(girl, SKILL_HANDJOB, hand);
g_Girls.UpdateSkill(girl, SKILL_ANAL, anal);
g_Girls.UpdateEnjoyment(girl, ACTION_WORKCLUB, work);
girl->m_Events.AddMessage(ss.str(), imagetype, Day0Night1);
int roll_max = (g_Girls.GetStat(girl, STAT_BEAUTY) + g_Girls.GetStat(girl, STAT_CHARISMA));
roll_max /= 4;
wages += 10 + g_Dice%roll_max;
girl->m_Pay = (int)wages;
girl->m_Tips = (int)tips;
// Improve stats
int xp = 15, libido = 1, skill = 3;
if (g_Girls.HasTrait(girl, "Quick Learner")) { skill += 1; xp += 3; }
else if (g_Girls.HasTrait(girl, "Slow Learner")) { skill -= 1; xp -= 3; }
if (g_Girls.HasTrait(girl, "Nymphomaniac")) { libido += 2; }
if (!g_Girls.HasTrait(girl, "Straight")) { libido += min(3, g_Brothels.GetNumGirlsOnJob(0, JOB_BARSTRIPPER, false)); }
g_Girls.UpdateStat(girl, STAT_FAME, 1);
g_Girls.UpdateStat(girl, STAT_EXP, xp);
g_Girls.UpdateSkill(girl, SKILL_PERFORMANCE, g_Dice%skill);
g_Girls.UpdateSkill(girl, SKILL_SERVICE, g_Dice%skill + 1);
g_Girls.UpdateStatTemp(girl, STAT_LIBIDO, libido);
//gained traits
g_Girls.PossiblyGainNewTrait(girl, "Charming", 70, ACTION_WORKCLUB, girlName + " has been flirting with customers to try to get better tips. Enough practice at it has made her quite Charming.", Day0Night1);
if (jobperformance > 150 && g_Girls.GetStat(girl, STAT_CONSTITUTION) > 65) { g_Girls.PossiblyGainNewTrait(girl, "Fleet of Foot", 60, ACTION_WORKCLUB, girlName + " has been dodging between tables and avoiding running into customers for so long she has become Fleet Of Foot.", Day0Night1); }
//lose traits
g_Girls.PossiblyLoseExistingTrait(girl, "Clumsy", 30, ACTION_WORKCLUB, "It took her breaking hundreds of dishes, and just as many reprimands, but " + girlName + " has finally stopped being so Clumsy.", Day0Night1);
return false;
}