- 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
+++ /dev/null
-[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
+++ /dev/null
-<?xml version="1.0" encoding="ISO-8859-1"?>
-<xsl:stylesheet version="1.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform">
-<xsl:template match="/">
-<html>
-<head>
-<title>ReactOS Dependency Map</title>
-</head>
-<body>
-<h1>ReactOS Dependency Map</h1>
-<table border="1">
- <tr bgcolor="#9acd32">
- <th align="left">Module Name</th>
- <th align="left">Module Location</th>
- <th align="left">Other Module Usage</th>
- <th align="left">Module Re-Usage</th>
- </tr>
- <xsl:for-each select="components/component">
- <tr>
- <td><xsl:value-of select="name"/></td>
- <td><xsl:value-of select="base"/></td>
- <td><xsl:value-of select="lib_count"/></td>
- <td><xsl:value-of select="ref_count"/></td>
- </tr>
- </xsl:for-each>
- </table>
- </body>
- </html>
-</xsl:template>
-
-</xsl:stylesheet>
+++ /dev/null
-/* 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 <stdio.h>
-
-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 */
--- /dev/null
+/*
+ * 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 <stdio.h>
+
+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 */
+++ /dev/null
-<?xml version="1.0" encoding="ISO-8859-1"?>
-<xsl:stylesheet version="1.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform">
-<xsl:template match="/">
-<html>
-<head>
-<title>ReactOS Component Version Report</title>
-</head>
-<body>
-<h1>ReactOS Component Version Report</h1>
-<table border="1">
- <tr bgcolor="#9acd32">
- <th align="left">Module Name</th>
- <th align="left">Module Location</th>
- <th align="left">Version</th>
- <th align="left">Date</th>
- <th align="left">Owner</th>
- </tr>
- <xsl:for-each select="components/component">
- <tr>
- <td><xsl:value-of select="name"/></td>
- <td><xsl:value-of select="base"/></td>
- <td><xsl:value-of select="version"/></td>
- <td><xsl:value-of select="date"/></td>
- <td><xsl:value-of select="owner"/></td>
- </tr>
- </xsl:for-each>
- </table>
- </body>
- </html>
-</xsl:template>
-
-</xsl:stylesheet>
projects / reactos.git / commitdiff