├── Ciphers ├── caesar.c ├── homophonic.c ├── monoalphabetic.c └── playfair.c ├── Data Structures ├── circularlinkedlist.h ├── doublelinkedlist.h ├── queue.h ├── singlelinkedlist.h ├── sorting.c └── stack.h ├── LICENSE ├── OpenGL ├── Matrix Transformation.c ├── Mid Point Ellipse.c ├── Middle Point Circle.c ├── Reflection of A Line.c ├── Scan Fill Algorithm.c ├── Sutherland Hodgeman.c ├── Transformation of Line.c ├── bresenham.c └── midpoint_circle.c ├── README.md └── Random ├── elevator.c ├── extract_vid.c ├── myls.c ├── rgb2gray.c ├── stb_image.h └── stb_image_write.h /Ciphers/caesar.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | char *encrypt(char *inp, int shift) 7 | { 8 | char *out = malloc(strlen(inp) + 1); 9 | strcpy(out, inp); 10 | for (int i = 0; out[i]; i++) 11 | { 12 | if (isupper(out[i])) 13 | { 14 | out[i] = ((out[i] - 'A' + shift) % 26) + 'A'; 15 | } 16 | else if (islower(out[i])) 17 | { 18 | out[i] = ((out[i] - 'a' + shift) % 26) + 'a'; 19 | } 20 | } 21 | return out; 22 | } 23 | 24 | char *decrypt(char *inp, int shift) 25 | { 26 | return encrypt(inp, 26 - shift); 27 | } 28 | 29 | int main() 30 | { 31 | char inp[] = "Yo, it's neuralnets!"; 32 | int shift = 3; 33 | char *out = encrypt(inp, shift); 34 | printf("Encrypted : %s\n", out); 35 | char *decrypted = decrypt(out, shift); 36 | printf("Decrypted : %s\n", decrypted); 37 | free(out); 38 | free(decrypted); 39 | return 0; 40 | } -------------------------------------------------------------------------------- /Ciphers/homophonic.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | char* generateKey(){ 8 | char* key = malloc(sizeof(char) * 52); 9 | char uppercase[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; 10 | char lowercase[] = "abcdefghijklmnopqrstuvwxyz"; 11 | srand(time(NULL)); 12 | for(int i=0; i<26; i++){ 13 | int j = rand() % (26 - i); 14 | key[i] = uppercase[j]; 15 | key[i + 26] = lowercase[j]; 16 | uppercase[j] = uppercase[25 - i]; 17 | lowercase[j] = lowercase[25 - i]; 18 | } 19 | key[52] = '\0'; 20 | return key; 21 | } 22 | 23 | char* encrypt(char* inp, char* key){ 24 | char* out = malloc(strlen(inp) + 1); 25 | strcpy(out, inp); 26 | for(int i=0; out[i]; i++){ 27 | if(isupper(out[i])){ 28 | out[i] = key[out[i] - 'A']; 29 | }else if(islower(out[i])){ 30 | out[i] = key[out[i] - 'a' + 26]; 31 | } 32 | } 33 | return out; 34 | } 35 | 36 | char* decrypt(char* inp, char* key){ 37 | char* out = malloc(strlen(inp) + 1); 38 | strcpy(out, inp); 39 | for(int i=0; out[i]; i++){ 40 | if(isupper(out[i])){ 41 | for(int j=0; j<26; j++){ 42 | if(key[j] == out[i]){ 43 | out[i] = 'A' + j; 44 | break; 45 | } 46 | } 47 | }else if(islower(out[i])){ 48 | for(int j=26; j<52; j++){ 49 | if(key[j] == out[i]){ 50 | out[i] = 'a' + (j - 26); 51 | break; 52 | } 53 | } 54 | } 55 | } 56 | return out; 57 | } 58 | 59 | int main(){ 60 | char inp[] = "HellO, World!"; 61 | char* key = generateKey(); 62 | printf("Random key: %s\n", key); 63 | char* out = encrypt(inp, key); 64 | printf("Encrpyted : %s\n", out); 65 | char* out = decrypt(out, key); 66 | printf("Decrypted : %s\n", out); 67 | free(key); 68 | free(out); 69 | free(out); 70 | return 0; 71 | } -------------------------------------------------------------------------------- /Ciphers/monoalphabetic.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | char *generateKey() 8 | { 9 | char *key = malloc(27); 10 | char a[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; 11 | srand(time(NULL)); 12 | for (int i = 0; i < 26; i++) 13 | { 14 | int j = rand() % (26 - i); 15 | key[i] = a[j]; 16 | a[j] = a[25 - i]; 17 | } 18 | key[26] = '\0'; 19 | return key; 20 | } 21 | 22 | char *encrypt(char *inp, char *key) 23 | { 24 | char *out = malloc(strlen(inp) + 1); 25 | strcpy(out, inp); 26 | for (int i = 0; out[i]; i++) 27 | { 28 | if (isupper(out[i])) 29 | { 30 | out[i] = key[out[i] - 'A']; 31 | } 32 | else if (islower(out[i])) 33 | { 34 | out[i] = tolower(key[out[i] - 'a']); 35 | } 36 | } 37 | return out; 38 | } 39 | 40 | char *decrypt(char *inp, char *key) 41 | { 42 | char *out = malloc(strlen(inp) + 1); 43 | strcpy(out, inp); 44 | for (int i = 0; out[i]; i++) 45 | { 46 | if (isupper(out[i])) 47 | { 48 | for (int j = 0; j < 26; j++) 49 | { 50 | if (key[j] == out[i]) 51 | { 52 | out[i] = 'A' + j; 53 | break; 54 | } 55 | } 56 | } 57 | else if (islower(out[i])) 58 | { 59 | for (int j = 0; j < 26; j++) 60 | { 61 | if (tolower(key[j]) == out[i]) 62 | { 63 | out[i] = 'a' + j; 64 | break; 65 | } 66 | } 67 | } 68 | } 69 | return out; 70 | } 71 | 72 | int main() 73 | { 74 | char inp[] = "Yo, it's neuralnets!"; 75 | char *key = generateKey(); 76 | printf("Random key: %s\n", key); 77 | char *out = encrypt(inp, key); 78 | printf("Encrypted : %s\n", out); 79 | char *out1 = decrypt(out, key); 80 | printf("Decrypted : %s\n", out1); 81 | free(key); 82 | free(out); 83 | free(out1); 84 | return 0; 85 | } -------------------------------------------------------------------------------- /Ciphers/playfair.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | 8 | bool isvisited(char* arr, int size, char c){ 9 | for (int i = 0; i < size; i++){ 10 | if (arr[i] == c) 11 | return true; 12 | } 13 | return false; 14 | } 15 | 16 | char** keymatrix(char *text, int size){ 17 | char *set = (char*) malloc(sizeof(char) * 25); 18 | char **key = (char**)malloc(sizeof(char) * 5); 19 | 20 | for (int i = 0; i < 5; i++) 21 | key[i] = (char*)malloc(sizeof(char) * 5); 22 | 23 | int visited = 0; 24 | for (int i = 0; i < size && visited < 25; i++){ 25 | if (!isvisited(set, i, text[i])){ 26 | set[visited] = text[i]; 27 | visited++; 28 | } 29 | } 30 | 31 | for (char c = 'a'; visited < 25; c++){ 32 | if (c == 'j'){ 33 | continue; 34 | } 35 | if(!isvisited(set, visited, c)){ 36 | set[visited] = c; 37 | visited ++; 38 | } 39 | } 40 | 41 | int k = 0; 42 | for (int i=0; i < 5; i++){ 43 | for (int j=0; j < 5; j++){ 44 | key[i][j] = set[k++]; 45 | } 46 | } 47 | 48 | free(set); 49 | return key; 50 | } 51 | 52 | void get_coord(char a, char b, int *i1, int *j1, int *i2, int *j2, char** key){ 53 | for(int i=0; i<5; i++){ 54 | for(int j=0; j<5; j++){ 55 | if (a == key[i][j]){ 56 | *i1 = i; 57 | *j1 = j; 58 | } 59 | if (b == key[i][j]){ 60 | *i2 = i; 61 | *j2 = j; 62 | } 63 | } 64 | } 65 | } 66 | 67 | char* encode(char* plain, char **key, int size){ 68 | for(int i = 0; i < size; i++){ 69 | if (plain[i] == 'j'){ 70 | plain[i] = 'i'; 71 | } 72 | } 73 | char* ans = (char*)malloc(sizeof(char) * size); 74 | int i = 0, j = 0; 75 | while (i < size){ 76 | char a = plain[i]; 77 | char b; 78 | if ((i + 1) < size){ 79 | b = plain[i+1]; 80 | }else{ 81 | b = 'x'; 82 | } 83 | if (a == b){ 84 | ans[j++] = a; 85 | ans[j++] = 'x'; 86 | i++; 87 | } 88 | else{ 89 | ans[j++] = a; 90 | ans[j++] = b; 91 | i+=2; 92 | } 93 | } 94 | ans[j] = '\0'; 95 | int ans_size = (int)strlen(ans); 96 | char* encript_text = (char*)malloc(sizeof(char) * (ans_size + 1)); 97 | 98 | for(int k = 0; k < ans_size; k+=2){ 99 | int i1 = 0, j1 = 0, i2 = 0, j2 = 0; 100 | get_coord(ans[k], ans[k+1], &i1, &j1, &i2, &j2, key); 101 | if (i1 == i2){ 102 | encript_text[k] = key[i1][(j1 + 1) % 5]; 103 | encript_text[k+1] = key[i2][(j2 + 1) % 5]; 104 | } 105 | else if (j1 == j2){ 106 | encript_text[k] = key[(i1 + 1) % 5][j1]; 107 | encript_text[k+1] = key[(i2 + 1) % 5][j2]; 108 | } 109 | else{ 110 | encript_text[k] = key[i1][j2]; 111 | encript_text[k+1] = key[i2][j1]; 112 | } 113 | } 114 | 115 | encript_text[ans_size] = '\0'; 116 | free(ans); 117 | return encript_text; 118 | } 119 | 120 | char *decode(char* enc, char** key, int size){ 121 | 122 | char* decript_text = (char*)malloc(sizeof(char) * size + 1); 123 | for(int i = 0; i < size; i+=2){ 124 | int i1 = 0, j1 = 0, i2 = 0, j2 = 0; 125 | get_coord(enc[i], enc[i+1], &i1, &j1, &i2, &j2, key); 126 | if(i1 == i2){ 127 | decript_text[i] = key[i1][(j1 + 4) % 5]; 128 | decript_text[i+1] = key[i2][(j2 + 4) % 5]; 129 | } 130 | else if (j1 == j2){ 131 | decript_text[i] = key[(i1 + 4) % 5][j1]; 132 | decript_text[i+1] = key[(i2 + 4) % 5][j2]; 133 | } 134 | else{ 135 | decript_text[i] = key[i1][j2]; 136 | decript_text[i+1] = key[i2][j1]; 137 | } 138 | } 139 | decript_text[size] = '\0'; 140 | 141 | char* ans = (char*)malloc(sizeof(char) * (size + 1)); 142 | int j = 0; 143 | for (int i = 0; i < size; i++){ 144 | if (decript_text[i] != 'x'){ 145 | ans[j++] = decript_text[i]; 146 | } 147 | } 148 | ans[j] = '\0'; 149 | 150 | return ans; 151 | } 152 | 153 | int main(){ 154 | char mess[] = "hihowareyou"; 155 | char k[] = "neuralnets"; 156 | char **key = keymatrix(k, strlen(k)); 157 | printf("Key:\n"); 158 | 159 | for (int i=0; i < 5; i++){ 160 | for(int j=0; j < 5; j++){ 161 | printf("%c ", key[i][j]); 162 | } 163 | printf("\n"); 164 | } 165 | 166 | char *enc = encode(mess, key, strlen(mess)); 167 | printf("Encode: %s\n", enc); 168 | 169 | char *dec = decode(enc, key, strlen(enc)); 170 | printf("Decode: %s\n", dec); 171 | } -------------------------------------------------------------------------------- /Data Structures/circularlinkedlist.h: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | struct cslinklist 5 | { 6 | int data; 7 | struct cslinklist *next; 8 | }; 9 | typedef struct cslinklist node; 10 | node *start = NULL; 11 | int nodectr; 12 | node *getnode() 13 | { 14 | node *newnode; 15 | newnode = (node *)malloc(sizeof(node)); 16 | printf("\n Enter data: "); 17 | scanf("%d", &newnode->data); 18 | newnode->next = NULL; 19 | return newnode; 20 | } 21 | int menu() 22 | { 23 | int ch; 24 | printf("\n 1. Create a list "); 25 | printf("\n\n--------------------------"); 26 | printf("\n 2. Insert a node at beginning "); 27 | printf("\n 3. Insert a node at end"); 28 | printf("\n 4. Insert a node at middle"); 29 | printf("\n\n--------------------------"); 30 | printf("\n 5. Delete a node from beginning"); 31 | printf("\n 6. Delete a node from Last"); 32 | printf("\n 7. Delete a node from Middle"); 33 | printf("\n\n--------------------------"); 34 | printf("\n 8. Display the list"); 35 | printf("\n 9. Exit"); 36 | printf("\n\n--------------------------"); 37 | printf("\n Enter your choice: "); 38 | scanf("%d", &ch); 39 | return ch; 40 | } 41 | void createlist(int n) 42 | { 43 | int i; 44 | node *newnode; 45 | node *temp; 46 | nodectr = n; 47 | for (i = 0; i < n; i++) 48 | { 49 | newnode = getnode(); 50 | if (start == NULL) 51 | { 52 | start = newnode; 53 | } 54 | else 55 | { 56 | temp = start; 57 | while (temp->next != NULL) 58 | temp = temp->next; 59 | temp->next = newnode; 60 | } 61 | } 62 | newnode->next = start; 63 | } 64 | void display() 65 | { 66 | node *temp; 67 | temp = start; 68 | printf("\n The contents of List (Left to Right): "); 69 | if (start == NULL) 70 | printf("\n Empty List"); 71 | else 72 | { 73 | do 74 | { 75 | printf("\t %d ", temp->data); 76 | temp = temp->next; 77 | } while (temp != 78 | start); 79 | printf(" X "); 80 | } 81 | } 82 | void cll_insert_beg() 83 | { 84 | node *newnode, *last; 85 | newnode = getnode(); 86 | if (start == NULL) 87 | { 88 | start = newnode; 89 | newnode->next = start; 90 | } 91 | else 92 | { 93 | last = start; 94 | while (last->next != start) 95 | last = last->next; 96 | newnode->next = start; 97 | start = newnode; 98 | last->next = start; 99 | } 100 | printf("\n Node inserted at beginning.."); 101 | nodectr++; 102 | } 103 | void cll_insert_end() 104 | { 105 | node *newnode, *temp; 106 | newnode = getnode(); 107 | if (start == NULL) 108 | { 109 | start = newnode; 110 | newnode->next = start; 111 | } 112 | else 113 | { 114 | temp = start; 115 | while (temp->next != start) 116 | temp = temp->next; 117 | temp->next = newnode; 118 | newnode->next = start; 119 | } 120 | printf("\n Node inserted at end.."); 121 | nodectr++; 122 | } 123 | void cll_insert_mid() 124 | { 125 | node *newnode, *temp, *prev; 126 | int i, pos; 127 | newnode = getnode(); 128 | printf("\n Enter the position: "); 129 | scanf("%d", &pos); 130 | if (pos > 1 && pos < nodectr) 131 | { 132 | temp = start; 133 | prev = temp; 134 | i = 1; 135 | while (i < pos) 136 | { 137 | prev = temp; 138 | temp = temp->next; 139 | i++; 140 | } 141 | prev->next = newnode; 142 | newnode->next = temp; 143 | nodectr++; 144 | printf("\n Node inserted at middle.."); 145 | } 146 | else 147 | { 148 | printf("position %d of list is not a middle position ", pos); 149 | } 150 | } 151 | void cll_delete_beg() 152 | { 153 | node *temp, *last; 154 | if (start == NULL) 155 | { 156 | printf("\n No nodes exist.."); 157 | getch(); 158 | return; 159 | } 160 | else 161 | { 162 | last = temp = start; 163 | while (last->next != start) 164 | last = last->next; 165 | start = start->next; 166 | last->next = start; 167 | free(temp); 168 | nodectr--; 169 | printf("\n Node deleted.."); 170 | if (nodectr == 0) 171 | start = NULL; 172 | } 173 | } 174 | void cll_delete_last() 175 | { 176 | node *temp, *prev; 177 | if (start == NULL) 178 | { 179 | printf("\n No nodes exist.."); 180 | getch(); 181 | return; 182 | } 183 | else 184 | { 185 | temp = start; 186 | prev = start; 187 | while (temp->next != start) 188 | { 189 | prev = temp; 190 | temp = temp->next; 191 | } 192 | prev->next = start; 193 | free(temp); 194 | nodectr--; 195 | if (nodectr == 0) 196 | start = NULL; 197 | printf("\n Node deleted.."); 198 | } 199 | } 200 | void cll_delete_mid() 201 | { 202 | int i = 0, pos; 203 | node *temp, *prev; 204 | if (start == NULL) 205 | { 206 | printf("\n No nodes exist.."); 207 | getch(); 208 | return; 209 | } 210 | else 211 | { 212 | printf("\n Which node to delete: "); 213 | scanf("%d", &pos); 214 | if (pos > nodectr) 215 | { 216 | printf("\nThis node does not exist"); 217 | getch(); 218 | return; 219 | } 220 | if (pos > 1 && pos < nodectr) 221 | { 222 | temp = start; 223 | prev = start; 224 | i = 0; 225 | while (i < pos - 1) 226 | { 227 | prev = temp; 228 | temp = temp->next; 229 | i++; 230 | } 231 | prev->next = temp->next; 232 | free(temp); 233 | nodectr--; 234 | printf("\n Node Deleted.."); 235 | } 236 | else 237 | { 238 | printf("\n It is not a middle position.."); 239 | getch(); 240 | } 241 | } 242 | } 243 | -------------------------------------------------------------------------------- /Data Structures/doublelinkedlist.h: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | struct node 5 | { 6 | int num; // value 7 | struct node *preptr; // head 8 | struct node *nextptr; // tail 9 | } *stnode, *ennode; 10 | 11 | void DlListcreation(int n); 12 | void DlLinsertNodeAtBeginning(int num); 13 | void DlLinsertNodeAtEnd(int num); 14 | void DlLinsertNodeAtAny(int num, int pos); 15 | void displayDlList(int a); 16 | 17 | void DlListcreation(int n) 18 | { 19 | int i, num; 20 | struct node *fnNode; 21 | if (n >= 1) 22 | { 23 | stnode = (struct node *)malloc(sizeof(struct node)); 24 | if (stnode != NULL) 25 | { 26 | printf(" Input data for node 1 : "); // assigning data in the first node 27 | scanf("%d", &num); 28 | stnode->num = num; 29 | stnode->preptr = NULL; 30 | stnode->nextptr = NULL; 31 | ennode = stnode; 32 | for (i = 2; i <= n; i++) 33 | { 34 | fnNode = (struct node *)malloc(sizeof(struct node)); 35 | if (fnNode != NULL) 36 | { 37 | printf(" Input data for node %d : ", i); 38 | scanf("%d", &num); 39 | fnNode->num = num; 40 | fnNode->preptr = ennode; // new node is linking with the previous node 41 | fnNode->nextptr = NULL; // set next address of fnnode is NULL 42 | ennode->nextptr = fnNode; // previous node is linking with the new node 43 | ennode = fnNode; // assign new node as last node 44 | } 45 | else 46 | { 47 | printf(" Memory can not be allocated."); 48 | break; 49 | } 50 | } 51 | } 52 | else 53 | { 54 | printf(" Memory can not be allocated."); 55 | } 56 | } 57 | } 58 | 59 | void DlLinsertNodeAtAny(int num, int pos) 60 | { 61 | int i; 62 | struct node *newnode, *tmp; 63 | if (ennode == NULL) 64 | { 65 | printf(" No data found in the list!\n"); 66 | } 67 | else 68 | { 69 | tmp = stnode; 70 | i = 1; 71 | while (i < pos - 1 && tmp != NULL) 72 | { 73 | tmp = tmp->nextptr; 74 | i++; 75 | } 76 | if (pos == 1) 77 | { 78 | DlLinsertNodeAtBeginning(num); 79 | } 80 | else if (tmp == ennode) 81 | { 82 | DlLinsertNodeAtEnd(num); 83 | } 84 | else if (tmp != NULL) 85 | { 86 | newnode = (struct node *)malloc(sizeof(struct node)); 87 | newnode->num = num; // next address of new node is linking with the next address of temp node 88 | newnode->nextptr = tmp->nextptr; // previous address of new node is linking with the tmp node 89 | newnode->preptr = tmp; 90 | if (tmp->nextptr != NULL) 91 | { 92 | tmp->nextptr->preptr = newnode; // n+1th node is linking with new node 93 | } 94 | tmp->nextptr = newnode; // n-1th node is linking with new node 95 | } 96 | else 97 | { 98 | printf(" The position you entered, is invalid.\n"); 99 | } 100 | } 101 | } 102 | 103 | void DlLinsertNodeAtBeginning(int num) 104 | { 105 | struct node *newnode; 106 | if (stnode == NULL) 107 | { 108 | printf(" No data found in the list!\n"); 109 | } 110 | else 111 | { 112 | newnode = (struct node *)malloc(sizeof(struct node)); 113 | newnode->num = num; 114 | newnode->nextptr = stnode; // next address of new node is linking with starting node 115 | newnode->preptr = NULL; // set previous address field of new node is NULL 116 | stnode->preptr = newnode; // previous address of starting node is linking with new node 117 | stnode = newnode; // set the new node as starting node 118 | } 119 | } 120 | 121 | void DlLinsertNodeAtEnd(int num) 122 | { 123 | struct node *newnode; 124 | if (ennode == NULL) 125 | { 126 | printf(" No data found in the list!\n"); 127 | } 128 | else 129 | { 130 | newnode = (struct node *)malloc(sizeof(struct node)); 131 | newnode->num = num; 132 | newnode->nextptr = NULL; // set next address field of new node is NULL 133 | newnode->preptr = ennode; // previous address of new node is linking with ending node 134 | ennode->nextptr = newnode; // next address of ending node is linking with new node 135 | ennode = newnode; // set the new node as ending node 136 | } 137 | } 138 | 139 | void displayDlList(int m) 140 | { 141 | struct node *tmp; 142 | int n = 1; 143 | if (stnode == NULL) 144 | { 145 | printf(" No data found in the List yet."); 146 | } 147 | else 148 | { 149 | tmp = stnode; 150 | if (m == 1) 151 | { 152 | printf("\n Data entered in the list are :\n"); 153 | } 154 | else 155 | { 156 | printf("\n After insertion the new list are :\n"); 157 | } 158 | while (tmp != NULL) 159 | { 160 | printf(" node %d : %d\n", n, tmp->num); 161 | n++; 162 | tmp = tmp->nextptr; // current pointer moves to the next node 163 | } 164 | } 165 | } -------------------------------------------------------------------------------- /Data Structures/queue.h: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | typedef struct { 6 | int vals[1000]; 7 | int f; 8 | int r; 9 | } Queue; 10 | 11 | 12 | void create_queue(Queue* q) { 13 | q->f = 0; 14 | q->r = -1; 15 | } 16 | 17 | bool is_empty(Queue* q) { 18 | return q->f > q->r; 19 | } 20 | 21 | void enqueue(Queue* q, int val) { 22 | q->vals[++q->r] = val; 23 | } 24 | 25 | int dequeue(Queue* q) { 26 | if (is_empty(q)) { 27 | printf("Queue is empty\n"); 28 | return -1; 29 | } 30 | return q->vals[q->f++]; 31 | } 32 | 33 | int peek(Queue* q){ 34 | if (is_empty(q)) { 35 | printf("Queue is empty\n"); 36 | return -1; 37 | } 38 | return q->vals[q->f]; 39 | } 40 | 41 | void print_queue(Queue* q) { 42 | if (is_empty(q)) { 43 | printf("Queue is empty\n"); 44 | return; 45 | } 46 | printf("Queue: "); 47 | for (int i = q->f; i <= q->r; i++) { 48 | printf("%d ", q->vals[i]); 49 | } 50 | printf("\n"); 51 | } -------------------------------------------------------------------------------- /Data Structures/singlelinkedlist.h: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | struct slinklist { 5 | int data; 6 | struct slinklist* next; 7 | }; 8 | 9 | typedef struct slinklist node; 10 | 11 | node *start=NULL; 12 | 13 | node* getnode(){ 14 | node* newnode; 15 | newnode =(node*) malloc(sizeof(node)); 16 | printf("\n Enter data :"); 17 | scanf("%d",&newnode->data); 18 | newnode->next = NULL; 19 | return newnode; 20 | } 21 | 22 | void traverse() 23 | { 24 | node *temp; 25 | temp = start; 26 | printf("\n The contents of List (Left to Right):\n"); 27 | if(start == NULL ) 28 | printf("\n Empty List"); 29 | else 30 | { 31 | while (temp != NULL) 32 | { 33 | printf("%d ->", temp -> data); 34 | temp = temp -> next; 35 | } 36 | } 37 | printf("X"); 38 | } 39 | int countnode(node *st){ 40 | if(st == NULL) 41 | return 0; 42 | else 43 | return(1 + countnode(st -> next)); 44 | } 45 | void createlist(int n){ 46 | node* newnode; 47 | node* temp; 48 | for (int i=0;inext!=NULL){ 56 | temp=temp->next; 57 | } 58 | temp->next=newnode; 59 | } 60 | } 61 | } 62 | void insert_at_beg(){ 63 | node* newnode; 64 | newnode=getnode(); 65 | if (start==NULL){ 66 | start=newnode; 67 | } 68 | else{ 69 | newnode->next=start; 70 | start=newnode; 71 | } 72 | } 73 | void insert_at_end(){ 74 | node *newnode, *temp; 75 | newnode=getnode(); 76 | if (start==NULL){ 77 | start=newnode; 78 | } 79 | else{ 80 | temp=start; 81 | while(temp->next!=NULL){ 82 | temp=temp->next; 83 | } 84 | temp->next=start; 85 | } 86 | } 87 | void insert_at_mid(){ 88 | node *newnode, *temp, *prev; 89 | int pos,nodectr, ctr=1; 90 | newnode=getnode(); 91 | printf("\n Enter the Position :"); 92 | scanf("%d",&pos); 93 | nodectr=countnode(start); 94 | if(pos>1 && posnext; 99 | ctr++; 100 | } 101 | prev->next=newnode; 102 | newnode->next=temp; 103 | } 104 | else { 105 | printf("%d is not a middle position",pos); 106 | } 107 | } 108 | 109 | void delete_at_beg(){ 110 | node* temp; 111 | if (start==NULL){ 112 | printf("\n No nodes exist"); 113 | return ; 114 | } 115 | else{ 116 | temp=start; 117 | start=temp->next; 118 | free(temp); 119 | printf("\n Node deleted"); 120 | } 121 | } 122 | 123 | void delete_at_end(){ 124 | node *temp,*prev; 125 | if (start==NULL){ 126 | printf("\n No nodes exist"); 127 | return ; 128 | } 129 | else{ 130 | temp=start; 131 | prev=start; 132 | while(temp->next!=NULL){ 133 | prev=temp; 134 | temp=temp->next; 135 | } 136 | prev->next=NULL; 137 | free(temp); 138 | printf("\n Node deleted"); 139 | } 140 | } 141 | 142 | void delete_at_mid(){ 143 | int ctr=1,pos,nodectr; 144 | node *temp,*prev; 145 | if (start==NULL){ 146 | printf("\n No nodes exist"); 147 | return ; 148 | } 149 | else{ 150 | printf("\n Enter position of node to delete: "); 151 | scanf("%d", &pos); 152 | nodectr = countnode(start); 153 | if(pos > nodectr){ 154 | printf("\nThis node doesnot exist"); 155 | } 156 | if (pos>1 && pos next; 162 | ctr ++; 163 | } 164 | prev -> next = temp -> next; 165 | free(temp); 166 | printf("\n Node deleted"); 167 | } 168 | } 169 | } 170 | -------------------------------------------------------------------------------- /Data Structures/sorting.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | void swap(int* a, int* b){ 5 | int k = *a; 6 | *a = *b; 7 | *b = k; 8 | } 9 | 10 | int* bbl(int* a, int n){ 11 | for(int i = n - 1; i >= 0; i--){ 12 | for(int j = 0; j < i; j++){ 13 | if(a[j] > a[j + 1]) swap(&a[j], &a[j + 1]); 14 | } 15 | } 16 | return a; 17 | } 18 | 19 | int* ins(int* a, int n){ 20 | for(int j = 1; j < n; j++){ 21 | int key = a[j], ind = j - 1; 22 | while(ind >= 0 && a[ind] > key){ 23 | a[ind + 1] = a[ind]; 24 | ind--; 25 | } 26 | a[ind + 1] = key; 27 | } 28 | return a; 29 | } 30 | 31 | int* sel(int* a, int n){ 32 | for(int i = 0; i < n - 1; i++){ 33 | int min = a[i], loc = i; 34 | for(int j = i + 1; j < n; j++){ 35 | if(a[j] < min){ 36 | min = a[j]; 37 | loc = j; 38 | } 39 | } 40 | if(loc != i){ 41 | a[loc] = a[i]; 42 | a[i] = min; 43 | } 44 | } 45 | return a; 46 | } 47 | 48 | void merge(int* a, int l, int m, int r){ 49 | int* b = (int*)malloc((r - l + 1) * sizeof(int)); 50 | int i = l, j = m + 1, k = 0; 51 | while(i <= m && j <= r){ 52 | if(a[i] <= a[j]) b[k++] = a[i++]; 53 | else b[k++] = a[j++]; 54 | } 55 | while(i <= m) b[k++] = a[i++]; 56 | while(j <= r) b[k++] = a[j++]; 57 | for(int i = 0; i < k; i++) a[l + i] = b[i]; 58 | free(b); 59 | } 60 | 61 | void mergeSort(int* a, int l, int h){ 62 | if(l < h){ 63 | int m = (l + h) / 2; 64 | mergeSort(a, l, m); 65 | mergeSort(a, m + 1, h); 66 | merge(a, l, m, h); 67 | } else return; 68 | } 69 | 70 | int partition(int* a, int l, int h, int t){ 71 | int i = l, j = l; 72 | while(i <= h){ 73 | if(a[i] <= a[t]){ 74 | swap(&a[i], &a[j]); 75 | j++; 76 | } 77 | i++; 78 | } 79 | return j - 1; 80 | } 81 | 82 | void QSort(int* a, int l, int h){ 83 | if(l >= h) return; 84 | int p = h; 85 | int m = partition(a, l, h, p); 86 | QSort(a, l, m - 1); 87 | QSort(a, m + 1, h); 88 | } 89 | -------------------------------------------------------------------------------- /Data Structures/stack.h: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | struct Node{ 5 | int val; 6 | struct Node* next; 7 | }; 8 | 9 | struct Stack{ 10 | struct Node* top; 11 | }; 12 | 13 | struct Node* create_stack(int data){ 14 | struct Node* newnode=(struct Node*)malloc(sizeof(struct Node)); 15 | newnode->val=data; 16 | newnode->next=NULL; 17 | return newnode; 18 | } 19 | 20 | void init_stack(struct Stack* stk){ 21 | stk->top=NULL; 22 | } 23 | 24 | int is_empty(struct Stack* stk){ 25 | return stk->top==NULL; 26 | } 27 | 28 | void push(struct Stack* stk,int it){ 29 | struct Node* newnode=create_stack(it); 30 | newnode->next=stk->top; 31 | stk->top=newnode; 32 | } 33 | 34 | int pop(struct Stack* stk){ 35 | if(is_empty(stk)){ 36 | printf("Empty Stack"); 37 | return -1; 38 | } 39 | struct Node* temp=stk->top; 40 | int data=temp->val; 41 | stk->top=stk->top->next; 42 | return data; 43 | } 44 | 45 | void prnt(struct Stack* stk){ 46 | if(is_empty(stk)){ 47 | printf("Empty Stack"); 48 | return; 49 | } 50 | printf("The Stack : "); 51 | struct Node* curr=stk->top; 52 | while(curr!=NULL){ 53 | printf("%d ",curr->val); 54 | curr=curr->next; 55 | } 56 | printf("\n"); 57 | } 58 | 59 | int peek(struct Stack* stk){ 60 | return stk->top->val; 61 | } -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | MIT License 2 | 3 | Copyright (c) 2024 neuralnetwork. 4 | 5 | Permission is hereby granted, free of charge, to any person obtaining a copy 6 | of this software and associated documentation files (the "Software"), to deal 7 | in the Software without restriction, including without limitation the rights 8 | to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 9 | copies of the Software, and to permit persons to whom the Software is 10 | furnished to do so, subject to the following conditions: 11 | 12 | The above copyright notice and this permission notice shall be included in all 13 | copies or substantial portions of the Software. 14 | 15 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 16 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 17 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 18 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 19 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 20 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 21 | SOFTWARE. 22 | -------------------------------------------------------------------------------- /OpenGL/Matrix Transformation.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | typedef struct 7 | { 8 | float x; 9 | float y; 10 | } Point2D; 11 | 12 | Point2D start_point, rotation_center, result_point; 13 | float translate_x, translate_y, rotation_angle, scale_angle, scale_factor, deg1, deg2; 14 | float composite_matrix[3][3]; 15 | 16 | void draw_og() 17 | { 18 | glColor3f(1.0, 0.0, 0.0); 19 | glBegin(GL_LINES); 20 | glVertex2f(-7.5f, 0.0f); 21 | glVertex2f(7.5f, 0.0f); 22 | glVertex2f(0.0f, -7.5f); 23 | glVertex2f(0.0f, 7.5f); 24 | glEnd(); 25 | } 26 | 27 | void solve() 28 | { 29 | for (int i = 0; i < 3; i++) 30 | for (int j = 0; j < 3; j++) 31 | composite_matrix[i][j] = (i == j) ? 1.0f : 0.0f; 32 | deg1=((rotation_angle) * 3.14159 / 180.0); 33 | float sin_val = sin(deg1); 34 | float cos_val = cos(deg1); 35 | float rot_mat[3][3] = {{cos_val, -sin_val, rotation_center.x * (1 - cos_val) + rotation_center.y * sin_val}, {sin_val, cos_val, rotation_center.y * (1 - cos_val) - rotation_center.x * sin_val}, {0, 0, 1}}; 36 | float trans_mat[3][3] = {{1, 0, translate_x}, {0, 1, translate_y}, {0, 0, 1}}; 37 | deg2=((scale_angle) * 3.14159 / 180.0); 38 | float dir_x = sin(deg2); 39 | float dir_y = cos(deg2); 40 | float scale_mat[3][3] = {{scale_factor * dir_x * dir_x + (1 - dir_x * dir_x), (scale_factor - 1) * dir_x * dir_y, 0}, {(scale_factor - 1) * dir_x * dir_y, scale_factor * dir_y * dir_y + (1 - dir_y * dir_y), 0}, {0, 0, 1}}; 41 | float temp_mat[3][3]; 42 | for (int i = 0; i < 3; i++) 43 | { 44 | for (int j = 0; j < 3; j++) 45 | { 46 | temp_mat[i][j] = 0; 47 | for (int k = 0; k < 3; k++) 48 | temp_mat[i][j] += trans_mat[i][k] * rot_mat[k][j]; 49 | } 50 | } 51 | for (int i = 0; i < 3; i++) 52 | { 53 | for (int j = 0; j < 3; j++) 54 | { 55 | composite_matrix[i][j] = 0; 56 | for (int k = 0; k < 3; k++) 57 | composite_matrix[i][j] += scale_mat[i][k] * temp_mat[k][j]; 58 | } 59 | } 60 | } 61 | 62 | void plot_point(float px, float py, float r, float g, float b) 63 | { 64 | glPointSize(8.0f); 65 | glBegin(GL_POINTS); 66 | glColor3f(r, g, b); 67 | glVertex2f(px / 80.0f, py / 80.0f); 68 | glEnd(); 69 | } 70 | 71 | void display() 72 | { 73 | glClear(GL_COLOR_BUFFER_BIT); 74 | draw_og(); 75 | plot_point(start_point.x, start_point.y, 1.0f, 0.4f, 0.2f); 76 | float rot_x = cos(deg1) * (start_point.x - rotation_center.x) - sin(deg1) * (start_point.y - rotation_center.y) + rotation_center.x; 77 | float rot_y = sin(deg1) * (start_point.x - rotation_center.x) + cos(deg1) * (start_point.y - rotation_center.y) + rotation_center.y; 78 | plot_point(rot_x, rot_y, 0.0f, 0.0f, 1.0f); 79 | plot_point(rot_x + translate_x, rot_y + translate_y, 1.0f, 0.0f, 1.0f); 80 | result_point.x = composite_matrix[0][0] * start_point.x + composite_matrix[0][1] * start_point.y + composite_matrix[0][2]; 81 | result_point.y = composite_matrix[1][0] * start_point.x + composite_matrix[1][1] * start_point.y + composite_matrix[1][2]; 82 | plot_point(result_point.x, result_point.y, 1.0f, 1.0f, 1.0f); 83 | glFlush(); 84 | } 85 | 86 | void take_input(){ 87 | printf("Enter initial coordinates x, y: "); 88 | scanf("%f %f", &start_point.x, &start_point.y); 89 | 90 | printf("Enter rotation center xr, yr: "); 91 | scanf("%f %f", &rotation_center.x, &rotation_center.y); 92 | 93 | printf("Enter translation t1, t2: "); 94 | scanf("%f %f", &translate_x, &translate_y); 95 | if (translate_x < 50 || translate_x > 150 || translate_y < 50 || translate_y > 150) { 96 | printf("Error: t1 and t2 must be between 50 and 150\n"); 97 | exit(1); 98 | } 99 | 100 | printf("Enter rotation angle d1: "); 101 | scanf("%f", &rotation_angle); 102 | if (rotation_angle < 10 || rotation_angle > 30) { 103 | printf("Error: d1 must be between 10 and 30\n"); 104 | exit(1); 105 | } 106 | 107 | printf("Enter scaling direction d2: "); 108 | scanf("%f", &scale_angle); 109 | if (scale_angle < 10 || scale_angle > 30) { 110 | printf("Error: d2 must be between 10 and 30\n"); 111 | exit(1); 112 | } 113 | 114 | printf("Enter scaling factor s: "); 115 | scanf("%f", &scale_factor); 116 | if (scale_factor < 2.0 || scale_factor > 3.0) { 117 | printf("Error: s must be between 2.0 and 3.0\n"); 118 | exit(1); 119 | } 120 | 121 | } 122 | 123 | int main(int argc, char **argv) 124 | { 125 | take_input(); 126 | solve(); 127 | printf("\nFinal Transformation Matrix:\n"); 128 | for (int i = 0; i < 3; i++) 129 | { 130 | for (int j = 0; j < 3; j++) 131 | printf("%.4f ", composite_matrix[i][j]); 132 | printf("\n"); 133 | } 134 | glutInit(&argc, argv); 135 | glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB); 136 | glutInitWindowSize(600, 600); 137 | glutCreateWindow("Transformation Matrices"); 138 | glClearColor(0.0f,0.0f,0.0f, 1.0f); 139 | gluOrtho2D(-7.5f, 7.5f, -7.5f, 7.5f); 140 | glutDisplayFunc(display); 141 | glutMainLoop(); 142 | return 0; 143 | } -------------------------------------------------------------------------------- /OpenGL/Mid Point Ellipse.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int windowWidth = 1366; 6 | int windowHeight = 768; 7 | 8 | void myInit(void){ 9 | glClearColor(0.0,0.0,0.0,0.0); 10 | glColor3f(1.0f,0.0f,0.0f); 11 | glPointSize(3.0); 12 | glMatrixMode(GL_PROJECTION); 13 | glLoadIdentity(); 14 | if (windowWidth > windowHeight) { 15 | glOrtho(-windowWidth / 2.0, windowWidth / 2.0, -windowHeight / 2.0, windowHeight / 2.0, -1.0, 1.0); 16 | } else { 17 | glOrtho(-windowWidth / 2.0, windowWidth / 2.0, -windowWidth / 2.0, windowWidth / 2.0, -1.0, 1.0); 18 | } 19 | } 20 | 21 | void myReshape(int w, int h) { 22 | windowWidth = w; 23 | windowHeight = h; 24 | glViewport(0, 0, w, h); 25 | myInit(); 26 | glutPostRedisplay(); 27 | } 28 | 29 | void myDisplay(void){ 30 | glClear(GL_COLOR_BUFFER_BIT); 31 | glClear(GL_COLOR_BUFFER_BIT); 32 | glColor3f(0.0f, 1.0f, 0.0f); 33 | glBegin(GL_LINES); 34 | glVertex2i(-1000, 0); 35 | glVertex2i(1000, 0); 36 | glVertex2i(0, -500); 37 | glVertex2i(0, 500); 38 | glEnd(); 39 | glColor3f(1.0f, 0.0f, 0.0f); 40 | glBegin(GL_POINTS); 41 | int rx,ry,xc,yc; 42 | printf("Input rx, ry, xc, yc : "); 43 | scanf("%d %d %d %d",&rx,&ry,&xc,&yc); 44 | double x=0,y=ry; 45 | double rx2=rx*(double)rx; 46 | double ry2=ry*(double)ry; 47 | double p1=ry2-rx2*ry+(rx2/4.0); 48 | glVertex2i(xc+(int)x,yc+(int)y); 49 | while(2.0*ry2*x<2.0*rx2*y){ 50 | x++; 51 | if(p1>=0){ 52 | y--; 53 | p1-=2.0*y*rx2; 54 | } 55 | p1+=2.0*ry2*x+ry2; 56 | glVertex2i(xc+(int)x,yc+(int)y); 57 | glVertex2i(xc-(int)x,yc+(int)y); 58 | glVertex2i(xc+(int)x,yc-(int)y); 59 | glVertex2i(xc-(int)x,yc-(int)y); 60 | } 61 | double p2=ry2*(x+0.5)*(x+0.5)+rx2*(y-1.0)*(y-1.0)-rx2*ry2; 62 | glVertex2i(xc+(int)x,yc+(int)y); 63 | while(y>0){ 64 | y--; 65 | if(p2<=0){ 66 | x++; 67 | p2+=2.0*ry2*x; 68 | } 69 | p2+=rx2-2.0*y*rx2; 70 | glVertex2i(xc+(int)x,yc+(int)y); 71 | glVertex2i(xc-(int)x,yc+(int)y); 72 | glVertex2i(xc+(int)x,yc-(int)y); 73 | glVertex2i(xc-(int)x,yc-(int)y); 74 | } 75 | glEnd(); 76 | glFlush(); 77 | } 78 | 79 | int main(int argc, char** argv){ 80 | glutInit(&argc,argv); 81 | glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB); 82 | glutInitWindowSize(1366, 768); 83 | glutInitWindowPosition(-500,-500); 84 | glutCreateWindow("Ellipse Midpoint Algorithm"); 85 | glutDisplayFunc(myDisplay); 86 | glutReshapeFunc(myReshape); 87 | myInit(); 88 | glutMainLoop(); 89 | return 0; 90 | } -------------------------------------------------------------------------------- /OpenGL/Middle Point Circle.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int windowWidth = 1366; 6 | int windowHeight = 768; 7 | 8 | void myInit(void){ 9 | glClearColor(0.0,0.0,0.0,0.0); 10 | glColor3f(1.0f,0.0f,0.0f); 11 | glPointSize(3.0); 12 | glMatrixMode(GL_PROJECTION); 13 | glLoadIdentity(); 14 | if (windowWidth > windowHeight) { 15 | glOrtho(-windowWidth / 2.0, windowWidth / 2.0, -windowHeight / 2.0, windowHeight / 2.0, -1.0, 1.0); 16 | } else { 17 | glOrtho(-windowWidth / 2.0, windowWidth / 2.0, -windowWidth / 2.0, windowWidth / 2.0, -1.0, 1.0); 18 | } 19 | } 20 | 21 | void myReshape(int w, int h) { 22 | windowWidth = w; 23 | windowHeight = h; 24 | glViewport(0, 0, w, h); 25 | myInit(); 26 | glutPostRedisplay(); 27 | } 28 | 29 | void myDisplay(void){ 30 | glClear(GL_COLOR_BUFFER_BIT); 31 | glClear(GL_COLOR_BUFFER_BIT); 32 | glColor3f(0.0f, 1.0f, 0.0f); 33 | glBegin(GL_LINES); 34 | glVertex2i(-1000, 0); 35 | glVertex2i(1000, 0); 36 | glVertex2i(0, -500); 37 | glVertex2i(0, 500); 38 | glEnd(); 39 | glColor3f(1.0f, 0.0f, 0.0f); 40 | glBegin(GL_POINTS); 41 | int cx,cy,r; 42 | printf("Enter the center points and radius :- "); 43 | scanf("%d %d %d",&cx,&cy,&r); 44 | int x=0,y=-r,p=-r; 45 | while (x<=-y){ 46 | if (p>0){ 47 | y++; 48 | p+=2*y; 49 | } 50 | p+=2*x+1; 51 | glVertex2i(cx+x,cy+y); 52 | glVertex2i(cx-x,cy+y); 53 | glVertex2i(cx+x,cy-y); 54 | glVertex2i(cx-x,cy-y); 55 | glVertex2i(cx+y,cy+x); 56 | glVertex2i(cx-y,cy+x); 57 | glVertex2i(cx+y,cy-x); 58 | glVertex2i(cx-y,cy-x); 59 | x++; 60 | } 61 | glEnd(); 62 | glFlush(); 63 | } 64 | 65 | 66 | void main(int argc, char** argv){ 67 | glutInit(&argc,argv); 68 | glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB); 69 | glutInitWindowSize(1366, 768); 70 | glutInitWindowPosition(-500,-500); 71 | glutCreateWindow("Middle Point Circle Theorem"); 72 | glutDisplayFunc(myDisplay); 73 | glutReshapeFunc(myReshape); 74 | myInit(); 75 | glutMainLoop(); 76 | } -------------------------------------------------------------------------------- /OpenGL/Reflection of A Line.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | 6 | int x0, yy, x2, y2; 7 | int xr1, yr1, xr2, yr2; 8 | double ans1, ans2, ans3, ans4; 9 | 10 | int windowWidth = 1366; 11 | int windowHeight = 768; 12 | 13 | void myInit(void) { 14 | glClearColor(0.0, 0.0, 0.0, 0.0); 15 | glColor3f(1.0f, 1.0f, 1.0f); 16 | glPointSize(4.0); 17 | glMatrixMode(GL_PROJECTION); 18 | glLoadIdentity(); 19 | double aspect = (double)windowWidth / windowHeight; 20 | if (windowWidth >= windowHeight) { 21 | glOrtho(-windowWidth / 2.0, windowWidth / 2.0, -windowWidth / (2.0 * aspect), windowWidth / (2.0 * aspect), -1.0, 1.0); 22 | } else { 23 | glOrtho(-windowHeight * aspect / 2.0, windowHeight * aspect / 2.0, -windowHeight / 2.0, windowHeight / 2.0, -1.0, 1.0); 24 | } 25 | glMatrixMode(GL_MODELVIEW); 26 | glLoadIdentity(); 27 | } 28 | 29 | void axes() { 30 | glColor3f(0.5f, 0.5f, 0.5f); 31 | glBegin(GL_LINES); 32 | glVertex2i(-windowWidth / 2, 0); 33 | glVertex2i(windowWidth / 2, 0); 34 | glVertex2i(0, -windowHeight / 2); 35 | glVertex2i(0, windowHeight / 2); 36 | glEnd(); 37 | } 38 | 39 | void take_inp() { 40 | printf("Enter the line to be reflected\n"); 41 | printf("Point 1 (x0 yy): "); 42 | scanf("%d %d", &x0, &yy); 43 | printf("Point 2 (x2 y2): "); 44 | scanf("%d %d", &x2, &y2); 45 | printf("Enter the reflection axis line\n"); 46 | printf("Point 1 (xr1 yr1): "); 47 | scanf("%d %d", &xr1, &yr1); 48 | printf("Point 2 (xr2 yr2): "); 49 | scanf("%d %d", &xr2, &yr2); 50 | } 51 | 52 | void myReshape(int w, int h) { 53 | windowWidth = w; 54 | windowHeight = h; 55 | glViewport(0, 0, w, h); 56 | myInit(); 57 | } 58 | 59 | void plotline(double w, double x, double y, double z, float r, float g, float b) { 60 | glColor3f(r, g, b); 61 | glBegin(GL_LINES); 62 | glVertex2d(w, x); 63 | glVertex2d(y, z); 64 | glEnd(); 65 | } 66 | 67 | void solve() { 68 | double tx0 = x0 - xr1; 69 | double ty0 = yy - yr1; 70 | double tx2 = x2 - xr1; 71 | double ty2 = y2 - yr1; 72 | double txr2 = xr2 - xr1; 73 | double tyr2 = yr2 - yr1; 74 | 75 | double reflected_tx0, reflected_ty0, reflected_tx2, reflected_ty2; 76 | 77 | if (fabs(txr2) < 1e-9) { 78 | reflected_tx0 = -tx0; 79 | reflected_ty0 = ty0; 80 | reflected_tx2 = -tx2; 81 | reflected_ty2 = ty2; 82 | } 83 | else if (fabs(tyr2) < 1e-9) { 84 | reflected_tx0 = tx0; 85 | reflected_ty0 = -ty0; 86 | reflected_tx2 = tx2; 87 | reflected_ty2 = -ty2; 88 | } 89 | else { 90 | double m = tyr2 / txr2; 91 | double m_sq = m * m; 92 | double d = m_sq + 1.0; 93 | 94 | double R[2][2]; 95 | R[0][0] = (1.0 - m_sq) / d; 96 | R[0][1] = (2.0 * m) / d; 97 | R[1][0] = (2.0 * m) / d; 98 | R[1][1] = (m_sq - 1.0) / d; 99 | 100 | reflected_tx0 = R[0][0] * tx0 + R[1][0] * ty0; 101 | reflected_ty0 = R[0][1] * tx0 + R[1][1] * ty0; 102 | reflected_tx2 = R[0][0] * tx2 + R[1][0] * ty2; 103 | reflected_ty2 = R[0][1] * tx2 + R[1][1] * ty2; 104 | } 105 | 106 | ans1 = reflected_tx0 + xr1; 107 | ans2 = reflected_ty0 + yr1; 108 | ans3 = reflected_tx2 + xr1; 109 | ans4 = reflected_ty2 + yr1; 110 | 111 | 112 | printf("Original Points : (%d, %d) to (%d, %d)\n", x0, yy, x2, y2); 113 | printf("Reflection Axis: (%d, %d) to (%d, %d)\n", xr1, yr1, xr2, yr2); 114 | printf("Reflected Points : (%.2f, %.2f) to (%.2f, %.2f)\n", ans1, ans2, ans3, ans4); 115 | } 116 | 117 | void myDisplay(void) { 118 | glClear(GL_COLOR_BUFFER_BIT); 119 | axes(); 120 | 121 | plotline(x0, yy, x2, y2, 1.0f, 0.0f, 0.0f); 122 | 123 | plotline(xr1, yr1, xr2, yr2, 0.0f, 1.0f, 0.0f); 124 | 125 | solve(); 126 | plotline(ans1, ans2, ans3, ans4, 0.0f, 1.0f, 1.0f); 127 | 128 | glFlush(); 129 | } 130 | 131 | int main(int argc, char** argv) { 132 | take_inp(); 133 | 134 | glutInit(&argc, argv); 135 | glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB); 136 | glutInitWindowSize(windowWidth, windowHeight); 137 | int screenWidth = glutGet(GLUT_SCREEN_WIDTH); 138 | int screenHeight = glutGet(GLUT_SCREEN_HEIGHT); 139 | glutInitWindowPosition((screenWidth - windowWidth) / 2, (screenHeight - windowHeight) / 2); 140 | 141 | glutCreateWindow("Reflection of Line about an Arbitrary Axis"); 142 | 143 | myInit(); 144 | 145 | glutDisplayFunc(myDisplay); 146 | glutReshapeFunc(myReshape); 147 | 148 | glutMainLoop(); 149 | 150 | return 0; 151 | } -------------------------------------------------------------------------------- /OpenGL/Scan Fill Algorithm.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int windowWidth = 1366; 6 | int windowHeight = 768; 7 | 8 | int n=11; 9 | 10 | typedef struct{ 11 | int x; 12 | int y; 13 | }Point; 14 | 15 | Point pts[]={{10,60},{30,140},{50,60},{80,220},{100,60}, 16 | {150,100},{180,50},{200,40},{250,90},{300,30},{120,10}}; 17 | 18 | void myInit(void){ 19 | glClearColor(0.0,0.0,0.0,0.0); 20 | glColor3f(1.0f,0.0f,0.0f); 21 | glPointSize(3.0); 22 | glMatrixMode(GL_PROJECTION); 23 | glLoadIdentity(); 24 | if (windowWidth > windowHeight) { 25 | glOrtho(-windowWidth / 2.0, windowWidth / 2.0, -windowHeight / 2.0, windowHeight / 2.0, -1.0, 1.0); 26 | } else { 27 | glOrtho(-windowWidth / 2.0, windowWidth / 2.0, -windowWidth / 2.0, windowWidth / 2.0, -1.0, 1.0); 28 | } 29 | } 30 | 31 | void myReshape(int w, int h) { 32 | windowWidth = w; 33 | windowHeight = h; 34 | glViewport(0, 0, w, h); 35 | myInit(); 36 | glutPostRedisplay(); 37 | } 38 | 39 | void myDisplay(void){ 40 | glClear(GL_COLOR_BUFFER_BIT); 41 | glColor3f(0.0f, 1.0f, 0.0f); 42 | glBegin(GL_LINES); 43 | glVertex2i(-1000, 0); 44 | glVertex2i(1000, 0); 45 | glVertex2i(0, -500); 46 | glVertex2i(0, 500); 47 | glEnd(); 48 | glColor3f(1.0f, 0.0f, 0.0f); 49 | // glBegin(GL_LINES); 50 | glPointSize(3.0); 51 | int ymin=pts[0].y; 52 | int ymax=pts[0].y; 53 | for (int i=1;ipts[i].y) ymin=pts[i].y; 56 | } 57 | // printf("%d %d",ymin,ymax); 58 | for (int y=ymin;y<=ymax;y++){ 59 | int ints[200]; 60 | int cnt=0; int y1,y2; 61 | for(int i=0;i=y1 && yy2){ 71 | if(y>=y2 && yints[j]){ 80 | int k=ints[i]; 81 | ints[i]=ints[j]; 82 | ints[j]=k; 83 | } 84 | } 85 | } 86 | for(int i=0;i 2 | #include 3 | #include 4 | #include 5 | 6 | int windowWidth = 1366; 7 | int windowHeight = 768; 8 | 9 | int n=9; 10 | 11 | int pts[20][2]={{50,150},{200,50},{350,150},{350,300},{250,300},{200,250},{150,350},{100,250},{100,200}}; 12 | int clipper[4][2]={{100,100},{300,100},{300,300},{100,300}}; 13 | 14 | typedef struct{ 15 | float x,y; 16 | }Point; 17 | 18 | Point ans[20]; 19 | int cnt; 20 | 21 | void myInit(void){ 22 | glClearColor(0.0,0.0,0.0,0.0); 23 | glColor3f(1.0f,0.0f,0.0f); 24 | glPointSize(3.0); 25 | glMatrixMode(GL_PROJECTION); 26 | glLoadIdentity(); 27 | if (windowWidth > windowHeight) { 28 | glOrtho(-windowWidth / 2.0, windowWidth / 2.0, -windowHeight / 2.0, windowHeight / 2.0, -1.0, 1.0); 29 | } else { 30 | glOrtho(-windowWidth / 2.0, windowWidth / 2.0, -windowWidth / 2.0, windowWidth / 2.0, -1.0, 1.0); 31 | } 32 | } 33 | 34 | void axes(){ 35 | glColor3f(1.0f, 0.0f, 0.0f); 36 | glBegin(GL_LINES); 37 | glVertex2i(-1000, 0); 38 | glVertex2i(1000, 0); 39 | glVertex2i(0, -500); 40 | glVertex2i(0, 500); 41 | glEnd(); 42 | } 43 | 44 | void polygon_boundary(){ 45 | glColor3f(0.0f, 1.0f, 0.0f); 46 | glBegin(GL_LINE_LOOP); 47 | for (int i = 0; i < n; i++) { 48 | glVertex2i(pts[i][0], pts[i][1]); 49 | } 50 | glEnd(); 51 | } 52 | 53 | void myReshape(int w, int h) { 54 | windowWidth = w; 55 | windowHeight = h; 56 | glViewport(0, 0, w, h); 57 | myInit(); 58 | glutPostRedisplay(); 59 | } 60 | 61 | void make_clip_window(){ 62 | glColor3f(0.5f,0.5f,1.0f); 63 | glBegin(GL_LINE_LOOP); 64 | for(int i=0;i<4;i++){ 65 | glVertex2i(clipper[i][0],clipper[i][1]); 66 | } 67 | glEnd(); 68 | } 69 | 70 | Point ints(Point st, Point end, int bound, int dim){ 71 | Point res; 72 | if(st.x==end.x){ 73 | res.x=st.x; 74 | res.y=bound; 75 | } 76 | else if(st.y==end.y){ 77 | res.x=bound; 78 | res.y=st.y; 79 | } 80 | else{ 81 | float m=(end.y-st.y)/(end.x-st.x); 82 | if(dim==0){ 83 | res.x=bound; 84 | res.y=st.y+m*(bound-st.x); 85 | } 86 | else{ 87 | res.y=bound; 88 | res.x=st.x+(bound-st.y)/m; 89 | } 90 | } 91 | return res; 92 | } 93 | 94 | void clips(int bound, int dim, int lowerbound){ 95 | Point temp[20]; 96 | int tempcount=0; 97 | for (int i = 0; i < cnt; i++) { 98 | Point a; 99 | a=ans[i]; 100 | Point b; 101 | b=ans[(i + 1) % cnt]; 102 | bool ain, bin; 103 | if (dim == 0) { 104 | if (lowerbound) { 105 | ain = (a.x >= bound); 106 | bin = (b.x >= bound); 107 | } 108 | else { 109 | ain = (a.x <= bound); 110 | bin = (b.x <= bound); 111 | } 112 | } 113 | else { 114 | if (lowerbound) { 115 | ain = (a.y >= bound); 116 | bin = (b.y >= bound); 117 | } 118 | else { 119 | ain = (a.y <= bound); 120 | bin = (b.y <= bound); 121 | } 122 | } 123 | // in-in 124 | if (ain && bin) { 125 | temp[tempcount].x=b.x; 126 | temp[tempcount].y=b.y; 127 | tempcount++; 128 | } 129 | // in-out 130 | else if (ain && !bin) { 131 | temp[tempcount]=ints(a,b,bound,dim); 132 | tempcount++; 133 | } 134 | // out-in 135 | else if (!ain && bin) { 136 | temp[tempcount]=ints(a,b,bound,dim); 137 | tempcount++; 138 | temp[tempcount].x=b.x; 139 | temp[tempcount].y=b.y; 140 | tempcount++; 141 | } 142 | // out-out 143 | else{ 144 | // do nothing 145 | } 146 | } 147 | for (int i = 0; i < tempcount; i++) { 148 | ans[i] = temp[i]; 149 | } 150 | cnt=tempcount; 151 | } 152 | 153 | void final(){ 154 | for(int i=0; i 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | int windowWidth = 1366; 8 | int windowHeight = 768; 9 | 10 | int x0, yy, x2, y2, t1, t2, a; 11 | float s1, s2; 12 | int xb1, yb1, xb2, yb2; 13 | 14 | void myInit(void) 15 | { 16 | glClearColor(0.0, 0.0, 0.0, 0.0); 17 | glColor3f(1.0f, 0.0f, 0.0f); 18 | glPointSize(3.0); 19 | glMatrixMode(GL_PROJECTION); 20 | glLoadIdentity(); 21 | if (windowWidth > windowHeight) 22 | { 23 | glOrtho(-windowWidth / 2.0, windowWidth / 2.0, -windowHeight / 2.0, windowHeight / 2.0, -1.0, 1.0); 24 | } 25 | else 26 | { 27 | glOrtho(-windowWidth / 2.0, windowWidth / 2.0, -windowWidth / 2.0, windowWidth / 2.0, -1.0, 1.0); 28 | } 29 | } 30 | 31 | void axes() 32 | { 33 | glColor3f(1.0f, 0.0f, 0.0f); 34 | glBegin(GL_LINES); 35 | glVertex2i(-1000, 0); 36 | glVertex2i(1000, 0); 37 | glVertex2i(0, -500); 38 | glVertex2i(0, 500); 39 | glEnd(); 40 | } 41 | 42 | void take_inp() 43 | { 44 | printf("Enter the points x1,y1 and x2,y2 : "); 45 | scanf("%d %d %d %d", &x0, &yy, &x2, &y2); 46 | printf("Enter the scaling factors sx, sy : "); 47 | scanf("%f %f", &s1, &s2); 48 | if (s1 < 0.2 || s2 < 0.2 || s1 > 3.0 || s2 > 3.0) 49 | { 50 | printf("Please remain in the range {0.2-3.0}.\n"); 51 | exit(0); 52 | } 53 | printf("Enter translation amount tx, ty : "); 54 | scanf("%d %d", &t1, &t2); 55 | if (t1 < 50 || t2 < 50 || t1 > 150 || t2 > 150) 56 | { 57 | printf("Please remain in the range {50-150}.\n"); 58 | exit(0); 59 | } 60 | printf("Enter angle of rotation A : "); 61 | scanf("%d", &a); 62 | if (a < 10 || a > 80) 63 | { 64 | printf("Please remain in the range {10-80}.\n"); 65 | exit(0); 66 | } 67 | } 68 | 69 | void draw_og() 70 | { 71 | glColor3f(1.0f, 1.0f, 0.0f); 72 | glBegin(GL_LINES); 73 | glVertex2i(x0, yy); 74 | glVertex2i(x2, y2); 75 | glEnd(); 76 | } 77 | 78 | void scale(int x4, int y4, int x5, int y5) 79 | { 80 | int mat[2][2] = {s1, 0, 0, s2}; 81 | int inp[2] = {x4, y4}; 82 | int out[2]; 83 | for (int i = 0; i < 2; i++) 84 | { 85 | out[i] = inp[i] * mat[i][i]; 86 | } 87 | int a = out[0], b = out[1]; 88 | int inp2[2] = {x5, y5}; 89 | for (int i = 0; i < 2; i++) 90 | { 91 | out[i] = inp2[i] * mat[i][i]; 92 | } 93 | glColor3f(0.0f, 1.0f, 0.0f); 94 | glBegin(GL_LINES); 95 | glVertex2i(a, b); 96 | glVertex2i(out[0], out[1]); 97 | glEnd(); 98 | xb1 = a; 99 | yb1 = b; 100 | xb2 = out[0]; 101 | yb2 = out[1]; 102 | } 103 | 104 | void translate(int x4, int y4, int x5, int y5) 105 | { 106 | int mat[2][2] = {t1, t2, t1, t2}; 107 | int inp[2][2] = {x4, y4, x5, y5}; 108 | int out[2][2]; 109 | for (int i = 0; i < 2; i++) 110 | { 111 | for (int j = 0; j < 2; j++) 112 | { 113 | out[i][j] = inp[i][j] + mat[i][j]; 114 | } 115 | } 116 | glColor3f(0.0f, 1.0f, 1.0f); 117 | glBegin(GL_LINES); 118 | glVertex2i(out[0][0], out[0][1]); 119 | glVertex2i(out[1][0], out[1][1]); 120 | glEnd(); 121 | xb1 = out[0][0]; 122 | yb1 = out[0][1]; 123 | xb2 = out[1][0]; 124 | yb2 = out[1][1]; 125 | } 126 | 127 | void rotation(int x4, int y4, int x5, int y5) 128 | { 129 | float rad = a * 3.14 / 180.0f; 130 | float mat[2][2] = {cos(rad), -sin(rad), sin(rad), cos(rad)}; 131 | float out[2]; 132 | float inp[2] = {x4, y4}; 133 | out[0] = inp[0] * mat[0][0] + inp[1] * mat[0][1]; 134 | out[1] = inp[0] * mat[1][0] + inp[1] * mat[1][1]; 135 | float a1 = out[0], b1 = out[1]; 136 | float inp2[2] = {x5, y5}; 137 | out[0] = inp2[0] * mat[0][0] + inp2[1] * mat[0][1]; 138 | out[1] = inp2[0] * mat[1][0] + inp2[1] * mat[1][1]; 139 | glColor3f(1.0f, 1.0f, 1.0f); 140 | glBegin(GL_LINES); 141 | glVertex2f(a1, b1); 142 | glVertex2f(out[0], out[1]); 143 | glEnd(); 144 | } 145 | 146 | void myReshape(int w, int h) 147 | { 148 | windowWidth = w; 149 | windowHeight = h; 150 | glViewport(0, 0, w, h); 151 | myInit(); 152 | glutPostRedisplay(); 153 | } 154 | 155 | void myDisplay(void) 156 | { 157 | glClear(GL_COLOR_BUFFER_BIT); 158 | axes(); 159 | take_inp(); 160 | draw_og(); 161 | scale(x0, yy, x2, y2); 162 | translate(xb1, yb1, xb2, yb2); 163 | rotation(xb1, yb1, xb2, yb2); 164 | glFlush(); 165 | } 166 | 167 | void main(int argc, char **argv) 168 | { 169 | glutInit(&argc, argv); 170 | glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB); 171 | glutInitWindowSize(1366, 768); 172 | glutInitWindowPosition(-500, -500); 173 | // glBlendFunc(GL_SRC_ALPHA, GL_ONE_MINUS_SRC_ALPHA); 174 | // glEnable(GL_BLEND); 175 | glutCreateWindow("Line niye kichu korchi"); 176 | glutDisplayFunc(myDisplay); 177 | glutReshapeFunc(myReshape); 178 | myInit(); 179 | glutMainLoop(); 180 | } -------------------------------------------------------------------------------- /OpenGL/bresenham.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | void myInit(void){ 6 | glClearColor(1.0, 1.0, 1.0, 0.0); 7 | glColor3f(1.0f, 0.0f, 0.0f); 8 | glPointSize(4.0); 9 | glMatrixMode(GL_PROJECTION); 10 | glLoadIdentity(); 11 | gluOrtho2D(-500.0, 500.0, -500.0, 500.0); 12 | } 13 | 14 | void mybres1(int x0, int y0, int x1, int y1){ 15 | int dx = x1 - x0; 16 | int dy = y1 - y0; 17 | glVertex2i(x0, y0); 18 | int dir = 1; 19 | if (dy < 0) dir = -1; 20 | dy *= dir; 21 | if(dx == 0) return; 22 | int y = y0; 23 | int p = 2 * dy - dx; 24 | for (int i = 0; i < dx + 1; i++){ 25 | glVertex2i(x0 + i, y); 26 | if (p >= 0){ 27 | y += dir; 28 | p -= 2 * dx; 29 | } 30 | p += 2 * dy; 31 | } 32 | } 33 | 34 | void mybres2(int x0, int y0, int x1, int y1){ 35 | int dx = x1 - x0; 36 | int dy = y1 - y0; 37 | glVertex2i(x0, y0); 38 | int dir = 1; 39 | if (dx < 0) dir = -1; 40 | dx *= dir; 41 | if(dy == 0) return; 42 | int x = x0; 43 | int p = 2 * dx - dy; 44 | for (int i = 0; i < dy + 1; i++){ 45 | glVertex2i(x, y0 + i); 46 | if (p >= 0){ 47 | x += dir; 48 | p -= 2 * dy; 49 | } 50 | p += 2 * dx; 51 | } 52 | } 53 | 54 | void myDisplay(void){ 55 | glClear(GL_COLOR_BUFFER_BIT); 56 | glColor3f(0.0f, 1.0f, 0.0f); 57 | glBegin(GL_LINES); 58 | glVertex2i(-500, 0); 59 | glVertex2i(500, 0); 60 | glVertex2i(0, 500); 61 | glVertex2i(0, -500); 62 | glEnd(); 63 | glColor3f(1.0f, 0.0f, 0.0f); 64 | int x0, y0, x1, y1; 65 | printf("Enter the points : x0, y0, x1, y1 -- "); 66 | scanf("%d %d %d %d", &x0, &y0, &x1, &y1); 67 | glBegin(GL_POINTS); 68 | if (abs(y1 - y0) < abs(x1 - x0)){ 69 | if (x0 > x1) mybres1(x1, y1, x0, y0); 70 | else mybres1(x0, y0, x1, y1); 71 | } else { 72 | if (y0 > y1) mybres2(x1, y1, x0, y0); 73 | else mybres2(x0, y0, x1, y1); 74 | } 75 | glEnd(); 76 | glFlush(); 77 | } 78 | 79 | int main(int argc, char** argv){ 80 | glutInit(&argc, argv); 81 | glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB); 82 | glutInitWindowSize(1366, 768); 83 | glutInitWindowPosition(-300, -300); 84 | glutCreateWindow("Bresenham's Algorithm"); 85 | glutDisplayFunc(myDisplay); 86 | myInit(); 87 | glutMainLoop(); 88 | return 0; 89 | } -------------------------------------------------------------------------------- /OpenGL/midpoint_circle.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | int windowWidth = 1366; 6 | int windowHeight = 768; 7 | 8 | void myInit(void){ 9 | glClearColor(0.0,0.0,0.0,0.0); 10 | glColor3f(1.0f,0.0f,0.0f); 11 | glPointSize(3.0); 12 | glMatrixMode(GL_PROJECTION); 13 | glLoadIdentity(); 14 | if (windowWidth > windowHeight) { 15 | glOrtho(-windowWidth / 2.0, windowWidth / 2.0, -windowHeight / 2.0, windowHeight / 2.0, -1.0, 1.0); 16 | } else { 17 | glOrtho(-windowWidth / 2.0, windowWidth / 2.0, -windowWidth / 2.0, windowWidth / 2.0, -1.0, 1.0); 18 | } 19 | } 20 | 21 | void myReshape(int w, int h) { 22 | windowWidth = w; 23 | windowHeight = h; 24 | glViewport(0, 0, w, h); 25 | myInit(); 26 | glutPostRedisplay(); 27 | } 28 | 29 | void myDisplay(void){ 30 | glClear(GL_COLOR_BUFFER_BIT); 31 | glClear(GL_COLOR_BUFFER_BIT); 32 | glColor3f(0.0f, 1.0f, 0.0f); 33 | glBegin(GL_LINES); 34 | glVertex2i(-1000, 0); 35 | glVertex2i(1000, 0); 36 | glVertex2i(0, -500); 37 | glVertex2i(0, 500); 38 | glEnd(); 39 | glColor3f(1.0f, 0.0f, 0.0f); 40 | glBegin(GL_POINTS); 41 | int cx,cy,r; 42 | printf("Enter the center points and radius :- "); 43 | scanf("%d %d %d",&cx,&cy,&r); 44 | int x=0,y=-r,p=-r; 45 | while (x<=-y){ 46 | if (p>0){ 47 | y++; 48 | p+=2*y; 49 | } 50 | p+=2*x+1; 51 | glVertex2i(cx+x,cy+y); 52 | glVertex2i(cx-x,cy+y); 53 | glVertex2i(cx+x,cy-y); 54 | glVertex2i(cx-x,cy-y); 55 | glVertex2i(cx+y,cy+x); 56 | glVertex2i(cx-y,cy+x); 57 | glVertex2i(cx+y,cy-x); 58 | glVertex2i(cx-y,cy-x); 59 | x++; 60 | } 61 | glEnd(); 62 | glFlush(); 63 | } 64 | 65 | 66 | void main(int argc, char** argv){ 67 | glutInit(&argc,argv); 68 | glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB); 69 | glutInitWindowSize(1366, 768); 70 | glutInitWindowPosition(-500,-500); 71 | glutCreateWindow("Middle Point Circle Theorem"); 72 | glutDisplayFunc(myDisplay); 73 | glutReshapeFunc(myReshape); 74 | myInit(); 75 | glutMainLoop(); 76 | } 77 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | This project is my little place where I try to implement concepts that I learn in college courses and build stuff from scratch in C 2 | 3 | ## Topics 4 | ### 0. Random 5 | - [x] Extract a 60 second video 6 | - [x] RGB to Gray 7 | - [x] Elevator Logic 8 | - [x] ls command from Linux terminal 9 | ### 1. Data Structures 10 | - [x] Stack 11 | - [x] Queue 12 | - [x] Single Linked List 13 | - [x] Circular Linked List 14 | - [x] Double Linked List 15 | - [X] Sorting Algorithms 16 | ### 2. Ciphers 17 | - [x] Caesar Cipher 18 | - [x] Monoalphabetic Cipher 19 | - [x] Homophonic Substitution Cipher 20 | - [ ] Polygram Substitution Cipher 21 | - [ ] Polyalphabetic Substitution Cipher 22 | - [x] Playfair Cipher 23 | - [ ] Hill Cipher 24 | ### 3. OpenGL 25 | - [x] Bresenham's Algorithm 26 | - [ ] Middlepoint Circle Algorithm 27 | -------------------------------------------------------------------------------- /Random/elevator.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #define MAX_FLOORS 10 5 | void shiftFloorUnit(int *floorUnit, bool goingUp) { 6 | if (goingUp) { 7 | *floorUnit <<= 1; 8 | } else { 9 | *floorUnit >>= 1; 10 | } 11 | } 12 | int performANDOperation(int floorUnit, int callUnit) { 13 | return floorUnit & callUnit; 14 | } 15 | int main() { 16 | int currentFloor, destinationFloor, elevatorPosition; 17 | char direction, continueChoice; 18 | int floorUnit = 1; 19 | int upCallUnit = 0, downCallUnit = 0; 20 | printf("Enter the initial elevator position (1-%d): ", MAX_FLOORS); 21 | scanf("%d", &elevatorPosition); 22 | while (1) { 23 | printf("Enter your current floor (1-%d): ", MAX_FLOORS); 24 | scanf("%d", ¤tFloor); 25 | printf("Enter 'u' for up or 'd' for down: "); 26 | scanf(" %c", &direction); 27 | printf("Enter your destination floor (1-%d): ", MAX_FLOORS); 28 | scanf("%d", &destinationFloor); 29 | if (direction == 'u') { 30 | upCallUnit = 1 << (destinationFloor - 1); 31 | } else { 32 | downCallUnit = 1 << (destinationFloor - 1); 33 | } 34 | floorUnit = 1 << (elevatorPosition - 1); 35 | printf("\nElevator movement:\n"); 36 | printf("Elevator is currently at floor: %d\n", elevatorPosition); 37 | printf("User is at floor: %d\n", currentFloor); 38 | while (elevatorPosition != currentFloor) { 39 | bool goingUp = currentFloor > elevatorPosition; 40 | if (goingUp) { 41 | printf("Elevator goes up\n"); 42 | elevatorPosition++; 43 | } else { 44 | printf("Elevator goes down\n"); 45 | elevatorPosition--; 46 | } 47 | shiftFloorUnit(&floorUnit, goingUp); 48 | } 49 | printf("Elevator arrives at user's floor: %d\n", currentFloor); 50 | while (currentFloor != destinationFloor) { 51 | bool goingUp = destinationFloor > currentFloor; 52 | if (goingUp) { 53 | printf("Elevator goes up\n"); 54 | currentFloor++; 55 | elevatorPosition++; 56 | shiftFloorUnit(&floorUnit, true); 57 | if (performANDOperation(floorUnit, upCallUnit) > 0) { 58 | printf("Elevator stops at floor %d\n", currentFloor); 59 | } 60 | } else { 61 | printf("Elevator goes down\n"); 62 | currentFloor--; 63 | elevatorPosition--; 64 | shiftFloorUnit(&floorUnit, false); 65 | if (performANDOperation(floorUnit, downCallUnit) > 0) { 66 | printf("Elevator stops at floor %d\n", currentFloor); 67 | } 68 | } 69 | } 70 | printf("Elevator stops and eliminates response signal\n"); 71 | printf("You have reached your destination: Floor %d\n", destinationFloor); 72 | printf("Do you want to continue? (y/n): "); 73 | scanf(" %c", &continueChoice); 74 | if (continueChoice != 'y' && continueChoice != 'Y') { 75 | break; 76 | } 77 | } 78 | printf("Elevator program terminated.\n"); 79 | return 0; 80 | } -------------------------------------------------------------------------------- /Random/extract_vid.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #define FRAMES 3600 5 | #define SIZE 28 6 | #define CHANNELS 3 7 | void print_video_data(int ****video) { 8 | for (int frame = 0; frame < FRAMES; frame++) { 9 | for (int i = 0; i < SIZE; i++) { 10 | for (int j = 0; j < SIZE; j++) { 11 | int pixel_number = i * SIZE + j + 1; 12 | int red = video[frame][0][i][j]; 13 | int green = video[frame][1][i][j]; 14 | int blue = video[frame][2][i][j]; 15 | printf("Frame %d | Pixel %d | RGB Value (%d,%d,%d)\n", 16 | frame + 1, pixel_number, red, green, blue); 17 | } 18 | } 19 | } 20 | } 21 | int main() { 22 | int ****video; 23 | video = (int ****)malloc(FRAMES * sizeof(int ***)); 24 | if (video == NULL) { 25 | fprintf(stderr, "Memory allocation failed\n"); 26 | return 1; 27 | } 28 | for (int frame = 0; frame < FRAMES; frame++) { 29 | video[frame] = (int ***)malloc(CHANNELS * sizeof(int **)); 30 | if (video[frame] == NULL) { 31 | fprintf(stderr, "Memory allocation failed\n"); 32 | return 1; 33 | } 34 | for (int channel = 0; channel < CHANNELS; channel++) { 35 | video[frame][channel] = (int **)malloc(SIZE * sizeof(int *)); 36 | if (video[frame][channel] == NULL) { 37 | fprintf(stderr, "Memory allocation failed\n"); 38 | return 1; 39 | } 40 | for (int i = 0; i < SIZE; i++) { 41 | video[frame][channel][i] = (int *)malloc(SIZE * sizeof(int)); 42 | if (video[frame][channel][i] == NULL) { 43 | fprintf(stderr, "Memory allocation failed\n"); 44 | return 1; 45 | } 46 | } 47 | } 48 | } 49 | srand(time(NULL)); 50 | for (int frame = 0; frame < FRAMES; frame++) { 51 | for (int channel = 0; channel < CHANNELS; channel++) { 52 | for (int i = 0; i < SIZE; i++) { 53 | for (int j = 0; j < SIZE; j++) { 54 | video[frame][channel][i][j] = rand() % 256; 55 | //i have allocated random values here, you can allocate the actuall values here by using FFMEG 56 | } 57 | } 58 | } 59 | } 60 | print_video_data(video); 61 | for (int frame = 0; frame < FRAMES; frame++) { 62 | for (int channel = 0; channel < CHANNELS; channel++) { 63 | for (int i = 0; i < SIZE; i++) { 64 | free(video[frame][channel][i]); 65 | } 66 | free(video[frame][channel]); 67 | } 68 | free(video[frame]); 69 | } 70 | free(video); 71 | return 0; 72 | } -------------------------------------------------------------------------------- /Random/myls.c: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | #include 4 | #include 5 | #include 6 | 7 | 8 | // struct dirent { 9 | // ino_t d_ino; /* inode number */ 10 | // off_t d_off; /* offset to the next dirent */ 11 | // unsigned short d_reclen; /* length of this record */ 12 | // unsigned char d_type; /* type of file; not supported 13 | // by all file system types */ 14 | // char d_name[256]; /* filename */ 15 | // }; 16 | 17 | void find_dirs(const char* dir_name,int show_f,int show_h){ 18 | DIR* dir_stream; 19 | struct dirent* entries; 20 | dir_stream=opendir(dir_name); 21 | if(dir_stream==NULL){ 22 | printf("Error : Can't open file, as it doesn't exist."); 23 | return; 24 | } 25 | while((entries=readdir(dir_stream))!=NULL){ 26 | if(!show_h && entries->d_name[0]=='.'){ 27 | continue; 28 | } 29 | if(show_f && entries->d_type==4){ 30 | continue; 31 | } 32 | // printf("%d\n",entries->d_type); 33 | printf("%s\n",entries->d_name); 34 | } 35 | if(closedir(dir_stream)==-1){ 36 | perror("Can't close directory"); 37 | } 38 | } 39 | 40 | int main(int argc, char **argv) { 41 | char* dir_name=""; 42 | int show_f=0; 43 | int show_h=0; 44 | for(int i=1;i 2 | #include 3 | #define STB_IMAGE_IMPLEMENTATION 4 | #include "stb_image.h" 5 | #define STB_IMAGE_WRITE_IMPLEMENTATION 6 | #include "stb_image_write.h" 7 | int main() 8 | { 9 | int width, height, channels; 10 | char input_path[100], output_path[100]; 11 | 12 | printf("Enter the path of the input RGB image: "); 13 | scanf("%99s", input_path); 14 | printf("Enter the path for the output grayscale image: "); 15 | scanf("%99s", output_path); 16 | 17 | unsigned char *img = stbi_load(input_path, &width, &height, &channels, 0); 18 | if (img == NULL) 19 | { 20 | printf("Error in loading the image\n"); 21 | exit(1); 22 | } 23 | 24 | printf("Loaded image with a width of %dpx, a height of %dpx and %d channels\n", width, height, channels); 25 | int gray_channels = 1; 26 | size_t img_size = width * height * gray_channels; 27 | unsigned char *gray_img = malloc(img_size); 28 | 29 | if (gray_img == NULL) 30 | { 31 | printf("Unable to allocate memory for the grayscale image.\n"); 32 | exit(1); 33 | } 34 | 35 | for (unsigned char *p = img, *pg = gray_img; p != img + width * height * channels; p += channels, pg += gray_channels) 36 | { 37 | *pg = (uint8_t)((*p * 0.299) + (*(p + 1) * 0.587) + (*(p + 2) * 0.114)); 38 | } 39 | 40 | stbi_write_png(output_path, width, height, gray_channels, gray_img, width * gray_channels); 41 | 42 | printf("Grayscale image saved to %s\n", output_path); 43 | stbi_image_free(img); 44 | free(gray_img); 45 | return 0; 46 | } -------------------------------------------------------------------------------- /Random/stb_image_write.h: -------------------------------------------------------------------------------- 1 | /* stb_image_write - v1.16 - public domain - http://nothings.org/stb 2 | writes out PNG/BMP/TGA/JPEG/HDR images to C stdio - Sean Barrett 2010-2015 3 | no warranty implied; use at your own risk 4 | 5 | Before #including, 6 | 7 | #define STB_IMAGE_WRITE_IMPLEMENTATION 8 | 9 | in the file that you want to have the implementation. 10 | 11 | Will probably not work correctly with strict-aliasing optimizations. 12 | 13 | ABOUT: 14 | 15 | This header file is a library for writing images to C stdio or a callback. 16 | 17 | The PNG output is not optimal; it is 20-50% larger than the file 18 | written by a decent optimizing implementation; though providing a custom 19 | zlib compress function (see STBIW_ZLIB_COMPRESS) can mitigate that. 20 | This library is designed for source code compactness and simplicity, 21 | not optimal image file size or run-time performance. 22 | 23 | BUILDING: 24 | 25 | You can #define STBIW_ASSERT(x) before the #include to avoid using assert.h. 26 | You can #define STBIW_MALLOC(), STBIW_REALLOC(), and STBIW_FREE() to replace 27 | malloc,realloc,free. 28 | You can #define STBIW_MEMMOVE() to replace memmove() 29 | You can #define STBIW_ZLIB_COMPRESS to use a custom zlib-style compress function 30 | for PNG compression (instead of the builtin one), it must have the following signature: 31 | unsigned char * my_compress(unsigned char *data, int data_len, int *out_len, int quality); 32 | The returned data will be freed with STBIW_FREE() (free() by default), 33 | so it must be heap allocated with STBIW_MALLOC() (malloc() by default), 34 | 35 | UNICODE: 36 | 37 | If compiling for Windows and you wish to use Unicode filenames, compile 38 | with 39 | #define STBIW_WINDOWS_UTF8 40 | and pass utf8-encoded filenames. Call stbiw_convert_wchar_to_utf8 to convert 41 | Windows wchar_t filenames to utf8. 42 | 43 | USAGE: 44 | 45 | There are five functions, one for each image file format: 46 | 47 | int stbi_write_png(char const *filename, int w, int h, int comp, const void *data, int stride_in_bytes); 48 | int stbi_write_bmp(char const *filename, int w, int h, int comp, const void *data); 49 | int stbi_write_tga(char const *filename, int w, int h, int comp, const void *data); 50 | int stbi_write_jpg(char const *filename, int w, int h, int comp, const void *data, int quality); 51 | int stbi_write_hdr(char const *filename, int w, int h, int comp, const float *data); 52 | 53 | void stbi_flip_vertically_on_write(int flag); // flag is non-zero to flip data vertically 54 | 55 | There are also five equivalent functions that use an arbitrary write function. You are 56 | expected to open/close your file-equivalent before and after calling these: 57 | 58 | int stbi_write_png_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data, int stride_in_bytes); 59 | int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 60 | int stbi_write_tga_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 61 | int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const float *data); 62 | int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality); 63 | 64 | where the callback is: 65 | void stbi_write_func(void *context, void *data, int size); 66 | 67 | You can configure it with these global variables: 68 | int stbi_write_tga_with_rle; // defaults to true; set to 0 to disable RLE 69 | int stbi_write_png_compression_level; // defaults to 8; set to higher for more compression 70 | int stbi_write_force_png_filter; // defaults to -1; set to 0..5 to force a filter mode 71 | 72 | 73 | You can define STBI_WRITE_NO_STDIO to disable the file variant of these 74 | functions, so the library will not use stdio.h at all. However, this will 75 | also disable HDR writing, because it requires stdio for formatted output. 76 | 77 | Each function returns 0 on failure and non-0 on success. 78 | 79 | The functions create an image file defined by the parameters. The image 80 | is a rectangle of pixels stored from left-to-right, top-to-bottom. 81 | Each pixel contains 'comp' channels of data stored interleaved with 8-bits 82 | per channel, in the following order: 1=Y, 2=YA, 3=RGB, 4=RGBA. (Y is 83 | monochrome color.) The rectangle is 'w' pixels wide and 'h' pixels tall. 84 | The *data pointer points to the first byte of the top-left-most pixel. 85 | For PNG, "stride_in_bytes" is the distance in bytes from the first byte of 86 | a row of pixels to the first byte of the next row of pixels. 87 | 88 | PNG creates output files with the same number of components as the input. 89 | The BMP format expands Y to RGB in the file format and does not 90 | output alpha. 91 | 92 | PNG supports writing rectangles of data even when the bytes storing rows of 93 | data are not consecutive in memory (e.g. sub-rectangles of a larger image), 94 | by supplying the stride between the beginning of adjacent rows. The other 95 | formats do not. (Thus you cannot write a native-format BMP through the BMP 96 | writer, both because it is in BGR order and because it may have padding 97 | at the end of the line.) 98 | 99 | PNG allows you to set the deflate compression level by setting the global 100 | variable 'stbi_write_png_compression_level' (it defaults to 8). 101 | 102 | HDR expects linear float data. Since the format is always 32-bit rgb(e) 103 | data, alpha (if provided) is discarded, and for monochrome data it is 104 | replicated across all three channels. 105 | 106 | TGA supports RLE or non-RLE compressed data. To use non-RLE-compressed 107 | data, set the global variable 'stbi_write_tga_with_rle' to 0. 108 | 109 | JPEG does ignore alpha channels in input data; quality is between 1 and 100. 110 | Higher quality looks better but results in a bigger image. 111 | JPEG baseline (no JPEG progressive). 112 | 113 | CREDITS: 114 | 115 | 116 | Sean Barrett - PNG/BMP/TGA 117 | Baldur Karlsson - HDR 118 | Jean-Sebastien Guay - TGA monochrome 119 | Tim Kelsey - misc enhancements 120 | Alan Hickman - TGA RLE 121 | Emmanuel Julien - initial file IO callback implementation 122 | Jon Olick - original jo_jpeg.cpp code 123 | Daniel Gibson - integrate JPEG, allow external zlib 124 | Aarni Koskela - allow choosing PNG filter 125 | 126 | bugfixes: 127 | github:Chribba 128 | Guillaume Chereau 129 | github:jry2 130 | github:romigrou 131 | Sergio Gonzalez 132 | Jonas Karlsson 133 | Filip Wasil 134 | Thatcher Ulrich 135 | github:poppolopoppo 136 | Patrick Boettcher 137 | github:xeekworx 138 | Cap Petschulat 139 | Simon Rodriguez 140 | Ivan Tikhonov 141 | github:ignotion 142 | Adam Schackart 143 | Andrew Kensler 144 | 145 | LICENSE 146 | 147 | See end of file for license information. 148 | 149 | */ 150 | 151 | #ifndef INCLUDE_STB_IMAGE_WRITE_H 152 | #define INCLUDE_STB_IMAGE_WRITE_H 153 | 154 | #include 155 | 156 | // if STB_IMAGE_WRITE_STATIC causes problems, try defining STBIWDEF to 'inline' or 'static inline' 157 | #ifndef STBIWDEF 158 | #ifdef STB_IMAGE_WRITE_STATIC 159 | #define STBIWDEF static 160 | #else 161 | #ifdef __cplusplus 162 | #define STBIWDEF extern "C" 163 | #else 164 | #define STBIWDEF extern 165 | #endif 166 | #endif 167 | #endif 168 | 169 | #ifndef STB_IMAGE_WRITE_STATIC // C++ forbids static forward declarations 170 | STBIWDEF int stbi_write_tga_with_rle; 171 | STBIWDEF int stbi_write_png_compression_level; 172 | STBIWDEF int stbi_write_force_png_filter; 173 | #endif 174 | 175 | #ifndef STBI_WRITE_NO_STDIO 176 | STBIWDEF int stbi_write_png(char const *filename, int w, int h, int comp, const void *data, int stride_in_bytes); 177 | STBIWDEF int stbi_write_bmp(char const *filename, int w, int h, int comp, const void *data); 178 | STBIWDEF int stbi_write_tga(char const *filename, int w, int h, int comp, const void *data); 179 | STBIWDEF int stbi_write_hdr(char const *filename, int w, int h, int comp, const float *data); 180 | STBIWDEF int stbi_write_jpg(char const *filename, int x, int y, int comp, const void *data, int quality); 181 | 182 | #ifdef STBIW_WINDOWS_UTF8 183 | STBIWDEF int stbiw_convert_wchar_to_utf8(char *buffer, size_t bufferlen, const wchar_t* input); 184 | #endif 185 | #endif 186 | 187 | typedef void stbi_write_func(void *context, void *data, int size); 188 | 189 | STBIWDEF int stbi_write_png_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data, int stride_in_bytes); 190 | STBIWDEF int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 191 | STBIWDEF int stbi_write_tga_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const void *data); 192 | STBIWDEF int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int w, int h, int comp, const float *data); 193 | STBIWDEF int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality); 194 | 195 | STBIWDEF void stbi_flip_vertically_on_write(int flip_boolean); 196 | 197 | #endif//INCLUDE_STB_IMAGE_WRITE_H 198 | 199 | #ifdef STB_IMAGE_WRITE_IMPLEMENTATION 200 | 201 | #ifdef _WIN32 202 | #ifndef _CRT_SECURE_NO_WARNINGS 203 | #define _CRT_SECURE_NO_WARNINGS 204 | #endif 205 | #ifndef _CRT_NONSTDC_NO_DEPRECATE 206 | #define _CRT_NONSTDC_NO_DEPRECATE 207 | #endif 208 | #endif 209 | 210 | #ifndef STBI_WRITE_NO_STDIO 211 | #include 212 | #endif // STBI_WRITE_NO_STDIO 213 | 214 | #include 215 | #include 216 | #include 217 | #include 218 | 219 | #if defined(STBIW_MALLOC) && defined(STBIW_FREE) && (defined(STBIW_REALLOC) || defined(STBIW_REALLOC_SIZED)) 220 | // ok 221 | #elif !defined(STBIW_MALLOC) && !defined(STBIW_FREE) && !defined(STBIW_REALLOC) && !defined(STBIW_REALLOC_SIZED) 222 | // ok 223 | #else 224 | #error "Must define all or none of STBIW_MALLOC, STBIW_FREE, and STBIW_REALLOC (or STBIW_REALLOC_SIZED)." 225 | #endif 226 | 227 | #ifndef STBIW_MALLOC 228 | #define STBIW_MALLOC(sz) malloc(sz) 229 | #define STBIW_REALLOC(p,newsz) realloc(p,newsz) 230 | #define STBIW_FREE(p) free(p) 231 | #endif 232 | 233 | #ifndef STBIW_REALLOC_SIZED 234 | #define STBIW_REALLOC_SIZED(p,oldsz,newsz) STBIW_REALLOC(p,newsz) 235 | #endif 236 | 237 | 238 | #ifndef STBIW_MEMMOVE 239 | #define STBIW_MEMMOVE(a,b,sz) memmove(a,b,sz) 240 | #endif 241 | 242 | 243 | #ifndef STBIW_ASSERT 244 | #include 245 | #define STBIW_ASSERT(x) assert(x) 246 | #endif 247 | 248 | #define STBIW_UCHAR(x) (unsigned char) ((x) & 0xff) 249 | 250 | #ifdef STB_IMAGE_WRITE_STATIC 251 | static int stbi_write_png_compression_level = 8; 252 | static int stbi_write_tga_with_rle = 1; 253 | static int stbi_write_force_png_filter = -1; 254 | #else 255 | int stbi_write_png_compression_level = 8; 256 | int stbi_write_tga_with_rle = 1; 257 | int stbi_write_force_png_filter = -1; 258 | #endif 259 | 260 | static int stbi__flip_vertically_on_write = 0; 261 | 262 | STBIWDEF void stbi_flip_vertically_on_write(int flag) 263 | { 264 | stbi__flip_vertically_on_write = flag; 265 | } 266 | 267 | typedef struct 268 | { 269 | stbi_write_func *func; 270 | void *context; 271 | unsigned char buffer[64]; 272 | int buf_used; 273 | } stbi__write_context; 274 | 275 | // initialize a callback-based context 276 | static void stbi__start_write_callbacks(stbi__write_context *s, stbi_write_func *c, void *context) 277 | { 278 | s->func = c; 279 | s->context = context; 280 | } 281 | 282 | #ifndef STBI_WRITE_NO_STDIO 283 | 284 | static void stbi__stdio_write(void *context, void *data, int size) 285 | { 286 | fwrite(data,1,size,(FILE*) context); 287 | } 288 | 289 | #if defined(_WIN32) && defined(STBIW_WINDOWS_UTF8) 290 | #ifdef __cplusplus 291 | #define STBIW_EXTERN extern "C" 292 | #else 293 | #define STBIW_EXTERN extern 294 | #endif 295 | STBIW_EXTERN __declspec(dllimport) int __stdcall MultiByteToWideChar(unsigned int cp, unsigned long flags, const char *str, int cbmb, wchar_t *widestr, int cchwide); 296 | STBIW_EXTERN __declspec(dllimport) int __stdcall WideCharToMultiByte(unsigned int cp, unsigned long flags, const wchar_t *widestr, int cchwide, char *str, int cbmb, const char *defchar, int *used_default); 297 | 298 | STBIWDEF int stbiw_convert_wchar_to_utf8(char *buffer, size_t bufferlen, const wchar_t* input) 299 | { 300 | return WideCharToMultiByte(65001 /* UTF8 */, 0, input, -1, buffer, (int) bufferlen, NULL, NULL); 301 | } 302 | #endif 303 | 304 | static FILE *stbiw__fopen(char const *filename, char const *mode) 305 | { 306 | FILE *f; 307 | #if defined(_WIN32) && defined(STBIW_WINDOWS_UTF8) 308 | wchar_t wMode[64]; 309 | wchar_t wFilename[1024]; 310 | if (0 == MultiByteToWideChar(65001 /* UTF8 */, 0, filename, -1, wFilename, sizeof(wFilename)/sizeof(*wFilename))) 311 | return 0; 312 | 313 | if (0 == MultiByteToWideChar(65001 /* UTF8 */, 0, mode, -1, wMode, sizeof(wMode)/sizeof(*wMode))) 314 | return 0; 315 | 316 | #if defined(_MSC_VER) && _MSC_VER >= 1400 317 | if (0 != _wfopen_s(&f, wFilename, wMode)) 318 | f = 0; 319 | #else 320 | f = _wfopen(wFilename, wMode); 321 | #endif 322 | 323 | #elif defined(_MSC_VER) && _MSC_VER >= 1400 324 | if (0 != fopen_s(&f, filename, mode)) 325 | f=0; 326 | #else 327 | f = fopen(filename, mode); 328 | #endif 329 | return f; 330 | } 331 | 332 | static int stbi__start_write_file(stbi__write_context *s, const char *filename) 333 | { 334 | FILE *f = stbiw__fopen(filename, "wb"); 335 | stbi__start_write_callbacks(s, stbi__stdio_write, (void *) f); 336 | return f != NULL; 337 | } 338 | 339 | static void stbi__end_write_file(stbi__write_context *s) 340 | { 341 | fclose((FILE *)s->context); 342 | } 343 | 344 | #endif // !STBI_WRITE_NO_STDIO 345 | 346 | typedef unsigned int stbiw_uint32; 347 | typedef int stb_image_write_test[sizeof(stbiw_uint32)==4 ? 1 : -1]; 348 | 349 | static void stbiw__writefv(stbi__write_context *s, const char *fmt, va_list v) 350 | { 351 | while (*fmt) { 352 | switch (*fmt++) { 353 | case ' ': break; 354 | case '1': { unsigned char x = STBIW_UCHAR(va_arg(v, int)); 355 | s->func(s->context,&x,1); 356 | break; } 357 | case '2': { int x = va_arg(v,int); 358 | unsigned char b[2]; 359 | b[0] = STBIW_UCHAR(x); 360 | b[1] = STBIW_UCHAR(x>>8); 361 | s->func(s->context,b,2); 362 | break; } 363 | case '4': { stbiw_uint32 x = va_arg(v,int); 364 | unsigned char b[4]; 365 | b[0]=STBIW_UCHAR(x); 366 | b[1]=STBIW_UCHAR(x>>8); 367 | b[2]=STBIW_UCHAR(x>>16); 368 | b[3]=STBIW_UCHAR(x>>24); 369 | s->func(s->context,b,4); 370 | break; } 371 | default: 372 | STBIW_ASSERT(0); 373 | return; 374 | } 375 | } 376 | } 377 | 378 | static void stbiw__writef(stbi__write_context *s, const char *fmt, ...) 379 | { 380 | va_list v; 381 | va_start(v, fmt); 382 | stbiw__writefv(s, fmt, v); 383 | va_end(v); 384 | } 385 | 386 | static void stbiw__write_flush(stbi__write_context *s) 387 | { 388 | if (s->buf_used) { 389 | s->func(s->context, &s->buffer, s->buf_used); 390 | s->buf_used = 0; 391 | } 392 | } 393 | 394 | static void stbiw__putc(stbi__write_context *s, unsigned char c) 395 | { 396 | s->func(s->context, &c, 1); 397 | } 398 | 399 | static void stbiw__write1(stbi__write_context *s, unsigned char a) 400 | { 401 | if ((size_t)s->buf_used + 1 > sizeof(s->buffer)) 402 | stbiw__write_flush(s); 403 | s->buffer[s->buf_used++] = a; 404 | } 405 | 406 | static void stbiw__write3(stbi__write_context *s, unsigned char a, unsigned char b, unsigned char c) 407 | { 408 | int n; 409 | if ((size_t)s->buf_used + 3 > sizeof(s->buffer)) 410 | stbiw__write_flush(s); 411 | n = s->buf_used; 412 | s->buf_used = n+3; 413 | s->buffer[n+0] = a; 414 | s->buffer[n+1] = b; 415 | s->buffer[n+2] = c; 416 | } 417 | 418 | static void stbiw__write_pixel(stbi__write_context *s, int rgb_dir, int comp, int write_alpha, int expand_mono, unsigned char *d) 419 | { 420 | unsigned char bg[3] = { 255, 0, 255}, px[3]; 421 | int k; 422 | 423 | if (write_alpha < 0) 424 | stbiw__write1(s, d[comp - 1]); 425 | 426 | switch (comp) { 427 | case 2: // 2 pixels = mono + alpha, alpha is written separately, so same as 1-channel case 428 | case 1: 429 | if (expand_mono) 430 | stbiw__write3(s, d[0], d[0], d[0]); // monochrome bmp 431 | else 432 | stbiw__write1(s, d[0]); // monochrome TGA 433 | break; 434 | case 4: 435 | if (!write_alpha) { 436 | // composite against pink background 437 | for (k = 0; k < 3; ++k) 438 | px[k] = bg[k] + ((d[k] - bg[k]) * d[3]) / 255; 439 | stbiw__write3(s, px[1 - rgb_dir], px[1], px[1 + rgb_dir]); 440 | break; 441 | } 442 | /* FALLTHROUGH */ 443 | case 3: 444 | stbiw__write3(s, d[1 - rgb_dir], d[1], d[1 + rgb_dir]); 445 | break; 446 | } 447 | if (write_alpha > 0) 448 | stbiw__write1(s, d[comp - 1]); 449 | } 450 | 451 | static void stbiw__write_pixels(stbi__write_context *s, int rgb_dir, int vdir, int x, int y, int comp, void *data, int write_alpha, int scanline_pad, int expand_mono) 452 | { 453 | stbiw_uint32 zero = 0; 454 | int i,j, j_end; 455 | 456 | if (y <= 0) 457 | return; 458 | 459 | if (stbi__flip_vertically_on_write) 460 | vdir *= -1; 461 | 462 | if (vdir < 0) { 463 | j_end = -1; j = y-1; 464 | } else { 465 | j_end = y; j = 0; 466 | } 467 | 468 | for (; j != j_end; j += vdir) { 469 | for (i=0; i < x; ++i) { 470 | unsigned char *d = (unsigned char *) data + (j*x+i)*comp; 471 | stbiw__write_pixel(s, rgb_dir, comp, write_alpha, expand_mono, d); 472 | } 473 | stbiw__write_flush(s); 474 | s->func(s->context, &zero, scanline_pad); 475 | } 476 | } 477 | 478 | static int stbiw__outfile(stbi__write_context *s, int rgb_dir, int vdir, int x, int y, int comp, int expand_mono, void *data, int alpha, int pad, const char *fmt, ...) 479 | { 480 | if (y < 0 || x < 0) { 481 | return 0; 482 | } else { 483 | va_list v; 484 | va_start(v, fmt); 485 | stbiw__writefv(s, fmt, v); 486 | va_end(v); 487 | stbiw__write_pixels(s,rgb_dir,vdir,x,y,comp,data,alpha,pad, expand_mono); 488 | return 1; 489 | } 490 | } 491 | 492 | static int stbi_write_bmp_core(stbi__write_context *s, int x, int y, int comp, const void *data) 493 | { 494 | if (comp != 4) { 495 | // write RGB bitmap 496 | int pad = (-x*3) & 3; 497 | return stbiw__outfile(s,-1,-1,x,y,comp,1,(void *) data,0,pad, 498 | "11 4 22 4" "4 44 22 444444", 499 | 'B', 'M', 14+40+(x*3+pad)*y, 0,0, 14+40, // file header 500 | 40, x,y, 1,24, 0,0,0,0,0,0); // bitmap header 501 | } else { 502 | // RGBA bitmaps need a v4 header 503 | // use BI_BITFIELDS mode with 32bpp and alpha mask 504 | // (straight BI_RGB with alpha mask doesn't work in most readers) 505 | return stbiw__outfile(s,-1,-1,x,y,comp,1,(void *)data,1,0, 506 | "11 4 22 4" "4 44 22 444444 4444 4 444 444 444 444", 507 | 'B', 'M', 14+108+x*y*4, 0, 0, 14+108, // file header 508 | 108, x,y, 1,32, 3,0,0,0,0,0, 0xff0000,0xff00,0xff,0xff000000u, 0, 0,0,0, 0,0,0, 0,0,0, 0,0,0); // bitmap V4 header 509 | } 510 | } 511 | 512 | STBIWDEF int stbi_write_bmp_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data) 513 | { 514 | stbi__write_context s = { 0 }; 515 | stbi__start_write_callbacks(&s, func, context); 516 | return stbi_write_bmp_core(&s, x, y, comp, data); 517 | } 518 | 519 | #ifndef STBI_WRITE_NO_STDIO 520 | STBIWDEF int stbi_write_bmp(char const *filename, int x, int y, int comp, const void *data) 521 | { 522 | stbi__write_context s = { 0 }; 523 | if (stbi__start_write_file(&s,filename)) { 524 | int r = stbi_write_bmp_core(&s, x, y, comp, data); 525 | stbi__end_write_file(&s); 526 | return r; 527 | } else 528 | return 0; 529 | } 530 | #endif //!STBI_WRITE_NO_STDIO 531 | 532 | static int stbi_write_tga_core(stbi__write_context *s, int x, int y, int comp, void *data) 533 | { 534 | int has_alpha = (comp == 2 || comp == 4); 535 | int colorbytes = has_alpha ? comp-1 : comp; 536 | int format = colorbytes < 2 ? 3 : 2; // 3 color channels (RGB/RGBA) = 2, 1 color channel (Y/YA) = 3 537 | 538 | if (y < 0 || x < 0) 539 | return 0; 540 | 541 | if (!stbi_write_tga_with_rle) { 542 | return stbiw__outfile(s, -1, -1, x, y, comp, 0, (void *) data, has_alpha, 0, 543 | "111 221 2222 11", 0, 0, format, 0, 0, 0, 0, 0, x, y, (colorbytes + has_alpha) * 8, has_alpha * 8); 544 | } else { 545 | int i,j,k; 546 | int jend, jdir; 547 | 548 | stbiw__writef(s, "111 221 2222 11", 0,0,format+8, 0,0,0, 0,0,x,y, (colorbytes + has_alpha) * 8, has_alpha * 8); 549 | 550 | if (stbi__flip_vertically_on_write) { 551 | j = 0; 552 | jend = y; 553 | jdir = 1; 554 | } else { 555 | j = y-1; 556 | jend = -1; 557 | jdir = -1; 558 | } 559 | for (; j != jend; j += jdir) { 560 | unsigned char *row = (unsigned char *) data + j * x * comp; 561 | int len; 562 | 563 | for (i = 0; i < x; i += len) { 564 | unsigned char *begin = row + i * comp; 565 | int diff = 1; 566 | len = 1; 567 | 568 | if (i < x - 1) { 569 | ++len; 570 | diff = memcmp(begin, row + (i + 1) * comp, comp); 571 | if (diff) { 572 | const unsigned char *prev = begin; 573 | for (k = i + 2; k < x && len < 128; ++k) { 574 | if (memcmp(prev, row + k * comp, comp)) { 575 | prev += comp; 576 | ++len; 577 | } else { 578 | --len; 579 | break; 580 | } 581 | } 582 | } else { 583 | for (k = i + 2; k < x && len < 128; ++k) { 584 | if (!memcmp(begin, row + k * comp, comp)) { 585 | ++len; 586 | } else { 587 | break; 588 | } 589 | } 590 | } 591 | } 592 | 593 | if (diff) { 594 | unsigned char header = STBIW_UCHAR(len - 1); 595 | stbiw__write1(s, header); 596 | for (k = 0; k < len; ++k) { 597 | stbiw__write_pixel(s, -1, comp, has_alpha, 0, begin + k * comp); 598 | } 599 | } else { 600 | unsigned char header = STBIW_UCHAR(len - 129); 601 | stbiw__write1(s, header); 602 | stbiw__write_pixel(s, -1, comp, has_alpha, 0, begin); 603 | } 604 | } 605 | } 606 | stbiw__write_flush(s); 607 | } 608 | return 1; 609 | } 610 | 611 | STBIWDEF int stbi_write_tga_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data) 612 | { 613 | stbi__write_context s = { 0 }; 614 | stbi__start_write_callbacks(&s, func, context); 615 | return stbi_write_tga_core(&s, x, y, comp, (void *) data); 616 | } 617 | 618 | #ifndef STBI_WRITE_NO_STDIO 619 | STBIWDEF int stbi_write_tga(char const *filename, int x, int y, int comp, const void *data) 620 | { 621 | stbi__write_context s = { 0 }; 622 | if (stbi__start_write_file(&s,filename)) { 623 | int r = stbi_write_tga_core(&s, x, y, comp, (void *) data); 624 | stbi__end_write_file(&s); 625 | return r; 626 | } else 627 | return 0; 628 | } 629 | #endif 630 | 631 | // ************************************************************************************************* 632 | // Radiance RGBE HDR writer 633 | // by Baldur Karlsson 634 | 635 | #define stbiw__max(a, b) ((a) > (b) ? (a) : (b)) 636 | 637 | #ifndef STBI_WRITE_NO_STDIO 638 | 639 | static void stbiw__linear_to_rgbe(unsigned char *rgbe, float *linear) 640 | { 641 | int exponent; 642 | float maxcomp = stbiw__max(linear[0], stbiw__max(linear[1], linear[2])); 643 | 644 | if (maxcomp < 1e-32f) { 645 | rgbe[0] = rgbe[1] = rgbe[2] = rgbe[3] = 0; 646 | } else { 647 | float normalize = (float) frexp(maxcomp, &exponent) * 256.0f/maxcomp; 648 | 649 | rgbe[0] = (unsigned char)(linear[0] * normalize); 650 | rgbe[1] = (unsigned char)(linear[1] * normalize); 651 | rgbe[2] = (unsigned char)(linear[2] * normalize); 652 | rgbe[3] = (unsigned char)(exponent + 128); 653 | } 654 | } 655 | 656 | static void stbiw__write_run_data(stbi__write_context *s, int length, unsigned char databyte) 657 | { 658 | unsigned char lengthbyte = STBIW_UCHAR(length+128); 659 | STBIW_ASSERT(length+128 <= 255); 660 | s->func(s->context, &lengthbyte, 1); 661 | s->func(s->context, &databyte, 1); 662 | } 663 | 664 | static void stbiw__write_dump_data(stbi__write_context *s, int length, unsigned char *data) 665 | { 666 | unsigned char lengthbyte = STBIW_UCHAR(length); 667 | STBIW_ASSERT(length <= 128); // inconsistent with spec but consistent with official code 668 | s->func(s->context, &lengthbyte, 1); 669 | s->func(s->context, data, length); 670 | } 671 | 672 | static void stbiw__write_hdr_scanline(stbi__write_context *s, int width, int ncomp, unsigned char *scratch, float *scanline) 673 | { 674 | unsigned char scanlineheader[4] = { 2, 2, 0, 0 }; 675 | unsigned char rgbe[4]; 676 | float linear[3]; 677 | int x; 678 | 679 | scanlineheader[2] = (width&0xff00)>>8; 680 | scanlineheader[3] = (width&0x00ff); 681 | 682 | /* skip RLE for images too small or large */ 683 | if (width < 8 || width >= 32768) { 684 | for (x=0; x < width; x++) { 685 | switch (ncomp) { 686 | case 4: /* fallthrough */ 687 | case 3: linear[2] = scanline[x*ncomp + 2]; 688 | linear[1] = scanline[x*ncomp + 1]; 689 | linear[0] = scanline[x*ncomp + 0]; 690 | break; 691 | default: 692 | linear[0] = linear[1] = linear[2] = scanline[x*ncomp + 0]; 693 | break; 694 | } 695 | stbiw__linear_to_rgbe(rgbe, linear); 696 | s->func(s->context, rgbe, 4); 697 | } 698 | } else { 699 | int c,r; 700 | /* encode into scratch buffer */ 701 | for (x=0; x < width; x++) { 702 | switch(ncomp) { 703 | case 4: /* fallthrough */ 704 | case 3: linear[2] = scanline[x*ncomp + 2]; 705 | linear[1] = scanline[x*ncomp + 1]; 706 | linear[0] = scanline[x*ncomp + 0]; 707 | break; 708 | default: 709 | linear[0] = linear[1] = linear[2] = scanline[x*ncomp + 0]; 710 | break; 711 | } 712 | stbiw__linear_to_rgbe(rgbe, linear); 713 | scratch[x + width*0] = rgbe[0]; 714 | scratch[x + width*1] = rgbe[1]; 715 | scratch[x + width*2] = rgbe[2]; 716 | scratch[x + width*3] = rgbe[3]; 717 | } 718 | 719 | s->func(s->context, scanlineheader, 4); 720 | 721 | /* RLE each component separately */ 722 | for (c=0; c < 4; c++) { 723 | unsigned char *comp = &scratch[width*c]; 724 | 725 | x = 0; 726 | while (x < width) { 727 | // find first run 728 | r = x; 729 | while (r+2 < width) { 730 | if (comp[r] == comp[r+1] && comp[r] == comp[r+2]) 731 | break; 732 | ++r; 733 | } 734 | if (r+2 >= width) 735 | r = width; 736 | // dump up to first run 737 | while (x < r) { 738 | int len = r-x; 739 | if (len > 128) len = 128; 740 | stbiw__write_dump_data(s, len, &comp[x]); 741 | x += len; 742 | } 743 | // if there's a run, output it 744 | if (r+2 < width) { // same test as what we break out of in search loop, so only true if we break'd 745 | // find next byte after run 746 | while (r < width && comp[r] == comp[x]) 747 | ++r; 748 | // output run up to r 749 | while (x < r) { 750 | int len = r-x; 751 | if (len > 127) len = 127; 752 | stbiw__write_run_data(s, len, comp[x]); 753 | x += len; 754 | } 755 | } 756 | } 757 | } 758 | } 759 | } 760 | 761 | static int stbi_write_hdr_core(stbi__write_context *s, int x, int y, int comp, float *data) 762 | { 763 | if (y <= 0 || x <= 0 || data == NULL) 764 | return 0; 765 | else { 766 | // Each component is stored separately. Allocate scratch space for full output scanline. 767 | unsigned char *scratch = (unsigned char *) STBIW_MALLOC(x*4); 768 | int i, len; 769 | char buffer[128]; 770 | char header[] = "#?RADIANCE\n# Written by stb_image_write.h\nFORMAT=32-bit_rle_rgbe\n"; 771 | s->func(s->context, header, sizeof(header)-1); 772 | 773 | #ifdef __STDC_LIB_EXT1__ 774 | len = sprintf_s(buffer, sizeof(buffer), "EXPOSURE= 1.0000000000000\n\n-Y %d +X %d\n", y, x); 775 | #else 776 | len = sprintf(buffer, "EXPOSURE= 1.0000000000000\n\n-Y %d +X %d\n", y, x); 777 | #endif 778 | s->func(s->context, buffer, len); 779 | 780 | for(i=0; i < y; i++) 781 | stbiw__write_hdr_scanline(s, x, comp, scratch, data + comp*x*(stbi__flip_vertically_on_write ? y-1-i : i)); 782 | STBIW_FREE(scratch); 783 | return 1; 784 | } 785 | } 786 | 787 | STBIWDEF int stbi_write_hdr_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const float *data) 788 | { 789 | stbi__write_context s = { 0 }; 790 | stbi__start_write_callbacks(&s, func, context); 791 | return stbi_write_hdr_core(&s, x, y, comp, (float *) data); 792 | } 793 | 794 | STBIWDEF int stbi_write_hdr(char const *filename, int x, int y, int comp, const float *data) 795 | { 796 | stbi__write_context s = { 0 }; 797 | if (stbi__start_write_file(&s,filename)) { 798 | int r = stbi_write_hdr_core(&s, x, y, comp, (float *) data); 799 | stbi__end_write_file(&s); 800 | return r; 801 | } else 802 | return 0; 803 | } 804 | #endif // STBI_WRITE_NO_STDIO 805 | 806 | 807 | ////////////////////////////////////////////////////////////////////////////// 808 | // 809 | // PNG writer 810 | // 811 | 812 | #ifndef STBIW_ZLIB_COMPRESS 813 | // stretchy buffer; stbiw__sbpush() == vector<>::push_back() -- stbiw__sbcount() == vector<>::size() 814 | #define stbiw__sbraw(a) ((int *) (void *) (a) - 2) 815 | #define stbiw__sbm(a) stbiw__sbraw(a)[0] 816 | #define stbiw__sbn(a) stbiw__sbraw(a)[1] 817 | 818 | #define stbiw__sbneedgrow(a,n) ((a)==0 || stbiw__sbn(a)+n >= stbiw__sbm(a)) 819 | #define stbiw__sbmaybegrow(a,n) (stbiw__sbneedgrow(a,(n)) ? stbiw__sbgrow(a,n) : 0) 820 | #define stbiw__sbgrow(a,n) stbiw__sbgrowf((void **) &(a), (n), sizeof(*(a))) 821 | 822 | #define stbiw__sbpush(a, v) (stbiw__sbmaybegrow(a,1), (a)[stbiw__sbn(a)++] = (v)) 823 | #define stbiw__sbcount(a) ((a) ? stbiw__sbn(a) : 0) 824 | #define stbiw__sbfree(a) ((a) ? STBIW_FREE(stbiw__sbraw(a)),0 : 0) 825 | 826 | static void *stbiw__sbgrowf(void **arr, int increment, int itemsize) 827 | { 828 | int m = *arr ? 2*stbiw__sbm(*arr)+increment : increment+1; 829 | void *p = STBIW_REALLOC_SIZED(*arr ? stbiw__sbraw(*arr) : 0, *arr ? (stbiw__sbm(*arr)*itemsize + sizeof(int)*2) : 0, itemsize * m + sizeof(int)*2); 830 | STBIW_ASSERT(p); 831 | if (p) { 832 | if (!*arr) ((int *) p)[1] = 0; 833 | *arr = (void *) ((int *) p + 2); 834 | stbiw__sbm(*arr) = m; 835 | } 836 | return *arr; 837 | } 838 | 839 | static unsigned char *stbiw__zlib_flushf(unsigned char *data, unsigned int *bitbuffer, int *bitcount) 840 | { 841 | while (*bitcount >= 8) { 842 | stbiw__sbpush(data, STBIW_UCHAR(*bitbuffer)); 843 | *bitbuffer >>= 8; 844 | *bitcount -= 8; 845 | } 846 | return data; 847 | } 848 | 849 | static int stbiw__zlib_bitrev(int code, int codebits) 850 | { 851 | int res=0; 852 | while (codebits--) { 853 | res = (res << 1) | (code & 1); 854 | code >>= 1; 855 | } 856 | return res; 857 | } 858 | 859 | static unsigned int stbiw__zlib_countm(unsigned char *a, unsigned char *b, int limit) 860 | { 861 | int i; 862 | for (i=0; i < limit && i < 258; ++i) 863 | if (a[i] != b[i]) break; 864 | return i; 865 | } 866 | 867 | static unsigned int stbiw__zhash(unsigned char *data) 868 | { 869 | stbiw_uint32 hash = data[0] + (data[1] << 8) + (data[2] << 16); 870 | hash ^= hash << 3; 871 | hash += hash >> 5; 872 | hash ^= hash << 4; 873 | hash += hash >> 17; 874 | hash ^= hash << 25; 875 | hash += hash >> 6; 876 | return hash; 877 | } 878 | 879 | #define stbiw__zlib_flush() (out = stbiw__zlib_flushf(out, &bitbuf, &bitcount)) 880 | #define stbiw__zlib_add(code,codebits) \ 881 | (bitbuf |= (code) << bitcount, bitcount += (codebits), stbiw__zlib_flush()) 882 | #define stbiw__zlib_huffa(b,c) stbiw__zlib_add(stbiw__zlib_bitrev(b,c),c) 883 | // default huffman tables 884 | #define stbiw__zlib_huff1(n) stbiw__zlib_huffa(0x30 + (n), 8) 885 | #define stbiw__zlib_huff2(n) stbiw__zlib_huffa(0x190 + (n)-144, 9) 886 | #define stbiw__zlib_huff3(n) stbiw__zlib_huffa(0 + (n)-256,7) 887 | #define stbiw__zlib_huff4(n) stbiw__zlib_huffa(0xc0 + (n)-280,8) 888 | #define stbiw__zlib_huff(n) ((n) <= 143 ? stbiw__zlib_huff1(n) : (n) <= 255 ? stbiw__zlib_huff2(n) : (n) <= 279 ? stbiw__zlib_huff3(n) : stbiw__zlib_huff4(n)) 889 | #define stbiw__zlib_huffb(n) ((n) <= 143 ? stbiw__zlib_huff1(n) : stbiw__zlib_huff2(n)) 890 | 891 | #define stbiw__ZHASH 16384 892 | 893 | #endif // STBIW_ZLIB_COMPRESS 894 | 895 | STBIWDEF unsigned char * stbi_zlib_compress(unsigned char *data, int data_len, int *out_len, int quality) 896 | { 897 | #ifdef STBIW_ZLIB_COMPRESS 898 | // user provided a zlib compress implementation, use that 899 | return STBIW_ZLIB_COMPRESS(data, data_len, out_len, quality); 900 | #else // use builtin 901 | static unsigned short lengthc[] = { 3,4,5,6,7,8,9,10,11,13,15,17,19,23,27,31,35,43,51,59,67,83,99,115,131,163,195,227,258, 259 }; 902 | static unsigned char lengtheb[]= { 0,0,0,0,0,0,0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0 }; 903 | static unsigned short distc[] = { 1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193,257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577, 32768 }; 904 | static unsigned char disteb[] = { 0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13 }; 905 | unsigned int bitbuf=0; 906 | int i,j, bitcount=0; 907 | unsigned char *out = NULL; 908 | unsigned char ***hash_table = (unsigned char***) STBIW_MALLOC(stbiw__ZHASH * sizeof(unsigned char**)); 909 | if (hash_table == NULL) 910 | return NULL; 911 | if (quality < 5) quality = 5; 912 | 913 | stbiw__sbpush(out, 0x78); // DEFLATE 32K window 914 | stbiw__sbpush(out, 0x5e); // FLEVEL = 1 915 | stbiw__zlib_add(1,1); // BFINAL = 1 916 | stbiw__zlib_add(1,2); // BTYPE = 1 -- fixed huffman 917 | 918 | for (i=0; i < stbiw__ZHASH; ++i) 919 | hash_table[i] = NULL; 920 | 921 | i=0; 922 | while (i < data_len-3) { 923 | // hash next 3 bytes of data to be compressed 924 | int h = stbiw__zhash(data+i)&(stbiw__ZHASH-1), best=3; 925 | unsigned char *bestloc = 0; 926 | unsigned char **hlist = hash_table[h]; 927 | int n = stbiw__sbcount(hlist); 928 | for (j=0; j < n; ++j) { 929 | if (hlist[j]-data > i-32768) { // if entry lies within window 930 | int d = stbiw__zlib_countm(hlist[j], data+i, data_len-i); 931 | if (d >= best) { best=d; bestloc=hlist[j]; } 932 | } 933 | } 934 | // when hash table entry is too long, delete half the entries 935 | if (hash_table[h] && stbiw__sbn(hash_table[h]) == 2*quality) { 936 | STBIW_MEMMOVE(hash_table[h], hash_table[h]+quality, sizeof(hash_table[h][0])*quality); 937 | stbiw__sbn(hash_table[h]) = quality; 938 | } 939 | stbiw__sbpush(hash_table[h],data+i); 940 | 941 | if (bestloc) { 942 | // "lazy matching" - check match at *next* byte, and if it's better, do cur byte as literal 943 | h = stbiw__zhash(data+i+1)&(stbiw__ZHASH-1); 944 | hlist = hash_table[h]; 945 | n = stbiw__sbcount(hlist); 946 | for (j=0; j < n; ++j) { 947 | if (hlist[j]-data > i-32767) { 948 | int e = stbiw__zlib_countm(hlist[j], data+i+1, data_len-i-1); 949 | if (e > best) { // if next match is better, bail on current match 950 | bestloc = NULL; 951 | break; 952 | } 953 | } 954 | } 955 | } 956 | 957 | if (bestloc) { 958 | int d = (int) (data+i - bestloc); // distance back 959 | STBIW_ASSERT(d <= 32767 && best <= 258); 960 | for (j=0; best > lengthc[j+1]-1; ++j); 961 | stbiw__zlib_huff(j+257); 962 | if (lengtheb[j]) stbiw__zlib_add(best - lengthc[j], lengtheb[j]); 963 | for (j=0; d > distc[j+1]-1; ++j); 964 | stbiw__zlib_add(stbiw__zlib_bitrev(j,5),5); 965 | if (disteb[j]) stbiw__zlib_add(d - distc[j], disteb[j]); 966 | i += best; 967 | } else { 968 | stbiw__zlib_huffb(data[i]); 969 | ++i; 970 | } 971 | } 972 | // write out final bytes 973 | for (;i < data_len; ++i) 974 | stbiw__zlib_huffb(data[i]); 975 | stbiw__zlib_huff(256); // end of block 976 | // pad with 0 bits to byte boundary 977 | while (bitcount) 978 | stbiw__zlib_add(0,1); 979 | 980 | for (i=0; i < stbiw__ZHASH; ++i) 981 | (void) stbiw__sbfree(hash_table[i]); 982 | STBIW_FREE(hash_table); 983 | 984 | // store uncompressed instead if compression was worse 985 | if (stbiw__sbn(out) > data_len + 2 + ((data_len+32766)/32767)*5) { 986 | stbiw__sbn(out) = 2; // truncate to DEFLATE 32K window and FLEVEL = 1 987 | for (j = 0; j < data_len;) { 988 | int blocklen = data_len - j; 989 | if (blocklen > 32767) blocklen = 32767; 990 | stbiw__sbpush(out, data_len - j == blocklen); // BFINAL = ?, BTYPE = 0 -- no compression 991 | stbiw__sbpush(out, STBIW_UCHAR(blocklen)); // LEN 992 | stbiw__sbpush(out, STBIW_UCHAR(blocklen >> 8)); 993 | stbiw__sbpush(out, STBIW_UCHAR(~blocklen)); // NLEN 994 | stbiw__sbpush(out, STBIW_UCHAR(~blocklen >> 8)); 995 | memcpy(out+stbiw__sbn(out), data+j, blocklen); 996 | stbiw__sbn(out) += blocklen; 997 | j += blocklen; 998 | } 999 | } 1000 | 1001 | { 1002 | // compute adler32 on input 1003 | unsigned int s1=1, s2=0; 1004 | int blocklen = (int) (data_len % 5552); 1005 | j=0; 1006 | while (j < data_len) { 1007 | for (i=0; i < blocklen; ++i) { s1 += data[j+i]; s2 += s1; } 1008 | s1 %= 65521; s2 %= 65521; 1009 | j += blocklen; 1010 | blocklen = 5552; 1011 | } 1012 | stbiw__sbpush(out, STBIW_UCHAR(s2 >> 8)); 1013 | stbiw__sbpush(out, STBIW_UCHAR(s2)); 1014 | stbiw__sbpush(out, STBIW_UCHAR(s1 >> 8)); 1015 | stbiw__sbpush(out, STBIW_UCHAR(s1)); 1016 | } 1017 | *out_len = stbiw__sbn(out); 1018 | // make returned pointer freeable 1019 | STBIW_MEMMOVE(stbiw__sbraw(out), out, *out_len); 1020 | return (unsigned char *) stbiw__sbraw(out); 1021 | #endif // STBIW_ZLIB_COMPRESS 1022 | } 1023 | 1024 | static unsigned int stbiw__crc32(unsigned char *buffer, int len) 1025 | { 1026 | #ifdef STBIW_CRC32 1027 | return STBIW_CRC32(buffer, len); 1028 | #else 1029 | static unsigned int crc_table[256] = 1030 | { 1031 | 0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3, 1032 | 0x0eDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 1033 | 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 1034 | 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 1035 | 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 1036 | 0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 1037 | 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F, 1038 | 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 1039 | 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433, 1040 | 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 1041 | 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 1042 | 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 1043 | 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 1044 | 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 1045 | 0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 1046 | 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD, 1047 | 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 1048 | 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 1049 | 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 1050 | 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 1051 | 0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B, 1052 | 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79, 1053 | 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 1054 | 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 1055 | 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 1056 | 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 1057 | 0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 1058 | 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45, 1059 | 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 1060 | 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 1061 | 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF, 1062 | 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D 1063 | }; 1064 | 1065 | unsigned int crc = ~0u; 1066 | int i; 1067 | for (i=0; i < len; ++i) 1068 | crc = (crc >> 8) ^ crc_table[buffer[i] ^ (crc & 0xff)]; 1069 | return ~crc; 1070 | #endif 1071 | } 1072 | 1073 | #define stbiw__wpng4(o,a,b,c,d) ((o)[0]=STBIW_UCHAR(a),(o)[1]=STBIW_UCHAR(b),(o)[2]=STBIW_UCHAR(c),(o)[3]=STBIW_UCHAR(d),(o)+=4) 1074 | #define stbiw__wp32(data,v) stbiw__wpng4(data, (v)>>24,(v)>>16,(v)>>8,(v)); 1075 | #define stbiw__wptag(data,s) stbiw__wpng4(data, s[0],s[1],s[2],s[3]) 1076 | 1077 | static void stbiw__wpcrc(unsigned char **data, int len) 1078 | { 1079 | unsigned int crc = stbiw__crc32(*data - len - 4, len+4); 1080 | stbiw__wp32(*data, crc); 1081 | } 1082 | 1083 | static unsigned char stbiw__paeth(int a, int b, int c) 1084 | { 1085 | int p = a + b - c, pa = abs(p-a), pb = abs(p-b), pc = abs(p-c); 1086 | if (pa <= pb && pa <= pc) return STBIW_UCHAR(a); 1087 | if (pb <= pc) return STBIW_UCHAR(b); 1088 | return STBIW_UCHAR(c); 1089 | } 1090 | 1091 | // @OPTIMIZE: provide an option that always forces left-predict or paeth predict 1092 | static void stbiw__encode_png_line(unsigned char *pixels, int stride_bytes, int width, int height, int y, int n, int filter_type, signed char *line_buffer) 1093 | { 1094 | static int mapping[] = { 0,1,2,3,4 }; 1095 | static int firstmap[] = { 0,1,0,5,6 }; 1096 | int *mymap = (y != 0) ? mapping : firstmap; 1097 | int i; 1098 | int type = mymap[filter_type]; 1099 | unsigned char *z = pixels + stride_bytes * (stbi__flip_vertically_on_write ? height-1-y : y); 1100 | int signed_stride = stbi__flip_vertically_on_write ? -stride_bytes : stride_bytes; 1101 | 1102 | if (type==0) { 1103 | memcpy(line_buffer, z, width*n); 1104 | return; 1105 | } 1106 | 1107 | // first loop isn't optimized since it's just one pixel 1108 | for (i = 0; i < n; ++i) { 1109 | switch (type) { 1110 | case 1: line_buffer[i] = z[i]; break; 1111 | case 2: line_buffer[i] = z[i] - z[i-signed_stride]; break; 1112 | case 3: line_buffer[i] = z[i] - (z[i-signed_stride]>>1); break; 1113 | case 4: line_buffer[i] = (signed char) (z[i] - stbiw__paeth(0,z[i-signed_stride],0)); break; 1114 | case 5: line_buffer[i] = z[i]; break; 1115 | case 6: line_buffer[i] = z[i]; break; 1116 | } 1117 | } 1118 | switch (type) { 1119 | case 1: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - z[i-n]; break; 1120 | case 2: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - z[i-signed_stride]; break; 1121 | case 3: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - ((z[i-n] + z[i-signed_stride])>>1); break; 1122 | case 4: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - stbiw__paeth(z[i-n], z[i-signed_stride], z[i-signed_stride-n]); break; 1123 | case 5: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - (z[i-n]>>1); break; 1124 | case 6: for (i=n; i < width*n; ++i) line_buffer[i] = z[i] - stbiw__paeth(z[i-n], 0,0); break; 1125 | } 1126 | } 1127 | 1128 | STBIWDEF unsigned char *stbi_write_png_to_mem(const unsigned char *pixels, int stride_bytes, int x, int y, int n, int *out_len) 1129 | { 1130 | int force_filter = stbi_write_force_png_filter; 1131 | int ctype[5] = { -1, 0, 4, 2, 6 }; 1132 | unsigned char sig[8] = { 137,80,78,71,13,10,26,10 }; 1133 | unsigned char *out,*o, *filt, *zlib; 1134 | signed char *line_buffer; 1135 | int j,zlen; 1136 | 1137 | if (stride_bytes == 0) 1138 | stride_bytes = x * n; 1139 | 1140 | if (force_filter >= 5) { 1141 | force_filter = -1; 1142 | } 1143 | 1144 | filt = (unsigned char *) STBIW_MALLOC((x*n+1) * y); if (!filt) return 0; 1145 | line_buffer = (signed char *) STBIW_MALLOC(x * n); if (!line_buffer) { STBIW_FREE(filt); return 0; } 1146 | for (j=0; j < y; ++j) { 1147 | int filter_type; 1148 | if (force_filter > -1) { 1149 | filter_type = force_filter; 1150 | stbiw__encode_png_line((unsigned char*)(pixels), stride_bytes, x, y, j, n, force_filter, line_buffer); 1151 | } else { // Estimate the best filter by running through all of them: 1152 | int best_filter = 0, best_filter_val = 0x7fffffff, est, i; 1153 | for (filter_type = 0; filter_type < 5; filter_type++) { 1154 | stbiw__encode_png_line((unsigned char*)(pixels), stride_bytes, x, y, j, n, filter_type, line_buffer); 1155 | 1156 | // Estimate the entropy of the line using this filter; the less, the better. 1157 | est = 0; 1158 | for (i = 0; i < x*n; ++i) { 1159 | est += abs((signed char) line_buffer[i]); 1160 | } 1161 | if (est < best_filter_val) { 1162 | best_filter_val = est; 1163 | best_filter = filter_type; 1164 | } 1165 | } 1166 | if (filter_type != best_filter) { // If the last iteration already got us the best filter, don't redo it 1167 | stbiw__encode_png_line((unsigned char*)(pixels), stride_bytes, x, y, j, n, best_filter, line_buffer); 1168 | filter_type = best_filter; 1169 | } 1170 | } 1171 | // when we get here, filter_type contains the filter type, and line_buffer contains the data 1172 | filt[j*(x*n+1)] = (unsigned char) filter_type; 1173 | STBIW_MEMMOVE(filt+j*(x*n+1)+1, line_buffer, x*n); 1174 | } 1175 | STBIW_FREE(line_buffer); 1176 | zlib = stbi_zlib_compress(filt, y*( x*n+1), &zlen, stbi_write_png_compression_level); 1177 | STBIW_FREE(filt); 1178 | if (!zlib) return 0; 1179 | 1180 | // each tag requires 12 bytes of overhead 1181 | out = (unsigned char *) STBIW_MALLOC(8 + 12+13 + 12+zlen + 12); 1182 | if (!out) return 0; 1183 | *out_len = 8 + 12+13 + 12+zlen + 12; 1184 | 1185 | o=out; 1186 | STBIW_MEMMOVE(o,sig,8); o+= 8; 1187 | stbiw__wp32(o, 13); // header length 1188 | stbiw__wptag(o, "IHDR"); 1189 | stbiw__wp32(o, x); 1190 | stbiw__wp32(o, y); 1191 | *o++ = 8; 1192 | *o++ = STBIW_UCHAR(ctype[n]); 1193 | *o++ = 0; 1194 | *o++ = 0; 1195 | *o++ = 0; 1196 | stbiw__wpcrc(&o,13); 1197 | 1198 | stbiw__wp32(o, zlen); 1199 | stbiw__wptag(o, "IDAT"); 1200 | STBIW_MEMMOVE(o, zlib, zlen); 1201 | o += zlen; 1202 | STBIW_FREE(zlib); 1203 | stbiw__wpcrc(&o, zlen); 1204 | 1205 | stbiw__wp32(o,0); 1206 | stbiw__wptag(o, "IEND"); 1207 | stbiw__wpcrc(&o,0); 1208 | 1209 | STBIW_ASSERT(o == out + *out_len); 1210 | 1211 | return out; 1212 | } 1213 | 1214 | #ifndef STBI_WRITE_NO_STDIO 1215 | STBIWDEF int stbi_write_png(char const *filename, int x, int y, int comp, const void *data, int stride_bytes) 1216 | { 1217 | FILE *f; 1218 | int len; 1219 | unsigned char *png = stbi_write_png_to_mem((const unsigned char *) data, stride_bytes, x, y, comp, &len); 1220 | if (png == NULL) return 0; 1221 | 1222 | f = stbiw__fopen(filename, "wb"); 1223 | if (!f) { STBIW_FREE(png); return 0; } 1224 | fwrite(png, 1, len, f); 1225 | fclose(f); 1226 | STBIW_FREE(png); 1227 | return 1; 1228 | } 1229 | #endif 1230 | 1231 | STBIWDEF int stbi_write_png_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int stride_bytes) 1232 | { 1233 | int len; 1234 | unsigned char *png = stbi_write_png_to_mem((const unsigned char *) data, stride_bytes, x, y, comp, &len); 1235 | if (png == NULL) return 0; 1236 | func(context, png, len); 1237 | STBIW_FREE(png); 1238 | return 1; 1239 | } 1240 | 1241 | 1242 | /* *************************************************************************** 1243 | * 1244 | * JPEG writer 1245 | * 1246 | * This is based on Jon Olick's jo_jpeg.cpp: 1247 | * public domain Simple, Minimalistic JPEG writer - http://www.jonolick.com/code.html 1248 | */ 1249 | 1250 | static const unsigned char stbiw__jpg_ZigZag[] = { 0,1,5,6,14,15,27,28,2,4,7,13,16,26,29,42,3,8,12,17,25,30,41,43,9,11,18, 1251 | 24,31,40,44,53,10,19,23,32,39,45,52,54,20,22,33,38,46,51,55,60,21,34,37,47,50,56,59,61,35,36,48,49,57,58,62,63 }; 1252 | 1253 | static void stbiw__jpg_writeBits(stbi__write_context *s, int *bitBufP, int *bitCntP, const unsigned short *bs) { 1254 | int bitBuf = *bitBufP, bitCnt = *bitCntP; 1255 | bitCnt += bs[1]; 1256 | bitBuf |= bs[0] << (24 - bitCnt); 1257 | while(bitCnt >= 8) { 1258 | unsigned char c = (bitBuf >> 16) & 255; 1259 | stbiw__putc(s, c); 1260 | if(c == 255) { 1261 | stbiw__putc(s, 0); 1262 | } 1263 | bitBuf <<= 8; 1264 | bitCnt -= 8; 1265 | } 1266 | *bitBufP = bitBuf; 1267 | *bitCntP = bitCnt; 1268 | } 1269 | 1270 | static void stbiw__jpg_DCT(float *d0p, float *d1p, float *d2p, float *d3p, float *d4p, float *d5p, float *d6p, float *d7p) { 1271 | float d0 = *d0p, d1 = *d1p, d2 = *d2p, d3 = *d3p, d4 = *d4p, d5 = *d5p, d6 = *d6p, d7 = *d7p; 1272 | float z1, z2, z3, z4, z5, z11, z13; 1273 | 1274 | float tmp0 = d0 + d7; 1275 | float tmp7 = d0 - d7; 1276 | float tmp1 = d1 + d6; 1277 | float tmp6 = d1 - d6; 1278 | float tmp2 = d2 + d5; 1279 | float tmp5 = d2 - d5; 1280 | float tmp3 = d3 + d4; 1281 | float tmp4 = d3 - d4; 1282 | 1283 | // Even part 1284 | float tmp10 = tmp0 + tmp3; // phase 2 1285 | float tmp13 = tmp0 - tmp3; 1286 | float tmp11 = tmp1 + tmp2; 1287 | float tmp12 = tmp1 - tmp2; 1288 | 1289 | d0 = tmp10 + tmp11; // phase 3 1290 | d4 = tmp10 - tmp11; 1291 | 1292 | z1 = (tmp12 + tmp13) * 0.707106781f; // c4 1293 | d2 = tmp13 + z1; // phase 5 1294 | d6 = tmp13 - z1; 1295 | 1296 | // Odd part 1297 | tmp10 = tmp4 + tmp5; // phase 2 1298 | tmp11 = tmp5 + tmp6; 1299 | tmp12 = tmp6 + tmp7; 1300 | 1301 | // The rotator is modified from fig 4-8 to avoid extra negations. 1302 | z5 = (tmp10 - tmp12) * 0.382683433f; // c6 1303 | z2 = tmp10 * 0.541196100f + z5; // c2-c6 1304 | z4 = tmp12 * 1.306562965f + z5; // c2+c6 1305 | z3 = tmp11 * 0.707106781f; // c4 1306 | 1307 | z11 = tmp7 + z3; // phase 5 1308 | z13 = tmp7 - z3; 1309 | 1310 | *d5p = z13 + z2; // phase 6 1311 | *d3p = z13 - z2; 1312 | *d1p = z11 + z4; 1313 | *d7p = z11 - z4; 1314 | 1315 | *d0p = d0; *d2p = d2; *d4p = d4; *d6p = d6; 1316 | } 1317 | 1318 | static void stbiw__jpg_calcBits(int val, unsigned short bits[2]) { 1319 | int tmp1 = val < 0 ? -val : val; 1320 | val = val < 0 ? val-1 : val; 1321 | bits[1] = 1; 1322 | while(tmp1 >>= 1) { 1323 | ++bits[1]; 1324 | } 1325 | bits[0] = val & ((1<0)&&(DU[end0pos]==0); --end0pos) { 1368 | } 1369 | // end0pos = first element in reverse order !=0 1370 | if(end0pos == 0) { 1371 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, EOB); 1372 | return DU[0]; 1373 | } 1374 | for(i = 1; i <= end0pos; ++i) { 1375 | int startpos = i; 1376 | int nrzeroes; 1377 | unsigned short bits[2]; 1378 | for (; DU[i]==0 && i<=end0pos; ++i) { 1379 | } 1380 | nrzeroes = i-startpos; 1381 | if ( nrzeroes >= 16 ) { 1382 | int lng = nrzeroes>>4; 1383 | int nrmarker; 1384 | for (nrmarker=1; nrmarker <= lng; ++nrmarker) 1385 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, M16zeroes); 1386 | nrzeroes &= 15; 1387 | } 1388 | stbiw__jpg_calcBits(DU[i], bits); 1389 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, HTAC[(nrzeroes<<4)+bits[1]]); 1390 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, bits); 1391 | } 1392 | if(end0pos != 63) { 1393 | stbiw__jpg_writeBits(s, bitBuf, bitCnt, EOB); 1394 | } 1395 | return DU[0]; 1396 | } 1397 | 1398 | static int stbi_write_jpg_core(stbi__write_context *s, int width, int height, int comp, const void* data, int quality) { 1399 | // Constants that don't pollute global namespace 1400 | static const unsigned char std_dc_luminance_nrcodes[] = {0,0,1,5,1,1,1,1,1,1,0,0,0,0,0,0,0}; 1401 | static const unsigned char std_dc_luminance_values[] = {0,1,2,3,4,5,6,7,8,9,10,11}; 1402 | static const unsigned char std_ac_luminance_nrcodes[] = {0,0,2,1,3,3,2,4,3,5,5,4,4,0,0,1,0x7d}; 1403 | static const unsigned char std_ac_luminance_values[] = { 1404 | 0x01,0x02,0x03,0x00,0x04,0x11,0x05,0x12,0x21,0x31,0x41,0x06,0x13,0x51,0x61,0x07,0x22,0x71,0x14,0x32,0x81,0x91,0xa1,0x08, 1405 | 0x23,0x42,0xb1,0xc1,0x15,0x52,0xd1,0xf0,0x24,0x33,0x62,0x72,0x82,0x09,0x0a,0x16,0x17,0x18,0x19,0x1a,0x25,0x26,0x27,0x28, 1406 | 0x29,0x2a,0x34,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58,0x59, 1407 | 0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x83,0x84,0x85,0x86,0x87,0x88,0x89, 1408 | 0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4,0xb5,0xb6, 1409 | 0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda,0xe1,0xe2, 1410 | 0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf1,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,0xf9,0xfa 1411 | }; 1412 | static const unsigned char std_dc_chrominance_nrcodes[] = {0,0,3,1,1,1,1,1,1,1,1,1,0,0,0,0,0}; 1413 | static const unsigned char std_dc_chrominance_values[] = {0,1,2,3,4,5,6,7,8,9,10,11}; 1414 | static const unsigned char std_ac_chrominance_nrcodes[] = {0,0,2,1,2,4,4,3,4,7,5,4,4,0,1,2,0x77}; 1415 | static const unsigned char std_ac_chrominance_values[] = { 1416 | 0x00,0x01,0x02,0x03,0x11,0x04,0x05,0x21,0x31,0x06,0x12,0x41,0x51,0x07,0x61,0x71,0x13,0x22,0x32,0x81,0x08,0x14,0x42,0x91, 1417 | 0xa1,0xb1,0xc1,0x09,0x23,0x33,0x52,0xf0,0x15,0x62,0x72,0xd1,0x0a,0x16,0x24,0x34,0xe1,0x25,0xf1,0x17,0x18,0x19,0x1a,0x26, 1418 | 0x27,0x28,0x29,0x2a,0x35,0x36,0x37,0x38,0x39,0x3a,0x43,0x44,0x45,0x46,0x47,0x48,0x49,0x4a,0x53,0x54,0x55,0x56,0x57,0x58, 1419 | 0x59,0x5a,0x63,0x64,0x65,0x66,0x67,0x68,0x69,0x6a,0x73,0x74,0x75,0x76,0x77,0x78,0x79,0x7a,0x82,0x83,0x84,0x85,0x86,0x87, 1420 | 0x88,0x89,0x8a,0x92,0x93,0x94,0x95,0x96,0x97,0x98,0x99,0x9a,0xa2,0xa3,0xa4,0xa5,0xa6,0xa7,0xa8,0xa9,0xaa,0xb2,0xb3,0xb4, 1421 | 0xb5,0xb6,0xb7,0xb8,0xb9,0xba,0xc2,0xc3,0xc4,0xc5,0xc6,0xc7,0xc8,0xc9,0xca,0xd2,0xd3,0xd4,0xd5,0xd6,0xd7,0xd8,0xd9,0xda, 1422 | 0xe2,0xe3,0xe4,0xe5,0xe6,0xe7,0xe8,0xe9,0xea,0xf2,0xf3,0xf4,0xf5,0xf6,0xf7,0xf8,0xf9,0xfa 1423 | }; 1424 | // Huffman tables 1425 | static const unsigned short YDC_HT[256][2] = { {0,2},{2,3},{3,3},{4,3},{5,3},{6,3},{14,4},{30,5},{62,6},{126,7},{254,8},{510,9}}; 1426 | static const unsigned short UVDC_HT[256][2] = { {0,2},{1,2},{2,2},{6,3},{14,4},{30,5},{62,6},{126,7},{254,8},{510,9},{1022,10},{2046,11}}; 1427 | static const unsigned short YAC_HT[256][2] = { 1428 | {10,4},{0,2},{1,2},{4,3},{11,4},{26,5},{120,7},{248,8},{1014,10},{65410,16},{65411,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1429 | {12,4},{27,5},{121,7},{502,9},{2038,11},{65412,16},{65413,16},{65414,16},{65415,16},{65416,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1430 | {28,5},{249,8},{1015,10},{4084,12},{65417,16},{65418,16},{65419,16},{65420,16},{65421,16},{65422,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1431 | {58,6},{503,9},{4085,12},{65423,16},{65424,16},{65425,16},{65426,16},{65427,16},{65428,16},{65429,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1432 | {59,6},{1016,10},{65430,16},{65431,16},{65432,16},{65433,16},{65434,16},{65435,16},{65436,16},{65437,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1433 | {122,7},{2039,11},{65438,16},{65439,16},{65440,16},{65441,16},{65442,16},{65443,16},{65444,16},{65445,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1434 | {123,7},{4086,12},{65446,16},{65447,16},{65448,16},{65449,16},{65450,16},{65451,16},{65452,16},{65453,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1435 | {250,8},{4087,12},{65454,16},{65455,16},{65456,16},{65457,16},{65458,16},{65459,16},{65460,16},{65461,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1436 | {504,9},{32704,15},{65462,16},{65463,16},{65464,16},{65465,16},{65466,16},{65467,16},{65468,16},{65469,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1437 | {505,9},{65470,16},{65471,16},{65472,16},{65473,16},{65474,16},{65475,16},{65476,16},{65477,16},{65478,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1438 | {506,9},{65479,16},{65480,16},{65481,16},{65482,16},{65483,16},{65484,16},{65485,16},{65486,16},{65487,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1439 | {1017,10},{65488,16},{65489,16},{65490,16},{65491,16},{65492,16},{65493,16},{65494,16},{65495,16},{65496,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1440 | {1018,10},{65497,16},{65498,16},{65499,16},{65500,16},{65501,16},{65502,16},{65503,16},{65504,16},{65505,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1441 | {2040,11},{65506,16},{65507,16},{65508,16},{65509,16},{65510,16},{65511,16},{65512,16},{65513,16},{65514,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1442 | {65515,16},{65516,16},{65517,16},{65518,16},{65519,16},{65520,16},{65521,16},{65522,16},{65523,16},{65524,16},{0,0},{0,0},{0,0},{0,0},{0,0}, 1443 | {2041,11},{65525,16},{65526,16},{65527,16},{65528,16},{65529,16},{65530,16},{65531,16},{65532,16},{65533,16},{65534,16},{0,0},{0,0},{0,0},{0,0},{0,0} 1444 | }; 1445 | static const unsigned short UVAC_HT[256][2] = { 1446 | {0,2},{1,2},{4,3},{10,4},{24,5},{25,5},{56,6},{120,7},{500,9},{1014,10},{4084,12},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1447 | {11,4},{57,6},{246,8},{501,9},{2038,11},{4085,12},{65416,16},{65417,16},{65418,16},{65419,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1448 | {26,5},{247,8},{1015,10},{4086,12},{32706,15},{65420,16},{65421,16},{65422,16},{65423,16},{65424,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1449 | {27,5},{248,8},{1016,10},{4087,12},{65425,16},{65426,16},{65427,16},{65428,16},{65429,16},{65430,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1450 | {58,6},{502,9},{65431,16},{65432,16},{65433,16},{65434,16},{65435,16},{65436,16},{65437,16},{65438,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1451 | {59,6},{1017,10},{65439,16},{65440,16},{65441,16},{65442,16},{65443,16},{65444,16},{65445,16},{65446,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1452 | {121,7},{2039,11},{65447,16},{65448,16},{65449,16},{65450,16},{65451,16},{65452,16},{65453,16},{65454,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1453 | {122,7},{2040,11},{65455,16},{65456,16},{65457,16},{65458,16},{65459,16},{65460,16},{65461,16},{65462,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1454 | {249,8},{65463,16},{65464,16},{65465,16},{65466,16},{65467,16},{65468,16},{65469,16},{65470,16},{65471,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1455 | {503,9},{65472,16},{65473,16},{65474,16},{65475,16},{65476,16},{65477,16},{65478,16},{65479,16},{65480,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1456 | {504,9},{65481,16},{65482,16},{65483,16},{65484,16},{65485,16},{65486,16},{65487,16},{65488,16},{65489,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1457 | {505,9},{65490,16},{65491,16},{65492,16},{65493,16},{65494,16},{65495,16},{65496,16},{65497,16},{65498,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1458 | {506,9},{65499,16},{65500,16},{65501,16},{65502,16},{65503,16},{65504,16},{65505,16},{65506,16},{65507,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1459 | {2041,11},{65508,16},{65509,16},{65510,16},{65511,16},{65512,16},{65513,16},{65514,16},{65515,16},{65516,16},{0,0},{0,0},{0,0},{0,0},{0,0},{0,0}, 1460 | {16352,14},{65517,16},{65518,16},{65519,16},{65520,16},{65521,16},{65522,16},{65523,16},{65524,16},{65525,16},{0,0},{0,0},{0,0},{0,0},{0,0}, 1461 | {1018,10},{32707,15},{65526,16},{65527,16},{65528,16},{65529,16},{65530,16},{65531,16},{65532,16},{65533,16},{65534,16},{0,0},{0,0},{0,0},{0,0},{0,0} 1462 | }; 1463 | static const int YQT[] = {16,11,10,16,24,40,51,61,12,12,14,19,26,58,60,55,14,13,16,24,40,57,69,56,14,17,22,29,51,87,80,62,18,22, 1464 | 37,56,68,109,103,77,24,35,55,64,81,104,113,92,49,64,78,87,103,121,120,101,72,92,95,98,112,100,103,99}; 1465 | static const int UVQT[] = {17,18,24,47,99,99,99,99,18,21,26,66,99,99,99,99,24,26,56,99,99,99,99,99,47,66,99,99,99,99,99,99, 1466 | 99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99,99}; 1467 | static const float aasf[] = { 1.0f * 2.828427125f, 1.387039845f * 2.828427125f, 1.306562965f * 2.828427125f, 1.175875602f * 2.828427125f, 1468 | 1.0f * 2.828427125f, 0.785694958f * 2.828427125f, 0.541196100f * 2.828427125f, 0.275899379f * 2.828427125f }; 1469 | 1470 | int row, col, i, k, subsample; 1471 | float fdtbl_Y[64], fdtbl_UV[64]; 1472 | unsigned char YTable[64], UVTable[64]; 1473 | 1474 | if(!data || !width || !height || comp > 4 || comp < 1) { 1475 | return 0; 1476 | } 1477 | 1478 | quality = quality ? quality : 90; 1479 | subsample = quality <= 90 ? 1 : 0; 1480 | quality = quality < 1 ? 1 : quality > 100 ? 100 : quality; 1481 | quality = quality < 50 ? 5000 / quality : 200 - quality * 2; 1482 | 1483 | for(i = 0; i < 64; ++i) { 1484 | int uvti, yti = (YQT[i]*quality+50)/100; 1485 | YTable[stbiw__jpg_ZigZag[i]] = (unsigned char) (yti < 1 ? 1 : yti > 255 ? 255 : yti); 1486 | uvti = (UVQT[i]*quality+50)/100; 1487 | UVTable[stbiw__jpg_ZigZag[i]] = (unsigned char) (uvti < 1 ? 1 : uvti > 255 ? 255 : uvti); 1488 | } 1489 | 1490 | for(row = 0, k = 0; row < 8; ++row) { 1491 | for(col = 0; col < 8; ++col, ++k) { 1492 | fdtbl_Y[k] = 1 / (YTable [stbiw__jpg_ZigZag[k]] * aasf[row] * aasf[col]); 1493 | fdtbl_UV[k] = 1 / (UVTable[stbiw__jpg_ZigZag[k]] * aasf[row] * aasf[col]); 1494 | } 1495 | } 1496 | 1497 | // Write Headers 1498 | { 1499 | static const unsigned char head0[] = { 0xFF,0xD8,0xFF,0xE0,0,0x10,'J','F','I','F',0,1,1,0,0,1,0,1,0,0,0xFF,0xDB,0,0x84,0 }; 1500 | static const unsigned char head2[] = { 0xFF,0xDA,0,0xC,3,1,0,2,0x11,3,0x11,0,0x3F,0 }; 1501 | const unsigned char head1[] = { 0xFF,0xC0,0,0x11,8,(unsigned char)(height>>8),STBIW_UCHAR(height),(unsigned char)(width>>8),STBIW_UCHAR(width), 1502 | 3,1,(unsigned char)(subsample?0x22:0x11),0,2,0x11,1,3,0x11,1,0xFF,0xC4,0x01,0xA2,0 }; 1503 | s->func(s->context, (void*)head0, sizeof(head0)); 1504 | s->func(s->context, (void*)YTable, sizeof(YTable)); 1505 | stbiw__putc(s, 1); 1506 | s->func(s->context, UVTable, sizeof(UVTable)); 1507 | s->func(s->context, (void*)head1, sizeof(head1)); 1508 | s->func(s->context, (void*)(std_dc_luminance_nrcodes+1), sizeof(std_dc_luminance_nrcodes)-1); 1509 | s->func(s->context, (void*)std_dc_luminance_values, sizeof(std_dc_luminance_values)); 1510 | stbiw__putc(s, 0x10); // HTYACinfo 1511 | s->func(s->context, (void*)(std_ac_luminance_nrcodes+1), sizeof(std_ac_luminance_nrcodes)-1); 1512 | s->func(s->context, (void*)std_ac_luminance_values, sizeof(std_ac_luminance_values)); 1513 | stbiw__putc(s, 1); // HTUDCinfo 1514 | s->func(s->context, (void*)(std_dc_chrominance_nrcodes+1), sizeof(std_dc_chrominance_nrcodes)-1); 1515 | s->func(s->context, (void*)std_dc_chrominance_values, sizeof(std_dc_chrominance_values)); 1516 | stbiw__putc(s, 0x11); // HTUACinfo 1517 | s->func(s->context, (void*)(std_ac_chrominance_nrcodes+1), sizeof(std_ac_chrominance_nrcodes)-1); 1518 | s->func(s->context, (void*)std_ac_chrominance_values, sizeof(std_ac_chrominance_values)); 1519 | s->func(s->context, (void*)head2, sizeof(head2)); 1520 | } 1521 | 1522 | // Encode 8x8 macroblocks 1523 | { 1524 | static const unsigned short fillBits[] = {0x7F, 7}; 1525 | int DCY=0, DCU=0, DCV=0; 1526 | int bitBuf=0, bitCnt=0; 1527 | // comp == 2 is grey+alpha (alpha is ignored) 1528 | int ofsG = comp > 2 ? 1 : 0, ofsB = comp > 2 ? 2 : 0; 1529 | const unsigned char *dataR = (const unsigned char *)data; 1530 | const unsigned char *dataG = dataR + ofsG; 1531 | const unsigned char *dataB = dataR + ofsB; 1532 | int x, y, pos; 1533 | if(subsample) { 1534 | for(y = 0; y < height; y += 16) { 1535 | for(x = 0; x < width; x += 16) { 1536 | float Y[256], U[256], V[256]; 1537 | for(row = y, pos = 0; row < y+16; ++row) { 1538 | // row >= height => use last input row 1539 | int clamped_row = (row < height) ? row : height - 1; 1540 | int base_p = (stbi__flip_vertically_on_write ? (height-1-clamped_row) : clamped_row)*width*comp; 1541 | for(col = x; col < x+16; ++col, ++pos) { 1542 | // if col >= width => use pixel from last input column 1543 | int p = base_p + ((col < width) ? col : (width-1))*comp; 1544 | float r = dataR[p], g = dataG[p], b = dataB[p]; 1545 | Y[pos]= +0.29900f*r + 0.58700f*g + 0.11400f*b - 128; 1546 | U[pos]= -0.16874f*r - 0.33126f*g + 0.50000f*b; 1547 | V[pos]= +0.50000f*r - 0.41869f*g - 0.08131f*b; 1548 | } 1549 | } 1550 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, Y+0, 16, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1551 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, Y+8, 16, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1552 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, Y+128, 16, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1553 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, Y+136, 16, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1554 | 1555 | // subsample U,V 1556 | { 1557 | float subU[64], subV[64]; 1558 | int yy, xx; 1559 | for(yy = 0, pos = 0; yy < 8; ++yy) { 1560 | for(xx = 0; xx < 8; ++xx, ++pos) { 1561 | int j = yy*32+xx*2; 1562 | subU[pos] = (U[j+0] + U[j+1] + U[j+16] + U[j+17]) * 0.25f; 1563 | subV[pos] = (V[j+0] + V[j+1] + V[j+16] + V[j+17]) * 0.25f; 1564 | } 1565 | } 1566 | DCU = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, subU, 8, fdtbl_UV, DCU, UVDC_HT, UVAC_HT); 1567 | DCV = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, subV, 8, fdtbl_UV, DCV, UVDC_HT, UVAC_HT); 1568 | } 1569 | } 1570 | } 1571 | } else { 1572 | for(y = 0; y < height; y += 8) { 1573 | for(x = 0; x < width; x += 8) { 1574 | float Y[64], U[64], V[64]; 1575 | for(row = y, pos = 0; row < y+8; ++row) { 1576 | // row >= height => use last input row 1577 | int clamped_row = (row < height) ? row : height - 1; 1578 | int base_p = (stbi__flip_vertically_on_write ? (height-1-clamped_row) : clamped_row)*width*comp; 1579 | for(col = x; col < x+8; ++col, ++pos) { 1580 | // if col >= width => use pixel from last input column 1581 | int p = base_p + ((col < width) ? col : (width-1))*comp; 1582 | float r = dataR[p], g = dataG[p], b = dataB[p]; 1583 | Y[pos]= +0.29900f*r + 0.58700f*g + 0.11400f*b - 128; 1584 | U[pos]= -0.16874f*r - 0.33126f*g + 0.50000f*b; 1585 | V[pos]= +0.50000f*r - 0.41869f*g - 0.08131f*b; 1586 | } 1587 | } 1588 | 1589 | DCY = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, Y, 8, fdtbl_Y, DCY, YDC_HT, YAC_HT); 1590 | DCU = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, U, 8, fdtbl_UV, DCU, UVDC_HT, UVAC_HT); 1591 | DCV = stbiw__jpg_processDU(s, &bitBuf, &bitCnt, V, 8, fdtbl_UV, DCV, UVDC_HT, UVAC_HT); 1592 | } 1593 | } 1594 | } 1595 | 1596 | // Do the bit alignment of the EOI marker 1597 | stbiw__jpg_writeBits(s, &bitBuf, &bitCnt, fillBits); 1598 | } 1599 | 1600 | // EOI 1601 | stbiw__putc(s, 0xFF); 1602 | stbiw__putc(s, 0xD9); 1603 | 1604 | return 1; 1605 | } 1606 | 1607 | STBIWDEF int stbi_write_jpg_to_func(stbi_write_func *func, void *context, int x, int y, int comp, const void *data, int quality) 1608 | { 1609 | stbi__write_context s = { 0 }; 1610 | stbi__start_write_callbacks(&s, func, context); 1611 | return stbi_write_jpg_core(&s, x, y, comp, (void *) data, quality); 1612 | } 1613 | 1614 | 1615 | #ifndef STBI_WRITE_NO_STDIO 1616 | STBIWDEF int stbi_write_jpg(char const *filename, int x, int y, int comp, const void *data, int quality) 1617 | { 1618 | stbi__write_context s = { 0 }; 1619 | if (stbi__start_write_file(&s,filename)) { 1620 | int r = stbi_write_jpg_core(&s, x, y, comp, data, quality); 1621 | stbi__end_write_file(&s); 1622 | return r; 1623 | } else 1624 | return 0; 1625 | } 1626 | #endif 1627 | 1628 | #endif // STB_IMAGE_WRITE_IMPLEMENTATION 1629 | 1630 | /* Revision history 1631 | 1.16 (2021-07-11) 1632 | make Deflate code emit uncompressed blocks when it would otherwise expand 1633 | support writing BMPs with alpha channel 1634 | 1.15 (2020-07-13) unknown 1635 | 1.14 (2020-02-02) updated JPEG writer to downsample chroma channels 1636 | 1.13 1637 | 1.12 1638 | 1.11 (2019-08-11) 1639 | 1640 | 1.10 (2019-02-07) 1641 | support utf8 filenames in Windows; fix warnings and platform ifdefs 1642 | 1.09 (2018-02-11) 1643 | fix typo in zlib quality API, improve STB_I_W_STATIC in C++ 1644 | 1.08 (2018-01-29) 1645 | add stbi__flip_vertically_on_write, external zlib, zlib quality, choose PNG filter 1646 | 1.07 (2017-07-24) 1647 | doc fix 1648 | 1.06 (2017-07-23) 1649 | writing JPEG (using Jon Olick's code) 1650 | 1.05 ??? 1651 | 1.04 (2017-03-03) 1652 | monochrome BMP expansion 1653 | 1.03 ??? 1654 | 1.02 (2016-04-02) 1655 | avoid allocating large structures on the stack 1656 | 1.01 (2016-01-16) 1657 | STBIW_REALLOC_SIZED: support allocators with no realloc support 1658 | avoid race-condition in crc initialization 1659 | minor compile issues 1660 | 1.00 (2015-09-14) 1661 | installable file IO function 1662 | 0.99 (2015-09-13) 1663 | warning fixes; TGA rle support 1664 | 0.98 (2015-04-08) 1665 | added STBIW_MALLOC, STBIW_ASSERT etc 1666 | 0.97 (2015-01-18) 1667 | fixed HDR asserts, rewrote HDR rle logic 1668 | 0.96 (2015-01-17) 1669 | add HDR output 1670 | fix monochrome BMP 1671 | 0.95 (2014-08-17) 1672 | add monochrome TGA output 1673 | 0.94 (2014-05-31) 1674 | rename private functions to avoid conflicts with stb_image.h 1675 | 0.93 (2014-05-27) 1676 | warning fixes 1677 | 0.92 (2010-08-01) 1678 | casts to unsigned char to fix warnings 1679 | 0.91 (2010-07-17) 1680 | first public release 1681 | 0.90 first internal release 1682 | */ 1683 | 1684 | /* 1685 | ------------------------------------------------------------------------------ 1686 | This software is available under 2 licenses -- choose whichever you prefer. 1687 | ------------------------------------------------------------------------------ 1688 | ALTERNATIVE A - MIT License 1689 | Copyright (c) 2017 Sean Barrett 1690 | Permission is hereby granted, free of charge, to any person obtaining a copy of 1691 | this software and associated documentation files (the "Software"), to deal in 1692 | the Software without restriction, including without limitation the rights to 1693 | use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies 1694 | of the Software, and to permit persons to whom the Software is furnished to do 1695 | so, subject to the following conditions: 1696 | The above copyright notice and this permission notice shall be included in all 1697 | copies or substantial portions of the Software. 1698 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 1699 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 1700 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 1701 | AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 1702 | LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 1703 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 1704 | SOFTWARE. 1705 | ------------------------------------------------------------------------------ 1706 | ALTERNATIVE B - Public Domain (www.unlicense.org) 1707 | This is free and unencumbered software released into the public domain. 1708 | Anyone is free to copy, modify, publish, use, compile, sell, or distribute this 1709 | software, either in source code form or as a compiled binary, for any purpose, 1710 | commercial or non-commercial, and by any means. 1711 | In jurisdictions that recognize copyright laws, the author or authors of this 1712 | software dedicate any and all copyright interest in the software to the public 1713 | domain. We make this dedication for the benefit of the public at large and to 1714 | the detriment of our heirs and successors. We intend this dedication to be an 1715 | overt act of relinquishment in perpetuity of all present and future rights to 1716 | this software under copyright law. 1717 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 1718 | IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 1719 | FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 1720 | AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 1721 | ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 1722 | WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 1723 | ------------------------------------------------------------------------------ 1724 | */ --------------------------------------------------------------------------------