1184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen//===-- SequenceToOffsetTable.h - Compress similar sequences ----*- C++ -*-===// 2184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen// 3184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen// The LLVM Compiler Infrastructure 4184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen// 5184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen// This file is distributed under the University of Illinois Open Source 6184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen// License. See LICENSE.TXT for details. 7184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen// 8184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen//===----------------------------------------------------------------------===// 9184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen// 10184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen// SequenceToOffsetTable can be used to emit a number of null-terminated 11184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen// sequences as one big array. Use the same memory when a sequence is a suffix 12184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen// of another. 13184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen// 14184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen//===----------------------------------------------------------------------===// 15184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 16184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen#ifndef TBLGEN_SEQUENCE_TO_OFFSET_TABLE_H 17184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen#define TBLGEN_SEQUENCE_TO_OFFSET_TABLE_H 18184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 19184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen#include "llvm/Support/raw_ostream.h" 20184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen#include <algorithm> 21184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen#include <cassert> 22c19f72bd83e8cb2cc31257008ee9d7797dbf3dbbJakob Stoklund Olesen#include <cctype> 234ffd89fa4d2788611187d1a534d2ed46adf1702cChandler Carruth#include <functional> 24862b50420122e8be173ae534fcd1668c8c4be916Craig Topper#include <map> 254ffd89fa4d2788611187d1a534d2ed46adf1702cChandler Carruth#include <vector> 26184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 27184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesennamespace llvm { 28184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 29184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen/// SequenceToOffsetTable - Collect a number of terminated sequences of T. 30184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen/// Compute the layout of a table that contains all the sequences, possibly by 31184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen/// reusing entries. 32184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen/// 33a00b80b04c5edb08639c1c6b32e9231fd8b066f7Dmitri Gribenko/// @tparam SeqT The sequence container. (vector or string). 34a00b80b04c5edb08639c1c6b32e9231fd8b066f7Dmitri Gribenko/// @tparam Less A stable comparator for SeqT elements. 35184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesentemplate<typename SeqT, typename Less = std::less<typename SeqT::value_type> > 36184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesenclass SequenceToOffsetTable { 37184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen typedef typename SeqT::value_type ElemT; 38184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 39184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen // Define a comparator for SeqT that sorts a suffix immediately before a 40184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen // sequence with that suffix. 41184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen struct SeqLess : public std::binary_function<SeqT, SeqT, bool> { 42184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen Less L; 43184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen bool operator()(const SeqT &A, const SeqT &B) const { 44184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen return std::lexicographical_compare(A.rbegin(), A.rend(), 45184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen B.rbegin(), B.rend(), L); 46184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen } 47184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen }; 48184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 49184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen // Keep sequences ordered according to SeqLess so suffixes are easy to find. 50184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen // Map each sequence to its offset in the table. 51184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen typedef std::map<SeqT, unsigned, SeqLess> SeqMap; 52184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 53184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen // Sequences added so far, with suffixes removed. 54184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen SeqMap Seqs; 55184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 56184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen // Entries in the final table, or 0 before layout was called. 57184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen unsigned Entries; 58184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 59184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen // isSuffix - Returns true if A is a suffix of B. 60184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen static bool isSuffix(const SeqT &A, const SeqT &B) { 61184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen return A.size() <= B.size() && std::equal(A.rbegin(), A.rend(), B.rbegin()); 62184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen } 63184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 64184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesenpublic: 65184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen SequenceToOffsetTable() : Entries(0) {} 66184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 67184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen /// add - Add a sequence to the table. 68184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen /// This must be called before layout(). 69184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen void add(const SeqT &Seq) { 70184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen assert(Entries == 0 && "Cannot call add() after layout()"); 71184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen typename SeqMap::iterator I = Seqs.lower_bound(Seq); 72184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 73184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen // If SeqMap contains a sequence that has Seq as a suffix, I will be 74184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen // pointing to it. 75184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen if (I != Seqs.end() && isSuffix(Seq, I->first)) 76184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen return; 77184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 78184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen I = Seqs.insert(I, std::make_pair(Seq, 0u)); 79184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 80184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen // The entry before I may be a suffix of Seq that can now be erased. 81184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen if (I != Seqs.begin() && isSuffix((--I)->first, Seq)) 82184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen Seqs.erase(I); 83184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen } 84184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 85387c9dcddabe8551468647b249d3629953caab9eChris Lattner bool empty() const { return Seqs.empty(); } 864e5babe4f3aa5aaabf8ee91b10f64c9e35f2505cCraig Topper 87184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen /// layout - Computes the final table layout. 885974c31acbf5368ffc18b23c849d0c823f91f25eCraig Topper void layout() { 89184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen assert(Entries == 0 && "Can only call layout() once"); 90184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen // Lay out the table in Seqs iteration order. 91184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen for (typename SeqMap::iterator I = Seqs.begin(), E = Seqs.end(); I != E; 92184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen ++I) { 93184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen I->second = Entries; 94184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen // Include space for a terminator. 95184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen Entries += I->first.size() + 1; 96184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen } 97184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen } 98184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 99184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen /// get - Returns the offset of Seq in the final table. 100184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen unsigned get(const SeqT &Seq) const { 101184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen assert(Entries && "Call layout() before get()"); 102184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen typename SeqMap::const_iterator I = Seqs.lower_bound(Seq); 103184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen assert(I != Seqs.end() && isSuffix(Seq, I->first) && 104184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen "get() called with sequence that wasn't added first"); 105184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen return I->second + (I->first.size() - Seq.size()); 106184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen } 107184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 108184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen /// emit - Print out the table as the body of an array initializer. 109184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen /// Use the Print function to print elements. 1100d4e2ea00eac5d51a74a54dd504a8f34580041d7Jakob Stoklund Olesen void emit(raw_ostream &OS, 1110d4e2ea00eac5d51a74a54dd504a8f34580041d7Jakob Stoklund Olesen void (*Print)(raw_ostream&, ElemT), 1120d4e2ea00eac5d51a74a54dd504a8f34580041d7Jakob Stoklund Olesen const char *Term = "0") const { 113184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen assert(Entries && "Call layout() before emit()"); 114184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen for (typename SeqMap::const_iterator I = Seqs.begin(), E = Seqs.end(); 115184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen I != E; ++I) { 116184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen OS << " /* " << I->second << " */ "; 117184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen for (typename SeqT::const_iterator SI = I->first.begin(), 118184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen SE = I->first.end(); SI != SE; ++SI) { 119184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen Print(OS, *SI); 120184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen OS << ", "; 121184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen } 1220d4e2ea00eac5d51a74a54dd504a8f34580041d7Jakob Stoklund Olesen OS << Term << ",\n"; 123184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen } 124184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen } 125184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen}; 126184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 127c19f72bd83e8cb2cc31257008ee9d7797dbf3dbbJakob Stoklund Olesen// Helper function for SequenceToOffsetTable<string>. 128c19f72bd83e8cb2cc31257008ee9d7797dbf3dbbJakob Stoklund Olesenstatic inline void printChar(raw_ostream &OS, char C) { 129c19f72bd83e8cb2cc31257008ee9d7797dbf3dbbJakob Stoklund Olesen unsigned char UC(C); 130c19f72bd83e8cb2cc31257008ee9d7797dbf3dbbJakob Stoklund Olesen if (isalnum(UC) || ispunct(UC)) { 131c19f72bd83e8cb2cc31257008ee9d7797dbf3dbbJakob Stoklund Olesen OS << '\''; 132c19f72bd83e8cb2cc31257008ee9d7797dbf3dbbJakob Stoklund Olesen if (C == '\\' || C == '\'') 133c19f72bd83e8cb2cc31257008ee9d7797dbf3dbbJakob Stoklund Olesen OS << '\\'; 134c19f72bd83e8cb2cc31257008ee9d7797dbf3dbbJakob Stoklund Olesen OS << C << '\''; 135c19f72bd83e8cb2cc31257008ee9d7797dbf3dbbJakob Stoklund Olesen } else { 136c19f72bd83e8cb2cc31257008ee9d7797dbf3dbbJakob Stoklund Olesen OS << unsigned(UC); 137c19f72bd83e8cb2cc31257008ee9d7797dbf3dbbJakob Stoklund Olesen } 138c19f72bd83e8cb2cc31257008ee9d7797dbf3dbbJakob Stoklund Olesen} 139c19f72bd83e8cb2cc31257008ee9d7797dbf3dbbJakob Stoklund Olesen 140184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen} // end namespace llvm 141184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen 142184440e8085379f8c3749f04dcffee8d9f16f435Jakob Stoklund Olesen#endif 143