C 程序无法弄清楚如何正确释放 malloc

Question

在我的程序的主要 function 中，我进行了一些 malloc 调用，我认为最后是正确的免费调用。 我的地址清理程序告诉我，第 206 行中的数据仍在泄漏，即：

names[size - 1] = malloc(17 * sizeof(char));

问题是，如果我为 names[size - 1] 包含一个 free 语句，显然仍有数据从中泄漏。 我不知道为什么。 这是主要的：

int main(int argc, char** argv) {
if (argc - 1 != 1) {
    printf("Invalid number of arguments\n");
    return 0;
}

//get file, return if invalid path
FILE *file = fopen(argv[1], "r");
if (!file) {
    printf("Invalid input\n");
    return 0;
}

//make temp of circuit with struct directive
int scount = 0;
struct directive* temp = NULL;
int size = 2;
int icount = 0;
int ocount = 0;
int tcount = 0;
char dir[17];
char **names;
int *values;

//get INPUT info
fscanf(file, " %s", dir);
fscanf(file, "%d", &icount);

size += icount;
names = malloc(size * sizeof(char *));
names[0] = malloc(2 * sizeof(char));     //MALLOC
strcpy(names[0], "0");
names[1] = malloc(2 * sizeof(char));     //MALLOC
strcpy(names[1], "1");

int i;
for (i = 0; i < icount; i++) {
    names[i + 2] = malloc(17 * sizeof(char));
    fscanf(file, "%*[: ]%16s", names[i + 2]);
}

//get OUTPUT info
fscanf(file, " %s", dir);
fscanf(file, "%d", &ocount);
size += ocount;
names = realloc(names, size * sizeof(char *));
for (i = 0; i < ocount; i++) {
    names[i + icount + 2] = malloc(17 * sizeof(char));
    fscanf(file, "%*[: ]%16s", names[i + icount + 2]);
}

//get temp
struct directive step;
while (!feof(file)) {
    int numInputs = 2, numOutputs = 1;
    
    int sc = fscanf(file, " %s", dir); 
    if (sc != 1) {
        break;
    }
    scount++;
    step.n = 0;
    step.s = 0;
    strcpy(step.gate, dir);

    if (strcmp(dir, "NOT") == 0) {
        numInputs = 1;
    }
    if (strcmp(dir, "PASS") == 0) {
        numInputs = 1;
    }
    if (strcmp(dir, "DECODER") == 0) {
        fscanf(file, "%d", &numInputs);
        step.n = numInputs;
        numOutputs = pow(2, numInputs);
    }
    if (strcmp(dir, "MULTIPLEXER") == 0) {
        fscanf(file, "%d", &numInputs);
        step.s = numInputs;
        numInputs = pow(2, numInputs);
    }

    step.inputs = malloc(numInputs * sizeof(int));
    step.outputs = malloc(numOutputs * sizeof(int));
    step.selectors = malloc(step.s * sizeof(int));

    char v[17];
    for (i = 0; i < numInputs; i++) {
        fscanf(file, "%*[: ]%16s", v);
        step.inputs[i] = indexOf(size, names, v);
    }

    for (i = 0; i < step.s; i++) {
        fscanf(file, "%*[: ]%16s", v);
        step.selectors[i] = indexOf(size, names, v);
    }

    for (i = 0; i < numOutputs; i++) {
        fscanf(file, "%*[: ]%16s", v);
        int idx = indexOf(size, names, v);
        if (idx == -1) {
            size++;
            tcount++;
            char **tmp = realloc(names, size * sizeof *tmp);
            if (!tmp) abort(); // handle alloc failure
            names = tmp;
            names[size - 1] = malloc(17 * sizeof(char));
            strcpy(names[size - 1], v);
            step.outputs[i] = size - 1;
        }
        else {
            step.outputs[i] = idx;
        }
    }
    
    //add step to list of temp
    if (!temp) {
        temp = malloc(sizeof(struct directive));
    } else {
        temp = realloc(temp, scount * sizeof(struct directive));
    }
    temp[scount - 1] = step;

    
}

// initialize values array
values = malloc(size * sizeof(int));
resetValues(size, values);

while(1 < 2) {
    //print inputs
    for (i = 0; i < icount; i++) {
        printf("%d ", values[i + 2]);
    }
    printf("|");

    //run through temp, calculate outputs
    for (i = 0; i < scount; i++) {
        struct directive step = temp[i];
        if (strcmp(step.gate, "NOT") == 0) {
            NOT(values, step.inputs[0], step.outputs[0]);
        }
        if (strcmp(step.gate, "AND") == 0) {
            AND(values, step.inputs[0], step.inputs[1], step.outputs[0]);
        }
        if (strcmp(step.gate, "OR") == 0) {
            OR(values, step.inputs[0], step.inputs[1], step.outputs[0]);
        }
        if (strcmp(step.gate, "NAND") == 0) {
            NAND(values, step.inputs[0], step.inputs[1], step.outputs[0]);
        }
        if (strcmp(step.gate, "NOR") == 0) {
            NOR(values, step.inputs[0], step.inputs[1], step.outputs[0]);
        }
        if (strcmp(step.gate, "XOR") == 0) {
            XOR(values, step.inputs[0], step.inputs[1], step.outputs[0]);
        }
        if (strcmp(step.gate, "PASS") == 0) {
            PASS(values, step.inputs[0], step.outputs[0]);
        }
        if (strcmp(step.gate, "DECODER") == 0) {
            DECODER(values, step.n, step.inputs, step.outputs);
        }
        if (strcmp(step.gate, "MULTIPLEXER") == 0) {
            MUX(values, step.s, step.inputs, step.selectors, step.outputs[0]);
        }
        
    }

    //print outputs
    for (i = 0; i < ocount; i++) {
        printf(" %d", values[icount + i + 2]);
    }
    printf("\n");

    if (!incrementInputs(values, icount)) {
        break;
    }
    
}




    for (i = 0; i < icount; i++) {
    free(names[i + 2]);
    }

for (i = 0; i < ocount; i++) {
    free(names[i + icount + 2]);
  
}

for (int i = 0; i < scount; i++) {
  free(temp[i].inputs);
  free(temp[i].outputs);
  free(temp[i].selectors);
}


free(names[0]);
free(names[1]);
//free(names[size-1]);

free(values);
free(temp);
free(names);

return 0;

}