HomeSort by: relevance | last modified time | path
    Searched refs:subscript (Results 1 - 19 of 19) sorted by relevancy

  /src/tests/usr.bin/indent/
edge_cases.c 19 /* same as 'array[subscript]' */
20 number = array<:subscript:>;
31 /* same as 'array[subscript]' */
36 number = array <:subscript: >;
  /src/external/bsd/flex/dist/src/
scanopt.c 62 int index; /* Used as: argv[index][subscript]. */ member in struct:_scanopt_t
63 int subscript;
134 /* Macro to assure we reset subscript whenever we adjust s->index.*/
138 (s)->subscript= 0; \
152 s->subscript = 0;
514 s->argv[s->index][s->subscript];
683 pstart = s->argv[s->index] + s->subscript;
687 if (s->subscript == 0) {
715 s->subscript++;
725 /* We have to re-check the subscript status because i
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-data-ref.cc 54 - subscript: given two array accesses a subscript is the tuple
298 /* Dump function for a SUBSCRIPT structure. */
301 dump_subscript (FILE *outf, struct subscript *subscript)
303 conflict_function *cf = SUB_CONFLICTS_IN_A (subscript);
305 fprintf (outf, "\n (subscript \n");
310 tree last_iteration = SUB_LAST_CONFLICT (subscript);
315 cf = SUB_CONFLICTS_IN_B (subscript);
320 tree last_iteration = SUB_LAST_CONFLICT (subscript);
    [all...]
tree-data-ref.h 372 /* What is a subscript? Given two array accesses a subscript is the
379 struct subscript struct
400 typedef struct subscript *subscript_p;
437 /* For each subscript in the dependence test, there is an element in
  /src/external/gpl3/gcc/dist/gcc/
tree-data-ref.cc 54 - subscript: given two array accesses a subscript is the tuple
299 /* Dump function for a SUBSCRIPT structure. */
302 dump_subscript (FILE *outf, struct subscript *subscript)
304 conflict_function *cf = SUB_CONFLICTS_IN_A (subscript);
306 fprintf (outf, "\n (subscript \n");
311 tree last_iteration = SUB_LAST_CONFLICT (subscript);
316 cf = SUB_CONFLICTS_IN_B (subscript);
321 tree last_iteration = SUB_LAST_CONFLICT (subscript);
    [all...]
tree-data-ref.h 372 /* What is a subscript? Given two array accesses a subscript is the
379 struct subscript struct
400 typedef struct subscript *subscript_p;
437 /* For each subscript in the dependence test, there is an element in
  /src/external/apache2/llvm/dist/llvm/docs/_ocamldoc/
style.css 29 .superscript,.subscript
32 .subscript { vertical-align: sub; }
  /src/usr.bin/xlint/lint1/
init.c 117 * The maximum subscript that has ever been seen for an array of
367 const sym_t *member, size_t subscript)
379 dr->dr_subscript = subscript;
786 initialization_add_designator_subscript(initialization *in, size_t subscript)
803 if (!tp->t_incomplete_array && subscript >= (size_t)tp->u.dimension) {
804 /* array subscript %ju cannot be > %d */
805 error(168, (uintmax_t)subscript, tp->u.dimension - 1);
806 subscript = 0; /* suppress further errors */
809 if (tp->t_incomplete_array && subscript > in->in_max_subscript)
810 in->in_max_subscript = subscript;
    [all...]
  /src/games/phantasia/
main.c 931 int subscript; /* used for subscripting into Stattable */ local
934 subscript = type - '1';
936 if (subscript < C_MAGIC || subscript > C_EXPER)
937 if (subscript != C_SUPER || !Wizard)
939 subscript = C_FIGHTER;
941 statptr = &Stattable[subscript];
957 Player.p_type = subscript;
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/python/libstdcxx/v6/
xmethods.py 269 def get_result_type(self, obj, subscript):
272 def __call__(self, obj, subscript):
273 return self.index(obj, subscript)
542 def get_result_type(self, obj, subscript):
545 def __call__(self, obj, subscript):
546 return self.get(obj, int(subscript))
  /src/external/gpl3/gcc/dist/libstdc++-v3/python/libstdcxx/v6/
xmethods.py 269 def get_result_type(self, obj, subscript):
272 def __call__(self, obj, subscript):
273 return self.index(obj, subscript)
542 def get_result_type(self, obj, subscript):
545 def __call__(self, obj, subscript):
546 return self.get(obj, int(subscript))
  /src/sys/conf/
copts.mk 61 # /home/riastradh/netbsd/current/src/sys/sys/endian.h:220:9: error: array subscript [12, 2305843009213693951] is outside array bounds of 'const uint8_t[16]' {aka 'const unsigned char[16]'} [-Werror=array-bounds=]
  /src/share/mk/
bsd.x11.mk 226 # PKGDIST contains the name of a X11SRCDIR subscript where to find the
  /src/external/gpl3/gcc.old/dist/gcc/fortran/
trans-array.cc 675 if (ss_info->data.array.subscript[n])
676 gfc_free_ss_chain (ss_info->data.array.subscript[n]);
821 if (ss->info->data.array.subscript[n] != NULL)
822 set_ss_loop (ss->info->data.array.subscript[n], loop);
3001 gcc_assert (info->subscript[dim]
3002 && info->subscript[dim]->info->type == GFC_SS_VECTOR);
3005 desc = info->subscript[dim]->info->data.array.descriptor;
3064 gfc_add_loop_ss_code (gfc_loopinfo * loop, gfc_ss * ss, bool subscript,
3111 if (subscript)
3160 if (info->subscript[n]
    [all...]
trans.h 198 /* Holds the SS for a subscript. Indexed by actual dimension. */
199 struct gfc_ss *subscript[GFC_MAX_DIMENSIONS]; member in struct:gfc_array_info
239 /* A vector subscript. The vector's descriptor is cached in the
  /src/external/gpl3/gcc/dist/gcc/fortran/
trans-array.cc 693 if (ss_info->data.array.subscript[n])
694 gfc_free_ss_chain (ss_info->data.array.subscript[n]);
839 if (ss->info->data.array.subscript[n] != NULL)
840 set_ss_loop (ss->info->data.array.subscript[n], loop);
3079 gcc_assert (info->subscript[dim]
3080 && info->subscript[dim]->info->type == GFC_SS_VECTOR);
3083 desc = info->subscript[dim]->info->data.array.descriptor;
3142 gfc_add_loop_ss_code (gfc_loopinfo * loop, gfc_ss * ss, bool subscript,
3189 if (subscript)
3238 if (info->subscript[n]
    [all...]
trans.h 206 /* Holds the SS for a subscript. Indexed by actual dimension. */
207 struct gfc_ss *subscript[GFC_MAX_DIMENSIONS]; member in struct:gfc_array_info
247 /* A vector subscript. The vector's descriptor is cached in the
  /src/external/bsd/ipf/dist/
HISTORY 18 3546260 compiler warnings about non-integer array subscript
  /src/external/gpl2/gettext/dist/build-aux/
texinfo.tex 1449 % subscript character anyway. Then, @cindex @samp{_} (for example)

Completed in 61 milliseconds