jbe@352: #include <stdlib.h>
jbe@352: #include <stdio.h>
jbe@352: #include <string.h>
jbe@352: #include <libpq-fe.h>
jbe@352: #include <search.h>
jbe@352: 
jbe@374: static int logging = 0;
jbe@374: 
jbe@352: static char *escapeLiteral(PGconn *conn, const char *str, size_t len) {
jbe@352:   // provides compatibility for PostgreSQL versions prior 9.0
jbe@352:   // in future: return PQescapeLiteral(conn, str, len);
jbe@352:   char *res;
jbe@352:   size_t res_len;
jbe@352:   res = malloc(2*len+3);
jbe@358:   if (!res) return NULL;
jbe@352:   res[0] = '\'';
jbe@352:   res_len = PQescapeStringConn(conn, res+1, str, len, NULL);
jbe@352:   res[res_len+1] = '\'';
jbe@352:   res[res_len+2] = 0;
jbe@352:   return res;
jbe@352: }
jbe@352: 
jbe@352: static void freemem(void *ptr) {
jbe@352:   // to be used for "escapeLiteral" function
jbe@352:   // provides compatibility for PostgreSQL versions prior 9.0
jbe@352:   // in future: PQfreemem(ptr);
jbe@352:   free(ptr);
jbe@352: }
jbe@352: 
jbe@372: // column numbers when querying "individual_suggestion_ranking" view in function main():
jbe@352: #define COL_MEMBER_ID     0
jbe@352: #define COL_WEIGHT        1
jbe@352: #define COL_PREFERENCE    2
jbe@352: #define COL_SUGGESTION_ID 3
jbe@352: 
jbe@372: // data structure for a candidate (in this case a suggestion) to the proportional runoff system:
jbe@353: struct candidate {
jbe@372:   char *key;              // identifier of the candidate, which is the "suggestion_id" string
jbe@372:   double score_per_step;  // added score per step
jbe@372:   double score;           // current score of candidate; a score of 1.0 is needed to survive a round
jbe@372:   int seat;               // equals 0 for unseated candidates, or contains rank number
jbe@353: };
jbe@353: 
jbe@372: // compare two integers stored as strings (invocation like strcmp):
jbe@369: static int compare_id(char *id1, char *id2) {
jbe@369:   int ldiff;
jbe@369:   ldiff = strlen(id1) - strlen(id2);
jbe@369:   if (ldiff) return ldiff;
jbe@369:   else return strcmp(id1, id2);
jbe@369: }
jbe@369: 
jbe@372: // compare two candidates by their key (invocation like strcmp):
jbe@353: static int compare_candidate(struct candidate *c1, struct candidate *c2) {
jbe@369:   return compare_id(c1->key, c2->key);
jbe@353: }
jbe@352: 
jbe@372: // candidates are stored as global variables due to the constrained twalk() interface:
jbe@353: static int candidate_count;
jbe@353: static struct candidate *candidates;
jbe@353: 
jbe@372: // function to be passed to twalk() to store candidates ordered in candidates[] array:
jbe@353: static void register_candidate(char **candidate_key, VISIT visit, int level) {
jbe@352:   if (visit == postorder || visit == leaf) {
jbe@353:     struct candidate *candidate;
jbe@353:     candidate = candidates + (candidate_count++);
jbe@382:     candidate->key  = *candidate_key;
jbe@382:     candidate->seat = 0;
jbe@376:     if (logging) printf("Candidate #%i is suggestion #%s.\n", candidate_count, candidate->key);
jbe@352:   }
jbe@352: }
jbe@352: 
jbe@372: // performs a binary search in candidates[] array to lookup a candidate by its key (which is the suggestion_id):
jbe@353: static struct candidate *candidate_by_key(char *candidate_key) {
jbe@353:   struct candidate *candidate;
jbe@353:   struct candidate compare;
jbe@353:   compare.key = candidate_key;
jbe@353:   candidate = bsearch(&compare, candidates, candidate_count, sizeof(struct candidate), (void *)compare_candidate);
jbe@353:   if (!candidate) {
jbe@356:     fprintf(stderr, "Candidate not found (should not happen).\n");
jbe@352:     abort();
jbe@352:   }
jbe@353:   return candidate;
jbe@352: }
jbe@352: 
jbe@372: // section of a ballot with equally ranked candidates:
jbe@352: struct ballot_section {
jbe@352:   int count;
jbe@353:   struct candidate **candidates;
jbe@352: };
jbe@352: 
jbe@372: // ballot of the proportional runoff system:
jbe@352: struct ballot {
jbe@372:   int weight;                         // if weight is greater than 1, then the ballot is counted multiple times
jbe@372:   struct ballot_section sections[4];  // 4 sections, most preferred candidates first
jbe@352: };
jbe@352: 
jbe@372: // determine candidate, which is assigned the next seat (starting with the worst rank):
jbe@356: static struct candidate *loser(int round_number, struct ballot *ballots, int ballot_count) {
jbe@372:   int i, j, k;    // index variables for loops
jbe@372:   int remaining;  // remaining candidates to be seated
jbe@372:   // reset scores of all candidates:
jbe@356:   for (i=0; i<candidate_count; i++) {
jbe@356:     candidates[i].score = 0.0;
jbe@356:   }
jbe@372:   // calculate remaining candidates to be seated:
jbe@356:   remaining = candidate_count - round_number;
jbe@373:   // repeat following loop, as long as there is more than one remaining candidate:
jbe@373:   while (remaining > 1) {
jbe@376:     if (logging) printf("There are %i remaining candidates.\n", remaining);
jbe@372:     double scale;  // factor to be later multiplied with score_per_step:
jbe@372:     // reset score_per_step for all candidates:
jbe@356:     for (i=0; i<candidate_count; i++) {
jbe@356:       candidates[i].score_per_step = 0.0;
jbe@356:     }
jbe@372:     // calculate score_per_step for all candidates:
jbe@356:     for (i=0; i<ballot_count; i++) {
jbe@356:       for (j=0; j<4; j++) {
jbe@356:         int matches = 0;
jbe@356:         for (k=0; k<ballots[i].sections[j].count; k++) {
jbe@356:           struct candidate *candidate;
jbe@356:           candidate = ballots[i].sections[j].candidates[k];
jbe@356:           if (candidate->score < 1.0 && !candidate->seat) matches++;
jbe@356:         }
jbe@356:         if (matches) {
jbe@356:           double score_inc;
jbe@368:           score_inc = (double)ballots[i].weight / (double)matches;
jbe@356:           for (k=0; k<ballots[i].sections[j].count; k++) {
jbe@356:             struct candidate *candidate;
jbe@356:             candidate = ballots[i].sections[j].candidates[k];
jbe@356:             if (candidate->score < 1.0 && !candidate->seat) {
jbe@356:               candidate->score_per_step += score_inc;
jbe@356:             }
jbe@356:           }
jbe@356:           break;
jbe@356:         }
jbe@356:       }
jbe@356:     }
jbe@372:     // calculate scale factor:
jbe@372:     scale = (double)0.0;  // 0.0 is used to indicate that there is no value yet
jbe@356:     for (i=0; i<candidate_count; i++) {
jbe@356:       double max_scale;
jbe@356:       if (candidates[i].score_per_step > 0.0) {
jbe@356:         max_scale = (1.0-candidates[i].score) / candidates[i].score_per_step;
jbe@368:         if (scale == 0.0 || max_scale <= scale) {
jbe@356:           scale = max_scale;
jbe@356:         }
jbe@356:       }
jbe@356:     }
jbe@372:     // add scale*score_per_step to each candidates score:
jbe@356:     for (i=0; i<candidate_count; i++) {
jbe@376:       int log_candidate = 0;
jbe@376:       if (logging && candidates[i].score < 1.0 && !candidates[i].seat) log_candidate = 1;
jbe@377:       if (log_candidate) printf("Score for suggestion #%s = %.4f+%.4f*%.4f", candidates[i].key, candidates[i].score, scale, candidates[i].score_per_step);
jbe@356:       if (candidates[i].score_per_step > 0.0) {
jbe@370:         double max_scale;
jbe@370:         max_scale = (1.0-candidates[i].score) / candidates[i].score_per_step;
jbe@370:         if (max_scale == scale) {
jbe@372:           // score of 1.0 should be reached, so we set score directly to avoid floating point errors:
jbe@356:           candidates[i].score = 1.0;
jbe@356:           remaining--;
jbe@356:         } else {
jbe@356:           candidates[i].score += scale * candidates[i].score_per_step;
jbe@356:           if (candidates[i].score >= 1.0) remaining--;
jbe@356:         }
jbe@376:       }
jbe@377:       if (log_candidate) {
jbe@377:         if (candidates[i].score >= 1.0) printf("=1\n");
jbe@377:         else printf("=%.4f\n", candidates[i].score);
jbe@377:       }
jbe@376:       // when there is only one candidate remaining, then break inner (and thus outer) loop:
jbe@376:       if (remaining <= 1) {
jbe@376:         break;
jbe@356:       }
jbe@356:     }
jbe@356:   }
jbe@372:   // return remaining candidate:
jbe@372:   for (i=0; i<candidate_count; i++) {
jbe@356:     if (candidates[i].score < 1.0 && !candidates[i].seat) return candidates+i;
jbe@356:   }
jbe@372:   // if there is no remaining candidate, then something went wrong:
jbe@356:   fprintf(stderr, "No remaining candidate (should not happen).");
jbe@356:   abort();
jbe@356: }
jbe@356: 
jbe@372: // write results to database:
jbe@359: static int write_ranks(PGconn *db, char *escaped_initiative_id, int final) {
jbe@358:   PGresult *res;
jbe@358:   char *cmd;
jbe@358:   int i;
jbe@359:   if (final) {
jbe@378:     if (asprintf(&cmd, "BEGIN; UPDATE \"initiative\" SET \"final_suggestion_order_calculated\" = TRUE WHERE \"id\" = %s; UPDATE \"suggestion\" SET \"proportional_order\" = NULL WHERE \"initiative_id\" = %s", escaped_initiative_id, escaped_initiative_id) < 0) {
jbe@359:       fprintf(stderr, "Could not prepare query string in memory.\n");
jbe@359:       abort();
jbe@359:     }
jbe@359:   } else {
jbe@378:     if (asprintf(&cmd, "BEGIN; UPDATE \"suggestion\" SET \"proportional_order\" = NULL WHERE \"initiative_id\" = %s", escaped_initiative_id) < 0) {
jbe@359:       fprintf(stderr, "Could not prepare query string in memory.\n");
jbe@359:       abort();
jbe@359:     }
jbe@358:   }
jbe@358:   res = PQexec(db, cmd);
jbe@358:   free(cmd);
jbe@358:   if (!res) {
jbe@358:     fprintf(stderr, "Error in pqlib while sending SQL command to initiate suggestion update.\n");
jbe@358:     return 1;
jbe@358:   } else if (
jbe@358:     PQresultStatus(res) != PGRES_COMMAND_OK &&
jbe@358:     PQresultStatus(res) != PGRES_TUPLES_OK
jbe@358:   ) {
jbe@358:     fprintf(stderr, "Error while executing SQL command to initiate suggestion update:\n%s", PQresultErrorMessage(res));
jbe@358:     PQclear(res);
jbe@358:     return 1;
jbe@358:   } else {
jbe@358:     PQclear(res);
jbe@358:   }
jbe@358:   for (i=0; i<candidate_count; i++) {
jbe@358:     char *escaped_suggestion_id;
jbe@358:     escaped_suggestion_id = escapeLiteral(db, candidates[i].key, strlen(candidates[i].key));
jbe@358:     if (!escaped_suggestion_id) {
jbe@358:       fprintf(stderr, "Could not escape literal in memory.\n");
jbe@358:       abort();
jbe@358:     }
jbe@358:     if (asprintf(&cmd, "UPDATE \"suggestion\" SET \"proportional_order\" = %i WHERE \"id\" = %s", candidates[i].seat, escaped_suggestion_id) < 0) {
jbe@358:       fprintf(stderr, "Could not prepare query string in memory.\n");
jbe@358:       abort();
jbe@358:     }
jbe@358:     freemem(escaped_suggestion_id);
jbe@358:     res = PQexec(db, cmd);
jbe@358:     free(cmd);
jbe@358:     if (!res) {
jbe@358:       fprintf(stderr, "Error in pqlib while sending SQL command to update suggestion order.\n");
jbe@358:     } else if (
jbe@358:       PQresultStatus(res) != PGRES_COMMAND_OK &&
jbe@358:       PQresultStatus(res) != PGRES_TUPLES_OK
jbe@358:     ) {
jbe@358:       fprintf(stderr, "Error while executing SQL command to update suggestion order:\n%s", PQresultErrorMessage(res));
jbe@358:       PQclear(res);
jbe@358:     } else {
jbe@358:       PQclear(res);
jbe@358:       continue;
jbe@358:     }
jbe@358:     res = PQexec(db, "ROLLBACK");
jbe@358:     if (res) PQclear(res);
jbe@358:     return 1;
jbe@358:   }
jbe@358:   res = PQexec(db, "COMMIT");
jbe@358:   if (!res) {
jbe@358:     fprintf(stderr, "Error in pqlib while sending SQL command to commit transaction.\n");
jbe@358:     return 1;
jbe@358:   } else if (
jbe@358:     PQresultStatus(res) != PGRES_COMMAND_OK &&
jbe@358:     PQresultStatus(res) != PGRES_TUPLES_OK
jbe@358:   ) {
jbe@358:     fprintf(stderr, "Error while executing SQL command to commit transaction:\n%s", PQresultErrorMessage(res));
jbe@358:     PQclear(res);
jbe@358:     return 1;
jbe@358:   } else {
jbe@358:     PQclear(res);
jbe@358:     return 0;
jbe@358:   }
jbe@358: }
jbe@358: 
jbe@372: // calculate ordering of suggestions for an initiative and call write_ranks() to write it to database:
jbe@359: static int process_initiative(PGconn *db, PGresult *res, char *escaped_initiative_id, int final) {
jbe@372:   int err;                 // variable to store an error condition (0 = success)
jbe@372:   int ballot_count = 1;    // number of ballots, must be initiatized to 1, due to loop below
jbe@372:   struct ballot *ballots;  // data structure containing the ballots
jbe@372:   int i;                   // index variable for loops
jbe@372:   // create candidates[] and ballots[] arrays:
jbe@355:   {
jbe@372:     void *candidate_tree = NULL;  // temporary structure to create a sorted unique list of all candidate keys
jbe@372:     int tuple_count;              // number of tuples returned from the database
jbe@372:     char *old_member_id = NULL;   // old member_id to be able to detect a new ballot in loops
jbe@372:     struct ballot *ballot;        // pointer to current ballot
jbe@372:     int candidates_in_sections[4] = {0, };  // number of candidates that have been placed in each section
jbe@372:     // reset candidate count:
jbe@367:     candidate_count = 0;
jbe@372:     // determine number of tuples:
jbe@359:     tuple_count = PQntuples(res);
jbe@372:     // trivial case, when there are no tuples:
jbe@359:     if (!tuple_count) {
jbe@359:       if (final) {
jbe@374:         if (logging) printf("No suggestions found, but marking initiative as finally calculated.\n");
jbe@359:         err = write_ranks(db, escaped_initiative_id, final);
jbe@374:         if (logging) printf("Done.\n");
jbe@359:         return err;
jbe@359:       } else {
jbe@374:         if (logging) printf("Nothing to do.\n");
jbe@359:         return 0;
jbe@359:       }
jbe@359:     }
jbe@372:     // calculate ballot_count and generate set of candidate keys (suggestion_id is used as key):
jbe@366:     for (i=0; i<tuple_count; i++) {
jbe@355:       char *member_id, *suggestion_id;
jbe@366:       member_id = PQgetvalue(res, i, COL_MEMBER_ID);
jbe@366:       suggestion_id = PQgetvalue(res, i, COL_SUGGESTION_ID);
jbe@369:       if (!candidate_tree || !tfind(suggestion_id, &candidate_tree, (void *)compare_id)) {
jbe@366:         candidate_count++;
jbe@369:         if (!tsearch(suggestion_id, &candidate_tree, (void *)compare_id)) {
jbe@366:           fprintf(stderr, "Insufficient memory while inserting into candidate tree.\n");
jbe@366:           abort();
jbe@352:         }
jbe@352:       }
jbe@366:       if (old_member_id && strcmp(old_member_id, member_id)) ballot_count++;
jbe@355:       old_member_id = member_id;
jbe@352:     }
jbe@372:     // allocate memory for candidates[] array:
jbe@355:     candidates = malloc(candidate_count * sizeof(struct candidate));
jbe@355:     if (!candidates) {
jbe@356:       fprintf(stderr, "Insufficient memory while creating candidate list.\n");
jbe@353:       abort();
jbe@352:     }
jbe@372:     // transform tree of candidate keys into sorted array:
jbe@372:     candidate_count = 0;  // needed by register_candidate()
jbe@355:     twalk(candidate_tree, (void *)register_candidate);
jbe@372:     // free memory of tree structure (tdestroy() is not available on all platforms):
jbe@369:     while (candidate_tree) tdelete(*(void **)candidate_tree, &candidate_tree, (void *)compare_id);
jbe@372:     // allocate memory for ballots[] array:
jbe@355:     ballots = calloc(ballot_count, sizeof(struct ballot));
jbe@355:     if (!ballots) {
jbe@356:       fprintf(stderr, "Insufficient memory while creating ballot list.\n");
jbe@353:       abort();
jbe@352:     }
jbe@372:     // set ballot weights, determine ballot section sizes, and verify preference values:
jbe@355:     ballot = ballots;
jbe@365:     old_member_id = NULL;
jbe@355:     for (i=0; i<tuple_count; i++) {
jbe@363:       char *member_id;
jbe@355:       int weight, preference;
jbe@352:       member_id = PQgetvalue(res, i, COL_MEMBER_ID);
jbe@355:       weight = (int)strtol(PQgetvalue(res, i, COL_WEIGHT), (char **)NULL, 10);
jbe@355:       if (weight <= 0) {
jbe@356:         fprintf(stderr, "Unexpected weight value.\n");
jbe@358:         free(ballots);
jbe@358:         free(candidates);
jbe@358:         return 1;
jbe@355:       }
jbe@352:       preference = (int)strtol(PQgetvalue(res, i, COL_PREFERENCE), (char **)NULL, 10);
jbe@352:       if (preference < 1 || preference > 4) {
jbe@356:         fprintf(stderr, "Unexpected preference value.\n");
jbe@358:         free(ballots);
jbe@358:         free(candidates);
jbe@358:         return 1;
jbe@352:       }
jbe@352:       preference--;
jbe@366:       if (old_member_id && strcmp(old_member_id, member_id)) ballot++;
jbe@355:       ballot->weight = weight;
jbe@355:       ballot->sections[preference].count++;
jbe@355:       old_member_id = member_id;
jbe@355:     }
jbe@372:     // allocate memory for ballot sections:
jbe@355:     for (i=0; i<ballot_count; i++) {
jbe@355:       int j;
jbe@355:       for (j=0; j<4; j++) {
jbe@355:         if (ballots[i].sections[j].count) {
jbe@355:           ballots[i].sections[j].candidates = malloc(ballots[i].sections[j].count * sizeof(struct candidate *));
jbe@355:           if (!ballots[i].sections[j].candidates) {
jbe@356:             fprintf(stderr, "Insufficient memory while creating ballot section.\n");
jbe@355:             abort();
jbe@355:           }
jbe@355:         }
jbe@355:       }
jbe@352:     }
jbe@372:     // fill ballot sections with candidate references:
jbe@365:     old_member_id = NULL;
jbe@355:     ballot = ballots;
jbe@365:     for (i=0; i<tuple_count; i++) {
jbe@355:       char *member_id, *suggestion_id;
jbe@355:       int preference;
jbe@366:       member_id = PQgetvalue(res, i, COL_MEMBER_ID);
jbe@366:       suggestion_id = PQgetvalue(res, i, COL_SUGGESTION_ID);
jbe@366:       preference = (int)strtol(PQgetvalue(res, i, COL_PREFERENCE), (char **)NULL, 10);
jbe@366:       preference--;
jbe@366:       if (old_member_id && strcmp(old_member_id, member_id)) {
jbe@366:         ballot++;
jbe@366:         candidates_in_sections[0] = 0;
jbe@366:         candidates_in_sections[1] = 0;
jbe@366:         candidates_in_sections[2] = 0;
jbe@366:         candidates_in_sections[3] = 0;
jbe@355:       }
jbe@366:       ballot->sections[preference].candidates[candidates_in_sections[preference]++] = candidate_by_key(suggestion_id);
jbe@355:       old_member_id = member_id;
jbe@352:     }
jbe@376:     // print ballots, if logging is enabled:
jbe@376:     if (logging) {
jbe@376:       for (i=0; i<ballot_count; i++) {
jbe@376:         int j;
jbe@376:         for (j=0; j<4; j++) {
jbe@376:           int k;
jbe@377:           printf("Ballot #%i, ", i+1);
jbe@377:           if (j==0) printf("1st");
jbe@377:           if (j==1) printf("2nd");
jbe@377:           if (j==2) printf("3rd");
jbe@377:           if (j==3) printf("4th");
jbe@377:           printf(" preference: ");
jbe@376:           for (k=0; k<ballots[i].sections[j].count; k++) {
jbe@377:             if (!k) printf("suggestions ");
jbe@377:             else printf(", ");
jbe@377:             printf("#%s", ballots[i].sections[j].candidates[k]->key);
jbe@376:           }
jbe@377:           if (!k) printf("empty");
jbe@377:           printf(".\n");
jbe@376:         }
jbe@376:       }
jbe@376:     }
jbe@352:   }
jbe@355: 
jbe@372:   // calculate ranks based on constructed data structures:
jbe@356:   for (i=0; i<candidate_count; i++) {
jbe@356:     struct candidate *candidate = loser(i, ballots, ballot_count);
jbe@356:     candidate->seat = candidate_count - i;
jbe@376:     if (logging) printf("Assigning rank #%i to suggestion #%s.\n", candidate_count-i, candidate->key);
jbe@356:   }
jbe@356: 
jbe@372:   // free ballots[] array:
jbe@354:   for (i=0; i<ballot_count; i++) {
jbe@354:     int j;
jbe@354:     for (j=0; j<4; j++) {
jbe@354:       if (ballots[i].sections[j].count) {
jbe@354:         free(ballots[i].sections[j].candidates);
jbe@354:       }
jbe@354:     }
jbe@354:   }
jbe@354:   free(ballots);
jbe@358: 
jbe@372:   // write results to database:
jbe@361:   if (final) {
jbe@374:     if (logging) printf("Writing final ranks to database.\n");
jbe@361:   } else {
jbe@374:     if (logging) printf("Writing ranks to database.\n");
jbe@361:   }
jbe@359:   err = write_ranks(db, escaped_initiative_id, final);
jbe@374:   if (logging) printf("Done.\n");
jbe@358: 
jbe@372:   // free candidates[] array:
jbe@358:   free(candidates);
jbe@358: 
jbe@372:   // return error code of write_ranks() call
jbe@358:   return err;
jbe@352: }
jbe@352: 
jbe@352: int main(int argc, char **argv) {
jbe@352: 
jbe@352:   // variable declarations:
jbe@352:   int err = 0;
jbe@352:   int i, count;
jbe@352:   char *conninfo;
jbe@352:   PGconn *db;
jbe@352:   PGresult *res;
jbe@352: 
jbe@352:   // parse command line:
jbe@352:   if (argc == 0) return 1;
jbe@352:   if (argc == 1 || !strcmp(argv[1], "-h") || !strcmp(argv[1], "--help")) {
jbe@352:     FILE *out;
jbe@352:     out = argc == 1 ? stderr : stdout;
jbe@362:     fprintf(out, "\n");
jbe@374:     fprintf(out, "Usage: %s [-v|--verbose] <conninfo>\n", argv[0]);
jbe@362:     fprintf(out, "\n");
jbe@362:     fprintf(out, "<conninfo> is specified by PostgreSQL's libpq,\n");
jbe@362:     fprintf(out, "see http://www.postgresql.org/docs/9.1/static/libpq-connect.html\n");
jbe@362:     fprintf(out, "\n");
jbe@362:     fprintf(out, "Example: %s dbname=liquid_feedback\n", argv[0]);
jbe@362:     fprintf(out, "\n");
jbe@352:     return argc == 1 ? 1 : 0;
jbe@352:   }
jbe@352:   {
jbe@352:     size_t len = 0;
jbe@374:     int argb = 1;
jbe@374:     if (
jbe@374:       argc >= 2 &&
jbe@374:       (!strcmp(argv[1], "-v") || !strcmp(argv[1], "--verbose"))
jbe@374:     ) {
jbe@374:       argb = 2;
jbe@374:       logging = 1;
jbe@374:     }
jbe@374:     for (i=argb; i<argc; i++) len += strlen(argv[i]) + 1;
jbe@352:     conninfo = malloc(len * sizeof(char));
jbe@352:     if (!conninfo) {
jbe@358:       fprintf(stderr, "Error: Could not allocate memory for conninfo string.\n");
jbe@358:       abort();
jbe@352:     }
jbe@352:     conninfo[0] = 0;
jbe@374:     for (i=argb; i<argc; i++) {
jbe@374:       if (i>argb) strcat(conninfo, " ");
jbe@352:       strcat(conninfo, argv[i]);
jbe@352:     }
jbe@352:   }
jbe@352: 
jbe@352:   // connect to database:
jbe@352:   db = PQconnectdb(conninfo);
jbe@352:   if (!db) {
jbe@358:     fprintf(stderr, "Error: Could not create database handle.\n");
jbe@352:     return 1;
jbe@352:   }
jbe@352:   if (PQstatus(db) != CONNECTION_OK) {
jbe@352:     fprintf(stderr, "Could not open connection:\n%s", PQerrorMessage(db));
jbe@352:     return 1;
jbe@352:   }
jbe@352: 
jbe@352:   // check initiatives:
jbe@352:   res = PQexec(db, "SELECT \"initiative_id\", \"final\" FROM \"initiative_suggestion_order_calculation\"");
jbe@352:   if (!res) {
jbe@358:     fprintf(stderr, "Error in pqlib while sending SQL command selecting initiatives to process.\n");
jbe@352:     err = 1;
jbe@352:   } else if (PQresultStatus(res) != PGRES_TUPLES_OK) {
jbe@358:     fprintf(stderr, "Error while executing SQL command selecting initiatives to process:\n%s", PQresultErrorMessage(res));
jbe@352:     err = 1;
jbe@352:     PQclear(res);
jbe@359:   } else if (PQnfields(res) < 2) {
jbe@359:     fprintf(stderr, "Too few columns returned by SQL command selecting initiatives to process.\n");
jbe@359:     err = 1;
jbe@359:     PQclear(res);
jbe@352:   } else {
jbe@352:     count = PQntuples(res);
jbe@374:     if (logging) printf("Number of initiatives to process: %i\n", count);
jbe@352:     for (i=0; i<count; i++) {
jbe@352:       char *initiative_id, *escaped_initiative_id;
jbe@359:       int final;
jbe@352:       char *cmd;
jbe@352:       PGresult *res2;
jbe@352:       initiative_id = PQgetvalue(res, i, 0);
jbe@359:       final = (PQgetvalue(res, i, 1)[0] == 't') ? 1 : 0;
jbe@376:       if (logging) printf("Processing initiative #%s:\n", initiative_id);
jbe@352:       escaped_initiative_id = escapeLiteral(db, initiative_id, strlen(initiative_id));
jbe@358:       if (!escaped_initiative_id) {
jbe@358:         fprintf(stderr, "Could not escape literal in memory.\n");
jbe@358:         abort();
jbe@358:       }
jbe@352:       if (asprintf(&cmd, "SELECT \"member_id\", \"weight\", \"preference\", \"suggestion_id\" FROM \"individual_suggestion_ranking\" WHERE \"initiative_id\" = %s ORDER BY \"member_id\", \"preference\"", escaped_initiative_id) < 0) {
jbe@352:         fprintf(stderr, "Could not prepare query string in memory.\n");
jbe@355:         abort();
jbe@352:       }
jbe@352:       res2 = PQexec(db, cmd);
jbe@352:       free(cmd);
jbe@352:       if (!res2) {
jbe@358:         fprintf(stderr, "Error in pqlib while sending SQL command selecting individual suggestion rankings.\n");
jbe@352:         err = 1;
jbe@352:       } else if (PQresultStatus(res2) != PGRES_TUPLES_OK) {
jbe@358:         fprintf(stderr, "Error while executing SQL command selecting individual suggestion rankings:\n%s", PQresultErrorMessage(res));
jbe@352:         err = 1;
jbe@352:         PQclear(res2);
jbe@356:       } else if (PQnfields(res2) < 4) {
jbe@358:         fprintf(stderr, "Too few columns returned by SQL command selecting individual suggestion rankings.\n");
jbe@356:         err = 1;
jbe@356:         PQclear(res2);
jbe@352:       } else {
jbe@359:         if (process_initiative(db, res2, escaped_initiative_id, final)) err = 1;
jbe@352:         PQclear(res2);
jbe@352:       }
jbe@352:       freemem(escaped_initiative_id);
jbe@352:     }
jbe@352:     PQclear(res);
jbe@352:   }
jbe@352: 
jbe@375:   // cleanup and exit:
jbe@352:   PQfinish(db);
jbe@374:   if (!err) {
jbe@374:     if (logging) printf("Successfully terminated.\n");
jbe@374:   } else {
jbe@374:     fprintf(stderr, "Exiting with error code %i.\n", err);
jbe@374:   }
jbe@352:   return err;
jbe@352: 
jbe@352: }