📄 ch21.htm
字号:
l = link_date;<BR>
<BR>
printf("<H2>By Date</H2>\n");
<BR>
printf("<ul>\n");<BR>
<BR>
for(;l;)<BR>
{ if( l->data )<BR>
{ printf("<li>
<B>%s :</B> %d\n", ((sDATE *) (l->data))->date,
<BR>
((sDATE
*) (l->data))->num_access );<BR>
l
= l->next;<BR>
}<BR>
else break;
<BR>
}<BR>
printf("</ul>\n");<BR>
<BR>
l = link_hour;<BR>
<BR>
printf("<H2>By Hour</H2>\n");
<BR>
printf("<ul>\n");<BR>
<BR>
for(;l;)<BR>
{ if( l->data )<BR>
{ printf("<li>
<B>%s :</B> %d\n", ((sHOUR *) (l->data))->hour,
<BR>
((sHOUR
*) (l->data))->num_access );<BR>
l
= l->next;<BR>
}<BR>
else break;
<BR>
}<BR>
printf("</ul>\n");<BR>
<BR>
l = link_hostname;<BR>
<BR>
printf("<H2>By Hostname</H2>\n");
<BR>
printf("<ul>\n");<BR>
<BR>
for(;l;)<BR>
{ if( l->data )<BR>
{ printf("<li>
<B>%s :</B> %d\n", ((sHOSTNAME *) (l->data))->hostname,
<BR>
((sHOSTNAME
*) (l->data))->num_access );<BR>
l
= l->next;<BR>
}<BR>
else break;
<BR>
}<BR>
printf("</ul>\n");<BR>
<BR>
l = link_filename;<BR>
<BR>
printf("<H2>By Filename</H2>\n");
<BR>
printf("<ul>\n");<BR>
<BR>
for(;l;)<BR>
{ if( l->data )<BR>
{ printf("<li>
<B>%s :</B> %d\n", ((sFILENAME *) (l->data))->filename,
<BR>
((sFILENAME
*) (l->data))->num_access );<BR>
l
= l->next;<BR>
}<BR>
else break;
<BR>
}<BR>
printf("</ul>\n")</FONT></TT>;
<BR>
<TT><FONT FACE="Courier">}</FONT></TT>
</BLOCKQUOTE>
<HR>
<P>
This program makes use of linked lists, which aren't supported
directly in C as associative arrays are in Perl. Thus, there are
some support routines that are needed in order to make the program
function properly, and they are included here, in Listings 21.2
and 21.3.
<HR>
<BLOCKQUOTE>
<B>Listing 21.2. The linked list routine.<BR>
</B>
</BLOCKQUOTE>
<BLOCKQUOTE>
<TT><FONT FACE="Courier">// linklist.h -- The Header
file for the Linked List Routines<BR>
// Available on-line at http://www.anadas.com/cgiunleashed/trackuser/
<BR>
//<BR>
// By Shuman Ghosemajumder, Anadas Software Development<BR>
<BR>
// STRUCTURES *********************************************************
<BR>
<BR>
typedef struct linked_list<BR>
{ struct linked_list * next;<BR>
void * data;<BR>
} sLINK;<BR>
<BR>
// LINKED LIST FUncTION PROTOTYPES ************************************
<BR>
<BR>
void InitHead( sLINK * * head );<BR>
void DestroyList( sLINK * * head );<BR>
int CountNodes( sLINK * head );<BR>
sLINK * GetNext( sLINK * l );<BR>
sLINK * AddNode( sLINK * head, void * data, int data_size )</FONT></TT>;
<BR>
<TT><FONT FACE="Courier">sLINK * FindNode( sLINK * head, void
* data, int offset, int data_size );</FONT></TT>
</BLOCKQUOTE>
<HR>
<HR>
<BLOCKQUOTE>
<B>Listing 21.3. Source code for the linked list functions.<BR>
</B>
</BLOCKQUOTE>
<BLOCKQUOTE>
<TT><FONT FACE="Courier">// linklist.cpp -- Linked List Functions
<BR>
// Available on-line at http://www.anadas.com/cgiunleashed/trackuser/
<BR>
//<BR>
// By Shuman Ghosemajumder, Anadas Software Development<BR>
<BR>
<BR>
void InitHead( sLINK * * head )<BR>
{<BR>
// Initialize the head pointer of a linked
list<BR>
<BR>
*head = (sLINK *) malloc( sizeof(sLINK)
); // allocate memory<BR>
<BR>
if( ! *head )<BR>
{ printf("Memory
allocation error.\n");<BR>
exit(-1);<BR>
}<BR>
<BR>
(*head)->data = NULL; //
no data yet<BR>
(*head)->next = NULL; //
no next pointer yet<BR>
}<BR>
<BR>
<BR>
void DestroyList( sLINK * * head )<BR>
{<BR>
// Destroy an entire linked list<BR>
<BR>
sLINK * l = *head;<BR>
sLINK * temp;<BR>
<BR>
for(;;) &nb
sp;
// loop to destroy<BR>
{ if( l->data ) free(
l->data ); //
each node of the list<BR>
<BR>
if( l->next
)<BR>
{ temp
= l;<BR>
l
= l->next;<BR>
free(
temp ); //
thus freeing memory<BR>
}<BR>
else break;
<BR>
}<BR>
<BR>
*head = NULL;
// destroy the head pointer<BR>
}<BR>
<BR>
<BR>
sLINK * AddNode( sLINK * head, void * data, int data_size )<BR>
{<BR>
// Add a node to the linked list<BR>
<BR>
sLINK * next = head;<BR>
sLINK * last;<BR>
<BR>
do<BR>
{ last = next;<BR>
next = GetNext(
next );<BR>
} while( next ); //
go to the end of the list<BR>
<BR>
// next == NULL, therefore last == the
last node<BR>
<BR>
if( last->data == NULL )<BR>
{ next = last;<BR>
}<BR>
else<BR>
{ next = (sLINK *) malloc(
sizeof(sLINK) );<BR>
<BR>
if( ! next )<BR>
{ printf("Memory
allocation error.\n");<BR>
exit(-1);
<BR>
}<BR>
last->next
= next;<BR>
}<BR>
<BR>
next->data = (void *) malloc( data_size
);<BR>
<BR>
if( ! next->data )<BR>
{ printf("Memory
allocation error.\n");<BR>
exit(-1);<BR>
}<BR>
<BR>
memcpy( next->data, data, data_size
);<BR>
<BR>
next->next = NULL;<BR>
<BR>
return ((sLINK *) next);<BR>
}<BR>
<BR>
int CountNodes( sLINK * head )<BR>
{<BR>
// Return the total number of nodes in
the linked list<BR>
<BR>
int count = 0;<BR>
<BR>
do<BR>
{ head = GetNext( head
);<BR>
count++;<BR>
} while( head );<BR>
<BR>
return count;<BR>
}<BR>
<BR>
sLINK * GetNext( sLINK * l )<BR>
{<BR>
// Given one node of the list, return
a pointer to the next node if it<BR>
// exists, or NULL if it doesn't.<BR>
<BR>
if( l->next != NULL ) return ((sLINK
*) l->next);<BR>
else return
NULL;<BR>
}<BR>
<BR>
<BR>
sLINK * FindNode( sLINK * head, void * data, int offset, int data_size
)<BR>
{<BR>
// Compare "data" to the value
at "offset" in the data structure portion<BR>
// of the linked list, and return a pointer
to the node which contains<BR>
// this value if there is one.<BR>
<BR>
for(;;)<BR>
{ if( head->data !=
NULL )<BR>
{ if(
memcmp( (char *) head->data + offset, (char *) data, data_size
) == Â0 )<BR>
{ return
( (sLINK *) head );<BR>
}
<BR>
if(
head->next ) head = head->next;<BR>
else return
NULL;<BR>
}<BR>
else<BR>
{ return
NULL;<BR>
}<BR>
}<BR>
}</FONT></TT>
</BLOCKQUOTE>
<HR>
<P>
This program is a good starting point, but ideally you'd like
to be able to have it compiled automatically. As mentioned before,
access logs are often several megabytes (some can be several <I>hundred</I>
megabytes!) in size, so the idea of generating these kinds of
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -