X7ROOT File Manager
Current Path:
/opt/alt/python33/include/python3.3m
opt
/
alt
/
python33
/
include
/
python3.3m
/
ðŸ“
..
📄
Python-ast.h
(18.87 KB)
📄
Python.h
(2.77 KB)
📄
abstract.h
(41.61 KB)
📄
accu.h
(1016 B)
📄
asdl.h
(1.07 KB)
📄
ast.h
(344 B)
📄
bitset.h
(792 B)
📄
bltinmodule.h
(264 B)
📄
boolobject.h
(886 B)
📄
bytearrayobject.h
(1.95 KB)
📄
bytes_methods.h
(1.98 KB)
📄
bytesobject.h
(4.78 KB)
📄
cellobject.h
(701 B)
📄
ceval.h
(7.03 KB)
📄
classobject.h
(1.63 KB)
📄
code.h
(4.13 KB)
📄
codecs.h
(6.33 KB)
📄
compile.h
(1.62 KB)
📄
complexobject.h
(1.91 KB)
📄
datetime.h
(8.34 KB)
📄
descrobject.h
(2.84 KB)
📄
dictobject.h
(4.86 KB)
📄
dtoa.h
(458 B)
📄
dynamic_annotations.h
(21.94 KB)
📄
enumobject.h
(253 B)
📄
errcode.h
(1.46 KB)
📄
eval.h
(597 B)
📄
fileobject.h
(1.73 KB)
📄
fileutils.h
(1.06 KB)
📄
floatobject.h
(4.53 KB)
📄
frameobject.h
(3.29 KB)
📄
funcobject.h
(3.68 KB)
📄
genobject.h
(1.05 KB)
📄
graminit.h
(1.83 KB)
📄
grammar.h
(1.97 KB)
📄
import.h
(3.79 KB)
📄
intrcheck.h
(460 B)
📄
iterobject.h
(567 B)
📄
listobject.h
(2.77 KB)
📄
longintrepr.h
(3.9 KB)
📄
longobject.h
(7.55 KB)
📄
marshal.h
(743 B)
📄
memoryobject.h
(2.8 KB)
📄
metagrammar.h
(253 B)
📄
methodobject.h
(3.23 KB)
📄
modsupport.h
(4.75 KB)
📄
moduleobject.h
(1.53 KB)
📄
namespaceobject.h
(297 B)
📄
node.h
(996 B)
📄
object.h
(37.09 KB)
📄
objimpl.h
(13.08 KB)
📄
opcode.h
(5.09 KB)
📄
osdefs.h
(986 B)
📄
parsetok.h
(2.23 KB)
📄
patchlevel.h
(1.1 KB)
📄
pgen.h
(253 B)
📄
pgenheaders.h
(1.12 KB)
📄
py_curses.h
(4.08 KB)
📄
pyarena.h
(2.68 KB)
📄
pyatomic.h
(5.8 KB)
📄
pycapsule.h
(1.69 KB)
📄
pyconfig-64.h
(41.43 KB)
📄
pyconfig.h
(162 B)
📄
pyctype.h
(1.29 KB)
📄
pydebug.h
(986 B)
📄
pyerrors.h
(14.34 KB)
📄
pyexpat.h
(2.29 KB)
📄
pyfpe.h
(8.29 KB)
📄
pygetopt.h
(388 B)
📄
pymacconfig.h
(2.92 KB)
📄
pymacro.h
(2.62 KB)
📄
pymath.h
(6.26 KB)
📄
pymem.h
(4.59 KB)
📄
pyport.h
(30.32 KB)
📄
pystate.h
(7.58 KB)
📄
pystrcmp.h
(436 B)
📄
pystrtod.h
(1.25 KB)
📄
pythonrun.h
(8.79 KB)
📄
pythread.h
(2.96 KB)
📄
pytime.h
(2.64 KB)
📄
rangeobject.h
(629 B)
📄
setobject.h
(3.21 KB)
📄
sliceobject.h
(1.35 KB)
📄
structmember.h
(2.02 KB)
📄
structseq.h
(1.19 KB)
📄
symtable.h
(4.58 KB)
📄
sysmodule.h
(1.08 KB)
📄
token.h
(1.84 KB)
📄
traceback.h
(2.09 KB)
📄
tupleobject.h
(2.39 KB)
📄
typeslots.h
(1.95 KB)
📄
ucnhash.h
(1.03 KB)
📄
unicodeobject.h
(74.41 KB)
📄
warnings.h
(953 B)
📄
weakrefobject.h
(2.8 KB)
Editing: pyatomic.h
#ifndef Py_LIMITED_API #ifndef Py_ATOMIC_H #define Py_ATOMIC_H /* XXX: When compilers start offering a stdatomic.h with lock-free atomic_int and atomic_address types, include that here and rewrite the atomic operations in terms of it. */ #include "dynamic_annotations.h" #ifdef __cplusplus extern "C" { #endif /* This is modeled after the atomics interface from C1x, according to * the draft at * http://www.open-std.org/JTC1/SC22/wg14/www/docs/n1425.pdf. * Operations and types are named the same except with a _Py_ prefix * and have the same semantics. * * Beware, the implementations here are deep magic. */ typedef enum _Py_memory_order { _Py_memory_order_relaxed, _Py_memory_order_acquire, _Py_memory_order_release, _Py_memory_order_acq_rel, _Py_memory_order_seq_cst } _Py_memory_order; typedef struct _Py_atomic_address { void *_value; } _Py_atomic_address; typedef struct _Py_atomic_int { int _value; } _Py_atomic_int; /* Only support GCC (for expression statements) and x86 (for simple * atomic semantics) for now */ #if defined(__GNUC__) && (defined(__i386__) || defined(__amd64)) static __inline__ void _Py_atomic_signal_fence(_Py_memory_order order) { if (order != _Py_memory_order_relaxed) __asm__ volatile("":::"memory"); } static __inline__ void _Py_atomic_thread_fence(_Py_memory_order order) { if (order != _Py_memory_order_relaxed) __asm__ volatile("mfence":::"memory"); } /* Tell the race checker about this operation's effects. */ static __inline__ void _Py_ANNOTATE_MEMORY_ORDER(const volatile void *address, _Py_memory_order order) { (void)address; /* shut up -Wunused-parameter */ switch(order) { case _Py_memory_order_release: case _Py_memory_order_acq_rel: case _Py_memory_order_seq_cst: _Py_ANNOTATE_HAPPENS_BEFORE(address); break; case _Py_memory_order_relaxed: case _Py_memory_order_acquire: break; } switch(order) { case _Py_memory_order_acquire: case _Py_memory_order_acq_rel: case _Py_memory_order_seq_cst: _Py_ANNOTATE_HAPPENS_AFTER(address); break; case _Py_memory_order_relaxed: case _Py_memory_order_release: break; } } #define _Py_atomic_store_explicit(ATOMIC_VAL, NEW_VAL, ORDER) \ __extension__ ({ \ __typeof__(ATOMIC_VAL) atomic_val = ATOMIC_VAL; \ __typeof__(atomic_val->_value) new_val = NEW_VAL;\ volatile __typeof__(new_val) *volatile_data = &atomic_val->_value; \ _Py_memory_order order = ORDER; \ _Py_ANNOTATE_MEMORY_ORDER(atomic_val, order); \ \ /* Perform the operation. */ \ _Py_ANNOTATE_IGNORE_WRITES_BEGIN(); \ switch(order) { \ case _Py_memory_order_release: \ _Py_atomic_signal_fence(_Py_memory_order_release); \ /* fallthrough */ \ case _Py_memory_order_relaxed: \ *volatile_data = new_val; \ break; \ \ case _Py_memory_order_acquire: \ case _Py_memory_order_acq_rel: \ case _Py_memory_order_seq_cst: \ __asm__ volatile("xchg %0, %1" \ : "+r"(new_val) \ : "m"(atomic_val->_value) \ : "memory"); \ break; \ } \ _Py_ANNOTATE_IGNORE_WRITES_END(); \ }) #define _Py_atomic_load_explicit(ATOMIC_VAL, ORDER) \ __extension__ ({ \ __typeof__(ATOMIC_VAL) atomic_val = ATOMIC_VAL; \ __typeof__(atomic_val->_value) result; \ volatile __typeof__(result) *volatile_data = &atomic_val->_value; \ _Py_memory_order order = ORDER; \ _Py_ANNOTATE_MEMORY_ORDER(atomic_val, order); \ \ /* Perform the operation. */ \ _Py_ANNOTATE_IGNORE_READS_BEGIN(); \ switch(order) { \ case _Py_memory_order_release: \ case _Py_memory_order_acq_rel: \ case _Py_memory_order_seq_cst: \ /* Loads on x86 are not releases by default, so need a */ \ /* thread fence. */ \ _Py_atomic_thread_fence(_Py_memory_order_release); \ break; \ default: \ /* No fence */ \ break; \ } \ result = *volatile_data; \ switch(order) { \ case _Py_memory_order_acquire: \ case _Py_memory_order_acq_rel: \ case _Py_memory_order_seq_cst: \ /* Loads on x86 are automatically acquire operations so */ \ /* can get by with just a compiler fence. */ \ _Py_atomic_signal_fence(_Py_memory_order_acquire); \ break; \ default: \ /* No fence */ \ break; \ } \ _Py_ANNOTATE_IGNORE_READS_END(); \ result; \ }) #else /* !gcc x86 */ /* Fall back to other compilers and processors by assuming that simple volatile accesses are atomic. This is false, so people should port this. */ #define _Py_atomic_signal_fence(/*memory_order*/ ORDER) ((void)0) #define _Py_atomic_thread_fence(/*memory_order*/ ORDER) ((void)0) #define _Py_atomic_store_explicit(ATOMIC_VAL, NEW_VAL, ORDER) \ ((ATOMIC_VAL)->_value = NEW_VAL) #define _Py_atomic_load_explicit(ATOMIC_VAL, ORDER) \ ((ATOMIC_VAL)->_value) #endif /* !gcc x86 */ /* Standardized shortcuts. */ #define _Py_atomic_store(ATOMIC_VAL, NEW_VAL) \ _Py_atomic_store_explicit(ATOMIC_VAL, NEW_VAL, _Py_memory_order_seq_cst) #define _Py_atomic_load(ATOMIC_VAL) \ _Py_atomic_load_explicit(ATOMIC_VAL, _Py_memory_order_seq_cst) /* Python-local extensions */ #define _Py_atomic_store_relaxed(ATOMIC_VAL, NEW_VAL) \ _Py_atomic_store_explicit(ATOMIC_VAL, NEW_VAL, _Py_memory_order_relaxed) #define _Py_atomic_load_relaxed(ATOMIC_VAL) \ _Py_atomic_load_explicit(ATOMIC_VAL, _Py_memory_order_relaxed) #ifdef __cplusplus } #endif #endif /* Py_ATOMIC_H */ #endif /* Py_LIMITED_API */
Upload File
Create Folder