2012-07-22 18:01:12 -04:00
|
|
|
/*******************************************************************************
|
|
|
|
|
2013-07-10 09:26:01 -04:00
|
|
|
Copyright(C) Jonas 'Sortie' Termansen 2011, 2012.
|
2012-07-22 18:01:12 -04:00
|
|
|
|
2013-07-10 09:26:01 -04:00
|
|
|
This file is part of Sortix.
|
2012-07-22 18:01:12 -04:00
|
|
|
|
2013-07-10 09:26:01 -04:00
|
|
|
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.
|
2012-07-22 18:01:12 -04:00
|
|
|
|
2013-07-10 09:26:01 -04:00
|
|
|
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.
|
2012-07-22 18:01:12 -04:00
|
|
|
|
2013-07-10 09:26:01 -04:00
|
|
|
You should have received a copy of the GNU General Public License along with
|
|
|
|
Sortix. If not, see <http://www.gnu.org/licenses/>.
|
2012-07-22 18:01:12 -04:00
|
|
|
|
2013-07-10 09:26:01 -04:00
|
|
|
textterminal.cpp
|
|
|
|
Translates a character stream to a 2 dimensional array of character.
|
2012-07-22 18:01:12 -04:00
|
|
|
|
|
|
|
*******************************************************************************/
|
|
|
|
|
|
|
|
#include <sortix/kernel/platform.h>
|
|
|
|
#include <sortix/kernel/refcount.h>
|
|
|
|
#include <sortix/kernel/textbuffer.h>
|
|
|
|
#include <sortix/vga.h>
|
|
|
|
#include "textterminal.h"
|
|
|
|
|
|
|
|
namespace Sortix {
|
|
|
|
|
|
|
|
const uint16_t DEFAULT_COLOR = COLOR8_LIGHT_GREY << 0U | COLOR8_BLACK << 4U;
|
|
|
|
const uint16_t ATTR_CHAR = 1U << 0U;
|
|
|
|
|
2012-08-07 18:19:44 -04:00
|
|
|
TextTerminal::TextTerminal(Ref<TextBufferHandle> textbufhandle)
|
2012-07-22 18:01:12 -04:00
|
|
|
{
|
2012-08-07 18:19:44 -04:00
|
|
|
this->textbufhandle = textbufhandle;
|
Multithreaded kernel and improvement of signal handling.
Pardon the big ass-commit, this took months to develop and debug and the
refactoring got so far that a clean merge became impossible. The good news
is that this commit does quite a bit of cleaning up and generally improves
the kernel quality.
This makes the kernel fully pre-emptive and multithreaded. This was done
by rewriting the interrupt code, the scheduler, introducing new threading
primitives, and rewriting large parts of the kernel. During the past few
commits the kernel has had its device drivers thread secured; this commit
thread secures large parts of the core kernel. There still remains some
parts of the kernel that is _not_ thread secured, but this is not a problem
at this point. Each user-space thread has an associated kernel stack that
it uses when it goes into kernel mode. This stack is by default 8 KiB since
that value works for me and is also used by Linux. Strange things tends to
happen on x86 in case of a stack overflow - there is no ideal way to catch
such a situation right now.
The system call conventions were changed, too. The %edx register is now
used to provide the errno value of the call, instead of the kernel writing
it into a registered global variable. The system call code has also been
updated to better reflect the native calling conventions: not all registers
have to be preserved. This makes system calls faster and simplifies the
assembly. In the kernel, there is no longer the event.h header or the hacky
method of 'resuming system calls' that closely resembles cooperative
multitasking. If a system call wants to block, it should just block.
The signal handling was also improved significantly. At this point, signals
cannot interrupt kernel threads (but can always interrupt user-space threads
if enabled), which introduces some problems with how a SIGINT could
interrupt a blocking read, for instance. This commit introduces and uses a
number of new primitives such as kthread_lock_mutex_signal() that attempts
to get the lock but fails if a signal is pending. In this manner, the kernel
is safer as kernel threads cannot be shut down inconveniently, but in return
for complexity as blocking operations must check they if they should fail.
Process exiting has also been refactored significantly. The _exit(2) system
call sets the exit code and sends SIGKILL to all the threads in the process.
Once all the threads have cleaned themselves up and exited, a worker thread
calls the process's LastPrayer() method that unmaps memory, deletes the
address space, notifies the parent, etc. This provides a very robust way to
terminate processes as even half-constructed processes (during a failing fork
for instance) can be gracefully terminated.
I have introduced a number of kernel threads to help avoid threading problems
and simplify kernel design. For instance, there is now a functional generic
kernel worker thread that any kernel thread can schedule jobs for. Interrupt
handlers run with interrupts off (hence they cannot call kthread_ functions
as it may deadlock the system if another thread holds the lock) therefore
they cannot use the standard kernel worker threads. Instead, they use a
special purpose interrupt worker thread that works much like the generic one
expect that interrupt handlers can safely queue work with interrupts off.
Note that this also means that interrupt handlers cannot allocate memory or
print to the kernel log/screen as such mechanisms uses locks. I'll introduce
a lock free algorithm for such cases later on.
The boot process has also changed. The original kernel init thread in
kernel.cpp creates a new bootstrap thread and becomes the system idle thread.
Note that pid=0 now means the kernel, as there is no longer a system idle
process. The bootstrap thread launches all the kernel worker threads and then
creates a new process and loads /bin/init into it and then creates a thread
in pid=1, which starts the system. The bootstrap thread then quietly waits
for pid=1 to exit after which it shuts down/reboots/panics the system.
In general, the introduction of race conditions and dead locks have forced me
to revise a lot of the design and make sure it was thread secure. Since early
parts of the kernel was quite hacky, I had to refactor such code. So it seems
that the risk of dead locks forces me to write better code.
Note that a real preemptive multithreaded kernel simplifies the construction
of blocking system calls. My hope is that this will trigger a clean up of
the filesystem code that current is almost beyond repair.
Almost all of the kernel was modified during this refactoring. To the extent
possible, these changes have been backported to older non-multithreaded
kernel, but many changes were tightly coupled and went into this commit.
Of interest is the implementation of the kthread_ api based on the design
of pthreads; this library allows easy synchronization mechanisms and
includes C++-style scoped locks. This commit also introduces new worker
threads and tested mechanisms for interrupt handlers to schedule work in a
kernel worker thread.
A lot of code have been rewritten from scratch and has become a lot more
stable and correct.
Share and enjoy!
2012-08-01 11:30:34 -04:00
|
|
|
this->termlock = KTHREAD_MUTEX_INITIALIZER;
|
2012-07-22 18:01:12 -04:00
|
|
|
Reset();
|
|
|
|
}
|
2012-09-30 07:09:25 -04:00
|
|
|
|
|
|
|
TextTerminal::~TextTerminal()
|
|
|
|
{
|
|
|
|
}
|
2012-07-22 18:01:12 -04:00
|
|
|
|
|
|
|
void TextTerminal::Reset()
|
|
|
|
{
|
|
|
|
vgacolor = DEFAULT_COLOR;
|
|
|
|
column = line = 0;
|
|
|
|
ansisavedposx = ansisavedposy = 0;
|
|
|
|
ansimode = NONE;
|
|
|
|
TextBuffer* textbuf = textbufhandle->Acquire();
|
|
|
|
TextPos fillfrom(0, 0);
|
|
|
|
TextPos fillto(textbuf->Width()-1, textbuf->Height()-1);
|
|
|
|
TextChar fillwith(' ', vgacolor);
|
|
|
|
textbuf->Fill(fillfrom, fillto, fillwith, 0);
|
|
|
|
textbuf->SetCursorEnabled(true);
|
|
|
|
UpdateCursor(textbuf);
|
|
|
|
textbufhandle->Release(textbuf);
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t TextTerminal::Print(const char* string, size_t stringlen)
|
|
|
|
{
|
Multithreaded kernel and improvement of signal handling.
Pardon the big ass-commit, this took months to develop and debug and the
refactoring got so far that a clean merge became impossible. The good news
is that this commit does quite a bit of cleaning up and generally improves
the kernel quality.
This makes the kernel fully pre-emptive and multithreaded. This was done
by rewriting the interrupt code, the scheduler, introducing new threading
primitives, and rewriting large parts of the kernel. During the past few
commits the kernel has had its device drivers thread secured; this commit
thread secures large parts of the core kernel. There still remains some
parts of the kernel that is _not_ thread secured, but this is not a problem
at this point. Each user-space thread has an associated kernel stack that
it uses when it goes into kernel mode. This stack is by default 8 KiB since
that value works for me and is also used by Linux. Strange things tends to
happen on x86 in case of a stack overflow - there is no ideal way to catch
such a situation right now.
The system call conventions were changed, too. The %edx register is now
used to provide the errno value of the call, instead of the kernel writing
it into a registered global variable. The system call code has also been
updated to better reflect the native calling conventions: not all registers
have to be preserved. This makes system calls faster and simplifies the
assembly. In the kernel, there is no longer the event.h header or the hacky
method of 'resuming system calls' that closely resembles cooperative
multitasking. If a system call wants to block, it should just block.
The signal handling was also improved significantly. At this point, signals
cannot interrupt kernel threads (but can always interrupt user-space threads
if enabled), which introduces some problems with how a SIGINT could
interrupt a blocking read, for instance. This commit introduces and uses a
number of new primitives such as kthread_lock_mutex_signal() that attempts
to get the lock but fails if a signal is pending. In this manner, the kernel
is safer as kernel threads cannot be shut down inconveniently, but in return
for complexity as blocking operations must check they if they should fail.
Process exiting has also been refactored significantly. The _exit(2) system
call sets the exit code and sends SIGKILL to all the threads in the process.
Once all the threads have cleaned themselves up and exited, a worker thread
calls the process's LastPrayer() method that unmaps memory, deletes the
address space, notifies the parent, etc. This provides a very robust way to
terminate processes as even half-constructed processes (during a failing fork
for instance) can be gracefully terminated.
I have introduced a number of kernel threads to help avoid threading problems
and simplify kernel design. For instance, there is now a functional generic
kernel worker thread that any kernel thread can schedule jobs for. Interrupt
handlers run with interrupts off (hence they cannot call kthread_ functions
as it may deadlock the system if another thread holds the lock) therefore
they cannot use the standard kernel worker threads. Instead, they use a
special purpose interrupt worker thread that works much like the generic one
expect that interrupt handlers can safely queue work with interrupts off.
Note that this also means that interrupt handlers cannot allocate memory or
print to the kernel log/screen as such mechanisms uses locks. I'll introduce
a lock free algorithm for such cases later on.
The boot process has also changed. The original kernel init thread in
kernel.cpp creates a new bootstrap thread and becomes the system idle thread.
Note that pid=0 now means the kernel, as there is no longer a system idle
process. The bootstrap thread launches all the kernel worker threads and then
creates a new process and loads /bin/init into it and then creates a thread
in pid=1, which starts the system. The bootstrap thread then quietly waits
for pid=1 to exit after which it shuts down/reboots/panics the system.
In general, the introduction of race conditions and dead locks have forced me
to revise a lot of the design and make sure it was thread secure. Since early
parts of the kernel was quite hacky, I had to refactor such code. So it seems
that the risk of dead locks forces me to write better code.
Note that a real preemptive multithreaded kernel simplifies the construction
of blocking system calls. My hope is that this will trigger a clean up of
the filesystem code that current is almost beyond repair.
Almost all of the kernel was modified during this refactoring. To the extent
possible, these changes have been backported to older non-multithreaded
kernel, but many changes were tightly coupled and went into this commit.
Of interest is the implementation of the kthread_ api based on the design
of pthreads; this library allows easy synchronization mechanisms and
includes C++-style scoped locks. This commit also introduces new worker
threads and tested mechanisms for interrupt handlers to schedule work in a
kernel worker thread.
A lot of code have been rewritten from scratch and has become a lot more
stable and correct.
Share and enjoy!
2012-08-01 11:30:34 -04:00
|
|
|
ScopedLock lock(&termlock);
|
2012-07-22 18:01:12 -04:00
|
|
|
TextBuffer* textbuf = textbufhandle->Acquire();
|
|
|
|
for ( size_t i = 0; i < stringlen; i++ )
|
|
|
|
PutChar(textbuf, string[i]);
|
|
|
|
UpdateCursor(textbuf);
|
|
|
|
textbufhandle->Release(textbuf);
|
|
|
|
return stringlen;
|
|
|
|
}
|
|
|
|
|
2012-07-24 12:43:34 -04:00
|
|
|
size_t TextTerminal::Width() const
|
|
|
|
{
|
Multithreaded kernel and improvement of signal handling.
Pardon the big ass-commit, this took months to develop and debug and the
refactoring got so far that a clean merge became impossible. The good news
is that this commit does quite a bit of cleaning up and generally improves
the kernel quality.
This makes the kernel fully pre-emptive and multithreaded. This was done
by rewriting the interrupt code, the scheduler, introducing new threading
primitives, and rewriting large parts of the kernel. During the past few
commits the kernel has had its device drivers thread secured; this commit
thread secures large parts of the core kernel. There still remains some
parts of the kernel that is _not_ thread secured, but this is not a problem
at this point. Each user-space thread has an associated kernel stack that
it uses when it goes into kernel mode. This stack is by default 8 KiB since
that value works for me and is also used by Linux. Strange things tends to
happen on x86 in case of a stack overflow - there is no ideal way to catch
such a situation right now.
The system call conventions were changed, too. The %edx register is now
used to provide the errno value of the call, instead of the kernel writing
it into a registered global variable. The system call code has also been
updated to better reflect the native calling conventions: not all registers
have to be preserved. This makes system calls faster and simplifies the
assembly. In the kernel, there is no longer the event.h header or the hacky
method of 'resuming system calls' that closely resembles cooperative
multitasking. If a system call wants to block, it should just block.
The signal handling was also improved significantly. At this point, signals
cannot interrupt kernel threads (but can always interrupt user-space threads
if enabled), which introduces some problems with how a SIGINT could
interrupt a blocking read, for instance. This commit introduces and uses a
number of new primitives such as kthread_lock_mutex_signal() that attempts
to get the lock but fails if a signal is pending. In this manner, the kernel
is safer as kernel threads cannot be shut down inconveniently, but in return
for complexity as blocking operations must check they if they should fail.
Process exiting has also been refactored significantly. The _exit(2) system
call sets the exit code and sends SIGKILL to all the threads in the process.
Once all the threads have cleaned themselves up and exited, a worker thread
calls the process's LastPrayer() method that unmaps memory, deletes the
address space, notifies the parent, etc. This provides a very robust way to
terminate processes as even half-constructed processes (during a failing fork
for instance) can be gracefully terminated.
I have introduced a number of kernel threads to help avoid threading problems
and simplify kernel design. For instance, there is now a functional generic
kernel worker thread that any kernel thread can schedule jobs for. Interrupt
handlers run with interrupts off (hence they cannot call kthread_ functions
as it may deadlock the system if another thread holds the lock) therefore
they cannot use the standard kernel worker threads. Instead, they use a
special purpose interrupt worker thread that works much like the generic one
expect that interrupt handlers can safely queue work with interrupts off.
Note that this also means that interrupt handlers cannot allocate memory or
print to the kernel log/screen as such mechanisms uses locks. I'll introduce
a lock free algorithm for such cases later on.
The boot process has also changed. The original kernel init thread in
kernel.cpp creates a new bootstrap thread and becomes the system idle thread.
Note that pid=0 now means the kernel, as there is no longer a system idle
process. The bootstrap thread launches all the kernel worker threads and then
creates a new process and loads /bin/init into it and then creates a thread
in pid=1, which starts the system. The bootstrap thread then quietly waits
for pid=1 to exit after which it shuts down/reboots/panics the system.
In general, the introduction of race conditions and dead locks have forced me
to revise a lot of the design and make sure it was thread secure. Since early
parts of the kernel was quite hacky, I had to refactor such code. So it seems
that the risk of dead locks forces me to write better code.
Note that a real preemptive multithreaded kernel simplifies the construction
of blocking system calls. My hope is that this will trigger a clean up of
the filesystem code that current is almost beyond repair.
Almost all of the kernel was modified during this refactoring. To the extent
possible, these changes have been backported to older non-multithreaded
kernel, but many changes were tightly coupled and went into this commit.
Of interest is the implementation of the kthread_ api based on the design
of pthreads; this library allows easy synchronization mechanisms and
includes C++-style scoped locks. This commit also introduces new worker
threads and tested mechanisms for interrupt handlers to schedule work in a
kernel worker thread.
A lot of code have been rewritten from scratch and has become a lot more
stable and correct.
Share and enjoy!
2012-08-01 11:30:34 -04:00
|
|
|
ScopedLock lock(&termlock);
|
2012-07-24 12:43:34 -04:00
|
|
|
TextBuffer* textbuf = textbufhandle->Acquire();
|
|
|
|
size_t width = textbuf->Width();
|
|
|
|
textbufhandle->Release(textbuf);
|
|
|
|
return width;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t TextTerminal::Height() const
|
|
|
|
{
|
Multithreaded kernel and improvement of signal handling.
Pardon the big ass-commit, this took months to develop and debug and the
refactoring got so far that a clean merge became impossible. The good news
is that this commit does quite a bit of cleaning up and generally improves
the kernel quality.
This makes the kernel fully pre-emptive and multithreaded. This was done
by rewriting the interrupt code, the scheduler, introducing new threading
primitives, and rewriting large parts of the kernel. During the past few
commits the kernel has had its device drivers thread secured; this commit
thread secures large parts of the core kernel. There still remains some
parts of the kernel that is _not_ thread secured, but this is not a problem
at this point. Each user-space thread has an associated kernel stack that
it uses when it goes into kernel mode. This stack is by default 8 KiB since
that value works for me and is also used by Linux. Strange things tends to
happen on x86 in case of a stack overflow - there is no ideal way to catch
such a situation right now.
The system call conventions were changed, too. The %edx register is now
used to provide the errno value of the call, instead of the kernel writing
it into a registered global variable. The system call code has also been
updated to better reflect the native calling conventions: not all registers
have to be preserved. This makes system calls faster and simplifies the
assembly. In the kernel, there is no longer the event.h header or the hacky
method of 'resuming system calls' that closely resembles cooperative
multitasking. If a system call wants to block, it should just block.
The signal handling was also improved significantly. At this point, signals
cannot interrupt kernel threads (but can always interrupt user-space threads
if enabled), which introduces some problems with how a SIGINT could
interrupt a blocking read, for instance. This commit introduces and uses a
number of new primitives such as kthread_lock_mutex_signal() that attempts
to get the lock but fails if a signal is pending. In this manner, the kernel
is safer as kernel threads cannot be shut down inconveniently, but in return
for complexity as blocking operations must check they if they should fail.
Process exiting has also been refactored significantly. The _exit(2) system
call sets the exit code and sends SIGKILL to all the threads in the process.
Once all the threads have cleaned themselves up and exited, a worker thread
calls the process's LastPrayer() method that unmaps memory, deletes the
address space, notifies the parent, etc. This provides a very robust way to
terminate processes as even half-constructed processes (during a failing fork
for instance) can be gracefully terminated.
I have introduced a number of kernel threads to help avoid threading problems
and simplify kernel design. For instance, there is now a functional generic
kernel worker thread that any kernel thread can schedule jobs for. Interrupt
handlers run with interrupts off (hence they cannot call kthread_ functions
as it may deadlock the system if another thread holds the lock) therefore
they cannot use the standard kernel worker threads. Instead, they use a
special purpose interrupt worker thread that works much like the generic one
expect that interrupt handlers can safely queue work with interrupts off.
Note that this also means that interrupt handlers cannot allocate memory or
print to the kernel log/screen as such mechanisms uses locks. I'll introduce
a lock free algorithm for such cases later on.
The boot process has also changed. The original kernel init thread in
kernel.cpp creates a new bootstrap thread and becomes the system idle thread.
Note that pid=0 now means the kernel, as there is no longer a system idle
process. The bootstrap thread launches all the kernel worker threads and then
creates a new process and loads /bin/init into it and then creates a thread
in pid=1, which starts the system. The bootstrap thread then quietly waits
for pid=1 to exit after which it shuts down/reboots/panics the system.
In general, the introduction of race conditions and dead locks have forced me
to revise a lot of the design and make sure it was thread secure. Since early
parts of the kernel was quite hacky, I had to refactor such code. So it seems
that the risk of dead locks forces me to write better code.
Note that a real preemptive multithreaded kernel simplifies the construction
of blocking system calls. My hope is that this will trigger a clean up of
the filesystem code that current is almost beyond repair.
Almost all of the kernel was modified during this refactoring. To the extent
possible, these changes have been backported to older non-multithreaded
kernel, but many changes were tightly coupled and went into this commit.
Of interest is the implementation of the kthread_ api based on the design
of pthreads; this library allows easy synchronization mechanisms and
includes C++-style scoped locks. This commit also introduces new worker
threads and tested mechanisms for interrupt handlers to schedule work in a
kernel worker thread.
A lot of code have been rewritten from scratch and has become a lot more
stable and correct.
Share and enjoy!
2012-08-01 11:30:34 -04:00
|
|
|
ScopedLock lock(&termlock);
|
2012-07-24 12:43:34 -04:00
|
|
|
TextBuffer* textbuf = textbufhandle->Acquire();
|
|
|
|
size_t height = textbuf->Height();
|
|
|
|
textbufhandle->Release(textbuf);
|
|
|
|
return height;
|
|
|
|
}
|
|
|
|
|
2012-12-23 15:00:17 -05:00
|
|
|
bool TextTerminal::Sync()
|
|
|
|
{
|
|
|
|
// Reading something from the textbuffer may cause it to block while
|
|
|
|
// finishing rendering, effectively synchronizing with it.
|
|
|
|
ScopedLock lock(&termlock);
|
|
|
|
TextBuffer* textbuf = textbufhandle->Acquire();
|
|
|
|
textbuf->GetCursorPos();
|
|
|
|
textbufhandle->Release(textbuf);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2012-07-22 18:01:12 -04:00
|
|
|
void TextTerminal::PutChar(TextBuffer* textbuf, char c)
|
|
|
|
{
|
|
|
|
if ( ansimode )
|
|
|
|
PutAnsiEscaped(textbuf, c);
|
|
|
|
else switch ( c )
|
|
|
|
{
|
|
|
|
case '\n': Newline(textbuf); break;
|
|
|
|
case '\r': column = 0; break;
|
|
|
|
case '\b': Backspace(textbuf); break;
|
|
|
|
case '\t': Tab(textbuf); break;
|
|
|
|
case '\e': AnsiReset(); break;
|
|
|
|
default:
|
|
|
|
{
|
|
|
|
if ( textbuf->Width() <= column )
|
|
|
|
Newline(textbuf);
|
|
|
|
TextPos pos(column++, line);
|
|
|
|
TextChar tc(c, vgacolor);
|
|
|
|
textbuf->SetChar(pos, tc);
|
|
|
|
textbuf->SetCharAttr(pos, ATTR_CHAR);
|
|
|
|
} break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void TextTerminal::UpdateCursor(TextBuffer* textbuf)
|
|
|
|
{
|
|
|
|
textbuf->SetCursorPos(TextPos(column, line));
|
|
|
|
}
|
|
|
|
|
|
|
|
void TextTerminal::Newline(TextBuffer* textbuf)
|
|
|
|
{
|
|
|
|
textbuf->SetCharAttr(TextPos(column, line), ATTR_CHAR);
|
|
|
|
column = 0;
|
|
|
|
if ( line < textbuf->Height()-1 )
|
|
|
|
line++;
|
|
|
|
else
|
|
|
|
textbuf->Scroll(1, TextChar(' ', vgacolor)),
|
|
|
|
line = textbuf->Height()-1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static TextPos DecrementTextPos(TextBuffer* textbuf, TextPos pos)
|
|
|
|
{
|
|
|
|
if ( !pos.x && !pos.y )
|
|
|
|
return pos;
|
|
|
|
if ( !pos.x )
|
|
|
|
return TextPos(textbuf->Width(), pos.y-1);
|
|
|
|
return TextPos(pos.x-1, pos.y);
|
|
|
|
}
|
|
|
|
|
|
|
|
void TextTerminal::Backspace(TextBuffer* textbuf)
|
|
|
|
{
|
|
|
|
TextPos pos(column, line);
|
|
|
|
while ( pos.x || pos.y )
|
|
|
|
{
|
|
|
|
pos = DecrementTextPos(textbuf, pos);
|
|
|
|
uint16_t attr = textbuf->GetCharAttr(pos);
|
|
|
|
textbuf->SetChar(pos, TextChar(' ', vgacolor));
|
|
|
|
textbuf->SetCharAttr(pos, attr & ~ATTR_CHAR);
|
|
|
|
if ( attr & ATTR_CHAR )
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
column = pos.x;
|
|
|
|
line = pos.y;
|
|
|
|
}
|
|
|
|
|
|
|
|
void TextTerminal::Tab(TextBuffer* textbuf)
|
|
|
|
{
|
|
|
|
if ( column == textbuf->Width() )
|
|
|
|
Newline(textbuf);
|
|
|
|
// TODO: This does not work correctly if the text buffer width is not a
|
|
|
|
// multiple of four and the column is near the edge.
|
2012-09-08 09:06:10 -04:00
|
|
|
unsigned until = 8 - (column % 8);
|
2012-07-22 18:01:12 -04:00
|
|
|
textbuf->SetCharAttr(TextPos(column, line), ATTR_CHAR);
|
|
|
|
while ( (until--) != 0 )
|
|
|
|
textbuf->SetChar(TextPos(column++, line), TextChar(' ', vgacolor));
|
|
|
|
}
|
|
|
|
|
|
|
|
// TODO: This implementation of the 'Ansi Escape Codes' is incomplete and hacky.
|
|
|
|
void TextTerminal::AnsiReset()
|
|
|
|
{
|
|
|
|
ansiusedparams = 0;
|
|
|
|
currentparamindex = 0;
|
|
|
|
ansiparams[0] = 0;
|
|
|
|
paramundefined = true;
|
|
|
|
ignoresequence = false;
|
|
|
|
ansimode = CSI;
|
|
|
|
}
|
|
|
|
|
|
|
|
void TextTerminal::PutAnsiEscaped(TextBuffer* textbuf, char c)
|
|
|
|
{
|
|
|
|
// Check the proper prefixes are used.
|
|
|
|
if ( ansimode == CSI )
|
|
|
|
{
|
|
|
|
if ( c != '[' ) { ansimode = NONE; return; }
|
|
|
|
ansimode = COMMAND;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Read part of a parameter.
|
|
|
|
if ( '0' <= c && c <= '9' )
|
|
|
|
{
|
|
|
|
if ( paramundefined )
|
|
|
|
ansiusedparams++;
|
|
|
|
paramundefined = false;
|
|
|
|
unsigned val = c - '0';
|
|
|
|
ansiparams[currentparamindex] *= 10;
|
|
|
|
ansiparams[currentparamindex] += val;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Parameter delimiter.
|
|
|
|
else if ( c == ';' )
|
|
|
|
{
|
|
|
|
if ( currentparamindex == ANSI_NUM_PARAMS - 1 )
|
|
|
|
{
|
|
|
|
ansimode = NONE;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
paramundefined = true;
|
|
|
|
ansiparams[++currentparamindex] = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Left for future standardization, so discard this sequence.
|
|
|
|
else if ( c == ':' )
|
|
|
|
{
|
|
|
|
ignoresequence = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Run a command.
|
|
|
|
else if ( 64 <= c && c <= 126 )
|
|
|
|
{
|
|
|
|
if ( !ignoresequence )
|
|
|
|
RunAnsiCommand(textbuf, c);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Something I don't understand, and ignore intentionally.
|
|
|
|
else if ( c == '?' )
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
// TODO: There are some rare things that should be supported here.
|
|
|
|
|
|
|
|
// Ignore unknown input.
|
|
|
|
else
|
|
|
|
{
|
|
|
|
ansimode = NONE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void TextTerminal::RunAnsiCommand(TextBuffer* textbuf, char c)
|
|
|
|
{
|
|
|
|
const unsigned width = (unsigned) textbuf->Width();
|
|
|
|
const unsigned height = (unsigned) textbuf->Height();
|
|
|
|
|
|
|
|
switch ( c )
|
|
|
|
{
|
|
|
|
case 'A': // Cursor up
|
|
|
|
{
|
|
|
|
unsigned dist = 0 < ansiusedparams ? ansiparams[0] : 1;
|
|
|
|
if ( line < dist )
|
|
|
|
line = 0;
|
|
|
|
else
|
|
|
|
line -= dist;
|
|
|
|
} break;
|
|
|
|
case 'B': // Cursor down
|
|
|
|
{
|
|
|
|
unsigned dist = 0 < ansiusedparams ? ansiparams[0] : 1;
|
|
|
|
if ( height <= line + dist )
|
|
|
|
line = height-1;
|
|
|
|
else
|
|
|
|
line += dist;
|
|
|
|
} break;
|
|
|
|
case 'C': // Cursor forward
|
|
|
|
{
|
|
|
|
unsigned dist = 0 < ansiusedparams ? ansiparams[0] : 1;
|
|
|
|
if ( width <= column + dist )
|
|
|
|
column = width-1;
|
|
|
|
else
|
|
|
|
column += dist;
|
|
|
|
} break;
|
|
|
|
case 'D': // Cursor backward
|
|
|
|
{
|
|
|
|
unsigned dist = 0 < ansiusedparams ? ansiparams[0] : 1;
|
|
|
|
if ( column < dist )
|
|
|
|
column = 0;
|
|
|
|
else
|
|
|
|
column -= dist;
|
|
|
|
} break;
|
|
|
|
case 'E': // Move to beginning of line N lines down.
|
|
|
|
{
|
|
|
|
column = 0;
|
|
|
|
unsigned dist = 0 < ansiusedparams ? ansiparams[0] : 1;
|
|
|
|
if ( height <= line + dist )
|
|
|
|
line = height-1;
|
|
|
|
else
|
|
|
|
line += dist;
|
|
|
|
} break;
|
|
|
|
case 'F': // Move to beginning of line N lines up.
|
|
|
|
{
|
|
|
|
column = 0;
|
|
|
|
unsigned dist = 0 < ansiusedparams ? ansiparams[0] : 1;
|
|
|
|
if ( line < dist )
|
|
|
|
line = 0;
|
|
|
|
else
|
|
|
|
line -= dist;
|
|
|
|
} break;
|
|
|
|
case 'G': // Move the cursor to column N.
|
|
|
|
{
|
|
|
|
unsigned pos = 0 < ansiusedparams ? ansiparams[0]-1 : 0;
|
|
|
|
if ( width <= pos )
|
|
|
|
pos = width-1;
|
|
|
|
column = pos;
|
|
|
|
} break;
|
|
|
|
case 'H': // Move the cursor to line Y, column X.
|
|
|
|
case 'f':
|
|
|
|
{
|
|
|
|
unsigned posy = 0 < ansiusedparams ? ansiparams[0]-1 : 0;
|
|
|
|
unsigned posx = 1 < ansiusedparams ? ansiparams[1]-1 : 0;
|
|
|
|
if ( width <= posx )
|
|
|
|
posx = width-1;
|
|
|
|
if ( height <= posy )
|
|
|
|
posy = height-1;
|
|
|
|
column = posx;
|
|
|
|
line = posy;
|
|
|
|
} break;
|
|
|
|
case 'J': // Erase parts of the screen.
|
|
|
|
{
|
|
|
|
unsigned mode = 0 < ansiusedparams ? ansiparams[0] : 0;
|
|
|
|
TextPos from(0, 0);
|
|
|
|
TextPos to(0, 0);
|
|
|
|
|
|
|
|
if ( mode == 0 ) // From cursor to end.
|
|
|
|
from = TextPos{column, line},
|
|
|
|
to = TextPos{width-1, height-1};
|
|
|
|
|
|
|
|
if ( mode == 1 ) // From start to cursor.
|
|
|
|
from = TextPos{0, 0},
|
|
|
|
to = TextPos{column, line};
|
|
|
|
|
|
|
|
if ( mode == 2 ) // Everything.
|
|
|
|
from = TextPos{0, 0},
|
|
|
|
to = TextPos{width-1, height-1};
|
|
|
|
|
|
|
|
textbuf->Fill(from, to, TextChar(' ', vgacolor), 0);
|
|
|
|
} break;
|
|
|
|
case 'K': // Erase parts of the current line.
|
|
|
|
{
|
|
|
|
unsigned mode = 0 < ansiusedparams ? ansiparams[0] : 0;
|
|
|
|
TextPos from(0, 0);
|
|
|
|
TextPos to(0, 0);
|
|
|
|
|
|
|
|
if ( mode == 0 ) // From cursor to end.
|
|
|
|
from = TextPos{column, line},
|
|
|
|
to = TextPos{width-1, line};
|
|
|
|
|
|
|
|
if ( mode == 1 ) // From start to cursor.
|
|
|
|
from = TextPos{0, line},
|
|
|
|
to = TextPos{column, line};
|
|
|
|
|
|
|
|
if ( mode == 2 ) // Everything.
|
|
|
|
from = TextPos{0, line},
|
|
|
|
to = TextPos{width-1, line};
|
|
|
|
|
|
|
|
textbuf->Fill(from, to, TextChar(' ', vgacolor), 0);
|
|
|
|
} break;
|
|
|
|
case 'S': // Scroll a line up and place a new line at the buttom.
|
|
|
|
{
|
|
|
|
textbuf->Scroll(1, TextChar(' ', vgacolor));
|
|
|
|
line = height-1;
|
|
|
|
} break;
|
|
|
|
case 'T': // Scroll a line up and place a new line at the top.
|
|
|
|
{
|
|
|
|
textbuf->Scroll(-1, TextChar(' ', vgacolor));
|
|
|
|
line = 0;
|
|
|
|
} break;
|
|
|
|
case 'm': // Change how the text is rendered.
|
|
|
|
{
|
|
|
|
if ( ansiusedparams == 0 )
|
|
|
|
{
|
|
|
|
ansiparams[0] = 0;
|
|
|
|
ansiusedparams++;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Convert from the ANSI color scheme to the VGA color scheme.
|
|
|
|
const unsigned conversion[8] =
|
|
|
|
{
|
|
|
|
COLOR8_BLACK, COLOR8_RED, COLOR8_GREEN, COLOR8_BROWN,
|
|
|
|
COLOR8_BLUE, COLOR8_MAGENTA, COLOR8_CYAN, COLOR8_LIGHT_GREY,
|
|
|
|
};
|
|
|
|
|
|
|
|
for ( size_t i = 0; i < ansiusedparams; i++ )
|
|
|
|
{
|
|
|
|
unsigned cmd = ansiparams[i];
|
|
|
|
// Turn all attributes off.
|
|
|
|
if ( cmd == 0 )
|
|
|
|
{
|
|
|
|
vgacolor = DEFAULT_COLOR;
|
|
|
|
}
|
|
|
|
// Set text color.
|
|
|
|
else if ( 30 <= cmd && cmd <= 37 )
|
|
|
|
{
|
|
|
|
unsigned val = cmd - 30;
|
|
|
|
vgacolor &= 0xF0;
|
|
|
|
vgacolor |= conversion[val] << 0;
|
|
|
|
}
|
|
|
|
// Set background color.
|
|
|
|
else if ( 40 <= cmd && cmd <= 47 )
|
|
|
|
{
|
|
|
|
unsigned val = cmd - 40;
|
|
|
|
vgacolor &= 0x0F;
|
|
|
|
vgacolor |= conversion[val] << 4;
|
|
|
|
}
|
|
|
|
// TODO: There are many other things we don't support.
|
|
|
|
}
|
|
|
|
} break;
|
|
|
|
case 'n': // Request special information from terminal.
|
|
|
|
{
|
|
|
|
// TODO: Handle this code.
|
|
|
|
} break;
|
|
|
|
case 's': // Save cursor position.
|
|
|
|
{
|
|
|
|
ansisavedposx = column;
|
|
|
|
ansisavedposx = line;
|
|
|
|
} break;
|
|
|
|
case 'u': // Restore cursor position.
|
|
|
|
{
|
|
|
|
column = ansisavedposx;
|
|
|
|
line = ansisavedposx;
|
|
|
|
if ( width <= column )
|
|
|
|
column = width-1;
|
|
|
|
if ( height <= line )
|
|
|
|
line = height-1;
|
|
|
|
} break;
|
|
|
|
case 'l': // Hide cursor.
|
|
|
|
{
|
|
|
|
// TODO: This is somehow related to the special char '?'.
|
|
|
|
if ( 0 < ansiusedparams && ansiparams[0] == 25 )
|
|
|
|
textbuf->SetCursorEnabled(false);
|
|
|
|
} break;
|
|
|
|
case 'h': // Show cursor.
|
|
|
|
{
|
|
|
|
// TODO: This is somehow related to the special char '?'.
|
|
|
|
if ( 0 < ansiusedparams && ansiparams[0] == 25 )
|
|
|
|
textbuf->SetCursorEnabled(true);
|
|
|
|
} break;
|
|
|
|
// TODO: Handle other cases.
|
|
|
|
}
|
|
|
|
|
|
|
|
ansimode = NONE;
|
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace Sortix
|