cpair.c 11.1 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28
/**
 * @file cpair.c
 * @author Ivaylo Ivanov 11777707
 * @date 08.12.2018
 *
 * @brief Main program module.
 *
 * A program that searches for the closest pair of points in a set of 2D-points
 *
 *    SYNOPSIS
 *    cpair
 *
 *    EXAMPLE
 *    $ cat 1.txt
 *    4.0 4.0
 *    -1.0 1.0
 *    1.0 -1.0
 *    -4.0 -4.0
 *    $ ./cpair < 1.txt
 *    -1.000000 1.000000
 *    1.000000 -1.000000
 *
 *
 * The program accepts an array of 2D-points as an input from stdin. The input ends at EOF.
 *
 * The program does the following:
 *  - No output if the array has one point
 *  - The points if the array has 2 points
29 30 31
 *  - Otherwise, the array is split in 2 parts based on the mean of X and sent to 2 different paralell child processes.
 *    The parent watches for the return code of the children and terminates with an error if any of the children exit
 *    with anything other than success.
32 33 34 35 36 37 38 39 40 41 42
 *
 * Algorithm description when there are more than 2 points:
 *  - P1 and P2 are the closest pairs for the first and the second part respectively.
 *  - Go through all of the pairs between the points from the first half with the second half and save the shortest one in P3.
 *  - Compare P1, P2 and P3 and return the shortest one to stdout.
 *
 **/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
43 44 45
#include <unistd.h>
#include <sys/types.h>
#include <sys/wait.h>
46

47 48
/// Node struct for linked list
typedef struct node {
49 50 51 52 53
    /**
     * points[0] - contains the X coordinate of the point
     * points[1] - contains the Y coordinate of the point
     *
     **/
54 55 56
    float points[2];
    struct node * next;
} node_t;
57

58 59
float get_x_mean(node_t * head);
float get_distance(float x1, float x2, float y1, float y2);
60 61
node_t * find_shortest_distance(node_t * list);
int wait_for_termination(pid_t child);
62

