URL shortener, pastebin & file-sharing service, written from the ground up in C. https://r8r.be
 
 
 
 
 
Go to file
Jef Roosens 8a3be2b07c
ci/woodpecker/push/build Pipeline was successful Details
feat(lnm): start of event loop
2023-11-21 22:39:59 +01:00
.woodpecker feat(http): allow arbitrary number of response headers 2023-11-20 22:25:58 +01:00
bench chore: add benchmarking 2023-05-31 20:39:06 +02:00
include refactor(http): pass Server & Content-Length as proper headers 2023-11-20 22:41:49 +01:00
landerctl chore: clean up makefiles a bit 2023-11-18 21:36:08 +01:00
lnm feat(lnm): start of event loop 2023-11-21 22:39:59 +01:00
lsm chore: please cppcheck 2023-11-18 22:28:50 +01:00
src refactor(http): pass Server & Content-Length as proper headers 2023-11-20 22:41:49 +01:00
test refactor: decouple trie into static library 2023-07-28 18:48:44 +02:00
thirdparty refactor: clean up the code to start development properly 2023-05-29 18:28:43 +02:00
.dockerignore chore(lander): fix Docker build 2023-11-14 15:34:07 +01:00
.editorconfig feat: added randomly generated URLs 2022-11-21 12:03:16 +01:00
.gitignore feat(lander): integrate persistent insert & get lsm store 2023-11-08 11:19:33 +01:00
ARCHITECTURE.md docs: start architure file 2023-05-29 18:28:45 +02:00
CHANGELOG.md feat(http): allow arbitrary number of response headers 2023-11-20 22:25:58 +01:00
Dockerfile chore(lander): fix Docker build 2023-11-14 15:34:07 +01:00
Makefile chore: clean up makefiles a bit 2023-11-18 21:36:08 +01:00
README.md chore(lander): update readme 2023-11-19 13:25:09 +01:00
config.mk chore: remove old trie library 2023-11-19 21:01:32 +01:00
docker-compose.yml fix: accept more headers and bigger requests for browsers 2023-07-21 12:20:27 +02:00

README.md

Lander

Lander is an HTTP/1.1 server that acts as a URL shortener, pastebin and file-sharing service. It's written from the ground up in C, complete with an HTTP framework built on top of an event loop implementation based on Build Your Own Redis with C/C++. Lookup of entries is done using an in-memory trie data structure, and on-disk storage uses a custom binary database format.

The codebase uses one thirdparty library, namely picohttpparser for parsing HTTP requests.

The idea

A URL shortener has always been on my list of things I'd like to write myself. It's simple, yet useful.

for our Algorithms & Datastructures 3 class, we had to implement three different tries (Patricia trie, ternary trie, and a custom one). Considering these are efficient string-based search trees, this gave me the idea to use it as the backend for a URL shortener!

The name

I gave up giving my projects original names a long time ago, so now I just use the names of my friends ;p

Benchmarking

I benchmark this tool using the wrk2 utility. I've provided two Lua scripts to aid with this. To bench publishing redirects, use the following:

wrk2 -s bench/post.lua -t 10 -R 10k -d30s -c32 http://localhost:18080

And to bench GET requests:

wrk2 -s bench/get.lua -t 10 -R 25k -d30s -c32 http://localhost:18080

Of course you're free to change the parameters, but the provided Lua files generate URLs that can be used in the benchmark.