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 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558
|
/* Hypertext "Anchor" Object HTAnchor.c
** ==========================
**
** An anchor represents a region of a hypertext document which is linked to
** another anchor in the same or a different document.
**
** History
**
** Nov 1990 Written in Objective-C for the NeXT browser (TBL)
** 24-Oct-1991 (JFG), written in C, browser-independant
** 21-Nov-1991 (JFG), first complete version
**
** (c) Copyright CERN 1991 - See Copyright.html
*/
#include "HTFormat.h"
#include "HTUtils.h"
#include "HTParse.h"
#include "HTFWriter.h" /* for cache stuff */
#include "HTAnchor.h" /* Implemented here */
#define HASH_SIZE 101 /* Arbitrary prime. Memory/speed tradeoff */
typedef struct _HyperDoc Hyperdoc;
#ifdef VMS
struct _HyperDoc {
int junk; /* VMS cannot handle pointers to undefined structs */
};
#endif
PRIVATE HTList **adult_table=0; /* Point to table of lists of all parents */
/* Creation Methods
** ================
**
** Do not use "new" by itself outside this module. In order to enforce
** consistency, we insist that you furnish more information about the
** anchor you are creating : use newWithParent or newWithAddress.
*/
PRIVATE HTParentAnchor * HTParentAnchor_new
NOARGS
{
HTParentAnchor *newAnchor =
(HTParentAnchor *) calloc (1, sizeof (HTParentAnchor)); /* zero-filled */
newAnchor->parent = newAnchor;
return newAnchor;
}
PRIVATE HTChildAnchor * HTChildAnchor_new
NOARGS
{
return (HTChildAnchor *) calloc (1, sizeof (HTChildAnchor)); /* zero-filled */
}
/* Case insensitive string comparison
** ----------------------------------
** On entry,
** s Points to one string, null terminated
** t points to the other.
** On exit,
** returns YES if the strings are equivalent ignoring case
** NO if they differ in more than their case.
*/
PRIVATE BOOL equivalent
ARGS2 (CONST char *,s, CONST char *,t)
{
if (s && t) { /* Make sure they point to something */
for ( ; *s && *t ; s++, t++) {
if (TOUPPER(*s) != TOUPPER(*t))
return NO;
}
return TOUPPER(*s) == TOUPPER(*t);
} else
return s == t; /* Two NULLs are equivalent, aren't they ? */
}
/* Create new or find old sub-anchor
** ---------------------------------
**
** Me one is for a new anchor being edited into an existing
** document. The parent anchor must already exist.
*/
PUBLIC HTChildAnchor * HTAnchor_findChild
ARGS2 (HTParentAnchor *,parent, CONST char *,tag)
{
HTChildAnchor *child;
HTList *kids;
if (! parent) {
if (ANCH_TRACE)
fprintf(stderr, "HTAnchor_findChild called with NULL parent.\n");
return NULL;
}
if ((kids = parent->children)) { /* parent has children : search them */
if (tag && *tag) { /* TBL */
while ((child = HTList_nextObject (kids))) {
if (equivalent(child->tag, tag)) { /* Case sensitive 920226 */
if (ANCH_TRACE) fprintf (stderr,
"AnchorChild. %p of parent %p with name `%s' already exists.\n",
(void*)child, (void*)parent, tag);
return child;
}
}
} /* end if tag is void */
} else /* parent doesn't have any children yet : create family */
parent->children = HTList_new ();
child = HTChildAnchor_new ();
if (ANCH_TRACE) fprintf(stderr, "AnchorChild. New Anchor %p named `%s' is child of %p\n",
(void*)child, (int)tag ? tag : (CONST char *)"" , (void*)parent); /* int for apollo */
HTList_addObject (parent->children, child);
child->parent = parent;
StrAllocCopy(child->tag, tag);
return child;
}
/* Create or find a child anchor with a possible link
** --------------------------------------------------
**
** Create new anchor with a given parent and possibly
** a name, and possibly a link to a _relatively_ named anchor.
** (Code originally in ParseHTML.h)
*/
PUBLIC HTChildAnchor * HTAnchor_findChildAndLink
ARGS4(
HTParentAnchor *,parent, /* May not be 0 */
CONST char *,tag, /* May be "" or 0 */
CONST char *,href, /* May be "" or 0 */
HTLinkType *,ltype /* May be 0 */
)
{
HTChildAnchor * child = HTAnchor_findChild(parent, tag);
if (href && *href) {
char * relative_to = HTAnchor_address((HTAnchor *) parent);
char * parsed_address = HTParse(href, relative_to, PARSE_ALL);
HTAnchor * dest = HTAnchor_findAddress(parsed_address);
HTAnchor_link((HTAnchor *) child, dest, ltype);
free(parsed_address);
free(relative_to);
}
return child;
}
/* Create new or find old named anchor
** -----------------------------------
**
** Me one is for a reference which is found in a document, and might
** not be already loaded.
** Note: You are not guaranteed a new anchor -- you might get an old one,
** like with fonts.
*/
PUBLIC HTAnchor * HTAnchor_findAddress
ARGS1 (CONST char *,address)
{
char *tag = HTParse (address, "", PARSE_ANCHOR); /* Anchor tag specified ? */
/* If the address represents a sub-anchor, we recursively load its parent,
then we create a child anchor within that document. */
if (*tag) {
char *docAddress = HTParse(address, "", PARSE_ACCESS | PARSE_HOST |
PARSE_PATH | PARSE_PUNCTUATION);
HTParentAnchor * foundParent =
(HTParentAnchor *) HTAnchor_findAddress (docAddress);
HTChildAnchor * foundAnchor = HTAnchor_findChild (foundParent, tag);
free (docAddress);
free (tag);
return (HTAnchor *) foundAnchor;
}
else { /* If the address has no anchor tag,
check whether we have this node */
int hash;
CONST char *p;
HTList * adults;
HTList *grownups;
HTParentAnchor * foundAnchor;
free (tag);
/* Select list from hash table */
for(p=address, hash=0; *p; p++)
hash = (int) ((hash * 3 + (*(unsigned char*)p)) % HASH_SIZE);
if (!adult_table)
adult_table = (HTList**) calloc(HASH_SIZE, sizeof(HTList*));
if (!adult_table[hash]) adult_table[hash] = HTList_new();
adults = adult_table[hash];
/* Search list for anchor */
grownups = adults;
while ((foundAnchor = HTList_nextObject (grownups))) {
if (equivalent(foundAnchor->address, address)) {
if (ANCH_TRACE)
fprintf(stderr, "FindAnchor.. %p with address `%s' already exists.\n",
(void*) foundAnchor, address);
return (HTAnchor *) foundAnchor;
}
}
/* Node not found : create new anchor. */
foundAnchor = HTParentAnchor_new ();
if (ANCH_TRACE) fprintf(stderr, "FindAnchor.. %p with hash %d and address `%s' created\n", (void*)foundAnchor, hash, address);
/* This is done earlier in the Proxy server */
if (HTImProxy) {
StrAllocCopy(foundAnchor->address, address);
} else {
StrAllocCopy(foundAnchor->address, address);
foundAnchor->address = HTSimplify(foundAnchor->address);
}
HTList_addObject (adults, foundAnchor);
return (HTAnchor *) foundAnchor;
}
}
/* Delete an anchor and possibly related things (auto garbage collection)
** --------------------------------------------
**
** The anchor is only deleted if the corresponding document is not loaded.
** All outgoing links from parent and children are deleted, and this
** anchor is removed from the sources list of all its targets.
** We also try to delete the targets whose documents are not loaded.
** If this anchor's source list is empty, we delete it and its children.
*/
PRIVATE void deleteLinks
ARGS1 (HTAnchor *,me)
{
if (! me)
return;
/* Recursively try to delete target anchors */
if (me->mainLink.dest) {
HTParentAnchor *parent = me->mainLink.dest->parent;
HTList_removeObject (parent->sources, me);
if (! parent->document) /* Test here to avoid calling overhead */
HTAnchor_delete (parent);
}
if (me->links) { /* Extra destinations */
HTLink *target;
while ((target = HTList_removeLastObject (me->links))) {
HTParentAnchor *parent = target->dest->parent;
HTList_removeObject (parent->sources, me);
if (! parent->document) /* Test here to avoid calling overhead */
HTAnchor_delete (parent);
}
}
}
PUBLIC BOOL HTAnchor_delete
ARGS1 (HTParentAnchor *,me)
{
HTChildAnchor *child;
/* Don't delete if document is loaded */
if (me->document)
return NO;
/* Recursively try to delete target anchors */
deleteLinks ((HTAnchor *) me);
if (! HTList_isEmpty (me->sources)) { /* There are still incoming links */
/* Delete all outgoing links from children, if any */
HTList *kids = me->children;
while ((child = HTList_nextObject (kids)))
deleteLinks ((HTAnchor *) child);
return NO; /* Parent not deleted */
}
/* No more incoming links : kill everything */
/* First, recursively delete children */
while ((child = HTList_removeLastObject (me->children))) {
deleteLinks ((HTAnchor *) child);
free (child->tag);
free (child);
}
/* Now kill myself */
HTList_delete (me->children);
HTList_delete (me->sources);
free (me->address);
/* Devise a way to clean out the HTFormat if no longer needed (ref count?) */
free (me);
if (me->cacheItems) {
HTCacheClear(me->cacheItems);
}
return YES; /* Parent deleted */
}
/* Move an anchor to the head of the list of its siblings
** ------------------------------------------------------
**
** This is to ensure that an anchor which might have already existed
** is put in the correct order as we load the document.
*/
PUBLIC void HTAnchor_makeLastChild
ARGS1(HTChildAnchor *,me)
{
if (me->parent != (HTParentAnchor *) me) { /* Make sure it's a child */
HTList * siblings = me->parent->children;
HTList_removeObject (siblings, me);
HTList_addObject (siblings, me);
}
}
/* Data access functions
** ---------------------
*/
PUBLIC HTParentAnchor * HTAnchor_parent
ARGS1 (HTAnchor *,me)
{
return me ? me->parent : NULL;
}
PUBLIC void HTAnchor_setDocument
ARGS2 (HTParentAnchor *,me, HyperDoc *,doc)
{
if (me)
me->document = doc;
}
PUBLIC HyperDoc * HTAnchor_document
ARGS1 (HTParentAnchor *,me)
{
return me ? me->document : NULL;
}
#if 0
PUBLIC void HTAnchor_setAddress
ARGS2 (HTAnchor *,me, char *,addr)
{
if (me)
StrAllocCopy (me->parent->address, addr);
}
#endif
PUBLIC char * HTAnchor_address
ARGS1 (HTAnchor *,me)
{
char *addr = NULL;
if (me) {
if (((HTParentAnchor *) me == me->parent) ||
!((HTChildAnchor *) me)->tag) { /* it's an adult or no tag */
StrAllocCopy (addr, me->parent->address);
}
else { /* it's a named child */
addr = malloc (2 + strlen (me->parent->address)
+ strlen (((HTChildAnchor *) me)->tag));
if (addr == NULL) outofmem(__FILE__, "HTAnchor_address");
sprintf (addr, "%s#%s", me->parent->address,
((HTChildAnchor *) me)->tag);
}
}
return addr;
}
PUBLIC void HTAnchor_setFormat
ARGS2 (HTParentAnchor *,me, HTFormat ,form)
{
if (me)
me->format = form;
}
PUBLIC HTFormat HTAnchor_format
ARGS1 (HTParentAnchor *,me)
{
return me ? me->format : NULL;
}
PUBLIC void HTAnchor_clearIndex
ARGS1 (HTParentAnchor *,me)
{
if (me)
me->isIndex = NO;
}
PUBLIC void HTAnchor_setIndex
ARGS1 (HTParentAnchor *,me)
{
if (me)
me->isIndex = YES;
}
PUBLIC BOOL HTAnchor_isIndex
ARGS1 (HTParentAnchor *,me)
{
return me ? me->isIndex : NO;
}
PUBLIC BOOL HTAnchor_hasChildren
ARGS1 (HTParentAnchor *,me)
{
return me ? ! HTList_isEmpty(me->children) : NO;
}
/* Title handling
*/
PUBLIC CONST char * HTAnchor_title
ARGS1 (HTParentAnchor *,me)
{
return me ? me->title : 0;
}
PUBLIC void HTAnchor_setTitle
ARGS2(HTParentAnchor *,me, CONST char *,title)
{
StrAllocCopy(me->title, title);
}
PUBLIC void HTAnchor_appendTitle
ARGS2(HTParentAnchor *,me, CONST char *,title)
{
StrAllocCat(me->title, title);
}
/* Link me Anchor to another given one
** -------------------------------------
*/
PUBLIC BOOL HTAnchor_link
ARGS3(HTAnchor *,source, HTAnchor *,destination, HTLinkType *,type)
{
if (! (source && destination))
return NO; /* Can't link to/from non-existing anchor */
if (ANCH_TRACE)
fprintf(stderr, "LinkAnchor.. Linking anchor %p to anchor %p\n",
(void *) source, (void *) destination);
if (! source->mainLink.dest) {
source->mainLink.dest = destination;
source->mainLink.type = type;
} else {
HTLink * newLink = (HTLink *) malloc (sizeof (HTLink));
if (newLink == NULL) outofmem(__FILE__, "HTAnchor_link");
newLink->dest = destination;
newLink->type = type;
if (! source->links)
source->links = HTList_new ();
HTList_addObject (source->links, newLink);
}
if (!destination->parent->sources)
destination->parent->sources = HTList_new ();
HTList_addObject (destination->parent->sources, source);
return YES; /* Success */
}
/* Manipulation of links
** ---------------------
*/
PUBLIC HTAnchor * HTAnchor_followMainLink
ARGS1 (HTAnchor *,me)
{
return me->mainLink.dest;
}
PUBLIC HTAnchor * HTAnchor_followTypedLink
ARGS2 (HTAnchor *,me, HTLinkType *,type)
{
if (me->mainLink.type == type)
return me->mainLink.dest;
if (me->links) {
HTList *links = me->links;
HTLink *link;
while ((link = HTList_nextObject (links)))
if (link->type == type)
return link->dest;
}
return NULL; /* No link of me type */
}
/* Make main link
*/
PUBLIC BOOL HTAnchor_makeMainLink
ARGS2 (HTAnchor *,me, HTLink *,movingLink)
{
/* Check that everything's OK */
if (! (me && HTList_removeObject (me->links, movingLink)))
return NO; /* link not found or NULL anchor */
else {
/* First push current main link onto top of links list */
HTLink *newLink = (HTLink*) malloc (sizeof (HTLink));
if (newLink == NULL) outofmem(__FILE__, "HTAnchor_makeMainLink");
memcpy (newLink, & me->mainLink, sizeof (HTLink));
HTList_addObject (me->links, newLink);
/* Now make movingLink the new main link, and free it */
memcpy (& me->mainLink, movingLink, sizeof (HTLink));
free (movingLink);
return YES;
}
}
/* Methods List
** ------------
*/
PUBLIC HTList * HTAnchor_methods ARGS1(HTParentAnchor *, me)
{
if (!me->methods) {
me->methods = HTList_new();
}
return me->methods;
}
/* Protocol
** --------
*/
PUBLIC void * HTAnchor_protocol ARGS1(HTParentAnchor *, me)
{
return me->protocol;
}
PUBLIC void HTAnchor_setProtocol ARGS2(HTParentAnchor *, me,
void*, protocol)
{
me->protocol = protocol;
}
/* Physical Address
** ----------------
*/
PUBLIC char * HTAnchor_physical ARGS1(HTParentAnchor *, me)
{
return me->physical;
}
PUBLIC void HTAnchor_setPhysical ARGS2(HTParentAnchor *, me,
char *, physical)
{
if (!me || !physical) {
if (ANCH_TRACE)
fprintf(stderr, "HTAnchor.... setPhysical, called with null argument\n");
return;
}
StrAllocCopy(me->physical, physical);
}
|