63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83
int main(int argc, char *argv[]) {
    if (argc > 1) {
        puts("The command takes no additional arguments.");
        puts("Usage: cpair");
        exit(EXIT_FAILURE);
    }

    /**
     *  Create the pipe file descriptors and inititalize the pipes
     *
     * fd[0] - input side of pipe
     * fd[1] - output side of pipe
     *
     **/
    int in_pipe_a[2], out_pipe_a[2], in_pipe_b[2], out_pipe_b[2];

    if(pipe(in_pipe_a) < 0 || pipe(in_pipe_b) < 0 || pipe(out_pipe_a) < 0 || pipe(out_pipe_b) < 0) {
        fprintf(stderr, "ERROR: Failed creating the pipes\n");
        exit(EXIT_FAILURE);
    }

84 85
    char * input = ""; ///< An array to save the input to
    size_t input_len;
86
    int point_num = 0; ///< Save the number of points
87 88 89 90 91
    node_t * head = NULL;

    head = malloc(sizeof(node_t));

    node_t * current = head;
92

93 94
    while(getline(&input, &input_len, stdin) > 0) { ///< Read line by line
        fprintf(stderr, "pid: %d \n%s\n", getpid(), input);
Ivaylo Ivanov's avatar
Ivaylo Ivanov committed
95 96 97
        /// Split the input by whitespace as delimiter
        char *x = strtok(input, " ");
        char *y = strtok(NULL, " ");
98

Ivaylo Ivanov's avatar
Ivaylo Ivanov committed
99
        if(x != NULL && y != NULL) {
100
            /// Convert to float and save to the list
Ivaylo Ivanov's avatar
Ivaylo Ivanov committed
101 102
            current -> points[0] = strtof(x, NULL);
            current -> points[1] = strtof(y, NULL);
103 104 105
            current -> next = malloc(sizeof(node_t));
            current = current -> next;
            point_num++; ///< Increase the list length
106
        } else {
107
            fprintf(stderr, "ERROR: Ill-formed line found\n");
108 109 110 111 112 113 114 115
            exit(EXIT_FAILURE);
        }
    }

    if(point_num == 1)
        exit(EXIT_SUCCESS);

    if(point_num == 2) {
116 117
        printf("%f %f\n", head -> points[0], head -> points[1]);
        printf("%f %f\n", head -> next -> points[0], head -> next -> points[1]);
118 119 120
        exit(EXIT_SUCCESS);
    }

121 122
    pid_t child_a, child_b; ///< Create variables for the child processes

123
    /// Create first child
124
    switch(child_a = fork()) {
125
        case -1:
126
            fprintf(stderr ,"ERROR: Couldn't fork child\n");
127 128
            exit(EXIT_FAILURE);
        case 0:
129 130 131 132 133
            /// Child execution
            close(out_pipe_a[0]);
            close(in_pipe_a[1]);
            close(STDIN_FILENO);
            if(dup2(in_pipe_a[0], STDIN_FILENO) != STDIN_FILENO) {
Ivaylo Ivanov's avatar
Ivaylo Ivanov committed
134
                fprintf(stderr, "ERROR: Failed duplicating STDIN\n");
135 136
                exit(EXIT_FAILURE);
            }
137 138
            execlp(argv[0], argv[0], NULL);

Ivaylo Ivanov's avatar
Ivaylo Ivanov committed
139
            fprintf(stderr, "ERROR: Failed to load program into child\n");
140
            exit(EXIT_FAILURE);
141
        default:
142 143
            /// Parent execution
            /// Create second child
144 145 146 147 148
            switch(child_b = fork()) {
                case -1:
                    fprintf(stderr, "ERROR: Couldn't fork child\n");
                    exit(EXIT_FAILURE);
                case 0:
149 150 151 152 153
                    /// Child execution
                    close(out_pipe_b[0]);
                    close(in_pipe_b[1]);
                    close(STDIN_FILENO);
                    if(dup2(in_pipe_b[0], STDIN_FILENO) != STDIN_FILENO) {
Ivaylo Ivanov's avatar
Ivaylo Ivanov committed
154
                        fprintf(stderr, "ERROR: Failed duplicating STDIN\n");
155 156
                        exit(EXIT_FAILURE);
                    }
157 158
                    execlp(argv[0], argv[0], NULL);

Ivaylo Ivanov's avatar
Ivaylo Ivanov committed
159
                    fprintf(stderr, "ERROR: Failed to load program into child\n");
160 161 162 163 164 165 166 167 168 169 170
                    exit(EXIT_FAILURE);
                default:
                    /// Parent execution
                    close(in_pipe_a[0]);
                    close(in_pipe_b[0]);
                    close(STDOUT_FILENO);

                    float x_mean = get_x_mean(head);

                    /// Separate the lists based on the mean
                    current = head;
171 172 173 174

                    char * first_part = malloc(point_num * __UINT8_MAX__);
                    char * second_part = malloc(point_num * __UINT8_MAX__);

Ivaylo Ivanov's avatar
Ivaylo Ivanov committed
175
                    while(current -> next != NULL) {
176
                        char point[__UINT8_MAX__];
177
                        if(current -> points[0] <= x_mean) {
178 179 180
                            /// Setup string for first child pipe
                            sprintf(point, "%f %f\n", current -> points[0], current -> points[1]);
                            strcat(first_part, point);
181
                        } else {
182 183 184
                            /// Setup string for second child pipe
                            sprintf(point, "%f %f\n", current -> points[0], current -> points[1]);
                            strcat(second_part, point);
185 186 187 188 189
                        }
                        current = current -> next;
                    }

                    /**
Ivaylo Ivanov's avatar
Ivaylo Ivanov committed
190 191 192 193
                     *
                     * Send first half to first child
                     *
                     **/
Ivaylo Ivanov's avatar
Ivaylo Ivanov committed
194 195 196 197 198
                    if(dup2(in_pipe_a[1], STDIN_FILENO) != STDIN_FILENO) {
                        fprintf(stderr, "ERROR: Failed duplicating STDIN\n");
                        exit(EXIT_FAILURE);
                    }

Ivaylo Ivanov's avatar
Ivaylo Ivanov committed
199
                    /// Write to pipe
200
                    if (write(in_pipe_a[1], first_part, strlen(first_part)) < 0) {
201 202 203 204
                        fprintf(stderr, "ERROR: Failed writing to child\n");
                        exit(EXIT_FAILURE);
                    }
                    close(STDOUT_FILENO);
Ivaylo Ivanov's avatar
Ivaylo Ivanov committed
205 206 207 208 209 210

                    /**
                     *
                     * Send second half to second child
                     *
                     **/
Ivaylo Ivanov's avatar
Ivaylo Ivanov committed
211 212 213 214 215
                    if(dup2(in_pipe_b[1], STDIN_FILENO) != STDIN_FILENO) {
                        fprintf(stderr, "ERROR: Failed duplicating STDIN\n");
                        exit(EXIT_FAILURE);
                    }

Ivaylo Ivanov's avatar
Ivaylo Ivanov committed
216
                    /// Write to pipe
217
                    if (write(in_pipe_b[1], second_part, strlen(second_part)) < 0) {
218 219 220 221 222 223 224
                        fprintf(stderr, "ERROR: Failed writing to child\n");
                        exit(EXIT_FAILURE);
                    }
                    close(STDOUT_FILENO);

                    /// Wait for the correct exit of the children
                    if(wait_for_termination(child_a) != EXIT_SUCCESS || wait_for_termination(child_b) != EXIT_SUCCESS) {
Ivaylo Ivanov's avatar
Ivaylo Ivanov committed
225
                        fprintf(stderr, "ERROR: Children didn't terminate successfully\n");
226 227
                        exit(EXIT_FAILURE);
                    }
228

229 230 231 232 233 234 235 236
                    /// Free the memory
                    free(head);
                    free(first_part);
                    free(second_part);
                    free(current);
                    break;
            }
    }
237 238 239 240 241

    exit(EXIT_SUCCESS);
}

