1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
/* $Id: last.c,v 1.3 2009-01-28 17:21:54 potyra Exp $
*
* Copyright (C) 2008-2009 FAUmachine Team <info@faumachine.org>.
* This program is free software. You can redistribute it and/or modify it
* under the terms of the GNU General Public License, either version 2 of
* the License, or (at your option) any later version. See COPYING.
*/
#include <assert.h>
#include <inttypes.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define HASH_SIZE (4096*1024)
struct entry {
struct entry *prev;
struct entry *next;
uint64_t addr;
unsigned int last;
};
struct entry *first[HASH_SIZE];
struct entry *last[HASH_SIZE];
static unsigned int
hash(uint64_t addr)
{
addr /= 32;
return addr % HASH_SIZE;
}
static struct entry *
entry_get(uint64_t addr)
{
unsigned int h;
struct entry *t;
h = hash(addr);
for (t = first[h]; ; t = t->next) {
if (! t) {
t = malloc(sizeof(*t));
assert(t);
memset(t, 0, sizeof(*t));
t->addr = addr;
t->prev = last[h];
t->next = NULL;
if (t->prev) {
t->prev->next = t;
} else {
first[h] = t;
}
last[h] = t;
break;
}
if (t->addr == addr) {
break;
}
}
return t;
}
int
main(void)
{
unsigned int lineno;
char line[1024];
unsigned int h;
struct entry *t;
lineno = 1;
while (fgets(line, sizeof(line) - 1, stdin)) {
uint64_t addr;
addr = strtoull(line, NULL, 16);
entry_get(addr)->last = lineno;
lineno++;
if (lineno % (1024*128) == 0) {
fprintf(stderr, "Line %d\n", lineno);
}
}
for (h = 0; h < HASH_SIZE; h++) {
for (t = first[h]; t; t = t->next) {
printf("%u %016llx\n",
t->last, (unsigned long long) t->addr);
}
}
return 0;
}
|
