├── README ├── fb.h ├── Makefile ├── .github └── workflows │ └── codeql-analysis.yml ├── fb.c ├── monky.c └── COPYING /README: -------------------------------------------------------------------------------- 1 | framebuffer system monitor with truetype font handling, 32bit colors and 2 | histograms. 3 | 4 | depends: freetype2, libseccomp 5 | 6 | run it like: 7 | ./mon sda eth1: 8 | 9 | no configuration, stuff gets compiled, check monky.c. 10 | 11 | screenshot can be seen here: https://www.ctrlc.hu/~stef/monky.png 12 | -------------------------------------------------------------------------------- /fb.h: -------------------------------------------------------------------------------- 1 | #ifndef FB_H 2 | #define FB_H 3 | typedef struct { 4 | float limit; 5 | int color; 6 | } color_t; 7 | 8 | void init_fb(int fd, int _ttyfd); 9 | void init_ft(char* ttfp, size_t ttfp_len); 10 | void display(char *str, size_t str_len, float* data, uint8_t idx, size_t data_len, int fg, int bg, color_t *colors); 11 | void newline(int start, int y, int bg); 12 | #endif 13 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | INCLUDES = -I/usr/include/freetype2 2 | 3 | # for debugging 4 | #CFLAGS = -g -Wall -march=native -Werror -fPIC -fstack-protector --param=ssp-buffer-size=4 -Wformat -Werror=format-security $(INCLUDES) 5 | 6 | LIBS = -lseccomp -lfreetype 7 | CFLAGS = -O3 -Wall -march=native -Werror -fPIC -fstack-protector --param=ssp-buffer-size=4 -Wformat -Werror=format-security $(INCLUDES) 8 | 9 | # for those without seccomp: 10 | #LIBS = -lfreetype 11 | #CFLAGS = -DWITHOUT_SECCOMP -O3 -Wall -march=native -Werror -fPIC -fstack-protector --param=ssp-buffer-size=4 -Wformat -Werror=format-security $(INCLUDES) 12 | 13 | LDFLAGS = -Wl,--gc-sections -Wl,-z,relro,-PIE -fPIC 14 | 15 | objs = fb.o 16 | 17 | all : monky 18 | 19 | monky : monky.c $(objs) 20 | $(CC) $(CFLAGS) $(LDFLAGS) -o monky monky.c $(objs) $(LIBS) 21 | sudo chown root.root monky 22 | sudo chmod u+s monky 23 | -------------------------------------------------------------------------------- /.github/workflows/codeql-analysis.yml: -------------------------------------------------------------------------------- 1 | name: "CodeQL" 2 | 3 | on: 4 | push: 5 | branches: [master, ] 6 | pull_request: 7 | # The branches below must be a subset of the branches above 8 | branches: [master] 9 | schedule: 10 | - cron: '0 15 * * 2' 11 | 12 | jobs: 13 | analyze: 14 | name: Analyze 15 | runs-on: ubuntu-latest 16 | 17 | steps: 18 | - name: Checkout repository 19 | uses: actions/checkout@v2 20 | with: 21 | # We must fetch at least the immediate parents so that if this is 22 | # a pull request then we can checkout the head. 23 | fetch-depth: 2 24 | 25 | # If this run was triggered by a pull request event, then checkout 26 | # the head of the pull request instead of the merge commit. 27 | - run: git checkout HEAD^2 28 | if: ${{ github.event_name == 'pull_request' }} 29 | 30 | # Initializes the CodeQL tools for scanning. 31 | - name: Initialize CodeQL 32 | uses: github/codeql-action/init@v1 33 | # Override language selection by uncommenting this and choosing your languages 34 | # with: 35 | # languages: go, javascript, csharp, python, cpp, java 36 | 37 | # Autobuild attempts to build any compiled languages (C/C++, C#, or Java). 38 | # If this step fails, then you should remove it and run the build manually (see below) 39 | #- name: Autobuild 40 | # uses: github/codeql-action/autobuild@v1 41 | 42 | # ℹ️ Command-line programs to run using the OS shell. 43 | # 📚 https://git.io/JvXDl 44 | 45 | # ✏️ If the Autobuild fails above, remove it and uncomment the following three lines 46 | # and modify them (or add more) to build your code if your project 47 | # uses a compiled language 48 | 49 | - run: | 50 | sudo apt-get update 51 | sudo apt-get install libfreetype6-dev libseccomp-dev 52 | make 53 | 54 | - name: Perform CodeQL Analysis 55 | uses: github/codeql-action/analyze@v1 56 | -------------------------------------------------------------------------------- /fb.c: -------------------------------------------------------------------------------- 1 | // standalone compile with: gcc -g -DSTANDALONE_FB -lfreetype -I/usr/include/freetype2 -o fb fb.c 2 | #define _GNU_SOURCE 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include FT_FREETYPE_H 15 | #include FT_GLYPH_H 16 | #include 17 | #include "fb.h" 18 | 19 | #define MAX_GLYPHS 170 20 | 21 | // globals 22 | 23 | int mainvt=-1; 24 | 25 | int direction=0; 26 | 27 | // fb state/info 28 | int fbfd = -1; 29 | struct fb_var_screeninfo vinfo; 30 | struct fb_fix_screeninfo finfo; 31 | long int screensize = 0; 32 | char *fbp = NULL; 33 | 34 | int ttyfd; 35 | 36 | // freetype state/info 37 | FT_Library library; 38 | FT_Face face; 39 | 40 | int getvt() { 41 | if(ttyfd==-1) { 42 | printf("couldn't open /dev/tty0\n"); 43 | exit(1); 44 | } 45 | struct vt_stat vtstat; 46 | if (ioctl(ttyfd, VT_GETSTATE, &vtstat) < 0) { 47 | return -1; 48 | } 49 | return vtstat.v_active; 50 | } 51 | 52 | void init_fb(int fd, int _ttyfd) { 53 | fbfd = fd; 54 | if (fbfd == -1) { 55 | perror("Error: cannot open framebuffer device"); 56 | exit(1); 57 | } 58 | //printf("The framebuffer device was opened successfully.\n"); 59 | 60 | // Get fixed screen information 61 | if (ioctl(fbfd, FBIOGET_FSCREENINFO, &finfo) == -1) { 62 | perror("Error reading fixed information"); 63 | exit(2); 64 | } 65 | 66 | // Get variable screen information 67 | if (ioctl(fbfd, FBIOGET_VSCREENINFO, &vinfo) == -1) { 68 | perror("Error reading variable information"); 69 | exit(3); 70 | } 71 | 72 | //printf("%dx%d, %dbpp\n", vinfo.xres, vinfo.yres, vinfo.bits_per_pixel); 73 | 74 | // Figure out the size of the screen in bytes 75 | screensize = vinfo.xres * vinfo.yres * vinfo.bits_per_pixel / 8; 76 | 77 | // Map the device to memory 78 | fbp = (char *)mmap(0, screensize, PROT_READ | PROT_WRITE, MAP_SHARED, 79 | fbfd, 0); 80 | if ((long int)fbp == -1) { 81 | perror("Error: failed to map framebuffer device to memory"); 82 | exit(4); 83 | } 84 | //printf("The framebuffer device was mapped to memory successfully.\n"); 85 | 86 | //remember the current vt 87 | ttyfd=_ttyfd; 88 | if((mainvt=getvt())==-1) { 89 | printf("unable to determine current vt\n"); 90 | exit(1); 91 | }; 92 | } 93 | 94 | void init_ft(char* ttfp, size_t ttfp_len) { 95 | int error; 96 | 97 | //printf("Initializing Freetype2\n"); 98 | error = FT_Init_FreeType( &library ); 99 | if ( error ) return; 100 | 101 | //printf("Loading font: %s\n", font); 102 | FT_Open_Args args; 103 | args.flags=FT_OPEN_MEMORY; 104 | args.memory_base=(unsigned char*) ttfp; 105 | args.memory_size=ttfp_len; 106 | error = FT_Open_Face( library, &args, 0, &face ); 107 | if ( error == FT_Err_Unknown_File_Format ) { 108 | printf("unknown font format\n"); 109 | exit(1); 110 | } else if ( error ) { 111 | printf("font error: %d\n", error); 112 | exit(1); 113 | } 114 | 115 | error = FT_Set_Char_Size( face, /* handle to face object */ 116 | 0, /* char_width in 1/64th of points */ 117 | 90, /* char_height in 1/64th of points */ 118 | 600, /* horizontal device resolution */ 119 | 600 ); /* vertical device resolution */ 120 | if ( error ) { 121 | printf("font size error: %d\n", error); 122 | exit(1); 123 | } 124 | } 125 | 126 | void compute_string_bbox(FT_Glyph *glyphs, FT_UInt num_glyphs, FT_Vector *pos, FT_BBox *bbox ) { 127 | // could be so much more efficient with monospaced fonts. 128 | FT_BBox glyph_bbox; 129 | int n; 130 | 131 | /* initialize string bbox to "empty" values */ 132 | bbox->xMin = bbox->yMin = 32000; 133 | bbox->xMax = bbox->yMax = -32000; 134 | 135 | /* for each glyph image, compute its bounding box, */ 136 | /* translate it, and grow the string bbox */ 137 | for ( n = 0; n < num_glyphs; n++ ) { 138 | FT_Glyph_Get_CBox( glyphs[n], ft_glyph_bbox_pixels, 139 | &glyph_bbox ); 140 | 141 | glyph_bbox.xMin += pos[n].x; 142 | glyph_bbox.xMax += pos[n].x; 143 | glyph_bbox.yMin += pos[n].y; 144 | glyph_bbox.yMax += pos[n].y; 145 | 146 | if ( glyph_bbox.xMin < bbox->xMin ) 147 | bbox->xMin = glyph_bbox.xMin; 148 | 149 | if ( glyph_bbox.yMin < bbox->yMin ) 150 | bbox->yMin = glyph_bbox.yMin; 151 | 152 | if ( glyph_bbox.xMax > bbox->xMax ) 153 | bbox->xMax = glyph_bbox.xMax; 154 | 155 | if ( glyph_bbox.yMax > bbox->yMax ) 156 | bbox->yMax = glyph_bbox.yMax; 157 | } 158 | /* check that we really grew the string bbox */ 159 | if ( bbox->xMin > bbox->xMax ) { 160 | bbox->xMin = 0; 161 | bbox->yMin = 0; 162 | bbox->xMax = 0; 163 | bbox->yMax = 0; 164 | } 165 | } 166 | 167 | int draw_glyph(FT_Bitmap *bm, int x,int y, int bgcol) { 168 | long int location = 0, row, col; 169 | if(bm==NULL || fbp==NULL || x<0 || y<0 || x+bm->width>vinfo.xres || y+bm->rows>vinfo.yres) { 170 | return -1; 171 | } 172 | for (row=bm->rows;row>0;row--) { 173 | for (col=0;colwidth;col++) { 174 | location = (x+col+vinfo.xoffset) * (vinfo.bits_per_pixel/8) + 175 | (y+(row-1)+vinfo.yoffset) * finfo.line_length; 176 | if (vinfo.bits_per_pixel == 32) { 177 | if(bm->pixel_mode==FT_PIXEL_MODE_GRAY) { 178 | if(bm->buffer[((row-1)*bm->width)+col]!=0) { 179 | *(fbp+location)=bm->buffer[((row-1)*bm->width)+col]; 180 | *(fbp+location+1)=bm->buffer[((row-1)*bm->width)+col]; 181 | *(fbp+location+2)=bm->buffer[((row-1)*bm->width)+col]; 182 | *(fbp+location+3)=0xff; 183 | } else { 184 | *((int*)(fbp+location))=bgcol; 185 | } 186 | } //else if(bm->pixel_mode==FT_PIXEL_MODE_MONO) { 187 | //} 188 | }// else { //assume 16bpp 189 | //} 190 | } 191 | } 192 | return 0; 193 | } 194 | 195 | 196 | int fill(int x, int y, int w, int h, int col) { 197 | if(fbp==NULL || x<0 || y<0 || x+w>vinfo.xres || y+h>vinfo.yres) { 198 | return -1; 199 | } 200 | long int location = 0; 201 | int n,m; 202 | for(n=0; nglyph; /* a small shortcut */ 224 | 225 | pen_x = 0; /* start at (0,0) */ 226 | pen_y = 0; 227 | 228 | num_glyphs = 0; 229 | 230 | for ( n = 0; n < num_chars; n++ ) { 231 | /* convert character code to glyph index */ 232 | glyph_index = FT_Get_Char_Index( face, txt[n] ); 233 | if(glyph_index<0) { 234 | return -1; 235 | } 236 | /* store current pen position */ 237 | pos[num_glyphs].x = pen_x; 238 | pos[num_glyphs].y = pen_y; 239 | 240 | /* load glyph image into the slot without rendering */ 241 | error = FT_Load_Glyph( face, glyph_index, FT_LOAD_DEFAULT ); 242 | if ( error ) 243 | continue; /* ignore errors, jump to next glyph */ 244 | 245 | /* extract glyph image and store it in our table */ 246 | error = FT_Get_Glyph( face->glyph, &glyphs[num_glyphs] ); 247 | if ( error ) 248 | continue; /* ignore errors, jump to next glyph */ 249 | 250 | /* increment pen position */ 251 | pen_x += slot->advance.x >> 6; 252 | 253 | /* increment number of glyphs */ 254 | num_glyphs++; 255 | } 256 | 257 | compute_string_bbox(glyphs, num_chars, pos, &string_bbox); 258 | /* compute string dimensions in integer pixels */ 259 | string_width = string_bbox.xMax - string_bbox.xMin; 260 | string_height = string_bbox.yMax - string_bbox.yMin; 261 | 262 | if(direction==-1) x = x - (pos[num_glyphs-1].x + 9); 263 | 264 | if(fill(x,y,string_width+3,string_height+4,bgcol)==-1) { 265 | printf("failed to fill area: x=%d y=%d w=%d h=%d\n",x,y,string_width+3,string_height+4); 266 | exit(1); 267 | } 268 | 269 | // compute start pen position 270 | y += string_height; // bug if _ then height is 12, otherwise less... :/ 271 | 272 | for(n = 0; n < num_glyphs; n++) { 273 | FT_Glyph image; 274 | FT_Vector pen; 275 | image = glyphs[n]; 276 | pen.x = pos[n].x; 277 | pen.y = pos[n].y; 278 | 279 | error = FT_Glyph_To_Bitmap( &image, FT_RENDER_MODE_NORMAL, &pen, 0 ); 280 | if ( error ) { 281 | printf("font rendering error: %d\n",error); 282 | exit(1); 283 | } 284 | FT_BitmapGlyph bit = (FT_BitmapGlyph)image; 285 | draw_glyph( &bit->bitmap, 286 | x+pen.x+1, // + bit->left, 287 | y - (bit->top-1), 288 | bgcol); 289 | FT_Done_Glyph( image ); 290 | } 291 | for(n = 0; n < num_glyphs; n++) 292 | FT_Done_Glyph( glyphs[n] ); 293 | if(direction==-1) return x; 294 | return x + pos[num_glyphs-1].x + 9; 295 | } 296 | 297 | int histogram(float *data, uint8_t idx, size_t len, int x, int y, int h, color_t *colors, int bg) { 298 | if(direction!=1 && direction!=-1) { 299 | return -1; 300 | } 301 | float max=-INFINITY, min=INFINITY, range; 302 | unsigned int i, j, x1, y1, location, fg=colors[0].color; 303 | //find min/max 304 | for(i=0;imax) max=data[(i+idx) % len]; 307 | } 308 | 309 | for(i=0;data[idx]>=colors[i].limit && !isnan(colors[i].limit);i++) { 310 | fg=colors[i].color; 311 | } 312 | 313 | range=max-min; 314 | if(direction==-1) x-=len+1; 315 | for(i=0;ivinfo.xres || y+h>vinfo.yres) { 380 | return -1; 381 | } 382 | for (y1=y;y1=0) { 415 | close(fbfd); 416 | fbfd=-1; 417 | } 418 | } 419 | 420 | int main() { 421 | init_fb(); 422 | 423 | float data[]={1,1,1,2,2,3,3,5,7,6,5,3,2,1,1,1,4,3,1,1,1,2,1,2,1,2}; 424 | display("hello world", 11, data, 20, 0x00ff0000, 0x00333333, 1); 425 | int n; 426 | for(n=0;n<9;n++) { 427 | display("hello world", 11, data, 20, 0x00ff0000, 0x00333333, 0); 428 | } 429 | screenshot("fbft.ppm"); 430 | close_fb(); 431 | return 0; 432 | } 433 | #endif //STANDALONE_FB 434 | -------------------------------------------------------------------------------- /monky.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include /* libseccomp */ 8 | #include /* prctl */ 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include "fb.h" 14 | #include 15 | #include 16 | 17 | char font[]="./envy.ttf"; 18 | 19 | // set uid/guid to monky/readproc 20 | #define USERID 113 21 | #define GROUPID 30 22 | // set uid/guid to nobody 23 | //#define USERID 65534 24 | //#define GROUPID 65534 25 | 26 | // amount of history to keep 27 | #define SAMPLES 20 28 | #define SAMPLE_RATE 10 29 | 30 | #define FGCOLOR 0x000000ff 31 | #define BGCOLOR 0x000a0a0a 32 | 33 | // this is the position of monky 34 | #define monky_y (768 - (6*12)) 35 | 36 | #if __x86_64__ 37 | #define UD "ld" 38 | #else 39 | #define UD "lld" 40 | #endif 41 | 42 | int ttyfd; 43 | long unsigned int iteration=0; 44 | 45 | color_t default_colors[]={ { .limit = 0, .color = 0x000000a0, }, { .limit = NAN, .color = 0, }}; 46 | 47 | color_t percent_colors[]={ { .limit = 0, .color = 0x00404040, }, 48 | { .limit = 20, .color = 0x00000080, }, 49 | { .limit = 50, .color = 0x00808000, }, 50 | { .limit = 75, .color = 0x00cccccc, }, 51 | { .limit = 90, .color = 0x00800000, }, 52 | { .limit = NAN, .color = 0, }}; 53 | color_t revpercent_colors[]={ { .limit = 0, .color = 0x00800000, }, 54 | { .limit = 20, .color = 0x00804000, }, 55 | { .limit = 50, .color = 0x00808000, }, 56 | { .limit = 75, .color = 0x00000080, }, 57 | { .limit = 90, .color = 0x00808080, }, 58 | { .limit = NAN, .color = 0, }}; 59 | color_t temp_colors[]={ { .limit = 0, .color = 0x00808080, }, 60 | { .limit = 40, .color = 0x00000080, }, 61 | { .limit = 60, .color = 0x00808000, }, 62 | { .limit = 70, .color = 0x00804000, }, 63 | { .limit = 80, .color = 0x00800000, }, 64 | { .limit = 85, .color = 0x00cccccc, }, 65 | { .limit = NAN, .color = 0, }}; 66 | 67 | void fail(const int cmp, const char *msg) { 68 | if(cmp) { 69 | printf("%s\n", msg); 70 | exit(1); 71 | } 72 | } 73 | 74 | static void push(float q[], uint8_t* idx, float *acc, const float val) { 75 | *acc+=val; 76 | if(iteration%SAMPLE_RATE==0) { 77 | *idx = (*idx+1) % SAMPLES; 78 | q[*idx]=(*acc)/SAMPLE_RATE; 79 | *acc=0; 80 | } 81 | } 82 | 83 | FILE* cpufd; 84 | float cpu_samples[SAMPLES], cpuacc; 85 | uint8_t cpu_samples_idx=0; 86 | void cpu(void) { 87 | static uint64_t prevcputotal, prevcpuunused; 88 | uint32_t user, nice, system, idle, iowait, irq, softirq, steal, guest, guest_nice; 89 | uint64_t total, unused; 90 | float dtotal, dunused, ret; 91 | char label[5]; 92 | fail(fseek(cpufd,0,SEEK_SET)==-1, "failed to seek cpufd\n"); 93 | fail(fscanf(cpufd,"%4s %d %d %d %d %d %d %d %d %d %d", 94 | label, &user, &nice, &system, &idle, &iowait, &irq, &softirq, &steal, &guest, &guest_nice)==12, 95 | "cannot parse cpufd\n"); 96 | while(fgetc(cpufd)!=EOF); // weird way of flushing /proc files 97 | if(strncmp("cpu",label,sizeof(label))!=0) { 98 | printf("err: /proc/stat does not start with cpu line\n"); 99 | exit(1); 100 | } 101 | total = user + nice + system + idle + iowait + irq + softirq + steal + guest + guest_nice; 102 | unused = idle + iowait; 103 | 104 | // get previous sample 105 | if(prevcputotal == 0) { 106 | prevcputotal = total; 107 | } 108 | if(prevcpuunused == 0) { 109 | prevcpuunused = unused; 110 | } 111 | dtotal=total-prevcputotal; 112 | dunused=unused-prevcpuunused; 113 | 114 | // remember current sample 115 | prevcputotal = total; 116 | prevcpuunused = unused; 117 | ret=(100.0*( dtotal - dunused )) / dtotal; 118 | push(cpu_samples, &cpu_samples_idx, &cpuacc, ret); 119 | char buf[32]; 120 | size_t buflen; 121 | buflen=snprintf(buf,32,"c:%4.1f%%.", ret); 122 | display(buf, buflen, cpu_samples, cpu_samples_idx, SAMPLES, FGCOLOR, BGCOLOR, percent_colors); 123 | } 124 | 125 | FILE* entfd; 126 | float ent_samples[SAMPLES], entacc; 127 | uint8_t ent_samples_idx=0; 128 | void ent(void) { 129 | uint32_t avail=0; 130 | fail(fseek(entfd,0,SEEK_SET)==-1, "failed to seek entfd\n"); 131 | fail(fscanf(entfd,"%d\n", &avail)!=1,"failed to parse ent\n"); 132 | push(ent_samples, &ent_samples_idx, &entacc, (float) avail); 133 | char buf[32]; 134 | size_t buflen; 135 | buflen=snprintf(buf,32,".e: %4d.", avail); 136 | display(buf, buflen, ent_samples, ent_samples_idx, SAMPLES, FGCOLOR, BGCOLOR, default_colors); 137 | } 138 | 139 | FILE *tempfd; 140 | float temp_samples[SAMPLES], tempacc; 141 | uint8_t temp_samples_idx=0; 142 | void temp(void) { 143 | uint32_t t=0; 144 | fail(fseek(tempfd,0,SEEK_SET)==-1, "failed to seek tempfd\n"); 145 | fail(fscanf(tempfd,"%d\n", &t)!=1, "failed to parse tempfd\n"); 146 | push(temp_samples, &temp_samples_idx, &tempacc, ((float)t)/1000.0); 147 | char buf[32]; 148 | size_t buflen; 149 | buflen=snprintf(buf,32,".t:%2dC.", t/1000); 150 | display(buf, buflen, temp_samples, temp_samples_idx, SAMPLES, FGCOLOR, BGCOLOR, temp_colors); 151 | } 152 | 153 | FILE* memfd; 154 | float mem_samples[SAMPLES], memacc; 155 | uint8_t mem_samples_idx=0; 156 | void mem(void) { 157 | float max=0, cur=0, ret; 158 | uint64_t val; 159 | char label[15]; 160 | fail(fseek(memfd,0,SEEK_SET)==-1, "failed to seek memfd\n"); 161 | while(max==0 || cur==0) { 162 | if(fscanf(memfd,"%14s %"UD" %*s\n", label, &val)!=2) { 163 | break; 164 | } 165 | if(strncmp("MemTotal:",label,sizeof(label))==0) { 166 | max=(float) val; 167 | } else if(strncmp("MemAvailable:",label,sizeof(label))==0) { 168 | cur=(float) val; 169 | } 170 | } 171 | while(fgetc(memfd)!=EOF); // weird way of flushing /proc files 172 | if(max==0 || cur==0) { 173 | printf("err: could not measure mem\n"); 174 | exit(1); 175 | } 176 | ret=100.0 - ((cur*100) / max); 177 | push(mem_samples, &mem_samples_idx, &memacc, ret); 178 | char buf[32]; 179 | size_t buflen; 180 | buflen=snprintf(buf,32,".m:%5.1f%%.", ret); 181 | display(buf, buflen, mem_samples, mem_samples_idx, SAMPLES, FGCOLOR, BGCOLOR, percent_colors); 182 | } 183 | 184 | FILE* batfd; 185 | float bat_samples[SAMPLES], batacc; 186 | uint8_t bat_samples_idx=0; 187 | void bat() { 188 | float max=0, cur=0, ret; 189 | char val[33], status; 190 | char label[129]; 191 | status=0; 192 | fail(fseek(batfd,0,SEEK_SET)==-1, "failed to seek batfd\n"); 193 | while(max==0 || cur==0 || status==0) { 194 | if(fscanf(batfd,"%128[A-Z_]=%32s\n", label, val)!=2) { 195 | printf("%s || %s\n", label, val); 196 | continue; 197 | } 198 | if(strncmp("POWER_SUPPLY_STATUS",label,sizeof(label))==0) { 199 | if(strncmp(val,"Discharging",sizeof(val))==0) { 200 | status='D'; 201 | } else if(strncmp(val,"Charging",sizeof(val))==0) { 202 | status='D'; 203 | } else if(strncmp(val,"Unknown",sizeof(val))==0) { 204 | status='U'; 205 | } else { 206 | status='?'; 207 | } 208 | } else if(strncmp("POWER_SUPPLY_ENERGY_FULL",label,sizeof(label))==0) { 209 | max=atof(val); 210 | } else if(strncmp("POWER_SUPPLY_ENERGY_NOW",label,sizeof(label))==0) { 211 | cur=atof(val); 212 | } 213 | } 214 | while(fgetc(batfd)!=EOF); // weird way of flushing /proc files 215 | if(max==0 || cur==0 || status==0) { 216 | printf("err: could not measure battery\n"); 217 | return; 218 | //exit(1); 219 | } 220 | ret=((cur*100) / max); 221 | push(bat_samples, &bat_samples_idx, &batacc, ret); 222 | char buf[32]; 223 | size_t buflen; 224 | buflen=snprintf(buf,32,".b: %5.1f%%:%c.", ret, status); 225 | display(buf, buflen, bat_samples, bat_samples_idx, SAMPLES, FGCOLOR, BGCOLOR, revpercent_colors); 226 | } 227 | 228 | FILE* dskfd; 229 | float dsk_samples[SAMPLES], dskacc; 230 | uint8_t dsk_samples_idx=0; 231 | void dsk(const char* dev) { 232 | if(dev==NULL) return; 233 | static uint64_t previo; 234 | uint64_t reads, writes, total, ret; 235 | char label[11]; 236 | fail(fseek(dskfd,0,SEEK_SET)==-1, "failed to seek dskfd\n"); 237 | while(strncmp(label, dev, sizeof(label))!=0) { 238 | if(fscanf(dskfd,"%*d %*d %10s %*d %*d %"UD" %*d %*d %*d %"UD" %*d %*d %*d %*d", label, &reads, &writes)!=3) break; 239 | } 240 | while(fgetc(dskfd)!=EOF); // weird way of flushing /proc files 241 | if(strncmp(dev,label,sizeof(label))!=0) { 242 | printf("err: couldn't find %s in /proc/diskstat\n", dev); 243 | exit(1); 244 | } 245 | total = reads+writes; 246 | 247 | // get previous sample 248 | if(previo == 0) { 249 | previo = total; 250 | } 251 | 252 | // remember current sample 253 | ret=total-previo; 254 | previo = total; 255 | push(dsk_samples, &dsk_samples_idx, &dskacc, ret); 256 | char buf[33]; 257 | size_t buflen; 258 | buflen=snprintf(buf,32,".io: %5"UD"kB/s.", ret); 259 | display(buf, buflen, dsk_samples, dsk_samples_idx, SAMPLES, FGCOLOR, BGCOLOR, default_colors); 260 | } 261 | 262 | FILE* netfd; 263 | uint64_t pup, pdown; 264 | float up_samples[SAMPLES], down_samples[SAMPLES], upacc, downacc; 265 | void net(const char* dev) { 266 | if(dev==NULL) return; 267 | static uint8_t up_samples_idx=0, down_samples_idx=0; 268 | float up, down; 269 | uint64_t read=0, write=0; 270 | char label[11]=""; 271 | 272 | fail(fseek(netfd,0,SEEK_SET)==-1, "failed to seek netfd\n"); 273 | while(strncmp(label, dev, sizeof(label))!=0) { 274 | if(fscanf(netfd," %10s %"UD" %*d %*d %*d %*d %*d %*d %*d %"UD" %*d %*d %*d %*d %*d %*d %*d\n", label, &read, &write)==EOF) { 275 | break; 276 | } 277 | } 278 | while(fgetc(netfd)!=EOF); // weird way of flushing /proc files 279 | if(strncmp(dev,label,sizeof(label))!=0) { 280 | // device does not exist, push 0 into history and return 281 | push(up_samples, &up_samples_idx, &upacc, 0); 282 | push(down_samples, &down_samples_idx, &downacc, 0); 283 | return; 284 | } 285 | 286 | // get previous sample 287 | if(pup == 0) { 288 | pup = write; 289 | } 290 | if(pdown == 0) { 291 | pdown = read; 292 | } 293 | 294 | up=((float)(write - pup)) / 1024.0; 295 | down=((float)(read - pdown)) / 1024.0; 296 | 297 | push(up_samples, &up_samples_idx, &upacc, up); 298 | push(down_samples, &down_samples_idx, &downacc, down); 299 | 300 | // remember current sample 301 | pup=write; 302 | pdown=read; 303 | char buf[33]; 304 | size_t buflen; 305 | buflen=snprintf(buf,32,".u:%6.1fkB/s.", up); 306 | display(buf, buflen, up_samples, up_samples_idx, SAMPLES, FGCOLOR, BGCOLOR, default_colors); 307 | buflen=snprintf(buf,32,".d:%6.1fkB/s.", down); 308 | display(buf, buflen, down_samples, down_samples_idx, SAMPLES, FGCOLOR, BGCOLOR, default_colors); 309 | } 310 | 311 | #ifndef WITHOUT_SECCOMP 312 | void lock_seccomp(const int fds[], const size_t fdsize, const int fbfd) { 313 | // Init the filter 314 | int i; 315 | scmp_filter_ctx ctx; 316 | ctx = seccomp_init(SCMP_ACT_KILL); // default action: kill 317 | 318 | #if !defined __GLIBC__ // assume musl 319 | //readv([3,4,5,6,7,8,9] 320 | for(i=0;i1024*1024*10) { // 10M fontfile is a generous limit 452 | printf("%s too big.\n", font); 453 | exit(1); 454 | } 455 | char *ttfp; 456 | if((ttfp=malloc(st.st_size))==NULL) { 457 | printf("couldn't malloc %ld byte for font.\n", st.st_size); 458 | exit(1); 459 | } 460 | int ttffd; 461 | if((ttffd=open(font,O_RDONLY))==-1) { 462 | printf("couldn't open %s.\n", font); 463 | exit(1); 464 | } 465 | int ret; 466 | if((ret=read(ttffd, ttfp, st.st_size))!=st.st_size) { 467 | printf("didn't read complete font, only %d bytes read out of %ld.\n", ret, st.st_size); 468 | exit(1); 469 | } 470 | close(ttffd); 471 | 472 | #ifndef WITHOUT_SECCOMP 473 | // do seccomp sandbox 474 | int fds[]={fileno(tempfd), fileno(batfd), fileno(cpufd), fileno(memfd), fileno(dskfd), fileno(netfd), fileno(entfd)}; 475 | lock_seccomp(fds, 8, fbfd); 476 | #endif 477 | 478 | // initialize framebuffer and font rendering 479 | init_fb(fbfd, ttyfd); 480 | init_ft(ttfp, st.st_size); 481 | 482 | // run mainloop 483 | while(1) { 484 | // right aligned 485 | newline(-1, monky_y, BGCOLOR); 486 | ent(); 487 | net(argv[2]); 488 | dsk(argv[1]); 489 | bat(); 490 | temp(); 491 | mem(); 492 | cpu(); 493 | sleep(1); 494 | iteration++; 495 | } 496 | return 0; 497 | } 498 | -------------------------------------------------------------------------------- /COPYING: -------------------------------------------------------------------------------- 1 | GNU AFFERO GENERAL PUBLIC LICENSE 2 | Version 3, 19 November 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU Affero General Public License is a free, copyleft license for 11 | software and other kinds of works, specifically designed to ensure 12 | cooperation with the community in the case of network server software. 13 | 14 | The licenses for most software and other practical works are designed 15 | to take away your freedom to share and change the works. By contrast, 16 | our General Public Licenses are intended to guarantee your freedom to 17 | share and change all versions of a program--to make sure it remains free 18 | software for all its users. 19 | 20 | When we speak of free software, we are referring to freedom, not 21 | price. Our General Public Licenses are designed to make sure that you 22 | have the freedom to distribute copies of free software (and charge for 23 | them if you wish), that you receive source code or can get it if you 24 | want it, that you can change the software or use pieces of it in new 25 | free programs, and that you know you can do these things. 26 | 27 | Developers that use our General Public Licenses protect your rights 28 | with two steps: (1) assert copyright on the software, and (2) offer 29 | you this License which gives you legal permission to copy, distribute 30 | and/or modify the software. 31 | 32 | A secondary benefit of defending all users' freedom is that 33 | improvements made in alternate versions of the program, if they 34 | receive widespread use, become available for other developers to 35 | incorporate. Many developers of free software are heartened and 36 | encouraged by the resulting cooperation. However, in the case of 37 | software used on network servers, this result may fail to come about. 38 | The GNU General Public License permits making a modified version and 39 | letting the public access it on a server without ever releasing its 40 | source code to the public. 41 | 42 | The GNU Affero General Public License is designed specifically to 43 | ensure that, in such cases, the modified source code becomes available 44 | to the community. It requires the operator of a network server to 45 | provide the source code of the modified version running there to the 46 | users of that server. Therefore, public use of a modified version, on 47 | a publicly accessible server, gives the public access to the source 48 | code of the modified version. 49 | 50 | An older license, called the Affero General Public License and 51 | published by Affero, was designed to accomplish similar goals. This is 52 | a different license, not a version of the Affero GPL, but Affero has 53 | released a new version of the Affero GPL which permits relicensing under 54 | this license. 55 | 56 | The precise terms and conditions for copying, distribution and 57 | modification follow. 58 | 59 | TERMS AND CONDITIONS 60 | 61 | 0. Definitions. 62 | 63 | "This License" refers to version 3 of the GNU Affero General Public License. 64 | 65 | "Copyright" also means copyright-like laws that apply to other kinds of 66 | works, such as semiconductor masks. 67 | 68 | "The Program" refers to any copyrightable work licensed under this 69 | License. Each licensee is addressed as "you". "Licensees" and 70 | "recipients" may be individuals or organizations. 71 | 72 | To "modify" a work means to copy from or adapt all or part of the work 73 | in a fashion requiring copyright permission, other than the making of an 74 | exact copy. The resulting work is called a "modified version" of the 75 | earlier work or a work "based on" the earlier work. 76 | 77 | A "covered work" means either the unmodified Program or a work based 78 | on the Program. 79 | 80 | To "propagate" a work means to do anything with it that, without 81 | permission, would make you directly or secondarily liable for 82 | infringement under applicable copyright law, except executing it on a 83 | computer or modifying a private copy. Propagation includes copying, 84 | distribution (with or without modification), making available to the 85 | public, and in some countries other activities as well. 86 | 87 | To "convey" a work means any kind of propagation that enables other 88 | parties to make or receive copies. Mere interaction with a user through 89 | a computer network, with no transfer of a copy, is not conveying. 90 | 91 | An interactive user interface displays "Appropriate Legal Notices" 92 | to the extent that it includes a convenient and prominently visible 93 | feature that (1) displays an appropriate copyright notice, and (2) 94 | tells the user that there is no warranty for the work (except to the 95 | extent that warranties are provided), that licensees may convey the 96 | work under this License, and how to view a copy of this License. If 97 | the interface presents a list of user commands or options, such as a 98 | menu, a prominent item in the list meets this criterion. 99 | 100 | 1. Source Code. 101 | 102 | The "source code" for a work means the preferred form of the work 103 | for making modifications to it. "Object code" means any non-source 104 | form of a work. 105 | 106 | A "Standard Interface" means an interface that either is an official 107 | standard defined by a recognized standards body, or, in the case of 108 | interfaces specified for a particular programming language, one that 109 | is widely used among developers working in that language. 110 | 111 | The "System Libraries" of an executable work include anything, other 112 | than the work as a whole, that (a) is included in the normal form of 113 | packaging a Major Component, but which is not part of that Major 114 | Component, and (b) serves only to enable use of the work with that 115 | Major Component, or to implement a Standard Interface for which an 116 | implementation is available to the public in source code form. A 117 | "Major Component", in this context, means a major essential component 118 | (kernel, window system, and so on) of the specific operating system 119 | (if any) on which the executable work runs, or a compiler used to 120 | produce the work, or an object code interpreter used to run it. 121 | 122 | The "Corresponding Source" for a work in object code form means all 123 | the source code needed to generate, install, and (for an executable 124 | work) run the object code and to modify the work, including scripts to 125 | control those activities. However, it does not include the work's 126 | System Libraries, or general-purpose tools or generally available free 127 | programs which are used unmodified in performing those activities but 128 | which are not part of the work. For example, Corresponding Source 129 | includes interface definition files associated with source files for 130 | the work, and the source code for shared libraries and dynamically 131 | linked subprograms that the work is specifically designed to require, 132 | such as by intimate data communication or control flow between those 133 | subprograms and other parts of the work. 134 | 135 | The Corresponding Source need not include anything that users 136 | can regenerate automatically from other parts of the Corresponding 137 | Source. 138 | 139 | The Corresponding Source for a work in source code form is that 140 | same work. 141 | 142 | 2. Basic Permissions. 143 | 144 | All rights granted under this License are granted for the term of 145 | copyright on the Program, and are irrevocable provided the stated 146 | conditions are met. This License explicitly affirms your unlimited 147 | permission to run the unmodified Program. The output from running a 148 | covered work is covered by this License only if the output, given its 149 | content, constitutes a covered work. This License acknowledges your 150 | rights of fair use or other equivalent, as provided by copyright law. 151 | 152 | You may make, run and propagate covered works that you do not 153 | convey, without conditions so long as your license otherwise remains 154 | in force. You may convey covered works to others for the sole purpose 155 | of having them make modifications exclusively for you, or provide you 156 | with facilities for running those works, provided that you comply with 157 | the terms of this License in conveying all material for which you do 158 | not control copyright. Those thus making or running the covered works 159 | for you must do so exclusively on your behalf, under your direction 160 | and control, on terms that prohibit them from making any copies of 161 | your copyrighted material outside their relationship with you. 162 | 163 | Conveying under any other circumstances is permitted solely under 164 | the conditions stated below. Sublicensing is not allowed; section 10 165 | makes it unnecessary. 166 | 167 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 168 | 169 | No covered work shall be deemed part of an effective technological 170 | measure under any applicable law fulfilling obligations under article 171 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 172 | similar laws prohibiting or restricting circumvention of such 173 | measures. 174 | 175 | When you convey a covered work, you waive any legal power to forbid 176 | circumvention of technological measures to the extent such circumvention 177 | is effected by exercising rights under this License with respect to 178 | the covered work, and you disclaim any intention to limit operation or 179 | modification of the work as a means of enforcing, against the work's 180 | users, your or third parties' legal rights to forbid circumvention of 181 | technological measures. 182 | 183 | 4. Conveying Verbatim Copies. 184 | 185 | You may convey verbatim copies of the Program's source code as you 186 | receive it, in any medium, provided that you conspicuously and 187 | appropriately publish on each copy an appropriate copyright notice; 188 | keep intact all notices stating that this License and any 189 | non-permissive terms added in accord with section 7 apply to the code; 190 | keep intact all notices of the absence of any warranty; and give all 191 | recipients a copy of this License along with the Program. 192 | 193 | You may charge any price or no price for each copy that you convey, 194 | and you may offer support or warranty protection for a fee. 195 | 196 | 5. Conveying Modified Source Versions. 197 | 198 | You may convey a work based on the Program, or the modifications to 199 | produce it from the Program, in the form of source code under the 200 | terms of section 4, provided that you also meet all of these conditions: 201 | 202 | a) The work must carry prominent notices stating that you modified 203 | it, and giving a relevant date. 204 | 205 | b) The work must carry prominent notices stating that it is 206 | released under this License and any conditions added under section 207 | 7. This requirement modifies the requirement in section 4 to 208 | "keep intact all notices". 209 | 210 | c) You must license the entire work, as a whole, under this 211 | License to anyone who comes into possession of a copy. This 212 | License will therefore apply, along with any applicable section 7 213 | additional terms, to the whole of the work, and all its parts, 214 | regardless of how they are packaged. This License gives no 215 | permission to license the work in any other way, but it does not 216 | invalidate such permission if you have separately received it. 217 | 218 | d) If the work has interactive user interfaces, each must display 219 | Appropriate Legal Notices; however, if the Program has interactive 220 | interfaces that do not display Appropriate Legal Notices, your 221 | work need not make them do so. 222 | 223 | A compilation of a covered work with other separate and independent 224 | works, which are not by their nature extensions of the covered work, 225 | and which are not combined with it such as to form a larger program, 226 | in or on a volume of a storage or distribution medium, is called an 227 | "aggregate" if the compilation and its resulting copyright are not 228 | used to limit the access or legal rights of the compilation's users 229 | beyond what the individual works permit. Inclusion of a covered work 230 | in an aggregate does not cause this License to apply to the other 231 | parts of the aggregate. 232 | 233 | 6. Conveying Non-Source Forms. 234 | 235 | You may convey a covered work in object code form under the terms 236 | of sections 4 and 5, provided that you also convey the 237 | machine-readable Corresponding Source under the terms of this License, 238 | in one of these ways: 239 | 240 | a) Convey the object code in, or embodied in, a physical product 241 | (including a physical distribution medium), accompanied by the 242 | Corresponding Source fixed on a durable physical medium 243 | customarily used for software interchange. 244 | 245 | b) Convey the object code in, or embodied in, a physical product 246 | (including a physical distribution medium), accompanied by a 247 | written offer, valid for at least three years and valid for as 248 | long as you offer spare parts or customer support for that product 249 | model, to give anyone who possesses the object code either (1) a 250 | copy of the Corresponding Source for all the software in the 251 | product that is covered by this License, on a durable physical 252 | medium customarily used for software interchange, for a price no 253 | more than your reasonable cost of physically performing this 254 | conveying of source, or (2) access to copy the 255 | Corresponding Source from a network server at no charge. 256 | 257 | c) Convey individual copies of the object code with a copy of the 258 | written offer to provide the Corresponding Source. This 259 | alternative is allowed only occasionally and noncommercially, and 260 | only if you received the object code with such an offer, in accord 261 | with subsection 6b. 262 | 263 | d) Convey the object code by offering access from a designated 264 | place (gratis or for a charge), and offer equivalent access to the 265 | Corresponding Source in the same way through the same place at no 266 | further charge. You need not require recipients to copy the 267 | Corresponding Source along with the object code. If the place to 268 | copy the object code is a network server, the Corresponding Source 269 | may be on a different server (operated by you or a third party) 270 | that supports equivalent copying facilities, provided you maintain 271 | clear directions next to the object code saying where to find the 272 | Corresponding Source. Regardless of what server hosts the 273 | Corresponding Source, you remain obligated to ensure that it is 274 | available for as long as needed to satisfy these requirements. 275 | 276 | e) Convey the object code using peer-to-peer transmission, provided 277 | you inform other peers where the object code and Corresponding 278 | Source of the work are being offered to the general public at no 279 | charge under subsection 6d. 280 | 281 | A separable portion of the object code, whose source code is excluded 282 | from the Corresponding Source as a System Library, need not be 283 | included in conveying the object code work. 284 | 285 | A "User Product" is either (1) a "consumer product", which means any 286 | tangible personal property which is normally used for personal, family, 287 | or household purposes, or (2) anything designed or sold for incorporation 288 | into a dwelling. In determining whether a product is a consumer product, 289 | doubtful cases shall be resolved in favor of coverage. For a particular 290 | product received by a particular user, "normally used" refers to a 291 | typical or common use of that class of product, regardless of the status 292 | of the particular user or of the way in which the particular user 293 | actually uses, or expects or is expected to use, the product. A product 294 | is a consumer product regardless of whether the product has substantial 295 | commercial, industrial or non-consumer uses, unless such uses represent 296 | the only significant mode of use of the product. 297 | 298 | "Installation Information" for a User Product means any methods, 299 | procedures, authorization keys, or other information required to install 300 | and execute modified versions of a covered work in that User Product from 301 | a modified version of its Corresponding Source. The information must 302 | suffice to ensure that the continued functioning of the modified object 303 | code is in no case prevented or interfered with solely because 304 | modification has been made. 305 | 306 | If you convey an object code work under this section in, or with, or 307 | specifically for use in, a User Product, and the conveying occurs as 308 | part of a transaction in which the right of possession and use of the 309 | User Product is transferred to the recipient in perpetuity or for a 310 | fixed term (regardless of how the transaction is characterized), the 311 | Corresponding Source conveyed under this section must be accompanied 312 | by the Installation Information. But this requirement does not apply 313 | if neither you nor any third party retains the ability to install 314 | modified object code on the User Product (for example, the work has 315 | been installed in ROM). 316 | 317 | The requirement to provide Installation Information does not include a 318 | requirement to continue to provide support service, warranty, or updates 319 | for a work that has been modified or installed by the recipient, or for 320 | the User Product in which it has been modified or installed. Access to a 321 | network may be denied when the modification itself materially and 322 | adversely affects the operation of the network or violates the rules and 323 | protocols for communication across the network. 324 | 325 | Corresponding Source conveyed, and Installation Information provided, 326 | in accord with this section must be in a format that is publicly 327 | documented (and with an implementation available to the public in 328 | source code form), and must require no special password or key for 329 | unpacking, reading or copying. 330 | 331 | 7. Additional Terms. 332 | 333 | "Additional permissions" are terms that supplement the terms of this 334 | License by making exceptions from one or more of its conditions. 335 | Additional permissions that are applicable to the entire Program shall 336 | be treated as though they were included in this License, to the extent 337 | that they are valid under applicable law. If additional permissions 338 | apply only to part of the Program, that part may be used separately 339 | under those permissions, but the entire Program remains governed by 340 | this License without regard to the additional permissions. 341 | 342 | When you convey a copy of a covered work, you may at your option 343 | remove any additional permissions from that copy, or from any part of 344 | it. (Additional permissions may be written to require their own 345 | removal in certain cases when you modify the work.) You may place 346 | additional permissions on material, added by you to a covered work, 347 | for which you have or can give appropriate copyright permission. 348 | 349 | Notwithstanding any other provision of this License, for material you 350 | add to a covered work, you may (if authorized by the copyright holders of 351 | that material) supplement the terms of this License with terms: 352 | 353 | a) Disclaiming warranty or limiting liability differently from the 354 | terms of sections 15 and 16 of this License; or 355 | 356 | b) Requiring preservation of specified reasonable legal notices or 357 | author attributions in that material or in the Appropriate Legal 358 | Notices displayed by works containing it; or 359 | 360 | c) Prohibiting misrepresentation of the origin of that material, or 361 | requiring that modified versions of such material be marked in 362 | reasonable ways as different from the original version; or 363 | 364 | d) Limiting the use for publicity purposes of names of licensors or 365 | authors of the material; or 366 | 367 | e) Declining to grant rights under trademark law for use of some 368 | trade names, trademarks, or service marks; or 369 | 370 | f) Requiring indemnification of licensors and authors of that 371 | material by anyone who conveys the material (or modified versions of 372 | it) with contractual assumptions of liability to the recipient, for 373 | any liability that these contractual assumptions directly impose on 374 | those licensors and authors. 375 | 376 | All other non-permissive additional terms are considered "further 377 | restrictions" within the meaning of section 10. If the Program as you 378 | received it, or any part of it, contains a notice stating that it is 379 | governed by this License along with a term that is a further 380 | restriction, you may remove that term. If a license document contains 381 | a further restriction but permits relicensing or conveying under this 382 | License, you may add to a covered work material governed by the terms 383 | of that license document, provided that the further restriction does 384 | not survive such relicensing or conveying. 385 | 386 | If you add terms to a covered work in accord with this section, you 387 | must place, in the relevant source files, a statement of the 388 | additional terms that apply to those files, or a notice indicating 389 | where to find the applicable terms. 390 | 391 | Additional terms, permissive or non-permissive, may be stated in the 392 | form of a separately written license, or stated as exceptions; 393 | the above requirements apply either way. 394 | 395 | 8. Termination. 396 | 397 | You may not propagate or modify a covered work except as expressly 398 | provided under this License. Any attempt otherwise to propagate or 399 | modify it is void, and will automatically terminate your rights under 400 | this License (including any patent licenses granted under the third 401 | paragraph of section 11). 402 | 403 | However, if you cease all violation of this License, then your 404 | license from a particular copyright holder is reinstated (a) 405 | provisionally, unless and until the copyright holder explicitly and 406 | finally terminates your license, and (b) permanently, if the copyright 407 | holder fails to notify you of the violation by some reasonable means 408 | prior to 60 days after the cessation. 409 | 410 | Moreover, your license from a particular copyright holder is 411 | reinstated permanently if the copyright holder notifies you of the 412 | violation by some reasonable means, this is the first time you have 413 | received notice of violation of this License (for any work) from that 414 | copyright holder, and you cure the violation prior to 30 days after 415 | your receipt of the notice. 416 | 417 | Termination of your rights under this section does not terminate the 418 | licenses of parties who have received copies or rights from you under 419 | this License. If your rights have been terminated and not permanently 420 | reinstated, you do not qualify to receive new licenses for the same 421 | material under section 10. 422 | 423 | 9. Acceptance Not Required for Having Copies. 424 | 425 | You are not required to accept this License in order to receive or 426 | run a copy of the Program. Ancillary propagation of a covered work 427 | occurring solely as a consequence of using peer-to-peer transmission 428 | to receive a copy likewise does not require acceptance. However, 429 | nothing other than this License grants you permission to propagate or 430 | modify any covered work. These actions infringe copyright if you do 431 | not accept this License. Therefore, by modifying or propagating a 432 | covered work, you indicate your acceptance of this License to do so. 433 | 434 | 10. Automatic Licensing of Downstream Recipients. 435 | 436 | Each time you convey a covered work, the recipient automatically 437 | receives a license from the original licensors, to run, modify and 438 | propagate that work, subject to this License. You are not responsible 439 | for enforcing compliance by third parties with this License. 440 | 441 | An "entity transaction" is a transaction transferring control of an 442 | organization, or substantially all assets of one, or subdividing an 443 | organization, or merging organizations. If propagation of a covered 444 | work results from an entity transaction, each party to that 445 | transaction who receives a copy of the work also receives whatever 446 | licenses to the work the party's predecessor in interest had or could 447 | give under the previous paragraph, plus a right to possession of the 448 | Corresponding Source of the work from the predecessor in interest, if 449 | the predecessor has it or can get it with reasonable efforts. 450 | 451 | You may not impose any further restrictions on the exercise of the 452 | rights granted or affirmed under this License. For example, you may 453 | not impose a license fee, royalty, or other charge for exercise of 454 | rights granted under this License, and you may not initiate litigation 455 | (including a cross-claim or counterclaim in a lawsuit) alleging that 456 | any patent claim is infringed by making, using, selling, offering for 457 | sale, or importing the Program or any portion of it. 458 | 459 | 11. Patents. 460 | 461 | A "contributor" is a copyright holder who authorizes use under this 462 | License of the Program or a work on which the Program is based. The 463 | work thus licensed is called the contributor's "contributor version". 464 | 465 | A contributor's "essential patent claims" are all patent claims 466 | owned or controlled by the contributor, whether already acquired or 467 | hereafter acquired, that would be infringed by some manner, permitted 468 | by this License, of making, using, or selling its contributor version, 469 | but do not include claims that would be infringed only as a 470 | consequence of further modification of the contributor version. For 471 | purposes of this definition, "control" includes the right to grant 472 | patent sublicenses in a manner consistent with the requirements of 473 | this License. 474 | 475 | Each contributor grants you a non-exclusive, worldwide, royalty-free 476 | patent license under the contributor's essential patent claims, to 477 | make, use, sell, offer for sale, import and otherwise run, modify and 478 | propagate the contents of its contributor version. 479 | 480 | In the following three paragraphs, a "patent license" is any express 481 | agreement or commitment, however denominated, not to enforce a patent 482 | (such as an express permission to practice a patent or covenant not to 483 | sue for patent infringement). To "grant" such a patent license to a 484 | party means to make such an agreement or commitment not to enforce a 485 | patent against the party. 486 | 487 | If you convey a covered work, knowingly relying on a patent license, 488 | and the Corresponding Source of the work is not available for anyone 489 | to copy, free of charge and under the terms of this License, through a 490 | publicly available network server or other readily accessible means, 491 | then you must either (1) cause the Corresponding Source to be so 492 | available, or (2) arrange to deprive yourself of the benefit of the 493 | patent license for this particular work, or (3) arrange, in a manner 494 | consistent with the requirements of this License, to extend the patent 495 | license to downstream recipients. "Knowingly relying" means you have 496 | actual knowledge that, but for the patent license, your conveying the 497 | covered work in a country, or your recipient's use of the covered work 498 | in a country, would infringe one or more identifiable patents in that 499 | country that you have reason to believe are valid. 500 | 501 | If, pursuant to or in connection with a single transaction or 502 | arrangement, you convey, or propagate by procuring conveyance of, a 503 | covered work, and grant a patent license to some of the parties 504 | receiving the covered work authorizing them to use, propagate, modify 505 | or convey a specific copy of the covered work, then the patent license 506 | you grant is automatically extended to all recipients of the covered 507 | work and works based on it. 508 | 509 | A patent license is "discriminatory" if it does not include within 510 | the scope of its coverage, prohibits the exercise of, or is 511 | conditioned on the non-exercise of one or more of the rights that are 512 | specifically granted under this License. You may not convey a covered 513 | work if you are a party to an arrangement with a third party that is 514 | in the business of distributing software, under which you make payment 515 | to the third party based on the extent of your activity of conveying 516 | the work, and under which the third party grants, to any of the 517 | parties who would receive the covered work from you, a discriminatory 518 | patent license (a) in connection with copies of the covered work 519 | conveyed by you (or copies made from those copies), or (b) primarily 520 | for and in connection with specific products or compilations that 521 | contain the covered work, unless you entered into that arrangement, 522 | or that patent license was granted, prior to 28 March 2007. 523 | 524 | Nothing in this License shall be construed as excluding or limiting 525 | any implied license or other defenses to infringement that may 526 | otherwise be available to you under applicable patent law. 527 | 528 | 12. No Surrender of Others' Freedom. 529 | 530 | If conditions are imposed on you (whether by court order, agreement or 531 | otherwise) that contradict the conditions of this License, they do not 532 | excuse you from the conditions of this License. If you cannot convey a 533 | covered work so as to satisfy simultaneously your obligations under this 534 | License and any other pertinent obligations, then as a consequence you may 535 | not convey it at all. For example, if you agree to terms that obligate you 536 | to collect a royalty for further conveying from those to whom you convey 537 | the Program, the only way you could satisfy both those terms and this 538 | License would be to refrain entirely from conveying the Program. 539 | 540 | 13. Remote Network Interaction; Use with the GNU General Public License. 541 | 542 | Notwithstanding any other provision of this License, if you modify the 543 | Program, your modified version must prominently offer all users 544 | interacting with it remotely through a computer network (if your version 545 | supports such interaction) an opportunity to receive the Corresponding 546 | Source of your version by providing access to the Corresponding Source 547 | from a network server at no charge, through some standard or customary 548 | means of facilitating copying of software. This Corresponding Source 549 | shall include the Corresponding Source for any work covered by version 3 550 | of the GNU General Public License that is incorporated pursuant to the 551 | following paragraph. 552 | 553 | Notwithstanding any other provision of this License, you have 554 | permission to link or combine any covered work with a work licensed 555 | under version 3 of the GNU General Public License into a single 556 | combined work, and to convey the resulting work. The terms of this 557 | License will continue to apply to the part which is the covered work, 558 | but the work with which it is combined will remain governed by version 559 | 3 of the GNU General Public License. 560 | 561 | 14. Revised Versions of this License. 562 | 563 | The Free Software Foundation may publish revised and/or new versions of 564 | the GNU Affero General Public License from time to time. Such new versions 565 | will be similar in spirit to the present version, but may differ in detail to 566 | address new problems or concerns. 567 | 568 | Each version is given a distinguishing version number. If the 569 | Program specifies that a certain numbered version of the GNU Affero General 570 | Public License "or any later version" applies to it, you have the 571 | option of following the terms and conditions either of that numbered 572 | version or of any later version published by the Free Software 573 | Foundation. If the Program does not specify a version number of the 574 | GNU Affero General Public License, you may choose any version ever published 575 | by the Free Software Foundation. 576 | 577 | If the Program specifies that a proxy can decide which future 578 | versions of the GNU Affero General Public License can be used, that proxy's 579 | public statement of acceptance of a version permanently authorizes you 580 | to choose that version for the Program. 581 | 582 | Later license versions may give you additional or different 583 | permissions. However, no additional obligations are imposed on any 584 | author or copyright holder as a result of your choosing to follow a 585 | later version. 586 | 587 | 15. Disclaimer of Warranty. 588 | 589 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 590 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 591 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 592 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 593 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 594 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 595 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 596 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 597 | 598 | 16. Limitation of Liability. 599 | 600 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 601 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 602 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 603 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 604 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 605 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 606 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 607 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 608 | SUCH DAMAGES. 609 | 610 | 17. Interpretation of Sections 15 and 16. 611 | 612 | If the disclaimer of warranty and limitation of liability provided 613 | above cannot be given local legal effect according to their terms, 614 | reviewing courts shall apply local law that most closely approximates 615 | an absolute waiver of all civil liability in connection with the 616 | Program, unless a warranty or assumption of liability accompanies a 617 | copy of the Program in return for a fee. 618 | 619 | END OF TERMS AND CONDITIONS 620 | 621 | How to Apply These Terms to Your New Programs 622 | 623 | If you develop a new program, and you want it to be of the greatest 624 | possible use to the public, the best way to achieve this is to make it 625 | free software which everyone can redistribute and change under these terms. 626 | 627 | To do so, attach the following notices to the program. It is safest 628 | to attach them to the start of each source file to most effectively 629 | state the exclusion of warranty; and each file should have at least 630 | the "copyright" line and a pointer to where the full notice is found. 631 | 632 | 633 | Copyright (C) 634 | 635 | This program is free software: you can redistribute it and/or modify 636 | it under the terms of the GNU Affero General Public License as published by 637 | the Free Software Foundation, either version 3 of the License, or 638 | (at your option) any later version. 639 | 640 | This program is distributed in the hope that it will be useful, 641 | but WITHOUT ANY WARRANTY; without even the implied warranty of 642 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 643 | GNU Affero General Public License for more details. 644 | 645 | You should have received a copy of the GNU Affero General Public License 646 | along with this program. If not, see . 647 | 648 | Also add information on how to contact you by electronic and paper mail. 649 | 650 | If your software can interact with users remotely through a computer 651 | network, you should also make sure that it provides a way for users to 652 | get its source. For example, if your program is a web application, its 653 | interface could display a "Source" link that leads users to an archive 654 | of the code. There are many ways you could offer source, and different 655 | solutions will be better for different programs; see section 13 for the 656 | specific requirements. 657 | 658 | You should also get your employer (if you work as a programmer) or school, 659 | if any, to sign a "copyright disclaimer" for the program, if necessary. 660 | For more information on this, and how to apply and follow the GNU AGPL, see 661 | . 662 | --------------------------------------------------------------------------------