<commit_before> 	#include "types.h"
	#include "user.h"
	
	
	int
	main(int argc, char *argv[])
	{
	if (argc != 2){
	printf(1, "Usage: sanity <n>\n");
	exit();
	}
	int i;
	int n;
	int j = 0;
	int k;
	int retime;
	int rutime;
	int stime;
	int sums[3];
	//for (i = 0; i < 3; i++)
	// for (j = 0; j < 3; j++)
	// sums[i][j] = 0;
	n = atoi(argv[1]);
	i = n; //unimportant
	int pid;
	for (i = 0; i < n; i++) {
	//j = i % 3;
	pid = fork();
	if (pid == 0) {//child
	//j = (getpid() - 4) % 3; // ensures independence from the first son's pid when gathering the results in the second part of the program
	//switch(j) {
	// case 0: //CPU‐bound process (CPU):
	for (k = 0; k < 100; k++){
	for (j = 0; j < 1000000; j++){
	}
	printf(1, "PID : %d\n", getpid());
	}
	//printf(1, "DONE : %d \n", getpid());
	// break;
	//case 1: //short tasks based CPU‐bound process (S‐CPU):
	// for (k = 0; k < 100; k++){
	// for (j = 0; j < 1000000; j++){}
	// yield();
	// }
	// break;
	//case 2:// simulate I/O bound process (IO)
	// for(k = 0; k < 100; k++){
	// sleep(1);
	// }
	// break;
	//}
	exit(); // children exit here
	}
	continue; // father continues to spawn the next child
	}
	for (i = 0; i < n; i++) {<commit_msg>Made the print outs more clear<commit_after> 	#include "types.h"
	#include "user.h"
	
	
	int
	main(int argc, char *argv[])
	{
	if (argc != 2){
	printf(1, "Usage: sanity <n>\n");
	exit();
	}
	int i;
	int n;
	int j = 0;
	int k;
	int retime;
	int rutime;
	int stime;
	int sums[3];
	//for (i = 0; i < 3; i++)
	// for (j = 0; j < 3; j++)
	// sums[i][j] = 0;
	n = atoi(argv[1]);
	i = n; //unimportant
	int pid;
	for (i = 0; i < n; i++) {
	//j = i % 3;
	pid = fork();
	if (pid == 0) {//child
	//j = (getpid() - 4) % 3; // ensures independence from the first son's pid when gathering the results in the second part of the program
	//switch(j) {
	// case 0: //CPU‐bound process (CPU):
	for (k = 0; k < 100; k++){
	for (j = 0; j < 1000000; j++){}
	printf(1, "PID : %d\n", getpid());
	}
	//printf(1, "DONE : %d \n", getpid());
	// break;
	//case 1: //short tasks based CPU‐bound process (S‐CPU):
	// for (k = 0; k < 100; k++){
	// for (j = 0; j < 1000000; j++){}
	// yield();
	// }
	// break;
	//case 2:// simulate I/O bound process (IO)
	// for(k = 0; k < 100; k++){
	// sleep(1);
	// }
	// break;
	//}
	exit(); // children exit here
	}
	continue; // father continues to spawn the next child
	}
	for (i = 0; i < n; i++) {
{'fraction_non_alphanumeric': 0.23597839634399667, 'fraction_numerical': 0.04154549231408392, 'mean_word_length': 2.3537604456824512, 'pattern_counts': {'":': 0, '<': 23, '<?xml version=': 0, '>': 5, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '4903319', 'n_tokens_mistral': 1145, 'n_tokens_neox': 1037, 'n_words': 355}