| /src/games/sail/ |
| array.h | 45 struct array { struct
50 struct array *array_create(void);
51 void array_destroy(struct array *);
52 void array_init(struct array *);
53 void array_cleanup(struct array *);
54 unsigned array_num(const struct array *);
55 void *array_get(const struct array *, unsigned index_);
56 void array_set(const struct array *, unsigned index_, void *val);
57 int array_setsize(struct array *, unsigned num);
58 int array_add(struct array *, void *val, unsigned *index_ret)
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| opt-gather.awk | 24 function sort(ARRAY, ELEMENTS)
27 for (j = i; ARRAY[j-1] > ARRAY[j]; --j) {
28 temp = ARRAY[j]
29 ARRAY[j] = ARRAY[j-1]
30 ARRAY[j-1] = temp
|
| gcov-io.h | 235 #define GCOV_UNSIGNED2STRING(ARRAY,VALUE) \
236 ((ARRAY)[0] = (char)((VALUE) >> 24), \
237 (ARRAY)[1] = (char)((VALUE) >> 16), \
238 (ARRAY)[2] = (char)((VALUE) >> 8), \
239 (ARRAY)[3] = (char)((VALUE) >> 0))
|
| rtl-iter.h | 121 /* Iterate over X and its subrtxes, in arbitrary order. Use ARRAY to
122 store the worklist. We use an external array in order to avoid
124 the array. Use BOUNDS to find the bounds of simple "e"-string codes. */
128 generic_subrtx_iterator (array_type &array, value_type x,
131 m_array (array),
182 to fit into the current array. */
273 using subrtx_iterator::array ARRAY as the storage for the worklist.
274 ARRAY can be reused for multiple consecutive iterations but shouldn't
278 #define FOR_EACH_SUBRTX(ITER, ARRAY, X, TYPE)
[all...] |
| gengtype.h | 40 char inpname[1]; /* A variable-length array, ended by a null
156 TYPE_ARRAY, /* Array of GTY-ed types. */
322 type_p p; /* The array component type. */
484 ARRAY,
|
| /src/external/bsd/tradcpp/dist/ |
| array.h | 52 struct array { struct
57 struct array *array_create(void);
58 void array_destroy(struct array *);
59 void array_init(struct array *);
60 void array_cleanup(struct array *);
61 ARRAYINLINE unsigned array_num(const struct array *);
62 ARRAYINLINE void *array_get(const struct array *, unsigned index_);
63 ARRAYINLINE void array_set(const struct array *, unsigned index_, void *val);
64 void array_setsize(struct array *, unsigned num);
65 ARRAYINLINE void array_add(struct array *, void *val, unsigned *index_ret)
[all...] |
| /src/usr.bin/rump_dhcpclient/ |
| dhcp.c | 47 #define ARRAY (1 << 9)
74 { 33, IPV4 | ARRAY | REQUEST, "static_routes" },
75 { 3, IPV4 | ARRAY | REQUEST, "routers" },
77 { 4, IPV4 | ARRAY, "time_servers" },
78 { 5, IPV4 | ARRAY, "ien116_name_servers" },
79 { 6, IPV4 | ARRAY, "domain_name_servers" },
80 { 7, IPV4 | ARRAY, "log_servers" },
81 { 8, IPV4 | ARRAY, "cookie_servers" },
82 { 9, IPV4 | ARRAY, "lpr_servers" },
83 { 10, IPV4 | ARRAY, "impress_servers" }
[all...] |
| /src/external/bsd/bc/dist/ |
| const.h | 91 #define ARRAY 1
|
| bc.y | 73 d) Call by variable array parameters
394 { $$ = nextarg (NULL, lookup ($1,ARRAY), FALSE); }
396 { $$ = nextarg (NULL, lookup ($2,ARRAY), TRUE);
400 { $$ = nextarg (NULL, lookup ($2,ARRAY), TRUE);
406 { $$ = nextarg ($1, lookup ($3,ARRAY), FALSE); }
408 { $$ = nextarg ($1, lookup ($4,ARRAY), TRUE);
412 { $$ = nextarg ($1, lookup ($4,ARRAY), TRUE);
431 -lookup ($1,ARRAY));
446 -lookup ($3,ARRAY));
774 $$ = lookup($1,ARRAY);
[all...] |
| /src/external/apache2/mDNSResponder/dist/mDNSShared/ |
| general.h | 605 * Determines the size of an array's element type.
607 * @param ARRAY
608 * The array.
610 #define mdns_sizeof_element(ARRAY) sizeof(ARRAY[0])
626 * Determines the number of elements in an array.
628 * @param ARRAY
629 * The array.
631 #define mdns_countof(ARRAY) (sizeof(ARRAY) / mdns_sizeof_element(ARRAY)
[all...] |
| /src/usr.bin/xlint/common/ |
| inittyp.c | 123 typeinfo("array", ARRAY, ARRAY, 0, 0, ' '),
|
| lint.h | 93 ARRAY, /* array */
|
| tyname.c | 296 case ARRAY:
|
| /src/external/bsd/flex/dist/examples/manual/ |
| pascal.lex | 56 array return(ARRAY);
|
| /src/bin/ksh/ |
| table.h | 24 int index; /* index for an array */
30 struct tbl *array; /* array values */ member in union:tbl::__anon21
48 #define ARRAY BIT(13) /* array */
68 * should be reported by set/typeset). Does not include ARRAY or LOCAL.
92 #define AF_ARGV_ALLOC 0x1 /* argv[] array allocated */
|
| table.c | 137 p->u.array = (struct tbl *)0;
193 ((*dp)->flag&ARRAY)))
|
| /src/usr.bin/xlint/lint1/ |
| init.c | 117 * The maximum subscript that has ever been seen for an array of
160 if (!(ltp != NULL && ltp->t_tspec == ARRAY && rn->tn_op == STRING))
197 debug_step("completed array type is '%s'", type_name(sym->s_type));
296 case ARRAY:
398 } else if (tp->t_tspec == ARRAY)
503 case ARRAY:
528 lint_assert(tp->t_tspec == ARRAY);
530 /* too many array initializers, expected %d */
589 if (is_struct_or_union(ltp->t_tspec) || ltp->t_tspec == ARRAY) {
727 /* prevent "empty array declaration for '%s' [190]" *
[all...] |
| decl.c | 99 /* struct, union, enum, ptr, array and func are not shared. */
166 * Returns whether the type is 'void' or an incomplete array, struct, union
176 if (t == ARRAY)
807 * Printing a message if the outermost dimension of an array is 0 must
819 while (tp->t_tspec == ARRAY) {
856 while (tp->t_tspec == ARRAY)
919 if (t == FUNC || t == ARRAY) {
933 } else if (to == ARRAY) {
935 /* array of function is invalid */
940 if (t == ARRAY && tp->u.dimension == 0)
[all...] |
| emit1.c | 110 if (ts == ARRAY) {
|
| /src/sys/external/bsd/common/include/linux/ |
| kernel.h | 136 #define ARRAY_SIZE(ARRAY) __arraycount(ARRAY)
|
| /src/sys/kern/ |
| subr_kmem.c | 243 #define KMEM_CACHE_PROBE(ARRAY, INDEX, PTR, REQSIZE, ALLOCSIZE, FLAGS) \
253 #define KMEM_CACHE_PROBE(ARRAY, INDEX, PTR, REQSIZE, ALLOCSIZE, FLAGS) do \
257 KDASSERT((INDEX) < __arraycount(ARRAY)); \
258 if (__predict_false((id = *(ARRAY)[INDEX]) != 0)) { \
458 kmem_create_caches(const struct kmem_cache_info *array,
467 for (i = 0; array[i].kc_size != 0 ; i++) {
468 const char *name = array[i].kc_name;
469 size_t cache_size = array[i].kc_size;
512 array[i].kc_alloc_probe_id;
516 array[i].kc_free_probe_id
[all...] |
| /src/usr.bin/xlint/lint2/ |
| emit2.c | 68 if (ts == ARRAY) {
|
| read.c | 58 * The array pointed to by inpfns maps the file name indices of input files
65 * The array pointed to by *fnames maps file name indices to file names.
76 * hash table. Access by indices is done via an array of pointers to the
85 type_t **tlst; /* array for indexed access */
626 return ARRAY;
684 case ARRAY:
840 t = ARRAY;
871 case ARRAY:
|
| /src/external/cddl/osnet/dist/tools/ctf/cvt/ |
| ctftools.h | 99 * The default function argument array size. We'll realloc the array larger
151 ARRAY,
168 /* Auxiliary structure for array tdesc_t */
249 ardef_t *ardef; /* array */
|
| dwarf.c | 35 * marked as resolved. Consider an array type. If the type corresponding to
36 * the array contents has not yet been processed, we will create a blank tdesc
39 * type). We will then attempt to determine the size of the array. If the
40 * array has a byte size attribute, we will have completely characterized the
41 * array type, and will be able to mark it as resolved. The lack of a byte
44 * type, which has not, as yet, been encountered. The array type will thus be
50 * populated, the array type used in our example above will be able to use the
185 case ARRAY:
223 case ARRAY:
682 terminate("die %ju: unexpected non-subrange node in array\n"
[all...] |