/**
242 243 244
 * @brief Function to calculate the mean of the X coordinates from a points list
 * @details Loops through the points list, gets the sum of X coordinates and returns the mean
 * @param head - a pointer to a list with the points
245 246 247
 * @return mean of all X coordinates
 *
 **/
248 249
float get_x_mean(node_t * head) {
    node_t * current = head;
250
    float x_sum = 0;
251 252 253
    int i = 1;

    while(current != NULL) {
254 255 256
        x_sum += current -> points[0];
        current = current -> next;
        i++;
257
    }
258

259
    return x_sum/(i - 2); ///< TODO: Fix the bug with the 2 more iterations
260 261 262 263 264 265 266 267 268 269 270 271 272 273
}

/**
 * @brief Function to calculate the distance between 2 points
 * @details The function calculates the distance between 2 points
 *          in a Cartesian coordinate system, given their coordinates
 * @param x1, y1 - pair of coordinates for the first point
 *        x2, y2 - pair of coordinates for the second point
 * @return distance between the two points
 *
 **/
float get_distance(float x1, float x2, float y1, float y2) {
    return sqrt(pow((x2 - x1), 2) + pow((y2 - y1), 2));
}
274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334

/**
 * @brief Function to find the shortest distance in a list
 * @details The function gets a list of points and finds the pair
 *          with the shortest distance between them.
 * @param list - the list with points
 * @return res - a list containing the coordinates of the two closest points
 *
 **/
node_t * find_shortest_distance(node_t * list) {
    node_t * current = list;
    node_t * next = list;

    /// Setup the result list
    node_t * res = malloc(sizeof(node_t));
    res -> next = malloc(sizeof(node_t));

    int current_shortest = 0;
    int new_shortest = 0;

    while(current != NULL) {
        next = current -> next;
        if(next != NULL) {
            new_shortest = get_distance(current -> points[0], next -> points[0], current -> points[1], next -> points[1]);

            if(new_shortest < current_shortest) {
                current_shortest = new_shortest;

                /// Save the pairs
                res -> points[0] = current -> points[0];
                res -> points[1] = current -> points[1];
                res -> next -> points[0] = next -> points[0];
                res -> next -> points[1] = next -> points[1];
            }

            current = next;
        } else
            break;
    }

    return res;
}

/**
 * @briefs Function that waits for a child to close
 * @details The function waits for a child to close.
 *          If it closes successfully, it returns the exit status only.
 *          Otherwise, it prints an error message and then returns the exit status.
 * @param child - the pid of the child process
 * @return the exist status of the child process
 *
 **/
int wait_for_termination(pid_t child) {
    int exit_stat = 0;

    if(waitpid(child, &exit_stat, 0) < 0) {
        fprintf(stderr, "ERROR: Child did not exit successfully\n");
    }

    return WEXITSTATUS(exit_stat);
}