LinkHash.h 3.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475
  1. /*
  2. * Copyright (C) 2008 Google Inc. All rights reserved.
  3. *
  4. * Redistribution and use in source and binary forms, with or without
  5. * modification, are permitted provided that the following conditions
  6. * are met:
  7. * 1. Redistributions of source code must retain the above copyright
  8. * notice, this list of conditions and the following disclaimer.
  9. * 2. Redistributions in binary form must reproduce the above copyright
  10. * notice, this list of conditions and the following disclaimer in the
  11. * documentation and/or other materials provided with the distribution.
  12. *
  13. * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
  14. * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  15. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  16. * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR
  17. * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
  18. * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  19. * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
  20. * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
  21. * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  22. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  23. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  24. */
  25. #ifndef LinkHash_h
  26. #define LinkHash_h
  27. #include <wtf/Forward.h>
  28. #include <wtf/text/StringHash.h>
  29. namespace WebCore {
  30. class KURL;
  31. typedef uint64_t LinkHash;
  32. // Use the low 32-bits of the 64-bit LinkHash as the key for HashSets.
  33. struct LinkHashHash {
  34. static unsigned hash(LinkHash key) { return static_cast<unsigned>(key); }
  35. static bool equal(LinkHash a, LinkHash b) { return a == b; }
  36. static const bool safeToCompareToEmptyOrDeleted = true;
  37. // See AlreadyHashed::avoidDeletedValue.
  38. static unsigned avoidDeletedValue(LinkHash hash64)
  39. {
  40. ASSERT(hash64);
  41. unsigned hash = static_cast<unsigned>(hash64);
  42. unsigned newHash = hash | (!(hash + 1) << 31);
  43. ASSERT(newHash);
  44. ASSERT(newHash != 0xFFFFFFFF);
  45. return newHash;
  46. }
  47. };
  48. // Returns the hash of the string that will be used for visited link coloring.
  49. LinkHash visitedLinkHash(const String& url);
  50. LinkHash visitedLinkHash(const UChar* url, unsigned length);
  51. // Resolves the potentially relative URL "attributeURL" relative to the given
  52. // base URL, and returns the hash of the string that will be used for visited
  53. // link coloring. It will return the special value of 0 if attributeURL does not
  54. // look like a relative URL.
  55. LinkHash visitedLinkHash(const KURL& base, const AtomicString& attributeURL);
  56. // Resolves the potentially relative URL "attributeURL" relative to the given
  57. // base URL, and returns the hash of the string that will be used for visited.
  58. // It will return an empty Vector in case of errors.
  59. void visitedURL(const KURL& base, const AtomicString& attributeURL, Vector<UChar, 512>&);
  60. } // namespace WebCore
  61. #endif // LinkHash_h