HomeSort by: relevance | last modified time | path
    Searched defs:stride (Results 1 - 25 of 302) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/external/gpl3/gcc/dist/libgfortran/generated/
shape_i1.c 39 index_type stride; local
51 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
59 ret->base_addr[n * stride] = extent > 0 ? extent : 0 ;
shape_i16.c 39 index_type stride; local
51 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
59 ret->base_addr[n * stride] = extent > 0 ? extent : 0 ;
shape_i2.c 39 index_type stride; local
51 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
59 ret->base_addr[n * stride] = extent > 0 ? extent : 0 ;
shape_i4.c 39 index_type stride; local
51 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
59 ret->base_addr[n * stride] = extent > 0 ? extent : 0 ;
shape_i8.c 39 index_type stride; local
51 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
59 ret->base_addr[n * stride] = extent > 0 ? extent : 0 ;
bessel_r10.c 46 index_type stride; local
50 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
69 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
75 ret->base_addr[i*stride] = 0;
80 ret->base_addr[(n2-n1)*stride] = last1;
86 ret->base_addr[(n2-n1-1)*stride] = last2;
95 ret->base_addr[i*stride] = x2rev * (i+1+n1) * last2 - last1;
97 last2 = ret->base_addr[i*stride];
113 index_type stride; local
117 stride = GFC_DESCRIPTOR_STRIDE(ret,0)
    [all...]
bessel_r16.c 54 index_type stride; local
58 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
77 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
83 ret->base_addr[i*stride] = 0;
88 ret->base_addr[(n2-n1)*stride] = last1;
94 ret->base_addr[(n2-n1-1)*stride] = last2;
103 ret->base_addr[i*stride] = x2rev * (i+1+n1) * last2 - last1;
105 last2 = ret->base_addr[i*stride];
121 index_type stride; local
125 stride = GFC_DESCRIPTOR_STRIDE(ret,0)
    [all...]
bessel_r17.c 52 index_type stride; local
56 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
75 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
81 ret->base_addr[i*stride] = 0;
86 ret->base_addr[(n2-n1)*stride] = last1;
92 ret->base_addr[(n2-n1-1)*stride] = last2;
101 ret->base_addr[i*stride] = x2rev * (i+1+n1) * last2 - last1;
103 last2 = ret->base_addr[i*stride];
119 index_type stride; local
123 stride = GFC_DESCRIPTOR_STRIDE(ret,0)
    [all...]
bessel_r4.c 46 index_type stride; local
50 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
69 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
75 ret->base_addr[i*stride] = 0;
80 ret->base_addr[(n2-n1)*stride] = last1;
86 ret->base_addr[(n2-n1-1)*stride] = last2;
95 ret->base_addr[i*stride] = x2rev * (i+1+n1) * last2 - last1;
97 last2 = ret->base_addr[i*stride];
113 index_type stride; local
117 stride = GFC_DESCRIPTOR_STRIDE(ret,0)
    [all...]
bessel_r8.c 46 index_type stride; local
50 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
69 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
75 ret->base_addr[i*stride] = 0;
80 ret->base_addr[(n2-n1)*stride] = last1;
86 ret->base_addr[(n2-n1-1)*stride] = last2;
95 ret->base_addr[i*stride] = x2rev * (i+1+n1) * last2 - last1;
97 last2 = ret->base_addr[i*stride];
113 index_type stride; local
117 stride = GFC_DESCRIPTOR_STRIDE(ret,0)
    [all...]
in_unpack_c10.c 37 index_type stride[GFC_MAX_DIMENSIONS]; local
52 stride[n] = GFC_DESCRIPTOR_STRIDE(d,n);
57 if (dsize == stride[n])
69 stride0 = stride[0];
87 dest -= stride[n] * extent[n];
97 dest += stride[n];
in_unpack_c16.c 37 index_type stride[GFC_MAX_DIMENSIONS]; local
52 stride[n] = GFC_DESCRIPTOR_STRIDE(d,n);
57 if (dsize == stride[n])
69 stride0 = stride[0];
87 dest -= stride[n] * extent[n];
97 dest += stride[n];
in_unpack_c17.c 37 index_type stride[GFC_MAX_DIMENSIONS]; local
52 stride[n] = GFC_DESCRIPTOR_STRIDE(d,n);
57 if (dsize == stride[n])
69 stride0 = stride[0];
87 dest -= stride[n] * extent[n];
97 dest += stride[n];
in_unpack_c4.c 37 index_type stride[GFC_MAX_DIMENSIONS]; local
52 stride[n] = GFC_DESCRIPTOR_STRIDE(d,n);
57 if (dsize == stride[n])
69 stride0 = stride[0];
87 dest -= stride[n] * extent[n];
97 dest += stride[n];
  /src/external/gpl3/gcc.old/dist/libgfortran/generated/
shape_i1.c 39 index_type stride; local
51 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
59 ret->base_addr[n * stride] = extent > 0 ? extent : 0 ;
shape_i16.c 39 index_type stride; local
51 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
59 ret->base_addr[n * stride] = extent > 0 ? extent : 0 ;
shape_i2.c 39 index_type stride; local
51 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
59 ret->base_addr[n * stride] = extent > 0 ? extent : 0 ;
shape_i4.c 39 index_type stride; local
51 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
59 ret->base_addr[n * stride] = extent > 0 ? extent : 0 ;
shape_i8.c 39 index_type stride; local
51 stride = GFC_DESCRIPTOR_STRIDE(ret,0);
59 ret->base_addr[n * stride] = extent > 0 ? extent : 0 ;
  /src/sys/arch/newsmips/include/
wsconsio.h 11 u_int stride; member in struct:newsmips_wsdisplay_fbinfo
  /src/external/gpl3/gcc/dist/libgfortran/intrinsics/
is_contiguous.c 33 index_type extent, stride; local
40 stride = GFC_DESCRIPTOR_STRIDE (array, n);
41 if (stride != extent)
  /src/external/gpl3/gcc.old/dist/libgfortran/intrinsics/
is_contiguous.c 33 index_type extent, stride; local
40 stride = GFC_DESCRIPTOR_STRIDE (array, n);
41 if (stride != extent)
  /src/external/mit/libuv/dist/src/unix/
random-getentropy.c 41 size_t stride; local
49 for (pos = 0, stride = 256; pos + stride < buflen; pos += stride)
50 if (uv__getentropy((char *) buf + pos, stride))
  /src/sys/external/bsd/drm2/dist/drm/
drm_dumb_buffers.c 67 u32 cpp, stride, size; local
80 stride = cpp * args->width;
81 if (args->height > U32_MAX / stride)
85 size = args->height * stride;
  /src/external/apache2/llvm/dist/llvm/utils/
unicode-case-fold.py 54 # Computes the stride (from_char2 - from_char1) of two mappings.
58 # Computes the stride of a list of mappings. The list should have at least two
59 # mappings. All mappings in the list are assumed to have the same stride.
60 def stride(block): function
65 # shift and the stride between adjecant mappings (if any) is constant.
78 last = first + stride(b) * (len(b)-1)
79 modulo = first % stride(b)
89 if stride(b) == 2 and shift(b[0]) == 1 and modulo == 0:
94 elif stride(b) == 1:
99 body += pattern.format(last, stride(b), modulo, shift(b[0])
    [all...]

Completed in 26 milliseconds

1 2 3 4 5 6 7 8 91011>>