Home
last modified time | relevance | path

Searched refs:T (Results 1 – 25 of 33) sorted by relevance

12

/CTR-SDK-0.14.4/include/nn/math/
Dmath_Utility.h23 template <typename T>
24 inline T Abs(T x) in Abs()
29 template <typename T, typename U, typename S>
30 inline S Max(T a, U b) in Max()
35 template <typename T>
36 inline T Max(T a, T b) in Max()
41 template <typename T, typename U, typename S>
42 inline S Min(T a, U b) in Min()
47 template <typename T>
48 inline T Min(T a, T b) in Min()
[all …]
/CTR-SDK-0.14.4/sources/libraries/rdt/CTR/
Drdt_Deque.h33 template <class T, size_t N>
64 void PushBack(const T &value);
74 const T& Front(void) const;
79 T& Front(void);
84 const T& Back(void) const;
89 T& Back(void);
94 const T& At(size_t n) const;
113 T m_array[N];
122 template <class T, size_t N>
123 Deque<T, N>::Deque(void) in Deque()
[all …]
Drdt_Queue.h33 template <class T, size_t N>
59 void Push(const T &value);
69 const T& Front(void) const;
74 const T& Back(void) const;
98 T m_array[N];
105 template <class T, size_t N>
106 Queue<T, N>::Queue(void) in Queue()
112 template <class T, size_t N>
113 Queue<T, N>::~Queue(void) in ~Queue()
118 template <class T, size_t N>
[all …]
Drdt_Utility.h96 template <class T>
103 T t; in Align()
253 template <class T>
254 T min(T a, T b) in min()
259 template <class T>
260 T max(T a, T b) in max()
/CTR-SDK-0.14.4/include/nn/fnd/
Dfnd_LinkedList.h73 template <typename T, typename Tag = void>
74 class IntrusiveLinkedList : private nn::util::NonCopyable<IntrusiveLinkedList<T, Tag> >
102 void PushBack(T* p);
109 void PushFront(T* p);
116 T* GetFront() const;
123 T* GetBack() const;
132 T* PopFront();
141 T* PopBack();
150 T* GetNext(T* p) const;
159 T* GetPrevious(T* p) const;
[all …]
Dfnd_Allocator.h70 template <typename Allocator, typename T, typename Tag = void>
77 typedef T* pointer;
78 typedef const T* const_pointer;
79 typedef T& reference;
80 typedef const T& const_reference;
81 typedef T value_type;
89 …{ return static_cast<T*>(StdAllocatorAdapterHolder<Allocator, Tag>::GetAllocator()->Allocate(n * s…
91 … size_type max_size() const throw() { return ::std::numeric_limits<size_type>::max() / sizeof(T); } in max_size()
92 void construct(pointer p, const T& val) { new (static_cast<void*>(p)) T(val); } in construct()
93 void destroy(pointer p) { p->~T(); } in destroy()
[all …]
Dfnd_Interlocked.h52 template <typename T>
79 volatile T m_v; //!< バリア変数
88 bool operator()(T& x) { x = m_converter(x); return true; }
94 T m_operand; \
96 bool operator()(T& x) { x op m_operand; return true; } \
111 T result; \
112 bool operator()(T& x) { result = preop x postop; return true; } \
124 T m_comparand;
125 T m_value;
126 T m_result;
[all …]
Dfnd_FixedBufferVector.h26 template <typename T, int NUM_OF_T>
36 const T& operator[](int index) const
40 T& operator[](int index)
45 void Add(T v) in Add()
49 T* Add() in Add()
53 T* p = &m_Buffer[m_Length]; in Add()
74 T* GetBegin() { return &m_Buffer[0]; } in GetBegin()
75 T* GetEnd() { return &m_Buffer[m_Length]; } in GetEnd()
76 const T* GetBegin() const { return &m_Buffer[0]; } in GetBegin()
77 const T* GetEnd() const { return &m_Buffer[m_Length]; } in GetEnd()
[all …]
Dfnd_Queue.h33 template <typename T, typename Tag = void>
34 class IntrusiveQueue : private nn::util::NonCopyable<IntrusiveQueue<T, Tag> >
57 void Enqueue(T* p);
66 T* Dequeue();
85 template <typename T, typename Tag>
86 class IntrusiveQueue<T, Tag>::Item : private nn::util::NonCopyable<IntrusiveQueue<T, Tag>::Item>
96 template <typename T, typename Tag>
97 inline void IntrusiveQueue<T, Tag>::Enqueue(T* p) in Enqueue()
114 template <typename T, typename Tag>
115 inline T* IntrusiveQueue<T, Tag>::Dequeue() in Dequeue()
[all …]
/CTR-SDK-0.14.4/include/nn/fnd/ARMv6/
Dfnd_Interlocked.h30 template <typename T>
33 static T LoadRegEx (volatile T* ptr) { return __ldrex(ptr); } in LoadRegEx()
34 static int StoreRegEx(T val, volatile T* ptr) { return __strex(val, ptr); } in StoreRegEx()
48 template <typename T, typename = void> struct AtomicStorageSelecter;
50 …template <typename T> struct AtomicStorageSelecter<T, typename nn::util::enable_if<sizeof(T) == si…
55 …template <typename T> struct AtomicStorageSelecter<T, typename nn::util::enable_if<sizeof(T) == si…
60 …template <typename T> struct AtomicStorageSelecter<T, typename nn::util::enable_if<sizeof(T) == si…
65 …template <typename T> struct AtomicStorageSelecter<T, typename nn::util::enable_if<sizeof(T) == si…
84 template <typename T>
85 static T* CompareAndSwap(T** pTarget, T* comp, T* swap)
[all …]
/CTR-SDK-0.14.4/include/nn/util/
Dutil_TypeTraits.h40 template <class T, T v> struct integral_constant;
45 template <class T> struct is_void;
87 template <class T> struct alignment_of;
92 template <class T, class U> struct is_same;
125 template <bool, class T = void> struct enable_if;
134 template <class T, T v>
137 typedef integral_constant<T, v> type;
138 typedef T value_type;
156 template <class T>
157 struct alignment_of : public integral_constant<size_t, __alignof__(T)> {};
[all …]
Dutil_ScopedPointer.h26 template <typename T>
27 class ScopedPointer : private nn::util::NonCopyable<ScopedPointer<T> >
30 T* m_Ptr;
32 ScopedPointer(T* ptr) : m_Ptr(ptr){}; in ScopedPointer()
38 T& operator*() const
43 T* operator->() const
48 T* Get() const in Get()
Dutil_Misc.h27 template <typename T, size_t Num>
28 size_t GetArraySize(T (&a)[Num]) in GetArraySize()
42 template <typename T, size_t Num>
43 const SizeTValue<Num>& GetArraySizeT(T (&a)[Num]) in GetArraySizeT()
51 template <typename T, size_t Num>
52 char (*NumOfElementsT(T (&a)[Num]))[Num];
Dutil_StaticAssert.h54 …#define NN_STATIC_ASSERT_IS_POD(T) typedef union { T NN_UTIL_STATICASSERT_H_STRING_JOIN_(nn_util_s…
60 …#define NN_STATIC_ASSERT_IS_POD(T) typedef void NN_UTIL_STATICASSERT_H_STRING_JOIN_(nn_util_static…
/CTR-SDK-0.14.4/include/nn/util/ARMv6/
Dutil_LockFreeQueueImpl.h77 template <typename T>
78 …class LockFreeQueueNode : private nn::util::NonCopyable<LockFreeQueueNode<T> >, private LockFreeQu…
85 T m_x;
90 explicit LockFreeQueueNode(const T& x) : m_x(x) { Initialize(); } in LockFreeQueueNode()
92 T& Value() { return m_x; } in Value()
93 const T& Value() const { return m_x; } in Value()
118 template <typename T>
119 …class LockFreeQueueImpl : private NonCopyable<LockFreeQueueImpl<T> >, private LockFreeQueueImplBase
122 typedef T ValueType;
123 typedef LockFreeQueueNode<T> NodeType;
[all …]
/CTR-SDK-0.14.4/include/nn/os/
Dos_Alarm.h121 template <typename T>
122 void SetOneShot(nn::fnd::TimeSpan time, void (*handler)(T* param, bool cancelled), T* param);
139 template <typename T>
140 …TimeSpan initial, nn::fnd::TimeSpan interval, void (*handler)(T* param, bool cancelled), T* param);
155 template <typename T>
156 … void SetPeriodic(nn::fnd::TimeSpan interval, void (*handler)(T* param, bool cancelled), T* param);
207 template <typename T>
208 inline void Alarm::SetOneShot(nn::fnd::TimeSpan time, void (*handler)(T* param, bool cancelled), T*… in SetOneShot()
213 template <typename T>
214 …eriodic(nn::fnd::TimeSpan initial, nn::fnd::TimeSpan interval, void (*handler)(T*, bool), T* param) in SetPeriodic() argument
[all …]
Dos_Thread.h235 template <typename T, typename U, typename Stack>
236 …void Start(void (*f)(T), U param, Stack& stack, s32 priority = DEFAULT_THREAD_PRIORITY, s32 coreNo…
237 template <typename T, typename Stack>
238 …void Start(void (*f)(const T*), const T& param, Stack& stack, s32 priority = DEFAULT_THREAD_PRIORI…
239 template <typename T, typename Stack>
240 …void Start(void (*f)(const T&), const T& param, Stack& stack, s32 priority = DEFAULT_THREAD_PRIORI…
282 template <typename T, typename U, typename Stack>
283 …nn::Result TryStart(void (*f)(T), U param, Stack& stack, s32 priority = DEFAULT_THREAD_PRIORITY, s…
317 template <typename T, typename U>
318 …void StartUsingAutoStack(void (*f)(T), U param, size_t stackSize, s32 priority = DEFAULT_THREAD_PR…
[all …]
Dos_ContinuationIterator.h73 template <class T>
78 T m_Value;
84 void SetCurrent(const T& value) { m_Value = value; } in SetCurrent()
88 Result YieldReturn(const T& value) { SetCurrent(value); return Yield(); } in YieldReturn()
91 const T& GetCurrent() const { return m_Value; } in GetCurrent()
/CTR-SDK-0.14.4/include/nn/fslow/
Dfslow_Path.h125 template <typename T>
126 void SetBinary(const T* p) in SetBinary()
130 this->m_BinarySize = sizeof(T); in SetBinary()
133 template <typename T>
134 static LowPath Make(const T* p) in Make()
173 template <class T>
174 operator const T*() const
176 if (m_Path->GetPathType() == PATH_TYPE_BINARY && m_Path->GetBinarySize() == sizeof(T))
178 return static_cast<const T*>(m_Path->m_Data);
Dfslow_HandleTable.h110 template<class T>
126 const HandleValue& Register(const T& object) in Register()
142 const T& GetObject() const { return m_Object; } in GetObject()
149 T m_Object;
155 template<class T, size_t TNumEntry>
158 typedef HandleTableEntry<T> TEntry;
176 const HandleValue& Register(const T& object) in Register()
192 const T& GetObject(const HandleValue& value) const in GetObject()
199 bool TryGetObject(T* pObject, const HandleValue& value) const in TryGetObject()
Dfslow_SafePath.h37 template <class T> explicit ReferenceCountedString(const T* s) : Base(s) {} in ReferenceCountedString()
49 template <class T> explicit SafePath(const T* s) : Base(s) {} in SafePath()
/CTR-SDK-0.14.4/include/nn/util/detail/
Dutil_InitializationTransaction.h27 #define NN_UTIL_DETAIL_REGISTER_INITIALIZATION_TRANSACTION(transaction, T, object, f) \ argument
31 T& m_Object; \
34 …OIN_(nn_util_detail_initialtransaction_class_, __LINE__)(bool& transaction, T& object) : m_Object(…
/CTR-SDK-0.14.4/sources/libraries/os/
Dos_ContinuationIterator.cpp52 #define AllocateFromStack(T, sp) reinterpret_cast<T*>((sp) -= sizeof(T)) in Initialize() argument
Dos_Default.cpp24 template <typename T>
25 T RoundUp(T x, int r) in RoundUp()
/CTR-SDK-0.14.4/include/nn/os/ARM/
Dos_ExceptionHandler.h163 template <typename T>
164 void SetUserExceptionHandler(UserExceptionHandler pHandler, T* pStack) in SetUserExceptionHandler()

12