Category : OS/2 Files
Archive   : GPPDEV8F.ZIP
Filename : MPLEX.CCP
/*
Copyright (C) 1988 Free Software Foundation
written by Doug Lea ([email protected])
based on code by Marc Shapiro ([email protected])
This file is part of the GNU C++ Library. This library is free
software; you can redistribute it and/or modify it under the terms of
the GNU Library General Public License as published by the Free
Software Foundation; either version 2 of the License, or (at your
option) any later version. This library is distributed in the hope
that it will be useful, but WITHOUT ANY WARRANTY; without even the
implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the GNU Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this library; if not, write to the Free Software
Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#ifdef __GNUG__
#pragma implementation
#endif
#include "
//
int baseidx,
int lowidx,
int fenceidx,
int topidx)
:
{
unused = fence - low;
unsigned msize = (top - base)/_MAP_BITS + 1;
map = (unsigned long *) (new long[msize]);
bzero((void*)map, msize * sizeof(long));
}
void
{
if (fence <= low) empty_error();
--fence;
if (!valid(fence))
--unused;
else
free(fence);
reset_high();
}
void
{
if (fence <= low) empty_error();
if (!valid(low))
--unused;
else
free(low);
++low;
reset_low();
}
void
{
int s = top - base;
low = base = fence = lo;
top = base + s;
unused = 0;
bzero((void*)map, ((top - base)/_MAP_BITS + 1) * sizeof(long));
}
void
{
int s = top - base;
low = top = fence = hi;
base = top - s;
unused = 0;
bzero((void*)map, ((top - base)/_MAP_BITS + 1) * sizeof(long));
}
int
{
if (idx < low || idx >= fence) index_error();
int v = valid(idx);
if (v)
{
free(idx);
++unused;
}
return v;
}
int
{
if (idx < low || idx >= fence) index_error();
int v = valid(idx);
if (!v)
{
mark(idx);
--unused;
}
return v;
}
int
{
if (unused_indices() == 0) index_error();
int slot;
if (low == base) // can traverse 32 slots at a time
{
int blk = 0;
while (map[blk] == ~0L) ++blk;
slot = blk * _MAP_BITS + base;
}
else
slot = low;
while(valid(slot)) ++slot;
return slot;
}
int
{
if (empty()) return fence;
int slot;
if (low == base)
{
int blk = 0;
while (map[blk] == 0) ++blk;
slot = blk * _MAP_BITS + base;
}
else
slot = low;
while(!valid(slot)) ++slot;
return slot;
}
int
{
if (empty()) return low - 1;
int slot;
if (top == fence)
{
int blk = (top - base) / _MAP_BITS;
while (map[blk] == 0) --blk;
slot = blk * _MAP_BITS + base + _MAP_BITS - 1;
}
else
slot = fence - 1;
while(!valid(slot)) --slot;
return slot;
}
int
{
int v = data != 0; // have some data
v &= map != 0; // and a map
v &= base <= low; // ok, index-wise
v &= low <= fence;
v &= fence <= top;
v &= ((
v &= ((
int bitcount = 0; // and unused count correct
for (int i = low; i < fence; ++i) if (!valid(i)) ++bitcount;
v &= unused == bitcount;
if (!v) error("invariant failure");
return(v);
}
{
int i = ((int) p - (int) data) / sizeof(
if (p == 0 || i < low) return 0;
while (i < fence && !valid(i)) ++i;
if (i >= fence) return 0;
return pointer_to(i);
}
{
int i = ((int) p - (int) data) / sizeof(
if (p == 0 || i >= fence) return 0;
while (i >= low && !valid(i)) --i;
if (i < low) return 0;
return pointer_to(i);
}
{
if (empty()) return 0;
int slot;
if (low == base)
{
int blk = 0;
while (map[blk] == 0) ++blk;
slot = blk * _MAP_BITS + base;
}
else
slot = low;
while(!valid(slot)) ++slot;
return pointer_to(slot);
}
{
if (empty()) return 0;
int slot;
if (top == fence)
{
int blk = (top - base) / _MAP_BITS;
while (map[blk] == 0) --blk;
slot = blk * _MAP_BITS + base + _MAP_BITS - 1;
}
else
slot = fence - 1;
while(!valid(slot)) --slot;
return pointer_to(slot);
}
{
unused = 0;
lo = fnc = 0;
csize = DEFAULT_INITIAL_CAPACITY;
hd = ch = new
}
{
if (chunksize == 0) error("invalid constructor specification");
unused = 0;
lo = fnc = 0;
if (chunksize > 0)
{
csize = chunksize;
hd = ch = new
}
else
{
csize = -chunksize;
hd = ch = new
}
}
{
if (chunksize == 0) error("invalid constructor specification");
unused = 0;
lo = fnc = l;
if (chunksize > 0)
{
csize = chunksize;
hd = ch = new
}
else
{
csize = -chunksize;
hd = ch = new
}
}
void
{
int need = fnc - lo;
hd = 0;
if (up)
{
int l = lo;
do
{
int sz;
if (need >= csize)
sz = csize;
else
sz = need;
if (hd != 0)
h->link_to_next(hd);
else
hd = h;
l += sz;
need -= sz;
} while (need > 0);
}
else
{
int hi = fnc;
do
{
int sz;
if (need >= csize)
sz = csize;
else
sz = need;
if (hd != 0)
h->link_to_next(hd);
hd = h;
hi -= sz;
need -= sz;
} while (need > 0);
}
ch = (
}
{
lo = l;
fnc = hi + 1;
if (chunksize == 0)
{
csize = fnc - l;
make_initial_chunks(1);
}
else if (chunksize < 0)
{
csize = -chunksize;
make_initial_chunks(0);
}
else
{
csize = chunksize;
make_initial_chunks(1);
}
unused = fnc - lo;
for (int i=lo; i
fill(initval);
}
{
lo = a.lo;
fnc = a.fnc;
csize = a.csize;
unused = fnc - lo;
hd = 0;
const
do
{
p->low_index(), p->fence_index(), p->top_index());
if (hd != 0)
h->link_to_next(hd);
else
hd = h;
p = p->next();
} while (p != a.hd);
ch = (
for (int i = a.low(); i < a.fence(); a.next(i))
{
undel_index(i);
(*this)[i] = a[i];
}
}
void
{
if (&a != this)
{
invalidate();
lo = a.lo;
fnc = a.fnc;
csize = a.csize;
unused = fnc - lo;
hd = 0;
const
do
{
p->low_index(), p->fence_index(),
p->top_index());
if (hd != 0)
h->link_to_next(hd);
else
hd = h;
p = p->next();
} while (p != a.hd);
ch = (
for (int i = a.low(); i < a.fence(); a.next(i))
{
undel_index(i);
(*this)[i] = a[i];
}
}
}
int
{
const
const
while (idx >= t->fence_index())
{
if (t == tail) return 0;
t = ((
}
while (idx < t->low_index())
{
if (t == (
t = ((
}
set_cache(t);
return t->
}
void
{
const
const
while (idx >= t->fence_index())
{
if (t == tail) index_error();
t = ((
}
while (idx < t->low_index())
{
if (t == (
t = ((
}
if (!t->
set_cache(t);
}
void
{
const
const
while (!t->actual_pointer(p))
{
t = ((
if (t == old) index_error();
}
if (!t->
set_cache(t);
}
int
{
const
const
while (!t->actual_pointer(p))
{
t = ((
if (t == old) return 0;
}
set_cache(t);
return t->
}
int
{
if (!t->can_grow_high())
{
t = (new
t->link_to_prev(tl());
}
*((t->
set_cache(t);
return fnc++;
}
int
{
if (!t->can_grow_low())
{
hd = new
hd->link_to_next(t);
t = ((
}
*((t->
set_cache(t);
return --lo;
}
void
{
// clean up tail
t->reset_high();
while (t->
{
del_chunk(t);
pred->reset_high();
t = (pred);
}
if (one_chunk())
t->reset_high();
int oldfnc = fnc;
fnc = t->fence_index();
unused -= oldfnc - fnc;
// and head..
t = ((
t->reset_low();
while (t->
{
hd = (
del_chunk(t);
t = ((
t->reset_low();
}
int oldlo = lo;
lo = t->low_index();
unused -= lo - oldlo;
set_cache(t);
}
int
{
if (empty()) empty_error();
while (t->
{
del_chunk(t);
pred->reset_high();
t = (pred);
}
t->
while (t->
{
del_chunk(t);
pred->reset_high();
t = (pred);
}
int oldfnc = fnc;
fnc = t->fence_index();
unused -= oldfnc - fnc - 1;
set_cache(t);
return fnc - 1;
}
int
{
if (empty()) empty_error();
while (t->
{
hd = (
del_chunk(t);
t = ((
t->reset_low();
}
t->
while (t->
{
hd = (
del_chunk(t);
t = ((
t->reset_low();
}
int oldlo = lo;
lo = t->low_index();
unused -= lo - oldlo - 1;
set_cache(t);
return lo;
}
int
{
if (unused == 0)
return add_high(elem);
for(
t->unused_indices() == 0;
t = (
;
int i = t->unused_index();
set_cache(t);
undel_index(i);
(*this)[i] = elem;
return i;
}
int
{
if (unused == 0) index_error();
for(
t->unused_indices() == 0;
t = (
;
set_cache(t);
return t->unused_index();
}
Pix
{
if (unused == 0) return 0;
for(
t->unused_indices() == 0;
t = (
;
set_cache(t);
return t->pointer_to(t->unused_index());
}
int
{
if (idx < lo || idx >= fnc) index_error();
if (
{
++unused;
ch->
return 1;
}
else
return 0;
}
int
{
if (idx >= fnc) idx = fnc;
if (idx <= lo) return lo - 1;
const
while (idx > t->fence_index())
{
t = ((
}
while (idx <= t->low_index())
{
t = ((
}
int i = t->
while (i < t->low_index() && i >= lo)
{
t = ((
i = t->
}
set_cache(t);
return i;
}
int
{
if (idx < lo) idx = lo;
if (idx >= fnc - 1) return fnc;
const
while (idx >= t->fence_index())
{
t = ((
}
while (idx < t->low_index())
{
t = ((
}
int i = t->
while (i >= t->fence_index() && i < fnc)
{
t = (
i = t->
}
set_cache(t);
return i;
}
void
{
if (i == 0) return;
const
const
while (!t->actual_pointer(p))
{
t = ((
if (t == old)
{
i = 0;
return;
}
}
while (q == 0 && t != (
{
t = ((
q = t->
}
i = Pix(q);
set_cache(t);
return;
}
void
{
if (i == 0) return;
const
const
const
while (!t->actual_pointer(p))
{
t = ((
if (t == old)
{
i = 0;
return;
}
}
while (q == 0 && t != tail)
{
t = ((
q = t->
}
i = Pix(q);
set_cache(t);
return;
}
void
{
if (idx < lo || idx >= fnc) index_error();
while (idx >= t->fence_index())
{
t = ((
}
while (idx < t->low_index())
{
t = ((
}
int was_present = t->
if (!was_present)
{
--unused;
}
set_cache(t);
return;
}
void
{
if (fnc != lo)
{
while (t != hd)
{
del_chunk(t);
t = prv;
}
t->
set_cache(t);
fnc = lo;
unused = 0;
}
}
int
{
int v = hd != 0; // at least one chunk
int found_ch = 0; // to make sure ch is in list;
int count = 0; // to count unused slots
const
int gap = t->low_index() - lo;
v &= gap == 0; // hd lo not less than lo.
count += gap;
for (;;)
{
if (t == ch) ++found_ch;
v &= t->
count += t->unused_indices();
if (t == (
break;
else // and has indices less than succ
{
gap = t->next()->base_index() - t->top_index();
v &= gap == 0;
count += gap;
if (t != (
v &= !t->can_grow_low() && !t->can_grow_high();
t = (const
}
}
gap = fnc - t->fence_index();
v &= gap == 0;
count += gap;
v &= count == unused; // chunk counts agree with plex
v &= found_ch == 1;
if (!v) error("invariant failure");
return v;
}
Very nice! Thank you for this wonderful archive. I wonder why I found it only now. Long live the BBS file archives!
This is so awesome! 😀 I’d be cool if you could download an entire archive of this at once, though.
But one thing that puzzles me is the “mtswslnkmcjklsdlsbdmMICROSOFT” string. There is an article about it here. It is definitely worth a read: http://www.os2museum.com/wp/mtswslnk/