mmap 0.0.10
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 43
MMap 0.0.10
MMap is a GTK2 map viewer. more>>
MMap is a GTK2 map viewer. MMap project supports Blue Marble, Land Sat 7, Watchizu, SRTM. You can show a part of World Wind data with OpenGL 3D graphics.
It supports (a part of) these maps:
- Watchizu
- Blue Marble
- Land Sat 7
- SRTM
== WARNING ==
MMap+ stores map data in ~/.mmap/ .
Its so huge.
<<lessIt supports (a part of) these maps:
- Watchizu
- Blue Marble
- Land Sat 7
- SRTM
== WARNING ==
MMap+ stores map data in ~/.mmap/ .
Its so huge.
Download (0.31MB)
Added: 2006-08-30 License: GPL (GNU General Public License) Price:
1196 downloads
Chump 0.0.10
Chump is a multiple instruction set table-driven assembler / disassembler. more>>
Chump is a language I created to describe line assemblers and disassembles in one description.
It is used in KMD to describe different processors. The reason for using this reather than gnu binutils as is the fast implementation. Its basicly made for people who want to design instruction sets.
<<lessIt is used in KMD to describe different processors. The reason for using this reather than gnu binutils as is the fast implementation. Its basicly made for people who want to design instruction sets.
Download (0.15MB)
Added: 2005-04-22 License: LGPL (GNU Lesser General Public License) Price:
1647 downloads
Lazy Backup 0.0.10
Lazy Backup project is intended to be so easy even lazy people will do their backups. more>>
Lazy Backup project is intended to be so easy even lazy people will do their backups.
Everyone is encouraged to make regular backups but how many of us actually do? Not only can it take a long time, but it can be complicated with a bunch of steps. Lazybackup is all about making it easy so that people will actually do it.
Current implementation
Started as a script to make my own backups easier there is a ready to use perl application available for download via sourceforge. It is works from the command line, and prompts users to do things like change disks. It should be a lot easier to use than the various steps that would need to be used to backup manually.
Technologies
Currently used
dar - disk archiver as the archive engine
dvd+rw-tools - dvd burning tools
perl - script engine
Planned
parchive - to recover from lost or damaged disks
GTK+/ GNOME - Optional super easy front end
curses - another optional easy to use front-end
c++ - Many of the programs lazybackup depends on are written in c++, and have libraries written in c++ that could make lazybackup more streamlined if used instead of invoking the command line programs.
Goals
Lazybackup has the ambitious goal of being the defacto backup tool of the gnome desktop when GNU/Linux becomes a mainstream OS of non technical people. Lazybackup also aims to appeal to admins via advanced scritability, and full functionality via command line, and library interfaces.
<<lessEveryone is encouraged to make regular backups but how many of us actually do? Not only can it take a long time, but it can be complicated with a bunch of steps. Lazybackup is all about making it easy so that people will actually do it.
Current implementation
Started as a script to make my own backups easier there is a ready to use perl application available for download via sourceforge. It is works from the command line, and prompts users to do things like change disks. It should be a lot easier to use than the various steps that would need to be used to backup manually.
Technologies
Currently used
dar - disk archiver as the archive engine
dvd+rw-tools - dvd burning tools
perl - script engine
Planned
parchive - to recover from lost or damaged disks
GTK+/ GNOME - Optional super easy front end
curses - another optional easy to use front-end
c++ - Many of the programs lazybackup depends on are written in c++, and have libraries written in c++ that could make lazybackup more streamlined if used instead of invoking the command line programs.
Goals
Lazybackup has the ambitious goal of being the defacto backup tool of the gnome desktop when GNU/Linux becomes a mainstream OS of non technical people. Lazybackup also aims to appeal to admins via advanced scritability, and full functionality via command line, and library interfaces.
Download (0.019MB)
Added: 2006-04-19 License: GPL (GNU General Public License) Price:
1286 downloads
TDFSB 0.0.10
TDFSB is a 3D filesystem browser. more>>
TDFSB is a 3D filesystem browser for GNU/Linux.
TDFSB reads directory information and displays them as a 3D world, so you can take a walk through your filesystem. It also reads Images, MPEG and MP3 files as well as some other formats.
To use this program you should have hardware accelerated 3d graphics. Otherwise it may be very slow.
TDFSB is released under the GNU GPL.
Enhancements:
- This release works with freeglut and gives tdfsb a centered view on startup.
<<lessTDFSB reads directory information and displays them as a 3D world, so you can take a walk through your filesystem. It also reads Images, MPEG and MP3 files as well as some other formats.
To use this program you should have hardware accelerated 3d graphics. Otherwise it may be very slow.
TDFSB is released under the GNU GPL.
Enhancements:
- This release works with freeglut and gives tdfsb a centered view on startup.
Download (0.03MB)
Added: 2007-06-22 License: GPL (GNU General Public License) Price:
856 downloads
Criawips 0.0.11
Criawips project aims to create a full featured presentation application that integrated smoothly into the GNOME desktop. more>>
Criawips aims to become a full featured presentation application that offers the perfect platform both for small presentations used to explain a few things to other people and for big presentations used for commercial presentations.
Thus it should become easy to use, provide a good integration with other applications to become a presentation platform that can compete with commercial applications like MS PowerPoint, StarOffice Impress and Apples Keynote.
Since version 0.0.10, criawips supports text editing. Its yet very basic, but its going to be improved pretty much with the next releases.
This was the first big step towards creating presentations with criawips. Now the editing capabilities are going to be improved and then we can work on the template infrastructure to provide layouting.
<<lessThus it should become easy to use, provide a good integration with other applications to become a presentation platform that can compete with commercial applications like MS PowerPoint, StarOffice Impress and Apples Keynote.
Since version 0.0.10, criawips supports text editing. Its yet very basic, but its going to be improved pretty much with the next releases.
This was the first big step towards creating presentations with criawips. Now the editing capabilities are going to be improved and then we can work on the template infrastructure to provide layouting.
Download (0.78MB)
Added: 2005-10-02 License: GPL (GNU General Public License) Price:
1482 downloads
Cache::Mmap 0.09
Cache::Mmap Perl module helps you to share data cache using memory mapped files. more>>
Cache::Mmap Perl module helps you to share data cache using memory mapped files.
SYNOPSIS
use Cache::Mmap;
$cache=Cache::Mmap->new($filename,%options);
$val1=$cache->read($key1);
$cache->write($key2,$val2);
$cache->delete($key3);
This module implements a shared data cache, using memory mapped files. If routines are provided which interact with the underlying data, access to the cache is completely transparent, and the module handles all the details of refreshing cache contents, and updating underlying data, if necessary.
Cache entries are assigned to "buckets" within the cache file, depending on the key. Within each bucket, entries are stored approximately in order of last access, so that frequently accessed entries will move to the head of the bucket, thus decreasing access time. Concurrent accesses to the same bucket are prevented by file locking of the relevant section of the cache file.
CONFIGURATION METHODS
These methods are used to examine/update the configuration of a cache. Most of these methods are read-only, and the value returned may be different to that passed to the constructor, since the cache may have been created by an earlier process which specified different parameters.
buckets()
Returns the number of buckets in the cache file.
bucketsize()
Returns the size of buckets (in bytes) in the cache file.
cachenegative()
Returns true if items not found in the underlying data are cached anyway.
context()
Returns the context data for reads and writes to the underlying data.
context($context)
Provides new context data for reads and writes to the underlying data.
expiry()
Returns the time in seconds cache entries are considered valid for, or zero for indefinite validity.
pagesize()
Returns the page size (in bytes) of the cache file.
strings()
Returns true if the cache stores strings rather than references.
writethrough()
Returns true if items written to the cache are immediately written to the underlying data.
<<lessSYNOPSIS
use Cache::Mmap;
$cache=Cache::Mmap->new($filename,%options);
$val1=$cache->read($key1);
$cache->write($key2,$val2);
$cache->delete($key3);
This module implements a shared data cache, using memory mapped files. If routines are provided which interact with the underlying data, access to the cache is completely transparent, and the module handles all the details of refreshing cache contents, and updating underlying data, if necessary.
Cache entries are assigned to "buckets" within the cache file, depending on the key. Within each bucket, entries are stored approximately in order of last access, so that frequently accessed entries will move to the head of the bucket, thus decreasing access time. Concurrent accesses to the same bucket are prevented by file locking of the relevant section of the cache file.
CONFIGURATION METHODS
These methods are used to examine/update the configuration of a cache. Most of these methods are read-only, and the value returned may be different to that passed to the constructor, since the cache may have been created by an earlier process which specified different parameters.
buckets()
Returns the number of buckets in the cache file.
bucketsize()
Returns the size of buckets (in bytes) in the cache file.
cachenegative()
Returns true if items not found in the underlying data are cached anyway.
context()
Returns the context data for reads and writes to the underlying data.
context($context)
Provides new context data for reads and writes to the underlying data.
expiry()
Returns the time in seconds cache entries are considered valid for, or zero for indefinite validity.
pagesize()
Returns the page size (in bytes) of the cache file.
strings()
Returns true if the cache stores strings rather than references.
writethrough()
Returns true if items written to the cache are immediately written to the underlying data.
Download (0.021MB)
Added: 2007-05-28 License: Perl Artistic License Price:
884 downloads
giFToxic 0.0.10
giFToxic provides a GTK 2-based client for giFT. more>>
giFToxic provides a GTK 2-based client for giFT.
At the moment it is under heavy development.
giFT stands for giFT: Internet File Transfer. It is a daemon that is intended to act as a bridge to combine the capability of using several (peer-to-peer or otherwise) file sharing protocols for a simple GUI client.
It uses the plugin paradigm to dynamically load different protocols for a client as and when required. The currently supported networks include:
Stable
OpenFT, giFTs own file sharing network
Gnutella1 (used by BearShare, LimeWire, ...)
Ares Galaxy
Turtle F2F
Beta
FastTrack (used by Kazaa)
Alpha
OpenNap
eDonkey
Soulseek
A lightweight protocol is used by clients to communicate with the giFT process, allowing the protocol code to be completely abstracted from the user interface.
Search nodes handle search requests. They search the filelists their CHILD (common) nodes submitted to them. These nodes must have a capable Internet connection and at least 128M RAM. A modern processor is highly recommended as well.
INDEX nodes keep lists of available search nodes, collect statistics, and try to maintain the structure of the network.
Enhancements:
- fixed escaping
- dont start a source search when a transfer is started
- recycle upload slots
- fixed daemon autostart mode
- Languages added: hr, ms, fr, cs, az, sk, pt, sr, sv
<<lessAt the moment it is under heavy development.
giFT stands for giFT: Internet File Transfer. It is a daemon that is intended to act as a bridge to combine the capability of using several (peer-to-peer or otherwise) file sharing protocols for a simple GUI client.
It uses the plugin paradigm to dynamically load different protocols for a client as and when required. The currently supported networks include:
Stable
OpenFT, giFTs own file sharing network
Gnutella1 (used by BearShare, LimeWire, ...)
Ares Galaxy
Turtle F2F
Beta
FastTrack (used by Kazaa)
Alpha
OpenNap
eDonkey
Soulseek
A lightweight protocol is used by clients to communicate with the giFT process, allowing the protocol code to be completely abstracted from the user interface.
Search nodes handle search requests. They search the filelists their CHILD (common) nodes submitted to them. These nodes must have a capable Internet connection and at least 128M RAM. A modern processor is highly recommended as well.
INDEX nodes keep lists of available search nodes, collect statistics, and try to maintain the structure of the network.
Enhancements:
- fixed escaping
- dont start a source search when a transfer is started
- recycle upload slots
- fixed daemon autostart mode
- Languages added: hr, ms, fr, cs, az, sk, pt, sr, sv
Download (0.36MB)
Added: 2007-03-05 License: GPL (GNU General Public License) Price:
967 downloads
Ant SVK Task 0.0.10
Ant SVK Task is a software that can create fully functional support for the SVK SCM tool within Ant build files. more>>
Ant SVK Task is a software that can create fully functional support for the SVK SCM tool within Ant build files.
If you like to use SVK in relation with Ant you can use the library you have available which means you have to add the antsvk-Revision.jar to your CLASSPATH.
After that you have to define the different Task which can be used in Ant files later.
To define the svk checkout command you have to put the following Task definition into your Ant build file:
< taskdef name="svkCheckout" classname="com.soebes.antsvk.cli.command.CheckoutCommand" classpath="..."/ >
Enhancements:
- The complete test suite is now working with local repositories and mirrors which will be used by the test suite instead of real repositories.
- Trac is now used as the project management tool. Minor bugfixes were done.
<<lessIf you like to use SVK in relation with Ant you can use the library you have available which means you have to add the antsvk-Revision.jar to your CLASSPATH.
After that you have to define the different Task which can be used in Ant files later.
To define the svk checkout command you have to put the following Task definition into your Ant build file:
< taskdef name="svkCheckout" classname="com.soebes.antsvk.cli.command.CheckoutCommand" classpath="..."/ >
Enhancements:
- The complete test suite is now working with local repositories and mirrors which will be used by the test suite instead of real repositories.
- Trac is now used as the project management tool. Minor bugfixes were done.
Download (0.050MB)
Added: 2006-03-26 License: GPL (GNU General Public License) Price:
1307 downloads
SDL Fungus 0.0.10
SDL Fungus is an addictive, multiplayer puzzle game based on NetFungus for two to four players. more>>
SDL Fungus is an addictive, multiplayer puzzle game based on NetFungus. Up to four players can play by trying to surround and capture each others fungus.
Currently only the multiplayer mode on a single computer works. I plan on cleaning up the code and releaseing it under the GNU GPL before adding networked multiplayer or AI. Also, a MacOS X port should come soon.
All comments are welcome. There are probably hundreds of bugs. Also, the program uses SDL.
Controls
- To rotate the piece you want to place, press space.
- To skip your turn, press tab.
- To bite press control and then click on the fungus blocks that you want to bite. After you have selected press control again or press space to cancel the bite.
<<lessCurrently only the multiplayer mode on a single computer works. I plan on cleaning up the code and releaseing it under the GNU GPL before adding networked multiplayer or AI. Also, a MacOS X port should come soon.
All comments are welcome. There are probably hundreds of bugs. Also, the program uses SDL.
Controls
- To rotate the piece you want to place, press space.
- To skip your turn, press tab.
- To bite press control and then click on the fungus blocks that you want to bite. After you have selected press control again or press space to cancel the bite.
Download (0.10MB)
Added: 2005-11-04 License: LGPL (GNU Lesser General Public License) Price:
1449 downloads
Zeppoo 0.0.3d
Zeppoo makes it possible to detect if a rootkit is installed on your system. more>>
Zeppoo makes it possible to detect if a rootkit is installed on your system.
Zeppoo also makes it possible to detect hidden tasks, syscalls, some corrupted symbols, modules, and also hidden connections.
For that, it mainly uses /dev/kmem to directly inspect the memory of the kernel, and when possible, /dev/mem.
Installation:
Zeppoo uses a micro lib(pico ?) in order to obtain the interrupt descriptor table with an assembler instruction, but we provide a version directly compiled, called ulibzeppo.so
If you wish to compile your own version, you need to have the package python-devel installed, then compile with :
python setup.py build
Visualization:
** Tasks :
./zeppoo.py -v tasks
** Syscalls :
./zeppoo.py -v syscalls
** Networks :
./zeppoo.py -v networks
Checking:
** Tasks :
./zeppoo.py -c tasks
** Networks :
./zeppoo.py -c networks
Fingerprint:
** Create :
./zeppoo.py -f FICHIER create
** Checking :
./zeppoo.py -f FICHIER check
Others:
** To change device by default(/dev/kmem) :
-d PERIPH
** To use mmap to seek symbols(faster) :
-m
Examples:
** Visualization of tasks by /dev/mem using mmap :
./zeppoo.py -v tasks -d /dev/mem -m
** Make fingerprint using /dev/mem :
./zeppoo.py -f FILE create -d /dev/mem
** Check fingerprint using /dev/mem :
./zeppoo.py -f FILE check -d /dev/mem
Enhancements:
- check execution of a binary(execve, binfmt)
- add symbols verification(only execve)
<<lessZeppoo also makes it possible to detect hidden tasks, syscalls, some corrupted symbols, modules, and also hidden connections.
For that, it mainly uses /dev/kmem to directly inspect the memory of the kernel, and when possible, /dev/mem.
Installation:
Zeppoo uses a micro lib(pico ?) in order to obtain the interrupt descriptor table with an assembler instruction, but we provide a version directly compiled, called ulibzeppo.so
If you wish to compile your own version, you need to have the package python-devel installed, then compile with :
python setup.py build
Visualization:
** Tasks :
./zeppoo.py -v tasks
** Syscalls :
./zeppoo.py -v syscalls
** Networks :
./zeppoo.py -v networks
Checking:
** Tasks :
./zeppoo.py -c tasks
** Networks :
./zeppoo.py -c networks
Fingerprint:
** Create :
./zeppoo.py -f FICHIER create
** Checking :
./zeppoo.py -f FICHIER check
Others:
** To change device by default(/dev/kmem) :
-d PERIPH
** To use mmap to seek symbols(faster) :
-m
Examples:
** Visualization of tasks by /dev/mem using mmap :
./zeppoo.py -v tasks -d /dev/mem -m
** Make fingerprint using /dev/mem :
./zeppoo.py -f FILE create -d /dev/mem
** Check fingerprint using /dev/mem :
./zeppoo.py -f FILE check -d /dev/mem
Enhancements:
- check execution of a binary(execve, binfmt)
- add symbols verification(only execve)
Download (0.021MB)
Added: 2006-06-19 License: GPL (GNU General Public License) Price:
1223 downloads
And-httpd 0.99.11
And-httpd is an HTTP server that currently only maps URLs to files. more>>
And-httpd is an HTTP server that currently only maps URLs to files. In other words, in can take an incoming URL and map it to a file in a number of ways.
And-httpd cannot do CGI or other kinds of code execution. And-httpd cannot even dynamically create directory listings.
Design is a statemachine triggering off IO events, somewhat like thttpd and boa (among others).
Simple tests with ab show it to be about twice as fast as thttpd-2.20c (note that thttpd doesnt support keep-alive, which gives and-httpd a significant advantage -- mainly due to usage of Vstr).
Uses the following system utilities:
poll or epoll, multiplexing
multiple process support. for MP systems
sendfile or mmap, for file contents
LFS
TCP_CORK
TCP_DEFER_ACCEPT
posix_fadvise()
chroot, privilage de-escalation (can also easily be started as non-root)
does a bind mount for /dev/log when in a chroot.
socket filters
IP binding
Is HTTP/1.1 conditionally compliant, as far as I know (and I have tests to prove some of it :).
Supports optional HTTP/1.1 features:
Accept header for Content-Type.
0.9 HTTP compatability support
keep-alive, on by default for 1.1 and 1.0
virtual hosts (via. prefix directories and explicit configuration statements)
if-modified-since/if-unmodified-since
byte ranges (single and multipart/byteranges)
if-range
multipart/byteranges can also be limited to prevent DOS attacks.
accept-encoding/content-encoding for gzip/bzip2 (via. pre-generated files)
Also fully obeys identity
ETags
accept-language negotiation to serve multiple languages
Parses /etc/mime.types file plus extensions for disallowing certain file types.
Can be run "easily" Ie. "and-httpd foo" will start a web server listening on port 80 or 8008 (depending in if you are uid zero) serving the contents of the directory "foo".
Configuration file parser.
Also has optional "per request" configuration files (using the same code, and thus layout, as the main configuration files), allowing you to:
Generate explicit Content-Types.
Generate negotiated Content-Types for requests with multiple types.
Eg. http://www.and.org/vstr/examples/httpd.c is available as text/plain and text/html
Generate Content-MD5 data
Generate Content-Location data.
Generate Expires and Cache-Control data.
Generate all four types of redirects.
Generate the usable types of error conditions.
Change the file object used to serve the data.
Has a native ACL configuration (can also use Linux socket filters).
All "configuration parameters" done through policies.
Change configuration policy based on ip address connections.
Change configuration policy based on many parameters of the request.
Automatically generate the "right" Vary header based on which fields of the request were tested.
includes init.d file, and allows "local controller" connections for soft restarts, status information etc.
Converter to make log files that look like apache-httpd combined log files.
DOES NOT:
Auto generate directory listings (see ex_dir_list2html in Vstr examples)
SSI, or other file contents parsing (see ex_ssi in Vstr examples)
Run programs (doesnt call exec at all, only calls fork() at startup for MP systems).
Call any i18n/gettext libc functions (will be fixed).
Parse or honor the Accept-Charset header.
Full date parser (not a problem, string matches work well).
<<lessAnd-httpd cannot do CGI or other kinds of code execution. And-httpd cannot even dynamically create directory listings.
Design is a statemachine triggering off IO events, somewhat like thttpd and boa (among others).
Simple tests with ab show it to be about twice as fast as thttpd-2.20c (note that thttpd doesnt support keep-alive, which gives and-httpd a significant advantage -- mainly due to usage of Vstr).
Uses the following system utilities:
poll or epoll, multiplexing
multiple process support. for MP systems
sendfile or mmap, for file contents
LFS
TCP_CORK
TCP_DEFER_ACCEPT
posix_fadvise()
chroot, privilage de-escalation (can also easily be started as non-root)
does a bind mount for /dev/log when in a chroot.
socket filters
IP binding
Is HTTP/1.1 conditionally compliant, as far as I know (and I have tests to prove some of it :).
Supports optional HTTP/1.1 features:
Accept header for Content-Type.
0.9 HTTP compatability support
keep-alive, on by default for 1.1 and 1.0
virtual hosts (via. prefix directories and explicit configuration statements)
if-modified-since/if-unmodified-since
byte ranges (single and multipart/byteranges)
if-range
multipart/byteranges can also be limited to prevent DOS attacks.
accept-encoding/content-encoding for gzip/bzip2 (via. pre-generated files)
Also fully obeys identity
ETags
accept-language negotiation to serve multiple languages
Parses /etc/mime.types file plus extensions for disallowing certain file types.
Can be run "easily" Ie. "and-httpd foo" will start a web server listening on port 80 or 8008 (depending in if you are uid zero) serving the contents of the directory "foo".
Configuration file parser.
Also has optional "per request" configuration files (using the same code, and thus layout, as the main configuration files), allowing you to:
Generate explicit Content-Types.
Generate negotiated Content-Types for requests with multiple types.
Eg. http://www.and.org/vstr/examples/httpd.c is available as text/plain and text/html
Generate Content-MD5 data
Generate Content-Location data.
Generate Expires and Cache-Control data.
Generate all four types of redirects.
Generate the usable types of error conditions.
Change the file object used to serve the data.
Has a native ACL configuration (can also use Linux socket filters).
All "configuration parameters" done through policies.
Change configuration policy based on ip address connections.
Change configuration policy based on many parameters of the request.
Automatically generate the "right" Vary header based on which fields of the request were tested.
includes init.d file, and allows "local controller" connections for soft restarts, status information etc.
Converter to make log files that look like apache-httpd combined log files.
DOES NOT:
Auto generate directory listings (see ex_dir_list2html in Vstr examples)
SSI, or other file contents parsing (see ex_ssi in Vstr examples)
Run programs (doesnt call exec at all, only calls fork() at startup for MP systems).
Call any i18n/gettext libc functions (will be fixed).
Parse or honor the Accept-Charset header.
Full date parser (not a problem, string matches work well).
Download (0.67MB)
Added: 2006-09-11 License: LGPL (GNU Lesser General Public License) Price:
1138 downloads
ezXML 0.8.6
ezXML is a C library for parsing XML documents inspired by simpleXML for PHP. more>>
ezXML is a C library for parsing XML documents inspired by simpleXML for PHP. As the name implies, its easy to use.
Its also fast and lightweight (less than 20k compiled).
Example Usage
Given the following example XML document:
< ?xml version="1.0"?>
< formula1>
< team name="McLaren">
< driver>
< name>Kimi Raikkonen< /name>
< points>45< /points>
< /driver>
< driver>
< name>David Coultard< /name>
< points>24< /points>
< /driver>
< /team>
< /formula1>
This code snippet prints out a list of drivers, which team they drive for, and how many championship points they have:
ezxml_t f1 = ezxml_parse_file("formula1.xml"), team, driver;
const char *teamname;
for (team = ezxml_child(f1, "team"); team; team = team->next) {
teamname = ezxml_attr(team, "name");
for (driver = ezxml_child(team, "driver"); driver; driver = driver->next) {
printf("%s, %s: %sn", ezxml_child(driver, "name")->txt, teamname,
ezxml_child(driver, "points")->txt);
}
}
ezxml_free(f1);
Alternately, the following would print out the name of the second driver of the first team:
ezxml_t f1 = ezxml_parse_file("formula1.xml");
printf("%sn", ezxml_get(f1, "team", 0, "driver", 1, "name", -1)->txt);
ezxml_free(f1);
The -1 indicates the end of the argument list. Thats pretty much all there is to it. Complete API documentation can be found in ezxml.h.
Version restrictions:
- ezXML is not a validating parser.
- Loads the entire XML document into memory at once and does not allow for documents to be passed in a chunk at a time. Large XML files can still be handled though through ezxml_parse_file() and ezxml_parse_fd(), which use mmap to map the file to a virtual address space and rely on the virtual memory system to page in data as needed.
- Does not currently recognize all possible well-formedness errors. It should correctly handle all well-formed XML documents and will either ignore or halt XML processing on well-formedness errors. More well-formedness checking will be added in subsiquent releases.
- In making the character content of tags easy to access, there is no way provided to keep track of the location of sub tags relative to the character data. Example:
< doc>line one< br/>
line two< /doc>
- The character content of the doc tag is reported as "line onenline two", and < br/> is reported as a sub tag, but the location of < br/> within the character data is not. The function ezxml_toxml() will convert an ezXML structure back to XML with sub tag locations intact.
Enhancements:
- A bug was fixed in ezxml_add_child() that could occur when adding tags out of order.
- For consistency, ezxml_set_attr() now returns the tag given.
- ezxml_move() was added, along with its supporting functions ezxml_cut() and ezxml_insert().
- A bug was fixed where parsing an empty file could cause a segfault.
<<lessIts also fast and lightweight (less than 20k compiled).
Example Usage
Given the following example XML document:
< ?xml version="1.0"?>
< formula1>
< team name="McLaren">
< driver>
< name>Kimi Raikkonen< /name>
< points>45< /points>
< /driver>
< driver>
< name>David Coultard< /name>
< points>24< /points>
< /driver>
< /team>
< /formula1>
This code snippet prints out a list of drivers, which team they drive for, and how many championship points they have:
ezxml_t f1 = ezxml_parse_file("formula1.xml"), team, driver;
const char *teamname;
for (team = ezxml_child(f1, "team"); team; team = team->next) {
teamname = ezxml_attr(team, "name");
for (driver = ezxml_child(team, "driver"); driver; driver = driver->next) {
printf("%s, %s: %sn", ezxml_child(driver, "name")->txt, teamname,
ezxml_child(driver, "points")->txt);
}
}
ezxml_free(f1);
Alternately, the following would print out the name of the second driver of the first team:
ezxml_t f1 = ezxml_parse_file("formula1.xml");
printf("%sn", ezxml_get(f1, "team", 0, "driver", 1, "name", -1)->txt);
ezxml_free(f1);
The -1 indicates the end of the argument list. Thats pretty much all there is to it. Complete API documentation can be found in ezxml.h.
Version restrictions:
- ezXML is not a validating parser.
- Loads the entire XML document into memory at once and does not allow for documents to be passed in a chunk at a time. Large XML files can still be handled though through ezxml_parse_file() and ezxml_parse_fd(), which use mmap to map the file to a virtual address space and rely on the virtual memory system to page in data as needed.
- Does not currently recognize all possible well-formedness errors. It should correctly handle all well-formed XML documents and will either ignore or halt XML processing on well-formedness errors. More well-formedness checking will be added in subsiquent releases.
- In making the character content of tags easy to access, there is no way provided to keep track of the location of sub tags relative to the character data. Example:
< doc>line one< br/>
line two< /doc>
- The character content of the doc tag is reported as "line onenline two", and < br/> is reported as a sub tag, but the location of < br/> within the character data is not. The function ezxml_toxml() will convert an ezXML structure back to XML with sub tag locations intact.
Enhancements:
- A bug was fixed in ezxml_add_child() that could occur when adding tags out of order.
- For consistency, ezxml_set_attr() now returns the tag given.
- ezxml_move() was added, along with its supporting functions ezxml_cut() and ezxml_insert().
- A bug was fixed where parsing an empty file could cause a segfault.
Download (0.017MB)
Added: 2006-06-08 License: MIT/X Consortium License Price:
1237 downloads
tthsum 1.1.0
tthsum generates and checks TTH checksums. more>>
tthsum generates and checks TTH checksums (root of the THEX hash tree). The Merkle Hash Tree is a hash construct that exhibits desirable properties for verifying the integrity of files and file subranges in an incremental or out-of-order fashion.
The tool uses the Tiger hash algorithm for both the internal and the leaf nodes, and has an interface identical to md5sum.
Enhancements:
- Converted tthsum to C (it was C++).
- Updated makefiles, added NMakefile for Windows, run nmake /f NMakefile on windows.
- Added BIG_ENDIAN support (tested on a SPARC).
- Removed -b functionality. The asterisk that did nothing didnt make sense.
- Made this Changelog a bit more readable.
- Fixed a bug where incorrect hashes were generated when using the console as input file. (The reads did not generate a multiple of 1024 bytes.)
- Added mmap(2) support (-m) (mapping 1.6MB at a time), default is read(2). YMMV.
- Added -p, -w, -V options (show progress, warn about improper digest lines, show version).
- Writing escaped and utf8-ified filenames to digest.
<<lessThe tool uses the Tiger hash algorithm for both the internal and the leaf nodes, and has an interface identical to md5sum.
Enhancements:
- Converted tthsum to C (it was C++).
- Updated makefiles, added NMakefile for Windows, run nmake /f NMakefile on windows.
- Added BIG_ENDIAN support (tested on a SPARC).
- Removed -b functionality. The asterisk that did nothing didnt make sense.
- Made this Changelog a bit more readable.
- Fixed a bug where incorrect hashes were generated when using the console as input file. (The reads did not generate a multiple of 1024 bytes.)
- Added mmap(2) support (-m) (mapping 1.6MB at a time), default is read(2). YMMV.
- Added -p, -w, -V options (show progress, warn about improper digest lines, show version).
- Writing escaped and utf8-ified filenames to digest.
Download (0.030MB)
Added: 2005-06-29 License: GPL (GNU General Public License) Price:
1582 downloads
mod_ntlm 0.4
mod_ntlm is NTLM authentication for Apache / Unix. more>>
mod_ntlm is NTLM authentication for Apache / Unix.
Installation:
You have to be root to compile and install mod_ntlm.c successfully. You need a ready-to-run apache distribution installed. Go to the source distribution directory of mod_ntlm and enter:
make install && make restart
The Makefile is using apxs to compile and install mod_ntlm. Certain versions of apxs are known to fail unter certain versions of SuSE Linux.
It works fine for me with SuSE Linux 6.3 and Solaris 2.6, no other platforms have been tested y
Version restrictions:
- Basic authentication against SMB server is not supported. There are enough modules that do this and you need https to make it safe.
- Internet Explorer 3.0 (broken keepalive) is not supported, its about time to get a new browsers. Those users should have taken their computers away for using year old software.
- You can produce a problem by pressing reload fast and often. The connection is forced into reset each time, and sometimes Internet Explorer is sending a msg3 to an apache process that didnt send the msg1 yet. Im not sure weather this is an apache or Linux or IE problem. It could be resolved by caching credentials, which is unsafe and involves neat things like file locking and mmap().
Enhancements:
- Apache 1.3.x
<<lessInstallation:
You have to be root to compile and install mod_ntlm.c successfully. You need a ready-to-run apache distribution installed. Go to the source distribution directory of mod_ntlm and enter:
make install && make restart
The Makefile is using apxs to compile and install mod_ntlm. Certain versions of apxs are known to fail unter certain versions of SuSE Linux.
It works fine for me with SuSE Linux 6.3 and Solaris 2.6, no other platforms have been tested y
Version restrictions:
- Basic authentication against SMB server is not supported. There are enough modules that do this and you need https to make it safe.
- Internet Explorer 3.0 (broken keepalive) is not supported, its about time to get a new browsers. Those users should have taken their computers away for using year old software.
- You can produce a problem by pressing reload fast and often. The connection is forced into reset each time, and sometimes Internet Explorer is sending a msg3 to an apache process that didnt send the msg1 yet. Im not sure weather this is an apache or Linux or IE problem. It could be resolved by caching credentials, which is unsafe and involves neat things like file locking and mmap().
Enhancements:
- Apache 1.3.x
Download (0.040MB)
Added: 2006-05-02 License: BSD License Price:
1272 downloads
libxcpc 0.21
libxcpc library implements an automatic resource cleanup and exception handling in C. more>>
libxcpc library implements an automatic resource cleanup and exception handling in C. Error handling and cleanup code (at least for code that does error handling) can take quite some space in terms of lines of code to be written. This not only increases the binary size, but makes the code more difficult to read. C++ has native exception handling, and this solves part of the problem, while keeping exposed the resource cleanup one.
The libxcpc offers C++ like exception handling, plus automatic resource cleanup, to be used in software written in C. The libxcpc introduces three abstractions, that are Resource, Container and Exception. The Resource is every object (or action) that needs cleanup. This can be a block of allocated memory, an open file, a mapped memory region, etc... Every allocated Resource is owned by a Container. A Resource can be moved from a Container to another. A Container is a bucket inside which Resource are allocated.
A Container can be the parent of other Containers, by hence introducing a parent/child relationship between Containers. A Container can be reassigned to be child of a new Container. By freeing a Container all the Resources allocated inside the Container will be freed, and all the child Containers will be recursively freed too. Resource Containers greatly simplify the resource cleanup code, by being able to issue a single call to free a Container and having automatically all the Resources contained by it, freed as well.
Resources are added/removed in a LIFO (Last In First Out) way, and the libxcpc library offers APIs to re-arrange the order of the Resources inside their Contexts. An Exception is (like in C++) any kind of abnormal condition that prevent the program to flow in its path. This can be a failed memory allocation, a failure to open a file, a failure to mmap(2) a portion of a file, a failure to write(2) a file, etc... An Exception is described by a unique number (int) and by an associated data (void *). Exceptions are thrown using the XCPC_THROW(ctx, exno, data) statement, or re-thrown using XCPC_RETHROW(ctx).
A nice feature of exception handling, is that it allows you to handle only certain kind of exceptions, and different exceptions in different points of your code tree. Using libxcpc library, you handle exceptions by surrounding the potentially-throwing code with the XCPC_TRY(ctx) statement. The code can then use either the XCPC_CATCH(exno) or the XCPC_CATCH_ANY statements to handle specific or all kind of exceptions that happened in the code bound by the XCPC_TRY(ctx). An Exception block must be terminated by a XCPC_END_TRY statement.
If the current Exception block does not handle the current Exception using the XCPC_CATCH(exno) statement, and does not have a XCPC_CATCH_ANY statement, the libxcpc library backtrack to find a valid handler in the code at higher layers of the call hierarchy. It is important that at least the other Exception block uses a XCPC_CATCH_ANY statement, so that any Exceptions not caught by the code, is handled properly. When an Exception is caught by an handler, all the resources allocated by the code from the beginning of the XCPC_TRY(ctx) block, down to the place where the Exception is thrown, are automatically freed once the handler reaches the XCPC_END_TRY statement.
Enhancements:
- This release adds new system calls wrappers and fixes a few minor bugs.
<<lessThe libxcpc offers C++ like exception handling, plus automatic resource cleanup, to be used in software written in C. The libxcpc introduces three abstractions, that are Resource, Container and Exception. The Resource is every object (or action) that needs cleanup. This can be a block of allocated memory, an open file, a mapped memory region, etc... Every allocated Resource is owned by a Container. A Resource can be moved from a Container to another. A Container is a bucket inside which Resource are allocated.
A Container can be the parent of other Containers, by hence introducing a parent/child relationship between Containers. A Container can be reassigned to be child of a new Container. By freeing a Container all the Resources allocated inside the Container will be freed, and all the child Containers will be recursively freed too. Resource Containers greatly simplify the resource cleanup code, by being able to issue a single call to free a Container and having automatically all the Resources contained by it, freed as well.
Resources are added/removed in a LIFO (Last In First Out) way, and the libxcpc library offers APIs to re-arrange the order of the Resources inside their Contexts. An Exception is (like in C++) any kind of abnormal condition that prevent the program to flow in its path. This can be a failed memory allocation, a failure to open a file, a failure to mmap(2) a portion of a file, a failure to write(2) a file, etc... An Exception is described by a unique number (int) and by an associated data (void *). Exceptions are thrown using the XCPC_THROW(ctx, exno, data) statement, or re-thrown using XCPC_RETHROW(ctx).
A nice feature of exception handling, is that it allows you to handle only certain kind of exceptions, and different exceptions in different points of your code tree. Using libxcpc library, you handle exceptions by surrounding the potentially-throwing code with the XCPC_TRY(ctx) statement. The code can then use either the XCPC_CATCH(exno) or the XCPC_CATCH_ANY statements to handle specific or all kind of exceptions that happened in the code bound by the XCPC_TRY(ctx). An Exception block must be terminated by a XCPC_END_TRY statement.
If the current Exception block does not handle the current Exception using the XCPC_CATCH(exno) statement, and does not have a XCPC_CATCH_ANY statement, the libxcpc library backtrack to find a valid handler in the code at higher layers of the call hierarchy. It is important that at least the other Exception block uses a XCPC_CATCH_ANY statement, so that any Exceptions not caught by the code, is handled properly. When an Exception is caught by an handler, all the resources allocated by the code from the beginning of the XCPC_TRY(ctx) block, down to the place where the Exception is thrown, are automatically freed once the handler reaches the XCPC_END_TRY statement.
Enhancements:
- This release adds new system calls wrappers and fixes a few minor bugs.
Download (0.38MB)
Added: 2007-03-27 License: LGPL (GNU Lesser General Public License) Price:
942 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 mmap 0.0.10 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