1
0
Fork 0
mirror of https://gitlab.com/sortix/sortix.git synced 2023-02-13 20:55:38 -05:00
sortix--sortix/sortix/descriptors.cpp
2011-11-17 10:22:43 +01:00

138 lines
3.1 KiB
C++

/******************************************************************************
COPYRIGHT(C) JONAS 'SORTIE' TERMANSEN 2011.
This file is part of Sortix.
Sortix is free software: you can redistribute it and/or modify it under the
terms of the GNU General Public License as published by the Free Software
Foundation, either version 3 of the License, or (at your option) any later
version.
Sortix 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 General Public License for more
details.
You should have received a copy of the GNU General Public License along
with Sortix. If not, see <http://www.gnu.org/licenses/>.
descriptors.cpp
Handles file descriptors, socket descriptors, and whatnot for each process.
******************************************************************************/
#include "platform.h"
#include <libmaxsi/memory.h>
#include "descriptors.h"
#include "device.h"
using namespace Maxsi;
namespace Sortix
{
// When in doubt use brute-force. This class could easily be optimized.
Device* const reserveddevideptr = (Device*) 0x1UL;
DescriptorTable::DescriptorTable()
{
numdevices = 0;
devices = NULL;
}
DescriptorTable::~DescriptorTable()
{
for ( int i = 0; i < numdevices; i++ )
{
if ( devices[i] == NULL || devices[i] == reserveddevideptr ) { continue; }
// TODO: unref any device here!
}
delete[] devices;
}
int DescriptorTable::Allocate(Device* object)
{
for ( int i = 0; i < numdevices; i++ )
{
if ( devices[i] == NULL )
{
object->Refer();
devices[i] = object;
return i;
}
}
int newlistlength = numdevices*2;
if ( newlistlength == 0 ) { newlistlength = 8; }
Device** newlist = new Device*[newlistlength];
if ( newlist == NULL ) { return -1; }
if ( devices != NULL )
{
Memory::Copy(newlist, devices, sizeof(Device*) * numdevices);
}
Memory::Set(newlist + numdevices, 0, sizeof(Device*) * (newlistlength-numdevices));
delete[] devices;
devices = newlist;
numdevices = newlistlength;
return Allocate(object);
}
void DescriptorTable::Free(int index)
{
ASSERT(index < numdevices);
ASSERT(devices[index] != NULL);
if ( devices[index] != reserveddevideptr )
{
devices[index]->Unref();
}
devices[index] = NULL;
}
int DescriptorTable::Reserve()
{
return Allocate(reserveddevideptr);
}
void DescriptorTable::UseReservation(int index, Device* object)
{
ASSERT(index < index);
ASSERT(devices[index] != NULL);
ASSERT(devices[index] == reserveddevideptr);
object->Refer();
devices[index] = object;
}
bool DescriptorTable::Fork(DescriptorTable* forkinto)
{
Device** newlist = new Device*[numdevices];
if ( newlist == NULL ) { return false; }
for ( int i = 0; i < numdevices; i++ )
{
// TODO: Possibly deal with a potential O_CLOFORK!
newlist[i] = devices[i];
if ( !devices[i] ) { continue; }
if ( devices[i] == reserveddevideptr ) { continue; }
newlist[i]->Refer();
}
ASSERT(forkinto->devices == NULL);
forkinto->devices = newlist;
forkinto->numdevices = numdevices;
return true;
}
}