/* datebook.c * * Copyright (C) 1999 by Judd Montgomery * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */ #include "config.h" #include "i18n.h" #include #include #include #include #include #include #include /*#include */ /*#include */ #include #include #include "datebook.h" #include "utils.h" #include "log.h" #include "prefs.h" #if defined(WITH_JAPANESE) #include "japanese.h" #endif #ifndef FALSE #define FALSE 0 #endif #ifndef TRUE #define TRUE 1 #endif #define DATEBOOK_EOF 7 int compareTimesToDay(struct tm *tm1, struct tm *tm2); int datebook_compare(const void *v1, const void *v2) { AppointmentList **al1, **al2; struct Appointment *a1, *a2; al1=(AppointmentList **)v1; al2=(AppointmentList **)v2; a1=&((*al1)->ma.a); a2=&((*al2)->ma.a); return (a1->begin.tm_hour > a2->begin.tm_hour); } static int datebook_sort(AppointmentList **al) { AppointmentList *temp_al; AppointmentList **sort_al; int count, i; /* Count the entries in the list */ for (count=0, temp_al=*al; temp_al; temp_al=temp_al->next, count++) { ; } if (count<2) { /* We don't have to sort less than 2 items */ return 0; } /* Allocate an array to be qsorted */ sort_al = calloc(count, sizeof(AppointmentList *)); if (!sort_al) { jpilot_logf(LOG_WARN, _("Out of Memory\n")); return 0; } /* Set our array to be a list of pointers to the nodes in the linked list */ for (i=0, temp_al=*al; temp_al; temp_al=temp_al->next, i++) { sort_al[i] = temp_al; } /* qsort them */ qsort(sort_al, count, sizeof(AppointmentList *), datebook_compare); /* Put the linked list in the order of the array */ sort_al[count-1]->next = NULL; for (i=count-1; i; i--) { sort_al[i-1]->next=sort_al[i]; } *al = sort_al[0]; free(sort_al); return 0; } #ifdef USE_DB3 int db3_hack_date(struct Appointment *a, struct tm *today) { if (today==NULL) { return 0; } if (!a->note) { return 0; } if (strlen(a->note) > 8) { if ((a->note[0]=='#') && (a->note[1]=='#')) { if (a->note[2]=='f') { /* We found some silly hack, so we lie about the date */ memcpy(&(a->begin), today, sizeof(struct tm)); memcpy(&(a->end), today, sizeof(struct tm)); /* If the appointment has an end date, and today is past the end * date, because of this hack we would never be able to view * it anymore (or delete it). */ if (!(a->repeatForever)) { if (compareTimesToDay(today, &(a->repeatEnd))==1) { /* end date is before start date, illegal appointment */ /* make it legal, by only floating upto the end date */ memcpy(&(a->begin), &(a->repeatEnd), sizeof(struct tm)); memcpy(&(a->end), &(a->repeatEnd), sizeof(struct tm)); } } } } } return 0; } /* Returns a bitmask * 0 if not a floating OR * bitmask: * 1 if float, * 2 if completed float * 16 if float has a note */ int db3_is_float(struct Appointment *a, int *category) { int len, mask=0; *category=0; if (!a->note) { return 0; } len = strlen(a->note); if (len > 8) { if ((a->note[0]=='#') && (a->note[1]=='#')) { *category = a->note[4] - '@'; if (len > 10) { mask=mask | DB3_FLOAT_HAS_NOTE; } if (a->note[2]=='f') { mask=mask | DB3_FLOAT; return mask; } if (a->note[2]=='c') { mask=mask | DB3_FLOAT_COMPLETE; return mask; } } } return mask; } #endif static int pc_datebook_read_next_rec(FILE *in, MyAppointment *ma) { PCRecordHeader header; int rec_len, num; char *record; /*DatebookRecType rt; */ if (feof(in)) { return DATEBOOK_EOF; } num = fread(&header, sizeof(header), 1, in); if (num != 1) { if (ferror(in)) { jpilot_logf(LOG_DEBUG, _("Error on reading %s\n"), "DatebookDB.pdb"); return DATEBOOK_EOF; } if (feof(in)) { return DATEBOOK_EOF; } } rec_len = header.rec_len; ma->rt = header.rt; ma->attrib = header.attrib; ma->unique_id = header.unique_id; record = malloc(rec_len); if (!record) { jpilot_logf(LOG_WARN, _("Out of memory\n")); return DATEBOOK_EOF; } num = fread(record, rec_len, 1, in); if (num != 1) { if (ferror(in)) { jpilot_logf(LOG_DEBUG, _("Error on reading %s\n"), "DatebookDB.pc"); free(record); return DATEBOOK_EOF; } } num = unpack_Appointment(&(ma->a), record, rec_len); free(record); if (num<=0) { return -1; } return 0; } #ifdef JPILOT_DEBUG int does_pc_appt_exist(int unique_id, PCRecType rt) { FILE *pc_in; PCRecordHeader header; int num; /*jpilot_logf(LOG_DEBUG, "looking for unique id = %d\n",unique_id); */ /*jpilot_logf(LOG_DEBUG, "looking for rt = %d\n",rt); */ pc_in=open_file("DatebookDB.pc", "r"); if (pc_in==NULL) { jpilot_logf(LOG_WARN, "Couldn't open PC records file\n"); return 0; } while(!feof(pc_in)) { num = fread(&header, sizeof(header), 1, pc_in); if (num != 1) { if (ferror(pc_in)) { jpilot_logf(LOG_DEBUG, _("Error on reading %s\n"), "DatebookDB.pc"); break; } if (feof(pc_in)) { break; } } if ((header.unique_id==unique_id) && (header.rt==rt)) { fclose(pc_in); return 1; } if (fseek(pc_in, header.rec_len, SEEK_CUR)) { jpilot_logf(LOG_WARN, "fseek failed\n"); } } fclose(pc_in); return 0; } #endif int pc_datebook_write(struct Appointment *a, PCRecType rt, unsigned char attrib) { PCRecordHeader header; FILE *out; char record[65536]; int rec_len; unsigned int next_unique_id; get_next_unique_pc_id(&next_unique_id); #ifdef JPILOT_DEBUG jpilot_logf(LOG_DEBUG, "next unique id = %d\n",next_unique_id); #endif out = open_file("DatebookDB.pc", "a"); if (!out) { jpilot_logf(LOG_WARN, _("Error opening %s\n"), "DatebookDB.pc"); return -1; } rec_len = pack_Appointment(a, record, 65535); if (!rec_len) { PRINT_FILE_LINE; jpilot_logf(LOG_WARN, "pack_Appointment %s\n", _("error")); fclose(out); return -1; } header.rec_len=rec_len; header.rt=rt; header.attrib=attrib; header.unique_id=next_unique_id; fwrite(&header, sizeof(header), 1, out); fwrite(record, rec_len, 1, out); fflush(out); fclose(out); return 0; } void free_AppointmentList(AppointmentList **al) { AppointmentList *temp_al, *temp_al_next; for (temp_al = *al; temp_al; temp_al=temp_al_next) { free_Appointment(&(temp_al->ma.a)); temp_al_next = temp_al->next; free(temp_al); } *al = NULL; } /* */ /*If a copy is made, then it should be freed through free_Appointment */ /* */ int datebook_copy_appointment(struct Appointment *a1, struct Appointment **a2) { *a2=malloc(sizeof(struct Appointment)); if (!(*a2)) { jpilot_logf(LOG_WARN, _("Out of memory\n")); return -1; } memcpy(*a2, a1, sizeof(struct Appointment)); (*a2)->exception = (struct tm *)malloc(a1->exceptions * sizeof(struct tm)); if (!(*a2)->exception) { jpilot_logf(LOG_WARN, _("Out of memory\n")); return -1; } memcpy((*a2)->exception, a1->exception, a1->exceptions * sizeof(struct tm)); if (a1->description) { (*a2)->description=strdup(a1->description); } if (a1->note) { (*a2)->note=strdup(a1->note); } return 0; } /* Year is years since 1900 */ /* Mon is 0-11 */ /* Day is 1-31 */ /* */ int datebook_add_exception(struct Appointment *a, int year, int mon, int day) { struct tm *new_exception, *Ptm; if (a->exceptions==0) { a->exception=NULL; } new_exception = malloc((a->exceptions + 1) * sizeof(struct tm)); if (!new_exception) { jpilot_logf(LOG_WARN, _("Out of memory\n")); return -1; } memcpy(new_exception, a->exception, (a->exceptions) * sizeof(struct tm)); free(a->exception); a->exceptions++; a->exception = new_exception; Ptm = &(a->exception[a->exceptions - 1]); Ptm->tm_year = year; Ptm->tm_mon = mon; Ptm->tm_mday = day; Ptm->tm_hour = 0; Ptm->tm_min = 0; Ptm->tm_sec = 0; Ptm->tm_isdst = -1; mktime(Ptm); return 0; } int dateToDays(struct tm *tm1) { time_t t1; struct tm *gmt; static time_t adj = -1; int isdst; isdst = tm1->tm_isdst; tm1->tm_isdst = -1; t1 = mktime(tm1); if (-1 == adj) { gmt = gmtime(&t1); adj = t1 - mktime(gmt); } tm1->tm_isdst = isdst; return (t1+adj)/86400; /*There are 86400 secs in a day */ } /*returns 0 if times equal */ /*returns 1 if time1 is greater (later) */ /*returns 2 if time2 is greater (later) */ /* int compareTimesToSec(struct tm *tm1, struct tm *tm2) { time_t t1, t2; t1 = mktime(tm1); t2 = mktime(tm2); if (t1 > t2) return 1; if (t1 < t2) return 2; return 0; } */ /*returns 0 if times equal */ /*returns 1 if time1 is greater (later) */ /*returns 2 if time2 is greater (later) */ int compareTimesToDay(struct tm *tm1, struct tm *tm2) { unsigned int t1, t2; t1 = tm1->tm_year*366+tm1->tm_yday; t2 = tm2->tm_year*366+tm2->tm_yday; if (t1 > t2 ) return 1; if (t1 < t2 ) return 2; return 0; } unsigned int isApptOnDate(struct Appointment *a, struct tm *date) { unsigned int ret; unsigned int r; int begin_days, days, week1, week2; int dow, ndim; int i; /*days_in_month is adjusted for leap year with the date */ /*structure */ int days_in_month[]={31,28,31,30,31,30,31,31,30,31,30,31 }; ret = FALSE; if (!date) { return FALSE; } /*Leap year */ if ((date->tm_year%4 == 0) && !(((date->tm_year+1900)%100==0) && ((date->tm_year+1900)%400!=0)) ) { days_in_month[1]++; } /*See if the appointment starts after date */ r = compareTimesToDay(&(a->begin), date); if (r == 1) { return FALSE; } if (r == 0) { ret = TRUE; } /*If the appointment has an end date, see that we are not past it */ if (!(a->repeatForever)) { r = compareTimesToDay(&(a->repeatEnd), date); if (r == 2) { return FALSE; } } switch (a->repeatType) { case repeatNone: break; case repeatDaily: /*See if this appt repeats on this day */ begin_days = dateToDays(&(a->begin)); days = dateToDays(date); ret = (((days - begin_days)%(a->repeatFrequency))==0); break; case repeatWeekly: get_month_info(date->tm_mon, date->tm_mday, date->tm_year, &dow, &ndim); /*See if the appointment repeats on this day */ /* if (a->repeatWeekstart > 1) { a->repeatWeekstart = 1; } if (a->repeatWeekstart < 0) { a->repeatWeekstart = 0; } */ /*if (!(a->repeatDays[dow + a->repeatWeekstart])) { */ if (!(a->repeatDays[dow])) { ret = FALSE; break; } /*See if we are in a week that is repeated in */ begin_days = dateToDays(&(a->begin)); days = dateToDays(date); ret = (((days - begin_days)/7)%(a->repeatFrequency)==0); break; case repeatMonthlyByDay: /*See if we are in a month that is repeated in */ ret = (((date->tm_year - a->begin.tm_year)*12 + (date->tm_mon - a->begin.tm_mon))%(a->repeatFrequency)==0); if (!ret) { break; } /*If the days of the week match - good */ /*e.g. Monday or Thur, etc. */ if (a->repeatDay%7 != date->tm_wday) { ret = FALSE; break; } /*Are they both in the same week in the month */ /*e.g. The 3rd Mon, or the 2nd Fri, etc. */ week1 = a->repeatDay/7; week2 = (date->tm_mday - 1)/7; if (week1 != week2) { ret = FALSE; } /*See if the appointment repeats on the last week of the month */ /*and this is the 4th, and last. */ if (week1 > 3) { if ((date->tm_mday + 7) > days_in_month[date->tm_mon]) { ret = TRUE; } } break; case repeatMonthlyByDate: /*See if we are in a repeating month */ ret = (((date->tm_year - a->begin.tm_year)*12 + (date->tm_mon - a->begin.tm_mon))%(a->repeatFrequency) == 0); if (!ret) { break; } /*See if this is the date that the appt repeats on */ if (date->tm_mday == a->begin.tm_mday) { ret = TRUE; break; } /*If appt occurs after the last day of the month and this date */ /*is the last day of the month then it occurs today */ ret = ((a->begin.tm_mday > days_in_month[date->tm_mon]) && (date->tm_mday == days_in_month[date->tm_mon])); break; case repeatYearly: if ((date->tm_year - a->begin.tm_year)%(a->repeatFrequency) != 0) { ret = FALSE; break; } if ((date->tm_mday == a->begin.tm_mday) && (date->tm_mon == a->begin.tm_mon)) { ret = TRUE; break; } /*Take care of Feb 29th (Leap Day) */ if ((a->begin.tm_mon == 1) && (a->begin.tm_mday == 29) && (date->tm_mon == 1) && (date->tm_mday == 28)) { ret = TRUE; break; } break; default: jpilot_logf(LOG_WARN, "unknown repeatType (%d) found in DatebookDB\n", a->repeatType); ret = FALSE; }/*switch */ if (ret) { /*Check for exceptions */ for (i=0; iexceptions; i++) { #ifdef JPILOT_DEBUG jpilot_logf(LOG_DEBUG, "exception %d mon %d\n", i, a->exception[i].tm_mon); jpilot_logf(LOG_DEBUG, "exception %d day %d\n", i, a->exception[i].tm_mday); jpilot_logf(LOG_DEBUG, "exception %d year %d\n", i, a->exception[i].tm_year); jpilot_logf(LOG_DEBUG, "exception %d yday %d\n", i, a->exception[i].tm_yday); jpilot_logf(LOG_DEBUG, "today is yday %d\n", date->tm_yday); #endif begin_days = dateToDays(&(a->exception[i])); days = dateToDays(date); if (begin_days == days) { ret = FALSE; break; } } } return ret; } int get_datebook_app_info(struct AppointmentAppInfo *ai) { FILE *in; int num; unsigned int rec_size; char *buf; RawDBHeader rdbh; DBHeader dbh; in = open_file("DatebookDB.pdb", "r"); if (!in) { jpilot_logf(LOG_WARN, _("Error opening %s\n"), "DatebookDB.pdb"); return -1; } num = fread(&rdbh, sizeof(RawDBHeader), 1, in); if (num != 1) { if (ferror(in)) { jpilot_logf(LOG_WARN, _("Error reading %s\n"), "DatebookDB.pdb"); fclose(in); return -1; } if (feof(in)) { fclose(in); return -1; } } raw_header_to_header(&rdbh, &dbh); num = get_app_info_size(in, &rec_size); if (num) { fclose(in); return -1; } fseek(in, dbh.app_info_offset, SEEK_SET); buf=malloc(rec_size); if (!buf) { fclose(in); return -1; } num = fread(buf, rec_size, 1, in); if (num != 1) { if (ferror(in)) { fclose(in); free(buf); jpilot_logf(LOG_WARN, _("Error reading %s\n"), "DatebookDB.pdb"); return -1; } } num = unpack_AppointmentAppInfo(ai, buf, rec_size); free(buf); if (num<=0) { fclose(in); return -1; } fclose(in); return 0; } int datebook_create_bogus_record(char *record, int size, int *rec_len) { struct Appointment a; char desc[]="jpilot hack"; memset(&a, '\0', sizeof(struct Appointment)); a.event=1; a.begin.tm_sec=0; a.begin.tm_min=0; a.begin.tm_hour=11; a.begin.tm_mday=1; a.begin.tm_mon=0; a.begin.tm_year=80; a.begin.tm_isdst=-1; a.end.tm_sec=0; a.end.tm_min=0; a.end.tm_hour=11; a.end.tm_mday=1; a.end.tm_mon=0; a.end.tm_year=80; a.end.tm_isdst=-1; mktime(&a.begin); mktime(&a.end); a.description=desc; *rec_len = pack_Appointment(&a, record, size); if (!*rec_len) { return -1; } return 0; } int weed_datebook_list(AppointmentList **al, int mon, int year) { struct tm tm_fdom; struct tm tm_ldom; AppointmentList *prev_al, *next_al, *tal; int r, dow, ndim; int trash_it; bzero(&tm_fdom, sizeof(tm_fdom)); tm_fdom.tm_hour=11; tm_fdom.tm_mday=1; tm_fdom.tm_mon=mon; tm_fdom.tm_year=year; get_month_info(mon, 1, year, &dow, &ndim); memcpy(&tm_ldom, &tm_fdom, sizeof(tm_fdom)); tm_ldom.tm_mday=ndim; mktime(&tm_fdom); mktime(&tm_ldom); /* * We are going to try to shrink the linked list since we are about to * search though it ~30 times. */ for (prev_al=NULL, tal=*al; tal; tal = next_al) { trash_it=0; /* See if its a non-repeating appointment that isn't this month/year */ if (tal->ma.a.repeatType==repeatNone) { if ((tal->ma.a.begin.tm_year!=year) || (tal->ma.a.begin.tm_mon!=mon)) { trash_it=1; goto trash; } } /* See if its a yearly appointment that doesn't reoccur on this month */ if (tal->ma.a.repeatType==repeatYearly) { if ((tal->ma.a.begin.tm_mon!=mon)) { trash_it=1; goto trash; } } /*See if the appointment starts after the last day of the month */ r = compareTimesToDay(&(tal->ma.a.begin), &tm_ldom); if (r == 1) { trash_it=1; goto trash; } /*If the appointment has an end date, see if it ended before the 1st */ if (!(tal->ma.a.repeatForever)) { r = compareTimesToDay(&(tal->ma.a.repeatEnd), &tm_fdom); if (r == 2) { trash_it=1; goto trash; } } /* Remove it from this list if it can't help us */ trash: if (trash_it) { if (prev_al) { prev_al->next=tal->next; } else { *al=tal->next; } next_al=tal->next; free_Appointment(&(tal->ma.a)); free(tal); } else { prev_al=tal; next_al=tal->next; } } return 0; } int appointment_on_day_list(int mon, int year, int *mask) { struct tm tm_dom; AppointmentList *tal, *al; long show_modified; long show_deleted; int i, dow, ndim, num; int bit; bzero(&tm_dom, sizeof(tm_dom)); tm_dom.tm_hour=11; tm_dom.tm_mday=1; tm_dom.tm_mon=mon; tm_dom.tm_year=year; al = NULL; num = get_days_appointments(&al, NULL); get_month_info(mon, 1, year, &dow, &ndim); weed_datebook_list(&al, mon, year); *mask = 0; get_pref(PREF_SHOW_MODIFIED, &show_modified, NULL); get_pref(PREF_SHOW_DELETED, &show_deleted, NULL); for (i=0, bit=1; inext) { if (tal->ma.rt == MODIFIED_PALM_REC) { if (!show_modified) { continue; } } if (tal->ma.rt == DELETED_PALM_REC) { if (!show_deleted) { continue; } } if (isApptOnDate(&(tal->ma.a), &tm_dom)) { *mask = *mask | bit; break; } } } free_AppointmentList(&al); return 0; } /* * If Null is passed in for date, then all appointments will be returned */ int get_days_appointments(AppointmentList **appointment_list, struct tm *now) { FILE *in, *pc_in; char *buf; int num_records, i, num, r; unsigned int offset, prev_offset, next_offset, rec_size; int out_of_order; long fpos; /*file position indicator */ unsigned char attrib; unsigned int unique_id; mem_rec_header *mem_rh, *temp_mem_rh, *last_mem_rh; record_header rh; RawDBHeader rdbh; DBHeader dbh; struct Appointment a; AppointmentList *temp_appointment_list; MyAppointment ma; #ifdef USE_DB3 long use_db3_tags; time_t ltime; struct tm *today; #endif #ifdef USE_DB3 time(<ime); today = localtime(<ime); get_pref(PREF_USE_DB3, &use_db3_tags, NULL); #endif mem_rh = last_mem_rh = NULL; in = open_file("DatebookDB.pdb", "r"); if (!in) { jpilot_logf(LOG_WARN, _("Error opening %s\n"), "DatebookDB.pdb"); return -1; } /*Read the database header */ num = fread(&rdbh, sizeof(RawDBHeader), 1, in); if (num != 1) { if (ferror(in)) { jpilot_logf(LOG_WARN, _("Error reading %s\n"), "DatebookDB.pdb"); fclose(in); return -1; } if (feof(in)) { return DATEBOOK_EOF; } } raw_header_to_header(&rdbh, &dbh); jpilot_logf(LOG_DEBUG, "db_name = %s\n", dbh.db_name); jpilot_logf(LOG_DEBUG, "num records = %d\n", dbh.number_of_records); jpilot_logf(LOG_DEBUG, "app info offset = %d\n", dbh.app_info_offset); /*Read each record entry header */ num_records = dbh.number_of_records; out_of_order = 0; prev_offset = 0; for (i=1; inext = NULL; temp_mem_rh->rec_num = i; temp_mem_rh->offset = offset; temp_mem_rh->attrib = rh.attrib; temp_mem_rh->unique_id = (rh.unique_ID[0]*256+rh.unique_ID[1])*256+rh.unique_ID[2]; if (mem_rh == NULL) { mem_rh = temp_mem_rh; last_mem_rh = temp_mem_rh; } else { last_mem_rh->next = temp_mem_rh; last_mem_rh = temp_mem_rh; } } temp_mem_rh = mem_rh; if (num_records) { if (out_of_order) { find_next_offset(mem_rh, 0, &next_offset, &attrib, &unique_id); } else { if (mem_rh) { next_offset = mem_rh->offset; attrib = mem_rh->attrib; unique_id = mem_rh->unique_id; } } fseek(in, next_offset, SEEK_SET); while(!feof(in)) { fpos = ftell(in); if (out_of_order) { find_next_offset(mem_rh, fpos, &next_offset, &attrib, &unique_id); } else { next_offset = 0xFFFFFF; if (temp_mem_rh) { attrib = temp_mem_rh->attrib; unique_id = temp_mem_rh->unique_id; if (temp_mem_rh->next) { temp_mem_rh = temp_mem_rh->next; next_offset = temp_mem_rh->offset; } } } rec_size = next_offset - fpos; #ifdef JPILOT_DEBUG jpilot_logf(LOG_DEBUG, "rec_size = %u\n",rec_size); jpilot_logf(LOG_DEBUG, "fpos,next_offset = %u %u\n",fpos,next_offset); jpilot_logf(LOG_DEBUG, "----------\n"); #endif buf = malloc(rec_size); if (!buf) { jpilot_logf(LOG_WARN, _("Out of memory\n")); break; } num = fread(buf, rec_size, 1, in); if ((num!=1)) { if (ferror(in)) { free(buf); break; } } num = unpack_Appointment(&a, buf, rec_size); if (num<=0) { free(buf); /*jpilot_logf(LOG_INFO, "unpack_Appointment failed\n"); */ /*jpilot_logf(LOG_INFO, "rec_size = %d\n", rec_size); */ continue; } free(buf); #if defined(WITH_JAPANESE) if (a.description != NULL) Sjis2Euc(a.description, 65536); if (a.note != NULL) Sjis2Euc(a.note, 65536); #endif #ifdef USE_DB3 if (use_db3_tags) { db3_hack_date(&a, today); } #endif /* if ( ((now==NULL) || isApptOnDate(&a, now)) && (!does_pc_appt_exist(unique_id, PALM_REC))) {*/ if ( ((now==NULL) || isApptOnDate(&a, now)) ) { temp_appointment_list = malloc(sizeof(AppointmentList)); if (!temp_appointment_list) { jpilot_logf(LOG_WARN, _("Out of memory")); break; } memcpy(&(temp_appointment_list->ma.a), &a, sizeof(struct Appointment)); /*temp_appointment_list->ma.a = temp_a; */ temp_appointment_list->app_type = DATEBOOK; temp_appointment_list->ma.rt = PALM_REC; temp_appointment_list->ma.attrib = attrib; temp_appointment_list->ma.unique_id = unique_id; temp_appointment_list->next = *appointment_list; *appointment_list = temp_appointment_list; } } } fclose(in); free_mem_rec_header(&mem_rh); /* */ /*Get the appointments out of the PC database */ /* */ pc_in = open_file("DatebookDB.pc", "r"); if (pc_in==NULL) { jpilot_logf(LOG_WARN, _("Error opening %s\n"), "DatebookDB.pc"); return 0; } /*r = pc_datebook_read_file_header(pc_in); */ while(!feof(pc_in)) { r = pc_datebook_read_next_rec(pc_in, &ma); if (r==DATEBOOK_EOF) break; if (r<0) break; #ifdef USE_DB3 if (use_db3_tags) { db3_hack_date(&(ma.a), today); } #endif if ( ((now==NULL) || isApptOnDate(&(ma.a), now)) &&(ma.rt!=DELETED_PC_REC) &&(ma.rt!=DELETED_PALM_REC) &&(ma.rt!=MODIFIED_PALM_REC) &&(ma.rt!=DELETED_DELETED_PALM_REC)) { temp_appointment_list = malloc(sizeof(AppointmentList)); if (!temp_appointment_list) { jpilot_logf(LOG_WARN, _("Out of memory\n")); break; } memcpy(&(temp_appointment_list->ma), &ma, sizeof(MyAppointment)); temp_appointment_list->app_type = DATEBOOK; temp_appointment_list->next = *appointment_list; *appointment_list = temp_appointment_list; /*temp_appointment_list->ma.attrib=0; */ } else { /*this doesnt really free it, just the string pointers */ free_Appointment(&(ma.a)); } if ((ma.rt==DELETED_PALM_REC) || (ma.rt==MODIFIED_PALM_REC)) { for (temp_appointment_list = *appointment_list; temp_appointment_list; temp_appointment_list=temp_appointment_list->next) { if (temp_appointment_list->ma.unique_id == ma.unique_id) { temp_appointment_list->ma.rt = ma.rt; } } } } fclose(pc_in); /* If they ask for all appointments don't sort them */ /* if (now) { */ datebook_sort(appointment_list); /*}*/ jpilot_logf(LOG_DEBUG, "Leaving get_days_apppointments\n"); return 0; }