Rename concurrency to synchronozation and remove whitespaces

Author: rp-code9

Operating-System-Concepts/memory-management/aligned_malloc_free/aligned_mem.h

@@ -37,4 +37,4 @@ void* aligned_malloc(size_t bytes, size_t alignment)
     return p2;
 }
 
-#endif
+#endif

Operating-System-Concepts/memory-management/aligned_malloc_free/test.c

@@ -6,7 +6,6 @@ gcc -I$(pwd) mymalloc.c test.c
 
 * Memory Leak check
 valgrind --leak-check=full --show-leak-kinds=all --track-origins=yes --verbose a.out
-
 */
 
 #include <stdio.h>
@@ -16,5 +15,5 @@ void main()
 {
     int *p = (int *)aligned_malloc(50, 128);
     printf("Allocate aligned memory at : %p\n", p);
-    // aligned_free(p);
+    aligned_free(p);
 }

Operating-System-Concepts/memory-management/my_malloc_free/mymalloc.c

@@ -4,7 +4,6 @@
 #include <stddef.h>
 #include "mymalloc.h"
 
-
 char memory[MAX_MEMSIZE];
 
 struct block* freeList = (void *)memory;
@@ -65,7 +64,6 @@ void* myMalloc(size_t bytes)
     }
 }
 
-
 void merge()
 {
     struct block* prev = NULL;

Operating-System-Concepts/memory-management/my_malloc_free/mymalloc.h

@@ -8,8 +8,6 @@
 
 #define MAX_MEMSIZE 20000
 
-
-
 typedef struct block
 {
     size_t size;
@@ -27,5 +25,4 @@ void merge();
 
 void myFree(void* ptr);
 
-
 #endif

Operating-System-Concepts/memory-management/my_malloc_free/test.c

@@ -5,7 +5,6 @@
 gcc -I$(pwd) mymalloc.c test.c
 */
 
-
 #include <stdio.h>
 #include "mymalloc.h"
 

Operating-System-Concepts/concurrency/SimpleProducerConsumer.cpp renamed to Operating-System-Concepts/synchronization/SimpleProducerConsumer.cpp

@@ -23,7 +23,7 @@ void consumeData(int data)
     std::cout << "[CONSUMER] : consumed data : " << data << "\n";
 }
 
-void producerFunc()
+void consumerFunc()
 {
     while (true) {
         while (!g_ready) {
@@ -35,7 +35,7 @@ void producerFunc()
     }
 }
 
-void consumerFunc()
+void producerFunc()
 {
     while (true) {
         std::unique_lock<std::mutex> ul(g_mutex);
@@ -60,4 +60,4 @@ int main()
     producerThread.join();
 
     return 0;
-}
+}

Operating-System-Concepts/concurrency/SimpleProducerConsumerCond.cpp renamed to Operating-System-Concepts/synchronization/SimpleProducerConsumerCond.cpp

@@ -68,4 +68,4 @@ int main()
     producerThread.join();
 
     return 0;
-}
+}

README.md

@@ -39,9 +39,9 @@ Short sample program to demonstrate C++ language basics
 
 
 # [Operating System Concepts](Operating-System-Concepts/)
-* Concurrency
-    * Simple producer consumer with busy wait [Link](Operating-System-Concepts/concurrency/SimpleProducerConsumer.cpp)
-    * Simple producer consumer with **condition variable** [Link](Operating-System-Concepts/concurrency/SimpleProducerConsumerCond.cpp)
+* Synchronization
+    * Simple producer consumer with busy wait, mutex in C++ [Link](Operating-System-Concepts/synchronization/SimpleProducerConsumer.cpp)
+    * Simple producer consumer with **condition variable**, condition variable in C++ [Link](Operating-System-Concepts/synchronization/SimpleProducerConsumerCond.cpp)
 * File IO
     * Print all lines which contain a given pattern [Link](Operating-System-Concepts/fileio/SearchPatternInFile.cpp)
 * Memory Management

problems/others/MaxLengthForCutting.cpp

@@ -4,9 +4,7 @@
 #include <algorithm>
 #include <vector>
 
-
-bool isValid(std::vector<int>& wood, const int K,
-                const int len)
+bool isValid(std::vector<int>& wood, const int K, const int len)
 {
     int count = 0;
 
@@ -26,7 +24,6 @@ int findMaxLengthCut(std::vector<int>& wood, int K)
     int left = 1;
     int right = *max_element(wood.begin(), wood.end());
 
-
     while (left <= right) {
         int mid = left + (right - left) / 2;
 
@@ -37,7 +34,6 @@ int findMaxLengthCut(std::vector<int>& wood, int K)
         }
     }
 
-
     return left;
 }
 

problems/others/MergeTransactions.cpp

@@ -4,7 +4,6 @@
 #include <queue>
 #include <vector>
 
-
 class Node
 {
 public:
@@ -53,7 +52,7 @@ std::vector<int> mergeSheet(std::vector<std::vector<int>>& transactions)
         maxq.push(node);
     }
 
-    while(!maxq.empty()) {
+    while (!maxq.empty()) {
         Node current = maxq.top();
         maxq.pop();
 
@@ -70,7 +69,6 @@ std::vector<int> mergeSheet(std::vector<std::vector<int>>& transactions)
     }
 
     return merged;
-
 }
 
 int main()