S                  39 modules/xvid_dec/xvid_wce/mbprediction.cpp #define RET_SHR(a, N, S) return (a+N) >> S;
S                 122 src/media_tools/reedsolomon.c static int compute_discrepancy(int lambda[], int S[], int L, int n);
S                 258 src/media_tools/reedsolomon.c compute_discrepancy (int lambda[], int S[], int L, int n)
S                 263 src/media_tools/reedsolomon.c 		sum ^= gmult(lambda[i], S[n-i]);
S                1941 src/odf/odf_dump.c 	u8 H, M, S, hS, rien;
S                1951 src/odf/odf_dump.c 	gf_oci_event_get_start_time(ev, &H, &M, &S, &hS, &rien);
S                1954 src/odf/odf_dump.c 	fprintf(trace, "%d:%d:%d:%d", H, M, S, hS);
S                1957 src/odf/odf_dump.c 	gf_oci_event_get_duration(ev, &H, &M, &S, &hS);
S                1959 src/odf/odf_dump.c 	fprintf(trace, "%d:%d:%d:%d", H, M, S, hS);
S                1566 src/utils/dlmalloc.c #define CALL_MORECORE(S)    MORECORE(S)
S                1568 src/utils/dlmalloc.c #define CALL_MORECORE(S)    MORECORE_DEFAULT(S)
S                1571 src/utils/dlmalloc.c #define CALL_MORECORE(S)        MFAIL
S                2356 src/utils/dlmalloc.c #define is_mmapped_segment(S)  ((S)->sflags & USE_MMAP_BIT)
S                2357 src/utils/dlmalloc.c #define is_extern_segment(S)   ((S)->sflags & EXTERN_BIT)
S                2537 src/utils/dlmalloc.c #define page_align(S)\
S                2538 src/utils/dlmalloc.c  (((S) + (mparams.page_size - SIZE_T_ONE)) & ~(mparams.page_size - SIZE_T_ONE))
S                2541 src/utils/dlmalloc.c #define granularity_align(S)\
S                2542 src/utils/dlmalloc.c   (((S) + (mparams.granularity - SIZE_T_ONE))\
S                2548 src/utils/dlmalloc.c #define mmap_align(S) granularity_align(S)
S                2550 src/utils/dlmalloc.c #define mmap_align(S) page_align(S)
S                2556 src/utils/dlmalloc.c #define is_page_aligned(S)\
S                2557 src/utils/dlmalloc.c    (((size_t)(S) & (mparams.page_size - SIZE_T_ONE)) == 0)
S                2558 src/utils/dlmalloc.c #define is_granularity_aligned(S)\
S                2559 src/utils/dlmalloc.c    (((size_t)(S) & (mparams.granularity - SIZE_T_ONE)) == 0)
S                2562 src/utils/dlmalloc.c #define segment_holds(S, A)\
S                2563 src/utils/dlmalloc.c   ((char*)(A) >= S->base && (char*)(A) < S->base + S->size)
S                2703 src/utils/dlmalloc.c #define compute_tree_index(S, I)\
S                2705 src/utils/dlmalloc.c   unsigned int X = S >> TREEBIN_SHIFT;\
S                2713 src/utils/dlmalloc.c     I =  (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\
S                2718 src/utils/dlmalloc.c #define compute_tree_index(S, I)\
S                2720 src/utils/dlmalloc.c   size_t X = S >> TREEBIN_SHIFT;\
S                2727 src/utils/dlmalloc.c     I =  (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\
S                2732 src/utils/dlmalloc.c #define compute_tree_index(S, I)\
S                2734 src/utils/dlmalloc.c   size_t X = S >> TREEBIN_SHIFT;\
S                2742 src/utils/dlmalloc.c     I =  (bindex_t)((K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1)));\
S                2747 src/utils/dlmalloc.c #define compute_tree_index(S, I)\
S                2749 src/utils/dlmalloc.c   size_t X = S >> TREEBIN_SHIFT;\
S                2761 src/utils/dlmalloc.c     I = (K << 1) + ((S >> (K + (TREEBIN_SHIFT-1)) & 1));\
S                3425 src/utils/dlmalloc.c #define insert_small_chunk(M, P, S) {\
S                3426 src/utils/dlmalloc.c   bindex_t I  = (bindex_t)small_index(S);\
S                3429 src/utils/dlmalloc.c   assert(S >= MIN_CHUNK_SIZE);\
S                3444 src/utils/dlmalloc.c #define unlink_small_chunk(M, P, S) {\
S                3447 src/utils/dlmalloc.c   bindex_t I = small_index(S);\
S                3484 src/utils/dlmalloc.c #define replace_dv(M, P, S) {\
S                3491 src/utils/dlmalloc.c   M->dvsize = S;\
S                3498 src/utils/dlmalloc.c #define insert_large_chunk(M, X, S) {\
S                3501 src/utils/dlmalloc.c   compute_tree_index(S, I);\
S                3513 src/utils/dlmalloc.c     size_t K = S << leftshift_for_tree_index(I);\
S                3515 src/utils/dlmalloc.c       if (chunksize(T) != S) {\
S                3639 src/utils/dlmalloc.c #define insert_chunk(M, P, S)\
S                3640 src/utils/dlmalloc.c   if (is_small(S)) insert_small_chunk(M, P, S)\
S                3641 src/utils/dlmalloc.c   else { tchunkptr TP = (tchunkptr)(P); insert_large_chunk(M, TP, S); }
S                3644 src/utils/dlmalloc.c #define unlink_chunk(M, P, S)\
S                3645 src/utils/dlmalloc.c   if (is_small(S)) unlink_small_chunk(M, P, S)\
S                 111 src/utils/sha1.c     ( W[t & 0x0F] = S(temp,1) )                         \
S                 116 src/utils/sha1.c     e += S(a,5) + F(b,c,d) + K + x; b = S(b,30);        \
S                  54 src/utils/uni_bidi.c 	S,       // Segment Separator (TAB)		// used only in L1
S                 851 src/utils/uni_bidi.c 	if (val==0x00000009) return S;	//# Cc       <control-0009>
S                 852 src/utils/uni_bidi.c 	if (val==0x0000000B) return S;	//# Cc       <control-000B>
S                 853 src/utils/uni_bidi.c 	if (val==0x0000001F) return S;	//# Cc       <control-001F>