SectionData.h revision 22add6ff3426df1a85089fe6a6e1597ee3b6f300 
1//===- SectionData.h ------------------------------------------------------===//
2//
3//                     The MCLinker Project
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9#ifndef MCLD_LD_SECTION_DATA_H
10#define MCLD_LD_SECTION_DATA_H
11#ifdef ENABLE_UNITTEST
12#include <gtest.h>
13#endif
14
15#include <llvm/ADT/ilist.h>
16#include <llvm/ADT/ilist_node.h>
17#include <llvm/Support/DataTypes.h>
18
19#include <mcld/Config/Config.h>
20#include <mcld/Support/Allocators.h>
21#include <mcld/Fragment/Fragment.h>
22
23namespace mcld {
24
25class LDSection;
26
27/** \class SectionData
28 *  \brief SectionData provides a container for all Fragments.
29 */
30class SectionData
31{
32private:
33  friend class Chunk<SectionData, MCLD_SECTIONS_PER_INPUT>;
34
35  SectionData();
36  explicit SectionData(LDSection &pSection);
37
38  SectionData(const SectionData &);            // DO NOT IMPLEMENT
39  SectionData& operator=(const SectionData &); // DO NOT IMPLEMENT
40
41public:
42  typedef llvm::iplist<Fragment> FragmentListType;
43
44  typedef FragmentListType::reference reference;
45  typedef FragmentListType::const_reference const_reference;
46
47  typedef FragmentListType::iterator iterator;
48  typedef FragmentListType::const_iterator const_iterator;
49
50  typedef FragmentListType::reverse_iterator reverse_iterator;
51  typedef FragmentListType::const_reverse_iterator const_reverse_iterator;
52
53public:
54  static SectionData* Create(LDSection& pSection);
55
56  static void Destroy(SectionData*& pSection);
57
58  const LDSection& getSection() const { return *m_pSection; }
59  LDSection&       getSection()       { return *m_pSection; }
60
61  FragmentListType &getFragmentList() { return m_Fragments; }
62  const FragmentListType &getFragmentList() const { return m_Fragments; }
63
64  size_t size() const { return m_Fragments.size(); }
65
66  bool empty() const { return m_Fragments.empty(); }
67
68  reference              front ()       { return m_Fragments.front();  }
69  const_reference        front () const { return m_Fragments.front();  }
70  reference              back  ()       { return m_Fragments.back();   }
71  const_reference        back  () const { return m_Fragments.back();   }
72
73  const_iterator         begin () const { return m_Fragments.begin();  }
74  iterator               begin ()       { return m_Fragments.begin();  }
75  const_iterator         end   () const { return m_Fragments.end();    }
76  iterator               end   ()       { return m_Fragments.end();    }
77  const_reverse_iterator rbegin() const { return m_Fragments.rbegin(); }
78  reverse_iterator       rbegin()       { return m_Fragments.rbegin(); }
79  const_reverse_iterator rend  () const { return m_Fragments.rend();   }
80  reverse_iterator       rend  ()       { return m_Fragments.rend();   }
81
82private:
83  FragmentListType m_Fragments;
84  LDSection* m_pSection;
85
86};
87
88} // namespace of mcld
89
90#endif
91
92