Skip to content

Instantly share code, notes, and snippets.

Nick Glynn 17twenty

Block or report user

Report or block 17twenty

Hide content and notifications from this user.

Learn more about blocking users

Contact Support about this user’s behavior.

Learn more about reporting abuse

Report abuse
View GitHub Profile
Arinerron / permissions.txt
Last active Nov 18, 2019
A list of all Android permissions...
View permissions.txt
17twenty / bst_in_go.go
Last active Nov 6, 2015
Search/Insert and Traverse
View bst_in_go.go
package main
import (
type Node struct {
left *Node
right *Node
17twenty /
Created May 5, 2015
Since the introduction of the append built-in, most of the functionality of the container/vector package, which was removed in Go 1, can be replicated using append() and copy()

Here are the vector methods and their slice-manipulation analogues:


a = append(a, b...)


b = make([]T, len(a))
17twenty / learn_something_new.c
Created May 23, 2014
Learn something new about passing arrays, and how awful the syntax can be :D
View learn_something_new.c
/* gcc -std=c99 due to loop initialiser - stupid GCC defaulting to C89 :( */
#include <stdio.h>
#define ARRAY_SIZE(x) \
((sizeof(x) / sizeof(x[0])))
void count_and_process_items(unsigned int (*array)[10])
for (int i = 0; i < ARRAY_SIZE(*array); ++i) {
printf("Item %d = %d\n", i, (*array)[i]);

Please note that the article is now on my website, and even though I am still working on it, any feedback is appreciated. Thanks for reading !

On the Quest of recoding malloc(3)

Back when I did not know anything about programing and started to learn C, I was first introduced to pointers (and other dreaded horrors that made me curl into a corner and cry) and dynamic memory in general.

I was baffled, troubled, yet fascinated by the basic explanation on how memory worked, and started to dread the time where I would need to manually create my char arrays for each and every sentences of my program; right before learning about string literals and feeling like an idiot.

It was then where I was learning about memory allocation and came upon a function that I would call for long the "magic function" : malloc. Magic, because at that point I didn't know how it worked, let alone knew anything about memory other that it was a "chain of boxes for numbers".

fkautz / serverdemo.go
Created Jan 31, 2014
A simple demo of mixing various go http server and rpc using mux
View serverdemo.go
package main
import (
grpc ""
17twenty / am33xx.dtsi
Last active Nov 18, 2017
Example Platform Driver to set mux on Beaglebone based on device tree
View am33xx.dtsi
* Device Tree Source for AM33XX SoC
* Copyright (C) 2012 Texas Instruments Incorporated -
* This file is licensed under the terms of the GNU General Public License
* version 2. This program is licensed "as is" without any warranty of any
* kind, whether express or implied.
  • Intro
    • Mindset
      • Break all the things
    • Understanding is key
      • Security people are the most diverse in tech for that reason
  • Web security
    • Tools
      • Burp
    • XSS
    • CSRF
vsergeev /
Created Apr 15, 2012
Minimalist "Embedded Linux from Scratch" Beaglebone Distribution Build

Busybox "Embedded Linux from Scratch" Distribution for the Beaglebone

Prepare your Build Sandbox

$ mkdir -p beaglelfs/{sources,rootfs_install,boot_mnt,rootfs_mnt}

Acquire an ARM Toolchain

Download the latest i686 Binary TAR of the ARM GNU/Linux (glibc-based) Lite Toolchain:

You can’t perform that action at this time.