T 44 MMgc/BasicList.h template<typename T, int growthIncrement=4>
T 72 MMgc/BasicList.h void Add(T item)
T 79 MMgc/BasicList.h T* newItems = mmfx_new_array_opt(T, capacity, kZero);
T 81 MMgc/BasicList.h VMPI_memcpy(newItems, items, count * sizeof(T));
T 89 MMgc/BasicList.h bool TryAdd(T item)
T 96 MMgc/BasicList.h T* newItems = mmfx_new_array_opt(T, tryCapacity, (MMgc::FixedMallocOpts)(kZero|kCanFail));
T 103 MMgc/BasicList.h VMPI_memcpy(newItems, items, count * sizeof(T));
T 112 MMgc/BasicList.h void Remove(T item)
T 130 MMgc/BasicList.h T Get(uint32_t i) const
T 186 MMgc/BasicList.h T *items;
T 192 MMgc/BasicList.h template<typename T>
T 196 MMgc/BasicList.h BasicListIterator(BasicList<T>& bl) : index(0), bl(bl)
T 204 MMgc/BasicList.h T next()
T 206 MMgc/BasicList.h T t = NULL;
T 217 MMgc/BasicList.h BasicList<T> &bl;
T 171 MMgc/GC.cpp , T(1.0-(1.0/L_ideal))
T 272 MMgc/GC.cpp return L_actual / ((1 - T) * (L_actual - 1));
T 322 MMgc/GC.cpp remainingMinorAllocationBudget = minorAllocationBudget = int32_t(remainingMajorAllocationBudget * T);
T 341 MMgc/GC.cpp remainingMinorAllocationBudget = minorAllocationBudget = int32_t(remainingMajorAllocationBudget * T);
T 208 MMgc/GC.h template <class T>
T 212 MMgc/GC.h GCHiddenPointer(T obj=NULL) { set(obj); }
T 213 MMgc/GC.h operator T() const { return (T) (val^HIDDENPTRMASK); }
T 214 MMgc/GC.h T operator=(T tNew)
T 217 MMgc/GC.h return (T)this;
T 219 MMgc/GC.h T operator->() const { return (T) (val^HIDDENPTRMASK); }
T 224 MMgc/GC.h GCHiddenPointer(const GCHiddenPointer<T>& toCopy) { GCAssert(false); }
T 226 MMgc/GC.h void set(T obj)
T 665 MMgc/GC.h double T;
T 267 MMgc/GCGlobalNew.h template <class T>
T 268 MMgc/GCGlobalNew.h T *MMgcConstructTaggedArray(T* /*dummy template arg*/, size_t count, MMgc::FixedMallocOpts opts)
T 270 MMgc/GCGlobalNew.h T *mem = (T*) MMgc::NewTaggedArray(count, sizeof(T), opts, false /* !isPrimitive */);
T 271 MMgc/GCGlobalNew.h T *tp = mem;
T 273 MMgc/GCGlobalNew.h new ((void*)tp) T;
T 285 MMgc/GCGlobalNew.h template <typename T> REALLY_INLINE void MMgcDestructTaggedScalarChecked( T* mem )
T 291 MMgc/GCGlobalNew.h mem->~T();
T 297 MMgc/GCGlobalNew.h template <typename T> REALLY_INLINE void MMgcDestructTaggedArrayChecked( T* mem )
T 306 MMgc/GCGlobalNew.h T* tail = mem + count;
T 310 MMgc/GCGlobalNew.h tail->~T();
T 440 MMgc/GCObject.h template<class T>
T 445 MMgc/GCObject.h ZeroPtr(T _t) : t(_t) { }
T 451 MMgc/GCObject.h operator T() { return t; }
T 452 MMgc/GCObject.h bool operator!=(T other) { return other != t; }
T 453 MMgc/GCObject.h T operator->() const { return t; }
T 455 MMgc/GCObject.h T t;
T 458 MMgc/GCObject.h template<class T>
T 463 MMgc/GCObject.h RCPtr(T _t) : t(_t)
T 485 MMgc/GCObject.h T operator=(T tNew)
T 493 MMgc/GCObject.h return (T) t;
T 496 MMgc/GCObject.h RCPtr<T>& operator=(const RCPtr<T>& other)
T 506 MMgc/GCObject.h operator T() const
T 508 MMgc/GCObject.h return (T) t;
T 511 MMgc/GCObject.h operator ZeroPtr<T>() const { return t; }
T 513 MMgc/GCObject.h bool operator!=(T other) { return other != t; }
T 515 MMgc/GCObject.h T operator->() const
T 517 MMgc/GCObject.h return (T) t;
T 524 MMgc/GCObject.h RCPtr(const RCPtr<T>& other);
T 527 MMgc/GCObject.h T t;
T 44 MMgc/GCThreadLocal.h template<typename T>
T 50 MMgc/GCThreadLocal.h GCAssert(sizeof(T) <= sizeof(void*));
T 62 MMgc/GCThreadLocal.h T operator=(T tNew)
T 67 MMgc/GCThreadLocal.h operator T() const
T 69 MMgc/GCThreadLocal.h return (T) VMPI_tlsGetValue(tlsId);
T 71 MMgc/GCThreadLocal.h T operator->() const
T 73 MMgc/GCThreadLocal.h return (T) VMPI_tlsGetValue(tlsId);
T 86 MMgc/GCWeakRef.h template<class T> class GCWeakRefPtr
T 91 MMgc/GCWeakRef.h GCWeakRefPtr(T t) { set(t);}
T 94 MMgc/GCWeakRef.h T operator=(const GCWeakRefPtr<T>& wb)
T 99 MMgc/GCWeakRef.h T operator=(T tNew)
T 104 MMgc/GCWeakRef.h operator T() const { return (T) t->get(); }
T 106 MMgc/GCWeakRef.h bool operator!=(T other) const { return other != t; }
T 108 MMgc/GCWeakRef.h T operator->() const
T 110 MMgc/GCWeakRef.h return (T) t->get();
T 113 MMgc/GCWeakRef.h T set(const T tNew)
T 144 MMgc/MMgc.h #define CAPACITY(T) (uint32_t(GCHeap::kBlockSize) / uint32_t(sizeof(T)))
T 234 MMgc/WriteBarrier.h template<class T> class WriteBarrier
T 239 MMgc/WriteBarrier.h T set(const T tNew)
T 249 MMgc/WriteBarrier.h explicit REALLY_INLINE WriteBarrier(T _t)
T 259 MMgc/WriteBarrier.h REALLY_INLINE T operator=(const WriteBarrier<T>& wb)
T 264 MMgc/WriteBarrier.h REALLY_INLINE T operator=(T tNew)
T 270 MMgc/WriteBarrier.h REALLY_INLINE operator T() const { return t; }
T 273 MMgc/WriteBarrier.h REALLY_INLINE T value() const { return t; }
T 275 MMgc/WriteBarrier.h REALLY_INLINE operator ZeroPtr<T>() const { return t; }
T 277 MMgc/WriteBarrier.h REALLY_INLINE bool operator!=(T other) const { return other != t; }
T 279 MMgc/WriteBarrier.h REALLY_INLINE T operator->() const
T 287 MMgc/WriteBarrier.h WriteBarrier(const WriteBarrier<T>& toCopy); // unimplemented
T 289 MMgc/WriteBarrier.h T t;
T 296 MMgc/WriteBarrier.h template<class T> class WriteBarrierRC
T 300 MMgc/WriteBarrier.h REALLY_INLINE T set(const T tNew)
T 311 MMgc/WriteBarrier.h explicit REALLY_INLINE WriteBarrierRC(const T _t) // : t(0) -- not necessary, WriteBarrierRC_ctor handles it
T 321 MMgc/WriteBarrier.h REALLY_INLINE void set(MMgc::GC* gc, void* container, T newValue)
T 326 MMgc/WriteBarrier.h REALLY_INLINE T operator=(const WriteBarrierRC<T>& wb)
T 331 MMgc/WriteBarrier.h REALLY_INLINE T operator=(T tNew)
T 336 MMgc/WriteBarrier.h REALLY_INLINE T value() const { return t; }
T 338 MMgc/WriteBarrier.h REALLY_INLINE operator T() const { return t; }
T 340 MMgc/WriteBarrier.h REALLY_INLINE operator ZeroPtr<T>() const { return t; }
T 342 MMgc/WriteBarrier.h REALLY_INLINE bool operator!=(T other) const { return other != t; }
T 344 MMgc/WriteBarrier.h REALLY_INLINE T operator->() const
T 359 MMgc/WriteBarrier.h WriteBarrierRC(const WriteBarrierRC<T>& toCopy);
T 361 MMgc/WriteBarrier.h T t;
T 44 axscript/dataio.h template <class T>
T 45 axscript/dataio.h inline void CoreSwap(T& a, T& b)
T 47 axscript/dataio.h T t = a;
T 48 core/Sampler.cpp static void inline read(uint8_t*& p, T& u)
T 55 core/Sampler.cpp const T* pT;
T 60 core/Sampler.cpp p += sizeof(T);
T 65 core/Sampler.cpp static void inline write(uint8_t*& p, T u)
T 72 core/Sampler.cpp T* pT;
T 77 core/Sampler.cpp p += sizeof(T);
T 72 core/SortedMap.h template <class K, class T, ListElementType valType>
T 101 core/SortedMap.h T put(K k, T v)
T 107 core/SortedMap.h return (T)v;
T 114 core/SortedMap.h T old = values[i];
T 129 core/SortedMap.h T get(K k) const
T 134 core/SortedMap.h bool get(K k, T& v) const
T 149 core/SortedMap.h T remove(K k)
T 154 core/SortedMap.h T removeAt(int i)
T 156 core/SortedMap.h T old = values.removeAt(i);
T 161 core/SortedMap.h T removeFirst() { return isEmpty() ? (T)0 : removeAt(0); }
T 162 core/SortedMap.h T removeLast() { return isEmpty() ? (T)0 : removeAt(keys.size()-1); }
T 163 core/SortedMap.h T first() const { return isEmpty() ? (T)0 : values[0]; }
T 164 core/SortedMap.h T last() const { return isEmpty() ? (T)0 : values[keys.size()-1]; }
T 170 core/SortedMap.h T at(int i) const { return values[i]; }
T 179 core/SortedMap.h List<T, valType> values;
T 204 core/SortedMap.h template <class K, class T, ListElementType valType>
T 219 core/SortedMap.h inline T put(K k, T v) { return map.put(k, v); }
T 220 core/SortedMap.h inline T get(K k) const { return map.get(k); }
T 221 core/SortedMap.h inline bool get(K k, T& v) const { return map.get(k, v); }
T 223 core/SortedMap.h inline T remove(K k) { return map.remove(k); }
T 224 core/SortedMap.h inline T removeAt(int i) { return map.removeAt(i); }
T 225 core/SortedMap.h inline T removeFirst() { return map.removeFirst(); }
T 226 core/SortedMap.h inline T removeLast() { return map.removeLast(); }
T 227 core/SortedMap.h inline T first() const { return map.first(); }
T 228 core/SortedMap.h inline T last() const { return map.last(); }
T 231 core/SortedMap.h inline T at(int i) const { return map.at(i); }
T 97 core/VectorClass.h template <class T>
T 109 core/VectorClass.h mmfx_delete_array((T*)m_array);
T 126 core/VectorClass.h T _getNativeUintProperty(uint32 index) const
T 133 core/VectorClass.h T _getNativeIntProperty(int index) const
T 140 core/VectorClass.h void _setNativeUintProperty(uint32 index, T value)
T 152 core/VectorClass.h void _setNativeIntProperty(int index, T value)
T 208 core/VectorClass.h VMPI_memset(m_array+newLength, 0, (m_length-newLength)*sizeof(T));
T 223 core/VectorClass.h T *arr = m_array;
T 224 core/VectorClass.h VMPI_memmove (arr + argc, arr, m_length * sizeof(T));
T 238 core/VectorClass.h T temp;
T 252 core/VectorClass.h T *arr = m_array;
T 255 core/VectorClass.h TypedVectorObject<T>* vec_args = isVector(args);
T 263 core/VectorClass.h VMPI_memmove (arr + insertPoint + insertCount, arr + insertPoint + deleteCount, toMove * sizeof(T));
T 269 core/VectorClass.h VMPI_memmove (arr + insertPoint + l_shiftAmount, arr + insertPoint, (m_length - insertPoint) * sizeof(T));
T 281 core/VectorClass.h VMPI_memmove(arr+insertPoint, vec_args->m_array+offset, insertCount*sizeof(T));
T 296 core/VectorClass.h T AS3_pop()
T 303 core/VectorClass.h T r = m_array[l];
T 310 core/VectorClass.h DWB(T *) m_array;
T 399 core/VectorClass.h TypedVectorObject<T>* isVector(Atom instance)
T 402 core/VectorClass.h return (TypedVectorObject<T>*)AvmCore::atomToScriptObject(instance);
T 413 core/VectorClass.h T *newArray = mmfx_new_array(T, newCapacity);
T 420 core/VectorClass.h VMPI_memcpy(newArray, m_array, m_length * sizeof(T));
T 421 core/VectorClass.h mmfx_delete_array((T*)m_array);
T 423 core/VectorClass.h VMPI_memset(newArray+m_length, 0, (newCapacity-m_capacity) * sizeof(T));
T 119 core/WordcodeEmitter.cpp T* tmp1 = v; \
T 121 core/WordcodeEmitter.cpp T* tmp2 = tmp1; \
T 97 core/avmplusList.h template <class T>
T 121 core/avmplusList.h template<class T, ListElementType kElementType, class ListAllocPolicy>
T 124 core/avmplusList.h template<class T, class ListAllocPolicy>
T 125 core/avmplusList.h class ListBase<T, LIST_NonGCObjects, ListAllocPolicy> : public ListAllocPolicy::Base
T 128 core/avmplusList.h T *data;
T 133 core/avmplusList.h void wb(uint32 index, T value)
T 141 core/avmplusList.h template<class T, class ListAllocPolicy>
T 142 core/avmplusList.h class ListBase<T, LIST_GCObjects, ListAllocPolicy> : public ListAllocPolicy::Base
T 145 core/avmplusList.h T *data;
T 150 core/avmplusList.h void wb(uint32 index, T value)
T 158 core/avmplusList.h template<class T, class ListAllocPolicy>
T 159 core/avmplusList.h class ListBase<T, LIST_RCObjects, ListAllocPolicy> : public ListAllocPolicy::Base
T 162 core/avmplusList.h T *data;
T 167 core/avmplusList.h void wb(uint32 index, T value)
T 175 core/avmplusList.h template <class T, ListElementType kElementType = _ListElementTypeHelper<T>::kElementType, class ListAllocPolicy = ListAllocPolicy_GC>
T 176 core/avmplusList.h class List : public ListBase<T, kElementType, ListAllocPolicy>
T 178 core/avmplusList.h using ListBase<T, kElementType, ListAllocPolicy>::data;
T 179 core/avmplusList.h using ListBase<T, kElementType, ListAllocPolicy>::len;
T 180 core/avmplusList.h using ListBase<T, kElementType, ListAllocPolicy>::max;
T 181 core/avmplusList.h using ListBase<T, kElementType, ListAllocPolicy>::gc;
T 182 core/avmplusList.h using ListBase<T, kElementType, ListAllocPolicy>::wb;
T 222 core/avmplusList.h uint32 add(T value)
T 243 core/avmplusList.h T get(uint32 index) const
T 248 core/avmplusList.h T last() const
T 253 core/avmplusList.h void set(uint32 index, T value)
T 259 core/avmplusList.h void insert(int index, T value)
T 285 core/avmplusList.h void add(const List<T, kElementType>& l)
T 302 core/avmplusList.h VMPI_memset(data, 0, len*sizeof(T));
T 308 core/avmplusList.h int indexOf(T value) const
T 315 core/avmplusList.h int lastIndexOf(T value) const
T 323 core/avmplusList.h T removeAt(uint32 i)
T 325 core/avmplusList.h T old = (T)0;
T 339 core/avmplusList.h T removeFirst() { return isEmpty() ? (T)0 : removeAt(0); }
T 340 core/avmplusList.h T removeLast() { return isEmpty() ? (T)0 : removeAt(len-1); }
T 342 core/avmplusList.h T operator[](uint32 index) const
T 357 core/avmplusList.h T* newData = (gc) ? (T*) gc->Calloc(cap, sizeof(T), gcflags) : mmfx_new_array(T, cap);
T 374 core/avmplusList.h const T *getData() const { return data; }
T 376 core/avmplusList.h void become(List<T, kElementType> &list) {
T 385 core/avmplusList.h List<T,kElementType>& operator=(const List<T,kElementType>& other); // unimplemented
T 386 core/avmplusList.h List(const List<T,kElementType>& other); // unimplemented
T 402 core/avmplusList.h void arraycopy(const T* src, int srcStart, T* dst, int dstStart, int nbr)
T 48 core/avmplusStack.h template <class T>
T 56 core/avmplusStack.h data = new T[kInitialCapacity];
T 64 core/avmplusStack.h void add(T value)
T 75 core/avmplusStack.h T pop()
T 89 core/avmplusStack.h T *data;
T 96 core/avmplusStack.h T *newData = new T[newMax];
T 123 core/jit-calls.h template <class T>
T 124 core/jit-calls.h REALLY_INLINE T load_cached_slot(BindingCache& c, Atom obj)
T 126 core/jit-calls.h return *((T*) (uintptr_t(atomObj(obj)) + c.slot_offset));
T 138 core/jit-calls.h template <class T>
T 142 core/jit-calls.h return op_call(env, load_cached_slot<T>(c, obj), argc, args);
T 304 core/jit-calls.h template <class T>
T 308 core/jit-calls.h return boxslot(atomObj(obj)->core(), load_cached_slot<T>(c, obj));
T 538 core/jit-calls.h template <class T>
T 543 core/jit-calls.h T* slot_ptr = (T*) (uintptr_t(obj_ptr) + c.slot_offset);
T 52 eval/eval-abc.cpp template<class T> static uint32_t computeSize(Seq<T>* xs)
T 60 eval/eval-abc.cpp template<class T> static uint8_t* serializeSeq(uint8_t* b, Seq<T>* xs)
T 67 eval/eval-abc.cpp template<class T> static uint32_t length(Seq<T>* xs)
T 70 eval/eval-util-inlines.h template<class T> inline Seq<T>* SeqBuilder<T>::get() const
T 96 eval/eval-util.cpp template<class T> void SeqBuilder<T>::addAtEnd(T item)
T 98 eval/eval-util.cpp Seq<T>* e = ALLOC(Seq<T>, (item));
T 213 eval/eval-util.h template<class T> class Seq {
T 215 eval/eval-util.h Seq(T hd, Seq<T>* tl=NULL) : hd(hd), tl(tl) {}
T 216 eval/eval-util.h T hd;
T 217 eval/eval-util.h Seq<T>* tl;
T 220 eval/eval-util.h template<class T> class SeqBuilder {
T 224 eval/eval-util.h void addAtEnd(T item);
T 225 eval/eval-util.h Seq<T>* get() const;
T 229 eval/eval-util.h Seq<T>* items;
T 230 eval/eval-util.h Seq<T>* last;
T 104 nanojit/Containers.h template<class T> class Seq {
T 106 nanojit/Containers.h Seq(T head, Seq<T>* tail=NULL) : head(head), tail(tail) {}
T 107 nanojit/Containers.h T head;
T 108 nanojit/Containers.h Seq<T>* tail;
T 115 nanojit/Containers.h template<class T> class SeqBuilder {
T 124 nanojit/Containers.h void insert(T item) {
T 125 nanojit/Containers.h Seq<T>* e = new (allocator) Seq<T>(item, items);
T 132 nanojit/Containers.h void add(T item) {
T 133 nanojit/Containers.h Seq<T>* e = new (allocator) Seq<T>(item);
T 142 nanojit/Containers.h Seq<T>* get() const {
T 158 nanojit/Containers.h Seq<T>* items;
T 159 nanojit/Containers.h Seq<T>* last;
T 256 nanojit/Containers.h template<class K, class T, class H=DefaultHash<K> > class HashMap {
T 262 nanojit/Containers.h T value;
T 263 nanojit/Containers.h Node(K k, T v) : key(k), value(v) { }
T 293 nanojit/Containers.h void put(const K& k, const T& v) {
T 304 nanojit/Containers.h T get(const K& k) {
T 344 nanojit/Containers.h const HashMap<K,T,H> ↦
T 349 nanojit/Containers.h Iter(HashMap<K,T,H>& map) : map(map), bucket((int)map.nbuckets-1), current(NULL)
T 368 nanojit/Containers.h const T& value() const {
T 385 nanojit/Containers.h template<class K, class T> class TreeMap {
T 392 nanojit/Containers.h T value;
T 393 nanojit/Containers.h Node(K k, T v) : left(NULL), right(NULL), key(k), value(v)
T 402 nanojit/Containers.h void insert(Node* &n, K k, T v) {
T 434 nanojit/Containers.h void put(K k, T v) {
T 446 nanojit/Containers.h T get(K k) {
T 1175 pcre/pcre_compile.cpp void push(T& value); // push value onto the stack (by copy)
T 1176 pcre/pcre_compile.cpp void pop(T& value); // pop value off the stack (by copy)
T 1177 pcre/pcre_compile.cpp T& stackTop(); // reference to top element
T 1181 pcre/pcre_compile.cpp T memory[TYPED_SEGMENT_SIZE]; // stack memory
T 1182 pcre/pcre_compile.cpp T *top; // for non-top segments, the saved 'top' pointer
T 1191 pcre/pcre_compile.cpp T *top; // next free address in that segment
T 1192 pcre/pcre_compile.cpp T *limit; // limit address in that segment
T 1200 pcre/pcre_compile.cpp void TypedStack<T>::invariants()
T 1208 pcre/pcre_compile.cpp TypedStack<T>::TypedStack()
T 1221 pcre/pcre_compile.cpp TypedStack<T>::~TypedStack()
T 1235 pcre/pcre_compile.cpp bool TypedStack<T>::isEmpty()
T 1241 pcre/pcre_compile.cpp T& TypedStack<T>::stackTop()
T 1249 pcre/pcre_compile.cpp void TypedStack<T>::push(T& value)
T 1264 pcre/pcre_compile.cpp void TypedStack<T>::pop(T& value)
T 1278 pcre/pcre_compile.cpp void TypedStack<T>::pushSegment()
T 1290 pcre/pcre_compile.cpp void TypedStack<T>::popSegment()
T 44 shell/DataIO.h template <class T>
T 45 shell/DataIO.h inline void CoreSwap(T& a, T& b)
T 47 shell/DataIO.h T t = a;
T 53 utils/abcasm/src/abcasm/Pool.java public class Pool<T extends Comparable>