From: Hermès Bélusca-Maïto Date: Thu, 5 Mar 2015 20:43:25 +0000 (+0000) Subject: Small source tree cleanup: X-Git-Tag: ReactOS-0.3.17-CLT2015~176 X-Git-Url: https://git.reactos.org/?p=reactos.git;a=commitdiff_plain;h=b086a99725bd2cc7390828f78fa19866518560e1 Small source tree cleanup: - Remove leftovers from rbuild era. - Remove .hgeol that was introduced in r53995 in an attempt to have Mercury "get[ing] native line endings": <@hbelusca> tkreuzer - hi tkreuzer! do you know whether you still need this .hgeol file at the root of our source tree? <@tkreuzer> hbelusca: no, feel free to delete it - rgenstat/llmosrt.c --> llmsort.c (take it from cdmake); this is however an unused tool in our build toolchain. svn path=/trunk/; revision=66570 --- diff --git a/reactos/.hgeol b/reactos/.hgeol deleted file mode 100644 index cd78843a6c2..00000000000 --- a/reactos/.hgeol +++ /dev/null @@ -1,31 +0,0 @@ -[patterns] -**.txt = native -**.cmake = native -**.asm = native -**.S = native -**.cxx = native -**.cpp = native -**.hpp = native -**.hxx = native -**.c = native -**.h = native -**.py = native -**.rc = native -**.html = native -**.bat = native -**.cmd = native -**.mak = native -**makefile = native -**.manifest = native -**.properties = native -**.dsp = native -**.sln = native -**.vcproj = native -**.gen = native -**.bmp = BIN -**.cur = BIN -**.ico = BIN -**.jpg = BIN -**.png = BIN -tgzsrc = LF -scripts/ba = LF diff --git a/reactos/depmap.xsl b/reactos/depmap.xsl deleted file mode 100644 index 7184e452939..00000000000 --- a/reactos/depmap.xsl +++ /dev/null @@ -1,30 +0,0 @@ - - - - - -ReactOS Dependency Map - - -

ReactOS Dependency Map

- - - - - - - - - - - - - - - -

Module Name	Module Location	Other Module Usage	Module Re-Usage

