Subversion Repositories SvarDOS

Rev

Rev 614 | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 614 Rev 1678
1
/*
1
/*
2
 * This file is part of the pkg (SvarDOS) project.
2
 * This file is part of the pkg (SvarDOS) project.
3
 * Copyright (C) Mateusz Viste 2012-2022
3
 * Copyright (C) Mateusz Viste 2012-2024
4
 */
4
 */
5
 
5
 
6
#include <ctype.h>    /* toupper() */
6
#include <ctype.h>    /* toupper() */
7
#include <stdio.h>
7
#include <stdio.h>
8
#include <string.h>    /* strlen() */
8
#include <string.h>    /* strlen() */
9
#include <stdlib.h>    /* free() */
9
#include <stdlib.h>    /* free() */
10
#include <unistd.h>    /* rmdir(), unlink() */
10
#include <unistd.h>    /* rmdir(), unlink() */
11
#include <direct.h>  /* watcom needs this for the rmdir() prototype */
11
#include <direct.h>  /* watcom needs this for the rmdir() prototype */
12
 
12
 
13
#include "helpers.h"   /* slash2backslash() */
13
#include "helpers.h"   /* slash2backslash() */
14
#include "kprintf.h"
14
#include "kprintf.h"
15
 
15
 
16
#include "pkgrem.h"
16
#include "pkgrem.h"
17
 
17
 
18
 
18
 
19
struct dirliststruct {
19
struct dirliststruct {
20
  struct dirliststruct *next;
20
  struct dirliststruct *next;
21
  char dirname[2]; /* this must be the last item in the structure */
21
  char dirname[2]; /* this must be the last item in the structure */
22
};
22
};
23
 
23
 
24
 
24
 
25
/* adds a directory to dirlist, if not already present */
25
/* adds a directory to dirlist, if not already present */
26
static struct dirliststruct *rememberdir(struct dirliststruct *dirlist, const char *path) {
26
static struct dirliststruct *rememberdir(struct dirliststruct *dirlist, const char *path) {
27
  struct dirliststruct *res;
27
  struct dirliststruct *res;
28
  /* if already present, do nothing */
28
  /* if already present, do nothing */
29
  for (res = dirlist; res != NULL; res = res->next) {
29
  for (res = dirlist; res != NULL; res = res->next) {
30
    if (strcasecmp(res->dirname, path) == 0) return(dirlist);
30
    if (strcasecmp(res->dirname, path) == 0) return(dirlist);
31
  }
31
  }
32
  /* not in the list yet - add it */
32
  /* not in the list yet - add it */
33
  res = malloc(sizeof(struct dirliststruct) + strlen(path));
33
  res = malloc(sizeof(struct dirliststruct) + strlen(path));
34
  if (res == NULL) {  /* out of memory */
34
  if (res == NULL) {  /* out of memory */
35
    kitten_printf(4, 3, path); /* "Out of memory! Could not store directory %s!" */
35
    kitten_printf(4, 3, path); /* "Out of memory! Could not store directory %s!" */
36
    puts("");
36
    puts("");
37
    return(NULL);
37
    return(NULL);
38
  }
38
  }
39
  strcpy(res->dirname, path);
39
  strcpy(res->dirname, path);
40
  res->next = dirlist;
40
  res->next = dirlist;
41
  return(res);
41
  return(res);
42
}
42
}
43
 
43
 
44
 
44
 
45
/* explode a path into subdirectories, and remember each one inside dirlist */
45
/* explode a path into subdirectories, and remember each one inside dirlist */
46
static struct dirliststruct *rememberpath(struct dirliststruct *dirlist, char *path) {
46
static struct dirliststruct *rememberpath(struct dirliststruct *dirlist, char *path) {
47
  int x, gameover = 0;
47
  int x, gameover = 0;
48
  /* iterate on the path, and add each subdirectory */
48
  /* iterate on the path, and add each subdirectory */
49
  for (x = 0;; x++) {
49
  for (x = 0;; x++) {
50
    switch (path[x]) {
50
    switch (path[x]) {
51
      case 0:
51
      case 0:
52
        gameover = 1;
52
        gameover = 1;
53
      case '/':
53
      case '/':
54
      case '\\':
54
      case '\\':
55
        path[x] = 0;
55
        path[x] = 0;
56
        dirlist = rememberdir(dirlist, path);
56
        dirlist = rememberdir(dirlist, path);
57
        path[x] = '\\';
57
        path[x] = '\\';
58
    }
58
    }
59
    if (gameover != 0) break;
59
    if (gameover != 0) break;
60
  }
60
  }
61
  return(dirlist);
61
  return(dirlist);
62
}
62
}
63
 
63
 
64
 
64
 
65
/* removes a package from the system. Returns 0 on success, non-zero otherwise */
65
/* removes a package from the system. Returns 0 on success, non-zero otherwise */
66
int pkgrem(const char *pkgname, const char *dosdir) {
66
int pkgrem(const char *pkgname, const char *dosdir) {
67
  char fpath[256];
67
  char fpath[256];
68
  char buff[256];
68
  char buff[256];
69
  FILE *flist;
69
  FILE *flist;
70
  int lastdirsep;
70
  int lastdirsep;
71
  struct dirliststruct *dirlist = NULL; /* used to remember directories to remove */
71
  struct dirliststruct *dirlist = NULL; /* used to remember directories to remove */
72
 
72
 
73
  /* open the file %DOSDIR%\packages\pkgname.lst */
73
  /* open the (legacy) listing file at %DOSDIR%\packages\pkgname.lst
-
 
74
   * if not exists then fall back to appinfo\pkgname.lsm */
74
  sprintf(fpath, "%s\\packages\\%s.lst", dosdir, pkgname);
75
  sprintf(fpath, "%s\\packages\\%s.lst", dosdir, pkgname);
75
  flist = fopen(fpath, "rb");
76
  flist = fopen(fpath, "rb");
76
  if (flist == NULL) {
77
  if (flist == NULL) {
-
 
78
    sprintf(fpath, "%s\\appinfo\\%s.lsm", dosdir, pkgname);
-
 
79
    flist = fopen(fpath, "rb");
-
 
80
    if (flist == NULL) {
77
    kitten_printf(4, 0, pkgname); /* "Package %s is not installed, so not removed." */
81
      kitten_printf(4, 0, pkgname); /* "Package %s is not installed, so not removed." */
78
    puts("");
82
      puts("");
79
    return(-1);
83
      return(-1);
-
 
84
    }
80
  }
85
  }
81
 
86
 
82
  /* remove all files/folders listed in pkgname.lst but NOT pkgname.lst */
87
  /* remove all files/folders listed in pkgname.lsm but NOT pkgname.lsm */
83
  while (freadtokval(flist, buff, sizeof(buff), NULL, 0) == 0) {
88
  while (freadtokval(flist, buff, sizeof(buff), NULL, 0) == 0) {
84
    int x;
89
    int x;
-
 
90
 
-
 
91
    /* skip empty lines */
-
 
92
    if (buff[0] == 0) continue;
-
 
93
 
85
    slash2backslash(buff); /* change all slash to backslash */
94
    /* change all slash to backslash */
-
 
95
    slash2backslash(buff);
-
 
96
 
-
 
97
    /* skip garbage */
86
    if (buff[0] == 0) continue; /* skip empty lines */
98
    if ((buff[1] != ':') || (buff[2] != '\\')) continue;
-
 
99
 
-
 
100
    /* trim out CRC information (if present) */
-
 
101
    trimfnamecrc(buff);
87
 
102
 
88
    /* remember the path part for removal later */
103
    /* remember the path part for removal later */
89
    lastdirsep = -1;
104
    lastdirsep = -1;
90
    for (x = 1; buff[x] != 0; x++) {
105
    for (x = 1; buff[x] != 0; x++) {
91
      if ((buff[x] == '\\') && (buff[x - 1] != ':')) lastdirsep = x;
106
      if ((buff[x] == '\\') && (buff[x - 1] != ':')) lastdirsep = x;
92
    }
107
    }
93
    if (lastdirsep > 0) {
108
    if (lastdirsep > 0) {
94
      buff[lastdirsep] = 0;
109
      buff[lastdirsep] = 0;
95
      dirlist = rememberpath(dirlist, buff);
110
      dirlist = rememberpath(dirlist, buff);
96
      buff[lastdirsep] = '\\';
111
      buff[lastdirsep] = '\\';
97
    }
112
    }
98
 
113
 
99
    /* if it's a directory, skip it */
114
    /* if it's a directory, skip it */
100
    if (buff[strlen(buff) - 1] == '\\') continue;
115
    if (buff[strlen(buff) - 1] == '\\') continue;
101
 
116
 
102
    /* do not delete pkgname.lst at this point - I am using it (will be deleted later) */
117
    /* do not delete pkgname.lst at this point because I am using it (will be
-
 
118
     * deleted later) */
103
    if (strcasecmp(buff, fpath) == 0) continue;
119
    if (strcasecmp(buff, fpath) == 0) continue;
104
 
120
 
105
    /* remove it */
121
    /* remove it */
106
    kitten_printf(4, 4, buff); /* "removing %s" */
122
    kitten_printf(4, 4, buff); /* "removing %s" */
107
    puts("");
123
    puts("");
108
    unlink(buff);
124
    unlink(buff);
109
  }
125
  }
110
 
126
 
111
  /* close the lst file */
127
  /* close the lsm file */
112
  fclose(flist);
128
  fclose(flist);
113
 
129
 
114
  /* iterate over dirlist and remove directories if empty, from longest to shortest */
130
  /* iterate over dirlist and remove directories if empty, from longest to shortest */
115
  while (dirlist != NULL) {
131
  while (dirlist != NULL) {
116
    struct dirliststruct *dirlistpos, *previousdir;
132
    struct dirliststruct *dirlistpos, *previousdir;
117
    /* find the longest path, and put it on top */
133
    /* find the longest path, and put it on top */
118
    previousdir = dirlist;
134
    previousdir = dirlist;
119
    for (dirlistpos = dirlist->next; dirlistpos != NULL; dirlistpos = dirlistpos->next) {
135
    for (dirlistpos = dirlist->next; dirlistpos != NULL; dirlistpos = dirlistpos->next) {
120
      if (strlen(dirlistpos->dirname) > strlen(dirlist->dirname)) {
136
      if (strlen(dirlistpos->dirname) > strlen(dirlist->dirname)) {
121
        previousdir->next = dirlistpos->next;
137
        previousdir->next = dirlistpos->next;
122
        dirlistpos->next = dirlist;
138
        dirlistpos->next = dirlist;
123
        dirlist = dirlistpos;
139
        dirlist = dirlistpos;
124
        dirlistpos = previousdir;
140
        dirlistpos = previousdir;
125
      } else {
141
      } else {
126
        previousdir = dirlistpos;
142
        previousdir = dirlistpos;
127
      }
143
      }
128
    }
144
    }
129
    /* printf("RMDIR %s\n", dirlist->dirname); */
145
    /* printf("RMDIR %s\n", dirlist->dirname); */
130
    rmdir(dirlist->dirname);
146
    rmdir(dirlist->dirname);
131
    /* free the allocated memory for this entry */
147
    /* free the allocated memory for this entry */
132
    dirlistpos = dirlist;
148
    dirlistpos = dirlist;
133
    dirlist = dirlistpos->next;
149
    dirlist = dirlistpos->next;
134
    free(dirlistpos);
150
    free(dirlistpos);
135
  }
151
  }
136
 
152
 
137
  /* remove the lst file */
153
  /* remove the lst file */
-
 
154
  kitten_printf(4, 4, fpath); /* "removing %s" */
-
 
155
  puts("");
138
  unlink(fpath);
156
  unlink(fpath);
-
 
157
 
139
  kitten_printf(4, 5, pkgname); /* "Package %s has been removed." */
158
  kitten_printf(4, 5, pkgname); /* "Package %s has been removed." */
140
  puts("");
159
  puts("");
141
  return(0);
160
  return(0);
142
}
161
}
143
 
162