emo/procps
1
0
Fork 0
Code Issues Pull Requests Packages Releases Activity

ps --sort bug

Browse Source
This commit is contained in:
albert 2002-10-14 05:12:14 +00:00
parent 77f16a7bd9
commit 4b57916ac9
4 changed files with 12 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
ChangeLog
View File

@ -4,6 +4,11 @@ more "make install" fixes
lib CFLAGS working again lib CFLAGS working again
top.1 codes fixed top.1 codes fixed
bad (int*) cast in top removed bad (int*) cast in top removed
top runs faster
libproc memory corruption fixed
rant moved out of top.1 man page
ability to SKIP installing things
fixed ps --sort crash
procps-3.0.1 --> procps-3.0.2 procps-3.0.1 --> procps-3.0.2

4
NEWS
View File

@ -5,6 +5,10 @@ lib CFLAGS working again
top.1 codes fixed top.1 codes fixed
bad (int*) cast in top removed bad (int*) cast in top removed
top runs faster top runs faster
libproc memory corruption fixed
rant moved out of top.1 man page
ability to SKIP installing things
fixed ps --sort crash
procps-3.0.1 --> procps-3.0.2 procps-3.0.1 --> procps-3.0.2

2
ps/display.c
View File

@ -266,6 +266,7 @@ static void prep_forest_sort(void){
tmp_list->reverse = 0; tmp_list->reverse = 0;
tmp_list->typecode = '?'; /* what was this for? */ tmp_list->typecode = '?'; /* what was this for? */
tmp_list->sr = incoming->sr; tmp_list->sr = incoming->sr;
tmp_list->need = incoming->need;
tmp_list->next = sort_list; tmp_list->next = sort_list;
sort_list = tmp_list; sort_list = tmp_list;
} }
@ -276,6 +277,7 @@ static void prep_forest_sort(void){
tmp_list->reverse = 0; tmp_list->reverse = 0;
tmp_list->typecode = '?'; /* what was this for? */ tmp_list->typecode = '?'; /* what was this for? */
tmp_list->sr = incoming->sr; tmp_list->sr = incoming->sr;
tmp_list->need = incoming->need;
tmp_list->next = sort_list; tmp_list->next = sort_list;
sort_list = tmp_list; sort_list = tmp_list;
} }

1
ps/sortformat.c
View File

@ -311,6 +311,7 @@ static sort_node *do_one_sort_spec(const char *spec){
sort_node *thisnode; sort_node *thisnode;
thisnode = malloc(sizeof(format_node)); thisnode = malloc(sizeof(format_node));
thisnode->sr = fs->sr; thisnode->sr = fs->sr;
thisnode->need = fs->need;
thisnode->reverse = reverse; thisnode->reverse = reverse;
thisnode->next = NULL; thisnode->next = NULL;
return thisnode; return thisnode;