- - - - - diff --git a/reactos/tools/rgenstat/llmosrt.c b/reactos/tools/rgenstat/llmosrt.c deleted file mode 100644 index bc78a10c1c0..00000000000 --- a/reactos/tools/rgenstat/llmosrt.c +++ /dev/null @@ -1,105 +0,0 @@ -/* A Linked-List Memory Sort - by Philip J. Erdelsky - pje@acm.org - http://www.alumni.caltech.edu/~pje/ -*/ - -/* According to his website, this file was released into the public domain by Phillip J. Erdelsky */ - - -#include - -void *sort_linked_list(void *p, unsigned index, int (*compare)(void *, void *)) -{ - unsigned base; - unsigned long block_size; - - struct record - { - struct record *next[1]; - /* other members not directly accessed by this function */ - }; - - struct tape - { - struct record *first, *last; - unsigned long count; - } tape[4]; - - /* Distribute the records alternately to tape[0] and tape[1]. */ - - tape[0].count = tape[1].count = 0L; - tape[0].first = NULL; - base = 0; - while (p != NULL) - { - struct record *next = ((struct record *)p)->next[index]; - ((struct record *)p)->next[index] = tape[base].first; - tape[base].first = ((struct record *)p); - tape[base].count++; - p = next; - base ^= 1; - } - - /* If the list is empty or contains only a single record, then */ - /* tape[1].count == 0L and this part is vacuous. */ - - for (base = 0, block_size = 1L; tape[base+1].count != 0L; - base ^= 2, block_size <<= 1) - { - int dest; - struct tape *tape0, *tape1; - tape0 = tape + base; - tape1 = tape + base + 1; - dest = base ^ 2; - tape[dest].count = tape[dest+1].count = 0; - for (; tape0->count != 0; dest ^= 1) - { - unsigned long n0, n1; - struct tape *output_tape = tape + dest; - n0 = n1 = block_size; - while (1) - { - struct record *chosen_record; - struct tape *chosen_tape; - if (n0 == 0 || tape0->count == 0) - { - if (n1 == 0 || tape1->count == 0) - break; - chosen_tape = tape1; - n1--; - } - else if (n1 == 0 || tape1->count == 0) - { - chosen_tape = tape0; - n0--; - } - else if ((*compare)(tape0->first, tape1->first) > 0) - { - chosen_tape = tape1; - n1--; - } - else - { - chosen_tape = tape0; - n0--; - } - chosen_tape->count--; - chosen_record = chosen_tape->first; - chosen_tape->first = chosen_record->next[index]; - if (output_tape->count == 0) - output_tape->first = chosen_record; - else - output_tape->last->next[index] = chosen_record; - output_tape->last = chosen_record; - output_tape->count++; - } - } - } - - if (tape[base].count > 1L) - tape[base].last->next[index] = NULL; - return tape[base].first; -} - -/* EOF */ diff --git a/reactos/tools/rgenstat/llmsort.c b/reactos/tools/rgenstat/llmsort.c new file mode 100644 index 00000000000..e20893c988e --- /dev/null +++ b/reactos/tools/rgenstat/llmsort.c @@ -0,0 +1,105 @@ +/* + * A Linked-List Memory Sort + * by Philip J. Erdelsky + * pje@acm.org + * http://alumnus.caltech.edu/~pje/ + */ + +/* According to his website, this file was released into the public domain by Philip J. Erdelsky */ + +#include + +void *sort_linked_list(void *p, unsigned index, int (*compare)(void *, void *)) +{ + unsigned base; + unsigned long block_size; + + struct record + { + struct record *next[1]; + /* other members not directly accessed by this function */ + }; + + struct tape + { + struct record *first, *last; + unsigned long count; + } tape[4]; + + /* Distribute the records alternately to tape[0] and tape[1]. */ + + tape[0].count = tape[1].count = 0L; + tape[0].first = NULL; + base = 0; + while (p != NULL) + { + struct record *next = ((struct record *)p)->next[index]; + ((struct record *)p)->next[index] = tape[base].first; + tape[base].first = ((struct record *)p); + tape[base].count++; + p = next; + base ^= 1; + } + + /* If the list is empty or contains only a single record, then */ + /* tape[1].count == 0L and this part is vacuous. */ + + for (base = 0, block_size = 1L; tape[base+1].count != 0L; + base ^= 2, block_size <<= 1) + { + int dest; + struct tape *tape0, *tape1; + tape0 = tape + base; + tape1 = tape + base + 1; + dest = base ^ 2; + tape[dest].count = tape[dest+1].count = 0; + for (; tape0->count != 0; dest ^= 1) + { + unsigned long n0, n1; + struct tape *output_tape = tape + dest; + n0 = n1 = block_size; + while (1) + { + struct record *chosen_record; + struct tape *chosen_tape; + if (n0 == 0 || tape0->count == 0) + { + if (n1 == 0 || tape1->count == 0) + break; + chosen_tape = tape1; + n1--; + } + else if (n1 == 0 || tape1->count == 0) + { + chosen_tape = tape0; + n0--; + } + else if ((*compare)(tape0->first, tape1->first) > 0) + { + chosen_tape = tape1; + n1--; + } + else + { + chosen_tape = tape0; + n0--; + } + chosen_tape->count--; + chosen_record = chosen_tape->first; + chosen_tape->first = chosen_record->next[index]; + if (output_tape->count == 0) + output_tape->first = chosen_record; + else + output_tape->last->next[index] = chosen_record; + output_tape->last = chosen_record; + output_tape->count++; + } + } + } + + if (tape[base].count > 1L) + tape[base].last->next[index] = NULL; + return tape[base].first; +} + +/* EOF */ diff --git a/reactos/vreport.xsl b/reactos/vreport.xsl deleted file mode 100644 index 36cf01b0d2d..00000000000 --- a/reactos/vreport.xsl +++ /dev/null @@ -1,32 +0,0 @@ - - - - - -ReactOS Component Version Report - - -

ReactOS Component Version Report

- - - - - - - - - - - - - - - - - -

Module Name	Module Location	Version	Date	Owner

- - - - -