Write out global initializers and data rel directly to ELF file.

src/IceUtils.h

 //===- subzero/src/IceUtils.h - Utility functions ---------------*- C++ -*-===//
 //
 //                        The Subzero Code Generator
 //
 // This file is distributed under the University of Illinois Open Source
 // License. See LICENSE.TXT for details.
 //
 //===----------------------------------------------------------------------===//
 //
 // This file declares some utility functions.
@@ skipping 35 matching lines @@
     assert((0 < N) &&
            (static_cast<unsigned int>(N) < (CHAR_BIT * sizeof(value))));
     T limit = static_cast<T>(1) << N;
     return (0 <= value) && (value < limit);
   }
 
   template <typename T> static inline bool WouldOverflowAdd(T X, T Y) {
     return ((X > 0 && Y > 0 && (X > std::numeric_limits<T>::max() - Y)) ||
             (X < 0 && Y < 0 && (X < std::numeric_limits<T>::min() - Y)));
   }
+
+  static inline uint64_t OffsetToAlignment(uint64_t Pos, uint64_t Align) {
+    assert(llvm::isPowerOf2_64(Align));
+    uint64_t Mod = Pos & (Align - 1);
+    if (Mod == 0)
+      return 0;
+    return Align - Mod;
+  }
 };
 
 // BoundedProducerConsumerQueue is a work queue that allows multiple
 // producers and multiple consumers.  A producer adds entries using
 // blockingPush(), and may block if the queue is "full".  A producer
 // uses notifyEnd() to indicate that no more entries will be added.  A
 // consumer removes an item using blockingPop(), which will return
 // nullptr if notifyEnd() has been called and the queue is empty (it
 // never returns nullptr if the queue contained any items).
 //
@@ skipping 112 matching lines @@
   }
   T *pop() {
     assert(!empty());
     return WorkItems[Front++ & MaxStaticSizeMask];
   }
 };
 
 } // end of namespace Ice
 
 #endif // SUBZERO_SRC_ICEUTILS_H