buffer
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 416
fid-listbuffer 0.1.3
fid-listbuffer is a buffer implementation for the Frigand Imperial Desktop. more>>
fid-listbuffer is a buffer implementation for the Frigand Imperial Desktop. Fid buffers are typically mutable monoids over particular unit types; the exact unit type and the equations satisfied by the monoid determine the particular buffer type.
This package defines a parametric buffer type for the simple case of a free monoid over a unit type that is to be exposed to the programmer, where replaceableRegion additionally is equivalent to ( r d -> return True).
Enhancements:
- This release maintains compatibility with fid-core 0.2.
<<lessThis package defines a parametric buffer type for the simple case of a free monoid over a unit type that is to be exposed to the programmer, where replaceableRegion additionally is equivalent to ( r d -> return True).
Enhancements:
- This release maintains compatibility with fid-core 0.2.
Download (0.031MB)
Added: 2005-10-27 License: Other/Proprietary License Price:
1458 downloads
Measuring Buffer 20090628
Measuring Buffer is an enhanced version of buffer. more>>
Measuring Buffer 20090628 provides you with a perfect and enhanced version of buffer which features display of throughput, network support, memory-mapped file I/O for huge buffers and multithreading. This will be your excellent choice.
Major Features:
- Display of I/O speed
- Optional use of memory mapped I/O for huge buffers
- Multithreaded instead of sharedmemory ipc
- Multi volume support
- Autoloader support
- Networking support
- Compatible command-line options
Enhancements:
- This release fixes a hang on transfer sizes smaller than blocksize with status display active.
- It has a Gentoo compatibility update, a man page update, a summary display update, and a libmhash initialization fix.
- Termination latency with active status display is reduced.
- There is a fix for -q suppressing the output of -H.
Added: 2009-06-29 License: GPL v3 Price: FREE
14 downloads
Other version of Measuring Buffer
Thomas Maier-Komor - Measuring Buffer is an enhanced version of buffer. Measuring Buffer. Measuring Buffer isLicense:GPL (GNU General Public License)
Virtual Ring Buffer 0.5.0
Virtual Ring Buffer (VRB) is an implementation of a character FIFO ring buffer. more>>
Virtual Ring Buffer (VRB) is an implementation of a character FIFO ring buffer. Virtual Ring Buffer provides direct access to the buffer so the calling program can construct output data in place, or parse input data in place, without the extra step of copying data to or from a calling program provided buffer area.
In order to facilitate this direct access, VRB makes sure that all references to buffer locations for either output or input is always a single contiguous block of memory so that the calling program does not have to deal with split buffer spaces every time the cycling of data reaches the end of the buffer and wraps around to the beginning.
Thus, the calling program is free to use any number of tools available which do not have to be aware that they are operating directly in a ring buffer. In the latest version, VRB also provides a buffer overflow protection mechanism so that buffer overflow bugs force the program to be trapped by the operating system if accessed pointers wander beyond the range of address space managed by VRB. This feature can be disabled if desired, since it occupies 2 extra pages of address space.
VRB does all this without adding any copying overhead of its own. This ability is achieved by placing a mirror image memory map immediately after the buffer that is a reference to exactly the same memory as the buffer itself. Thus a reference to the memory location immediately past the last location in the buffer accesses the same physical RAM as the beginning of the buffer.
Thus a pointer near the end of the buffer that has a length that would otherwise have to wrap around will instead extend into the mirror image space to get the same result, but without any special handling by the program.
Installation:
First extract the source where you wish to store it. One of these commands might be used within the desired directory after the tar files has been downloaded there:
bunzip2 < vrb-0.5.0.tar.bz2 | tar -xpf -
gunzip < vrb-0.5.0.tar.gz | tar -xpf -
A subdirectory called vrb-0.5.0 is created. Execute these command to change into that directory and compile the source (changing the prefix if desired):
cd vrb-0.5.0
./Configure --prefix=/usr/local
make clean
make install
Note that unlike most other source packages using a configuration system, the configure command name is capitalized. The above commands will not install the man pages at this time. To install the man pages, simply copy them to the desired location, such as:
cp -p vrb/man/man3/*.3 /usr/local/man/man3
Usage:
VRBs basic approach designed into its API is that the calling program asks for the address and length of either the empty space where output data can be placed, or the data space where input data is present (previously placed there). These steps are implemented by macros for maximum speed, and are separate for address and length. The calling program then accesses that data directly in the buffer via that address (and length).
Once the data handling is complete, the calling program decides how much of that data it has inserted into empty space, or taken from data space, and calls VRB functions to indicate the which, which updates pointers (but does not copy any data). There are also functions available to assist in doing read/write I/O. Once the man pages are installed, the command man vrb is the starting point.
Enhancements:
- A vrb_empty function was added.
- Dead code in vrb_take was cleaned up.
- A poll loop was implemented in vbuf. vbuf now uses getopt.
- Buffer size calculation and data type/format were fixed in vbuf.
<<lessIn order to facilitate this direct access, VRB makes sure that all references to buffer locations for either output or input is always a single contiguous block of memory so that the calling program does not have to deal with split buffer spaces every time the cycling of data reaches the end of the buffer and wraps around to the beginning.
Thus, the calling program is free to use any number of tools available which do not have to be aware that they are operating directly in a ring buffer. In the latest version, VRB also provides a buffer overflow protection mechanism so that buffer overflow bugs force the program to be trapped by the operating system if accessed pointers wander beyond the range of address space managed by VRB. This feature can be disabled if desired, since it occupies 2 extra pages of address space.
VRB does all this without adding any copying overhead of its own. This ability is achieved by placing a mirror image memory map immediately after the buffer that is a reference to exactly the same memory as the buffer itself. Thus a reference to the memory location immediately past the last location in the buffer accesses the same physical RAM as the beginning of the buffer.
Thus a pointer near the end of the buffer that has a length that would otherwise have to wrap around will instead extend into the mirror image space to get the same result, but without any special handling by the program.
Installation:
First extract the source where you wish to store it. One of these commands might be used within the desired directory after the tar files has been downloaded there:
bunzip2 < vrb-0.5.0.tar.bz2 | tar -xpf -
gunzip < vrb-0.5.0.tar.gz | tar -xpf -
A subdirectory called vrb-0.5.0 is created. Execute these command to change into that directory and compile the source (changing the prefix if desired):
cd vrb-0.5.0
./Configure --prefix=/usr/local
make clean
make install
Note that unlike most other source packages using a configuration system, the configure command name is capitalized. The above commands will not install the man pages at this time. To install the man pages, simply copy them to the desired location, such as:
cp -p vrb/man/man3/*.3 /usr/local/man/man3
Usage:
VRBs basic approach designed into its API is that the calling program asks for the address and length of either the empty space where output data can be placed, or the data space where input data is present (previously placed there). These steps are implemented by macros for maximum speed, and are separate for address and length. The calling program then accesses that data directly in the buffer via that address (and length).
Once the data handling is complete, the calling program decides how much of that data it has inserted into empty space, or taken from data space, and calls VRB functions to indicate the which, which updates pointers (but does not copy any data). There are also functions available to assist in doing read/write I/O. Once the man pages are installed, the command man vrb is the starting point.
Enhancements:
- A vrb_empty function was added.
- Dead code in vrb_take was cleaned up.
- A poll loop was implemented in vbuf. vbuf now uses getopt.
- Buffer size calculation and data type/format were fixed in vbuf.
Download (0.047MB)
Added: 2006-03-07 License: LGPL (GNU Lesser General Public License) Price:
1330 downloads
Audio::LADSPA::Buffer 0.018
Audio::LADSPA::Buffer is a Perl module for LADSPA buffer. more>>
Audio::LADSPA::Buffer is a Perl module for LADSPA buffer.
SYNOPSIS
use Audio::LADSPA;
my $buffer = Audio::LADSPA::Buffer->new($size);
$plugin->connect(Port name => $buffer);
$buffer->set( @values );
# or get a buffer from a plugin..
$buffer2 = $plugin->get_buffer(Other port);
# make audio buffer louder
$buffer *= 2;
Audio::LADSPA::Buffer objects implement the connections between Audio::LADSA::Plugin objects. You can set up the buffer, and let some plugin write to it, while others read from it, or read from or write to it yourself.
There is no real difference between audio and control buffers, except that control buffers have a size of 1 sample *) and audio buffers are usually bigger.
*) Samples in LADSPA are implemented as native floats.
<<lessSYNOPSIS
use Audio::LADSPA;
my $buffer = Audio::LADSPA::Buffer->new($size);
$plugin->connect(Port name => $buffer);
$buffer->set( @values );
# or get a buffer from a plugin..
$buffer2 = $plugin->get_buffer(Other port);
# make audio buffer louder
$buffer *= 2;
Audio::LADSPA::Buffer objects implement the connections between Audio::LADSA::Plugin objects. You can set up the buffer, and let some plugin write to it, while others read from it, or read from or write to it yourself.
There is no real difference between audio and control buffers, except that control buffers have a size of 1 sample *) and audio buffers are usually bigger.
*) Samples in LADSPA are implemented as native floats.
Download (0.080MB)
Added: 2006-06-23 License: Perl Artistic License Price:
1219 downloads
Devel::RingBuffer 0.31
Devel::RingBuffer is a Perl module with shared memory ring buffers for Perl scripts diagnosis/debug. more>>
Devel::RingBuffer is a Perl module with shared memory ring buffers for Perl scripts diagnosis/debug.
SYNOPSIS
#
# create ringbuffer
#
use Devel::RingBuffer;
use Devel::RingBuffer::TieInt;
my $ringbuf = Devel::RingBuffer->new(
File => somefile.trace,
Rings => 20,
Slots => 20,
SlotSize => 300,
MessageSize => 256,
GlobalSize => 24 * 1024,
StopOnCreate => 0,
TraceOnCreate => 1) || die "Cant create a ring buffer.";
my $ring = $ringbuf->allocate();
Provides shared memory structures (using memory mapped files via IPC::Mmap) to be used by diagnostic and debugger applications for Perl scripts (see Devel::STrace). Using XS/C code to maximize performance, creates a set of ringbuffers with a configurable number of slots.
Each slot includes a field for a linenumber, a timestamp, and a fully qualified subroutine name. Each ring buffer also includes additional headers and fields to support diagnostic interfaces, e.g., watched expressions, command/reponse interfaces to the monitored applications, etc.
<<lessSYNOPSIS
#
# create ringbuffer
#
use Devel::RingBuffer;
use Devel::RingBuffer::TieInt;
my $ringbuf = Devel::RingBuffer->new(
File => somefile.trace,
Rings => 20,
Slots => 20,
SlotSize => 300,
MessageSize => 256,
GlobalSize => 24 * 1024,
StopOnCreate => 0,
TraceOnCreate => 1) || die "Cant create a ring buffer.";
my $ring = $ringbuf->allocate();
Provides shared memory structures (using memory mapped files via IPC::Mmap) to be used by diagnostic and debugger applications for Perl scripts (see Devel::STrace). Using XS/C code to maximize performance, creates a set of ringbuffers with a configurable number of slots.
Each slot includes a field for a linenumber, a timestamp, and a fully qualified subroutine name. Each ring buffer also includes additional headers and fields to support diagnostic interfaces, e.g., watched expressions, command/reponse interfaces to the monitored applications, etc.
Download (0.037MB)
Added: 2007-05-02 License: Perl Artistic License Price:
908 downloads
XML::Filter::Sort::Buffer 1.01
XML::Filter::Sort::Buffer is an implementation class used by XML::Filter::Sort. more>>
XML::Filter::Sort::Buffer is an implementation class used by XML::Filter::Sort.
The documentation is targetted at developers wishing to extend or replace this class. For user documentation, see XML::Filter::Sort.
For an overview of the classes and methods used for buffering, see XML::Filter::Sort::BufferMgr.
BUFFER LIFE CYCLE
A XML::Filter::Sort::Buffer object is created by a XML::Filter::Sort::BufferMgr object using the new() method.
The XML::Filter::Sort object will then propagate any SAX events it receives, to the buffer object until the end of the record is reached. As each element is added to the buffer, its contents are compared to the sort key paths and the sort key values are extracted.
When the end of the record is reached, the close() method is called. The return value from this method is the list of sort keys.
The buffer manager will store the buffer until the end of the record sequence is reached. Then it will retrieve each buffer in order of the sort key values and call the buffers to_sax() method to send all buffered events to the downstream handler.
Following the call to to_sax(), the buffer is discarded. No destructor method is used - everything is handled by Perls garbage collector.
<<lessThe documentation is targetted at developers wishing to extend or replace this class. For user documentation, see XML::Filter::Sort.
For an overview of the classes and methods used for buffering, see XML::Filter::Sort::BufferMgr.
BUFFER LIFE CYCLE
A XML::Filter::Sort::Buffer object is created by a XML::Filter::Sort::BufferMgr object using the new() method.
The XML::Filter::Sort object will then propagate any SAX events it receives, to the buffer object until the end of the record is reached. As each element is added to the buffer, its contents are compared to the sort key paths and the sort key values are extracted.
When the end of the record is reached, the close() method is called. The return value from this method is the list of sort keys.
The buffer manager will store the buffer until the end of the record sequence is reached. Then it will retrieve each buffer in order of the sort key values and call the buffers to_sax() method to send all buffered events to the downstream handler.
Following the call to to_sax(), the buffer is discarded. No destructor method is used - everything is handled by Perls garbage collector.
Download (0.025MB)
Added: 2006-09-06 License: Perl Artistic License Price:
1146 downloads
Text::Editor::Vip::Buffer::DoUndoRedo 0.04
Text::Editor::Vip::Buffer::DoUndoRedo is a non optional plugin for a Text::Editor::Vip::Buffer. more>>
Text::Editor::Vip::Buffer::DoUndoRedo is a non optional plugin for a Text::Editor::Vip::Buffer.
The do, undo, redo functionality of Text::Editor::Vip::Buffer is implemented by this package. This package automatically extends a Text::Editor::Vip::Buffer when a Text::Editor::Vip::Buffer instance is created.
This package manipulated the data structures used to implement a do, undo and redo functionality. Text::Editor::Vip uses perl as it building block to implement such functionality. Perl "scripts" are the base for implementing this functionality.
<<lessThe do, undo, redo functionality of Text::Editor::Vip::Buffer is implemented by this package. This package automatically extends a Text::Editor::Vip::Buffer when a Text::Editor::Vip::Buffer instance is created.
This package manipulated the data structures used to implement a do, undo and redo functionality. Text::Editor::Vip uses perl as it building block to implement such functionality. Perl "scripts" are the base for implementing this functionality.
Download (0.052MB)
Added: 2006-10-23 License: Perl Artistic License Price:
1098 downloads
XML::Filter::Sort::BufferMgr 1.01
XML::Filter::Sort::BufferMgr is a Perl implementation class used by XML::Filter::Sort. more>>
XML::Filter::Sort::BufferMgr is a Perl implementation class used by XML::Filter::Sort.
The documentation is targetted at developers wishing to extend or replace this class. For user documentation, see XML::Filter::Sort.
Two classes are used to implement buffering records and spooling them back out in sorted order as SAX events. One instance of the XML::Filter::Sort::Buffer class is used to buffer each record and one or more instances of the XML::Filter::Sort::BufferMgr class are used to manage the buffers.
API METHODS
The API of this module as used by XML::Filter::Sort::Buffer consists of the following sequence of method calls:
When the first record in a sequence is encountered, XML::Filter::Sort creates a XML::Filter::Sort::BufferMgr object using the new() method.
XML::Filter::Sort calls the buffer managers new_buffer() method to get a XML::Filter::Sort::Buffer object and all SAX events are directed to this object until the end of the record is encountered. The following events are supported by the current buffer implementation:
start_element()
characters()
comment()
processing_instruction()
end_element()
When the end of the record is detected, XML::Filter::Sort calls the buffer managers close_buffer() method, which in turn calls the buffers close() method. The close() method returns a list of values for the sort keys and the buffer manager uses these to store the buffer for later recall. Subsequent records are handled as per step 2.
When the last record has been buffered, XML::Filter::Sort calls the buffer managers to_sax() method. The buffer manager retrieves each of the buffers in sorted order and calls the buffers to_sax() method.
Each buffer attempts to match the sort key paths as SAX events are received. Once a value has been found for a given key, that same path match is not attempted against subsequent events. For efficiency, the code to match each key is compiled into a closure. For even more efficiency, this compilation is done once when the XML::Filter::Sort object is created. The compile_matches() method in the buffer manager class calls the compile_matches() method in the buffer class to achieve this.
<<lessThe documentation is targetted at developers wishing to extend or replace this class. For user documentation, see XML::Filter::Sort.
Two classes are used to implement buffering records and spooling them back out in sorted order as SAX events. One instance of the XML::Filter::Sort::Buffer class is used to buffer each record and one or more instances of the XML::Filter::Sort::BufferMgr class are used to manage the buffers.
API METHODS
The API of this module as used by XML::Filter::Sort::Buffer consists of the following sequence of method calls:
When the first record in a sequence is encountered, XML::Filter::Sort creates a XML::Filter::Sort::BufferMgr object using the new() method.
XML::Filter::Sort calls the buffer managers new_buffer() method to get a XML::Filter::Sort::Buffer object and all SAX events are directed to this object until the end of the record is encountered. The following events are supported by the current buffer implementation:
start_element()
characters()
comment()
processing_instruction()
end_element()
When the end of the record is detected, XML::Filter::Sort calls the buffer managers close_buffer() method, which in turn calls the buffers close() method. The close() method returns a list of values for the sort keys and the buffer manager uses these to store the buffer for later recall. Subsequent records are handled as per step 2.
When the last record has been buffered, XML::Filter::Sort calls the buffer managers to_sax() method. The buffer manager retrieves each of the buffers in sorted order and calls the buffers to_sax() method.
Each buffer attempts to match the sort key paths as SAX events are received. Once a value has been found for a given key, that same path match is not attempted against subsequent events. For efficiency, the code to match each key is compiled into a closure. For even more efficiency, this compilation is done once when the XML::Filter::Sort object is created. The compile_matches() method in the buffer manager class calls the compile_matches() method in the buffer class to achieve this.
Download (0.025MB)
Added: 2007-06-29 License: Perl Artistic License Price:
847 downloads
libmousetrap 0.6.1
libmousetrap is a C library to create and manipulate mousetrap buffers in system memory. more>>
libmousetrap is a C library to create and manipulate mousetrap buffers in system memory. Mousetrap buffers are compressed two dimensional cartesian grids with integer precision.
A mousetrap buffer retains an integer identifier for every point in the grid, so that later the identifier can be referenced with a set of (x, y) coordinates.
Why?
Well, when youre doing graphics programming and somebody clicks something with the mouse, all you get is the x and y location where the click was, and what mouse button they pressed.
With the x and y location, all you can really get is the color of the pixel they clicked on, which doesnt tell you what *thing* on the screen they clicked on. There are lots of different ways to determine in your program what thing was clicked on, this library is one of them.
Enhancements:
- This release fixes a really silly but really nasty bug, I called the function to create mousetraps out of SDL surfaces with the flags and the id parameters mixed up.
<<lessA mousetrap buffer retains an integer identifier for every point in the grid, so that later the identifier can be referenced with a set of (x, y) coordinates.
Why?
Well, when youre doing graphics programming and somebody clicks something with the mouse, all you get is the x and y location where the click was, and what mouse button they pressed.
With the x and y location, all you can really get is the color of the pixel they clicked on, which doesnt tell you what *thing* on the screen they clicked on. There are lots of different ways to determine in your program what thing was clicked on, this library is one of them.
Enhancements:
- This release fixes a really silly but really nasty bug, I called the function to create mousetraps out of SDL surfaces with the flags and the id parameters mixed up.
Added: 2006-06-05 License: LGPL (GNU Lesser General Public License) Price:
1237 downloads
libshbuf 0.0.3
libshbuf introduces a new IPC concept: the shared buffer, a more flexible and faster alternative for standard Unix FIFOs. more>>
libshbuf introduces a new IPC concept: the "shared buffer", a more flexible and faster alternative for standard Unix FIFOs.
Take some shared memory, flavour it with semaphore-based locking and change notifications, and refine it with an easy-to-use API and you get libshbufs "shared buffers".
Main features:
- Normally better latency and throughput
- Full access to the buffer at any time
- Connecting processes need not to be children of each other
- Arbitrary buffer lengths
- Memory mapped
- Backlog
The implementation is based on SysV shared memory, semaphores and message queues. It makes use of POSIX pthreads.
Both an easy understandable C library and a basic Python module are provided.
Version 0.0.3 is stable and feature complete.
The concept of "shared buffers" is explicitly designed for high thoughput, low latency streaming of data (e.g. audio) between two processes, where a Unix FIFO is not enough. Thus it is optimized for exactly two connecting peers, a minimum of locking and minimum of copying of memory.
For each shared buffer two shared memory blocks, a semaphore and a messages queue are created. The first shared memory block (aka "control memory block") contains some watermark information about the shared buffer. The second contains the buffer itself.
The semaphore is used for locking access to the control block. The message queue is used for signalling the other side on changes of the buffer.
A shared buffer provider is a process which creates it with with shbuf_create(). A new key for it will be registered (the key is an integer value, the key_t of the control shm). A shared buffer client is the other side of the buffer: it opens an existing buffer with shbuf_open(key).
Only one client and one provider may be connected at once. When using the notifying feature of libshbuf a background thread is started, which listens on the message queue for certain messages. It forwards these messages to a classic FIFO. The main program may listen on this FIFO with a standard select() or poll().
<<lessTake some shared memory, flavour it with semaphore-based locking and change notifications, and refine it with an easy-to-use API and you get libshbufs "shared buffers".
Main features:
- Normally better latency and throughput
- Full access to the buffer at any time
- Connecting processes need not to be children of each other
- Arbitrary buffer lengths
- Memory mapped
- Backlog
The implementation is based on SysV shared memory, semaphores and message queues. It makes use of POSIX pthreads.
Both an easy understandable C library and a basic Python module are provided.
Version 0.0.3 is stable and feature complete.
The concept of "shared buffers" is explicitly designed for high thoughput, low latency streaming of data (e.g. audio) between two processes, where a Unix FIFO is not enough. Thus it is optimized for exactly two connecting peers, a minimum of locking and minimum of copying of memory.
For each shared buffer two shared memory blocks, a semaphore and a messages queue are created. The first shared memory block (aka "control memory block") contains some watermark information about the shared buffer. The second contains the buffer itself.
The semaphore is used for locking access to the control block. The message queue is used for signalling the other side on changes of the buffer.
A shared buffer provider is a process which creates it with with shbuf_create(). A new key for it will be registered (the key is an integer value, the key_t of the control shm). A shared buffer client is the other side of the buffer: it opens an existing buffer with shbuf_open(key).
Only one client and one provider may be connected at once. When using the notifying feature of libshbuf a background thread is started, which listens on the message queue for certain messages. It forwards these messages to a classic FIFO. The main program may listen on this FIFO with a standard select() or poll().
Download (0.26MB)
Added: 2005-12-09 License: LGPL (GNU Lesser General Public License) Price:
1414 downloads
librmrtsp
librmrtsp is provided as a library to allow other free software projects to include the functionality in there software. more>>
librmrtsp performs the same function as imfetch, however it is provided as a library to allow other free software projects to include the functionality in there software.
librmrtsp is based on code from the xine project, but has been extensively modified to remove buffer overruns, crashes and dependencies on the rest of the xine source tree.
The idea is continue process in order to produce a high quality library that could be used by other projects like xine and Fido.
<<lesslibrmrtsp is based on code from the xine project, but has been extensively modified to remove buffer overruns, crashes and dependencies on the rest of the xine source tree.
The idea is continue process in order to produce a high quality library that could be used by other projects like xine and Fido.
Download (MB)
Added: 2006-12-05 License: GPL (GNU General Public License) Price:
613 downloads
LibVNCServer 0.9.1
LibVNCServer is a library that makes it easy to make a VNC server. more>>
LibVNCServer is a library that makes it easy to make a VNC server. All you do is provide a frame buffer and some I/O functions, and call a function each time the frame buffer changes. It supports all encodings known, including tight, zlib, ZRLE, and cursor encodings.
LibVNCServer also includes the HTTP server from Xvnc, so you can start a java viewer by surfing to http://my.vnc.server:5801 or similar. It includes a beta version of LibVNCClient, which makes it easy to make a VNC client. Also included is LinuxVNC, which is to the Linux console as WinVNC is to the Windows desktop.
If you dont know VNC, have a look at the original VNC or at Tridia VNC, who also have commercial support for it.
Now that you know what it is, maybe you want to make your own server. If this is not the case, you can ignore the rest of this page an go on surfing the internet.
Now that you want to make a VNC server, that is, a server which speaks the RFB protocol, you can download this library from sourceforge.
The simplest server looks like this:
#include
int main(int argc,char** argv)
{
rfbScreenInfoPtr server=rfbGetScreen(&argc,argv,400,300,8,3,4);
server->frameBuffer=malloc(400*300*4);
rfbInitServer(server);
rfbRunEventLoop(server,-1,FALSE);
return(0);
}
This sample creates a 400x300 frame buffer in true colour. There are 4 bytes per pixel, because 3 (which are only used instead of all 4) is such an odd number. Then the server is initialized and a blocking event loop is started.
Of course, this program only shows rubbish (whatever is in the frame buffer you mallocd), but it proves that writing a server can be very easy.
For details (especially if you want to write a real server) look into the provided examples, pnmshow.c and example.c, and into the README. You find there documentation for much more complicated servers.
Enhancements:
- The x11vnc source code is no longer included in the package.
<<lessLibVNCServer also includes the HTTP server from Xvnc, so you can start a java viewer by surfing to http://my.vnc.server:5801 or similar. It includes a beta version of LibVNCClient, which makes it easy to make a VNC client. Also included is LinuxVNC, which is to the Linux console as WinVNC is to the Windows desktop.
If you dont know VNC, have a look at the original VNC or at Tridia VNC, who also have commercial support for it.
Now that you know what it is, maybe you want to make your own server. If this is not the case, you can ignore the rest of this page an go on surfing the internet.
Now that you want to make a VNC server, that is, a server which speaks the RFB protocol, you can download this library from sourceforge.
The simplest server looks like this:
#include
int main(int argc,char** argv)
{
rfbScreenInfoPtr server=rfbGetScreen(&argc,argv,400,300,8,3,4);
server->frameBuffer=malloc(400*300*4);
rfbInitServer(server);
rfbRunEventLoop(server,-1,FALSE);
return(0);
}
This sample creates a 400x300 frame buffer in true colour. There are 4 bytes per pixel, because 3 (which are only used instead of all 4) is such an odd number. Then the server is initialized and a blocking event loop is started.
Of course, this program only shows rubbish (whatever is in the frame buffer you mallocd), but it proves that writing a server can be very easy.
For details (especially if you want to write a real server) look into the provided examples, pnmshow.c and example.c, and into the README. You find there documentation for much more complicated servers.
Enhancements:
- The x11vnc source code is no longer included in the package.
Download (1.3MB)
Added: 2007-05-29 License: GPL (GNU General Public License) Price:
884 downloads
FakeBO 0.4.1
FakeBO is a program which fakes trojan server responses and logs incoming requests. more>>
FakeBO is a program which fakes trojan server responses and logs incoming requests.
FakeBO fakes trojan server responses (Back Orifice, NetBus, etc.) and logs every attempt to a logfile, stdout/stderr or syslog.
It is able to send fake pings and replies back to the client which is trying to access your system.
Main features:
- Added -V command line option
- Added one more log level for logreceived (4=hexdump of packet)
- Pontential buffer overflow fixed
- Some bugs in RealBO fixed
- Fixed problem when compiling on libc5 systems
<<lessFakeBO fakes trojan server responses (Back Orifice, NetBus, etc.) and logs every attempt to a logfile, stdout/stderr or syslog.
It is able to send fake pings and replies back to the client which is trying to access your system.
Main features:
- Added -V command line option
- Added one more log level for logreceived (4=hexdump of packet)
- Pontential buffer overflow fixed
- Some bugs in RealBO fixed
- Fixed problem when compiling on libc5 systems
Download (MB)
Added: 2007-03-22 License: GPL (GNU General Public License) Price:
947 downloads
ImSafe 0.2.2
ImSafe (Immune Security For your Enterprise) is a host-based intrusion detection tool. more>>
ImSafe (Immune Security For your Enterprise) is a host-based intrusion detection tool. After a learning phase, it is able to detect changes in processes behavior, to detect buffer overflows, etc. It is implemented through a device driver (as a kernel patch) for the Linux kernel, but can also be run on other UNIX systems by using a "sensor" built on strace base.
Main features:
- Anomaly detection by analysing audit trails of system calls
- Fast detection of Buffer Overflow Attacks through our call origin heuristic mecanism
- GTK based graphical user interface
- Created for Linux systems but works on almost every UNIX flavor
- Monitor multiple processes of one single application at a time (its enough for testing purposes)
- React in real-time to an attack by executing the script of your choices
<<lessMain features:
- Anomaly detection by analysing audit trails of system calls
- Fast detection of Buffer Overflow Attacks through our call origin heuristic mecanism
- GTK based graphical user interface
- Created for Linux systems but works on almost every UNIX flavor
- Monitor multiple processes of one single application at a time (its enough for testing purposes)
- React in real-time to an attack by executing the script of your choices
Download (0.24MB)
Added: 2006-07-07 License: GPL (GNU General Public License) Price:
1207 downloads
WMMemFree 0.7
WMMemFree is a memory monitoring dockapp. more>>
WMMemFree shows system memory usage. It runs as a dockapp for WindowMaker or some other window manager which supports dockapps.
On the top side you have your physical memory usage and on the bottom theres
your swap space usage. The following options can be passed to WMMemFree on the command line:
-h, --help - display basic usage info
-v, --version - display version
-display - specify the X11 display to connect to
-b, --buffers - consider buffer memory
-nb, --no-buffers - ignore buffer memory
-c, --cache - consider cache memory
-nc, --no-cache - ignore cache memory
-w, --window - run in a window
-nw, --no-window - dont run in a window
-s, --shape - use the XShape extension
-ns, --no-shape - dont use XShape extension
Enhancements:
- Now windowed mode will have no decorations, the window can be moved with the mouse.
<<lessOn the top side you have your physical memory usage and on the bottom theres
your swap space usage. The following options can be passed to WMMemFree on the command line:
-h, --help - display basic usage info
-v, --version - display version
-display - specify the X11 display to connect to
-b, --buffers - consider buffer memory
-nb, --no-buffers - ignore buffer memory
-c, --cache - consider cache memory
-nc, --no-cache - ignore cache memory
-w, --window - run in a window
-nw, --no-window - dont run in a window
-s, --shape - use the XShape extension
-ns, --no-shape - dont use XShape extension
Enhancements:
- Now windowed mode will have no decorations, the window can be moved with the mouse.
Download (0.014MB)
Added: 2005-09-27 License: GPL (GNU General Public License) Price:
1488 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above buffer search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed
