| /mirbsd/src/usr.bin/dc/ |
| D | stack.c | 29 static struct array *array_new(void);
30 static __inline void array_free(struct array *);
31 static struct array * array_dup(const struct array *);
32 static __inline void array_grow(struct array *, size_t);
33 static __inline void array_assign(struct array *, size_t, const struct value *);
34 static __inline struct value *array_retrieve(const struct array *, size_t);
67 if (v->array != NULL) { in stack_free_value()
68 array_free(v->array); in stack_free_value()
69 v->array = NULL; in stack_free_value()
92 copy->array = a->array == NULL ? NULL : array_dup(a->array); in stack_dup_value()
[all …]
|
| D | bcode.h | 43 struct array;
50 struct array *array; member
54 struct array { struct
|
| /mirbsd/src/gnu/usr.bin/perl/ext/threads/shared/t/ |
| D | 0nothread.t | 15 my @array;
46 sub array
49 is(@array, 0, "array empty");
50 $array[0] = $val[0];
51 is(@array,1, "Assign grows array");
52 is($array[0],$val[0],"Value correct");
53 unshift(@array,$val[2]);
54 is($array[0],$val[2],"Unshift worked");
55 is($array[-1],$val[0],"-ve index");
56 push(@array,$val[1]);
[all …]
|
| D | blessed.t | 57 $$hobj{'array'} = bless(&share([]), 'yang');
64 ok(2, ref($aobj) eq 'bar', "array blessing does work");
68 ok(5, ref($$aobj[0]) eq 'yin', "blessed hash in array");
69 ok(6, ref($$aobj[1]) eq 'yang', "blessed array in array");
70 ok(7, ref($$aobj[2]) eq 'baz', "blessed scalar in array");
71 ok(8, ${$$aobj[2]} eq '3', "blessed scalar in array contents");
74 ok(10, ref($$hobj{'array'}) eq 'yang', "blessed array in hash");
82 ok(14, ref($aobj) eq 'bar', "array blessing does work");
86 ok(17, ref($$aobj[0]) eq 'yin', "blessed hash in array");
87 ok(18, ref($$aobj[1]) eq 'yang', "blessed array in array");
[all …]
|
| D | disabled.t | 40 my @array = qw(1 2 3 4);
41 ok( eval qq{$func(\@array)}, undef );
47 my @array = qw(1 2 3 4);
48 ok( share(@array), \@array );
55 my @array = qw(1 2 3 4);
56 lock(@array);
|
| /mirbsd/src/gnu/usr.bin/perl/t/cmd/ |
| D | for.t | 112 @array = ('A', 'B', 'C');
113 for (@array) {
123 for (map {$_} @array) {
134 for (reverse @array) {
144 for (reverse map {$_} @array) {
155 for my $i (@array) {
165 for my $i (map {$_} @array) {
176 for my $i (reverse @array) {
186 for my $i (reverse map {$_} @array) {
198 for $_ (@array) {
[all …]
|
| /mirbsd/src/gnu/usr.bin/binutils/bfd/ |
| D | elf-strtab.c | 56 struct elf_strtab_hash_entry **array; member
112 table->array = bfd_malloc (table->alloced * amt); in _bfd_elf_strtab_init()
113 if (table->array == NULL) in _bfd_elf_strtab_init()
119 table->array[0] = NULL; in _bfd_elf_strtab_init()
130 free (tab->array); in _bfd_elf_strtab_free()
166 tab->array = bfd_realloc (tab->array, tab->alloced * amt); in _bfd_elf_strtab_add()
167 if (tab->array == NULL) in _bfd_elf_strtab_add()
172 tab->array[entry->u.index] = entry; in _bfd_elf_strtab_add()
184 ++tab->array[idx]->refcount; in _bfd_elf_strtab_addref()
194 BFD_ASSERT (tab->array[idx]->refcount > 0); in _bfd_elf_strtab_delref()
[all …]
|
| /mirbsd/src/gnu/usr.bin/perl/ext/B/t/ |
| D | f_map | 7 %hash = map { getkey($_) => $_ } @array;
11 foreach $_ (@array) {
17 %hash = map { +"\L$_", 1 } @array; # perl guesses BLOCK. right
19 %hash = map { ("\L$_", 1) } @array; # this also works
21 %hash = map { lc($_), 1 } @array; # as does this.
23 %hash = map +( lc($_), 1 ), @array; # this is EXPR and works!
25 %hash = map ( lc($_), 1 ), @array; # evaluates to (1, @array)
27 @hashes = map +{ lc($_), 1 }, @array # EXPR, so needs , at end
|
| /mirbsd/src/usr.bin/lex/ |
| D | misc.c | 525 int myctoi( array ) in myctoi() argument
526 char array[]; in myctoi()
530 (void) sscanf( array, "%d", &val );
538 Char myesc( array ) in myesc() argument
539 Char array[]; in myesc()
543 switch ( array[1] )
570 while ( isascii( array[sptr] ) &&
571 isdigit( array[sptr] ) )
578 c = array[sptr];
579 array[sptr] = '\0';
[all …]
|
| D | flexdef.h | 673 #define reallocate_integer_array(array,size) \ argument
674 (int *) reallocate_array( (void *) array, size, sizeof( int ) )
686 #define reallocate_int_ptr_array(array,size) \ argument
687 (int **) reallocate_array( (void *) array, size, sizeof( int * ) )
689 #define reallocate_char_ptr_array(array,size) \ argument
690 (char **) reallocate_array( (void *) array, size, sizeof( char * ) )
692 #define reallocate_dfaacc_union(array, size) \ argument
694 reallocate_array( (void *) array, size, sizeof( union dfaacc_union ) )
699 #define reallocate_character_array(array,size) \ argument
700 (char *) reallocate_array( (void *) array, size, sizeof( char ) )
[all …]
|
| /mirbsd/src/gnu/usr.bin/perl/pod/ |
| D | perlreftut.pod | 65 A reference is a scalar value that I<refers to> an entire array or an
76 to an array, you can recover the entire array from it. If you have a
82 an entire array, and references are scalars, so you can have a hash of
102 $aref = \@array; # $aref now holds a reference to @array
109 $xy = $aref; # $xy now holds a reference to @array
115 Sometimes you want to make an array or a hash that doesn't have a
122 C<[ ITEMS ]> makes a new, anonymous array, and returns a reference to
123 that array. C<{ ITEMS }> makes a new, anonymous hash, and returns a
127 # $aref now holds a reference to an array
140 @array = (1, 2, 3);
[all …]
|
| D | perllol.pod | 9 The simplest thing to build is an array of arrays (sometimes imprecisely
14 An array of an array is just a regular old array @AoA that you can
16 of the array:
18 # assign to our array, an array of array references
30 an @array, so you need parentheses. If you wanted there I<not> to be an @AoA,
33 # assign a reference to array of array references
45 array, whereas @AoA is an array proper. Likewise, C<$AoA[2]> is not an
46 array, but an array ref. So how come you can write these:
70 @AoA array containing all these, here's the right way to do that:
84 array in it.
[all …]
|
| D | perldsc.pod | 19 may now write something like this and all of a sudden, you'd have an array
80 X<multidimensional array> X<array, multidimensional>
82 You can't use a reference to an array or hash in quite the same way that you
83 would a real array or hash. For C or C++ programmers unused to
92 looks to you like an access to a two-or-more-dimensional array and/or hash,
99 $array[7][12] # array of arrays
100 $array[7]{string} # array of hashes
105 out your array in with a simple print() function, you'll get something
124 an array of arrays is either accidentally counting the number of
127 of a nested array:
[all …]
|
| /mirbsd/src/gnu/usr.bin/texinfo/makeinfo/ |
| D | index.c | 518 make_index_entries_unique (INDEX_ELT **array, int count) in make_index_entries_unique() argument
529 || array[i]->node != array[i + 1]->node in make_index_entries_unique()
530 || !STREQ (array[i]->entry, array[i + 1]->entry)) in make_index_entries_unique()
531 copy[j++] = array[i]; in make_index_entries_unique()
534 free (array[i]->entry); in make_index_entries_unique()
535 free (array[i]->entry_text); in make_index_entries_unique()
536 free (array[i]); in make_index_entries_unique()
565 array[i] = copy[i]; in make_index_entries_unique()
567 array[i] = NULL; in make_index_entries_unique()
580 INDEX_ELT **array; in sort_index() local
[all …]
|
| /mirbsd/src/usr.bin/tsort/ |
| D | tsort.c | 114 struct array { struct
126 static void split_nodes(struct ohash *, struct array *, struct array *); argument
132 static void dump_array(struct array *);
137 static struct node *find_smallest_node(struct array *);
138 static struct node *find_good_cycle_break(struct array *);
139 static void print_cycle(struct array *);
140 static struct node *find_cycle_from(struct node *, struct array *);
141 static struct node *find_predecessor(struct array *, struct node *);
142 static unsigned int traverse_node(struct node *, unsigned int, struct array *);
143 static struct node *find_longest_cycle(struct array *, struct array *);
[all …]
|
| /mirbsd/src/gnu/usr.bin/perl/ |
| D | genpacksizetables.pl | 44 my $array = $arrays{$arrayname};
45 die "No defined entries in $arrayname" unless $array->[$#$array];
48 $earliest++ while (!$array->[$earliest]);
50 splice @$array, 0, $earliest;
51 print "unsigned char size_${arrayname}[", scalar @$array, "] = {\n";
53 foreach (@$array) {
78 my $array = $arrays{$_};
79 push @lines, " {size_$_, $earliest{$_}, " . (scalar @$array) . "},";
|
| /mirbsd/src/gnu/usr.bin/perl/jpl/JNI/ |
| D | JNI.xs | 2398 GetArrayLength(array)
2400 jarray array
2403 RETVAL = (*env)->GetArrayLength(env, array);
2424 GetObjectArrayElement(array,index)
2426 jobjectArray array
2430 RETVAL = (*env)->GetObjectArrayElement(env, array,index);
2437 SetObjectArrayElement(array,index,val)
2439 jobjectArray array
2444 (*env)->SetObjectArrayElement(env, array,index,val);
2545 GetBooleanArrayElements(array)
[all …]
|
| /mirbsd/src/gnu/usr.bin/binutils/ld/ |
| D | ldctor.c | 217 struct set_element **array; in ldctor_build_sets() local
226 array = xmalloc (c * sizeof *array); in ldctor_build_sets()
231 array[i] = e; in ldctor_build_sets()
235 qsort (array, c, sizeof *array, ctor_cmp); in ldctor_build_sets()
237 e = array[0]; in ldctor_build_sets()
240 array[i]->next = array[i + 1]; in ldctor_build_sets()
241 array[i]->next = NULL; in ldctor_build_sets()
243 free (array); in ldctor_build_sets()
|
| /mirbsd/src/gnu/usr.bin/perl/ext/Storable/t/ |
| D | tied_hook.t | 155 $d = tie @array, TIED_ARRAY;
160 $array[0] = \$scalar;
161 $array[1] = $c;
162 $array[2] = \@array;
163 $array[3] = "plaine scalaire";
165 @tied = (\$scalar, \@array, \%hash);
168 $b, \$a, $a, $c, \$c, \%a, \@array, \%hash, \@tied);
|
| D | tied.t | 131 $d = tie @array, TIED_ARRAY;
146 $array[0] = \$scalar;
147 $array[1] = $c;
148 $array[2] = \@array;
150 @tied = (\$scalar, \@array, \%hash);
153 $b, \$a, $a, $c, \$c, \%a, \@array, \%hash, \@tied);
|
| /mirbsd/src/gnu/usr.bin/binutils/gdb/ |
| D | valarith.c | 179 value_subscript (struct value *array, struct value *idx) in value_subscript() argument
185 array = coerce_ref (array); in value_subscript()
186 tarray = check_typedef (value_type (array)); in value_subscript()
195 if (VALUE_LVAL (array) != lval_memory) in value_subscript()
196 return value_subscripted_rvalue (array, idx, lowerbound); in value_subscript()
202 return value_subscripted_rvalue (array, idx, lowerbound); in value_subscript()
217 array = value_coerce_array (array); in value_subscript()
232 byte = *((char *) value_contents (array) + offset); in value_subscript()
238 VALUE_LVAL (v) = VALUE_LVAL (array); in value_subscript()
239 if (VALUE_LVAL (array) == lval_internalvar) in value_subscript()
[all …]
|
| /mirbsd/src/gnu/usr.bin/perl/t/comp/ |
| D | proto.t | 37 my @array;
287 @array = ( \&tmp_sub_1 );
306 @array = ( \&tmp_sub_2 );
319 my($sub,$array) = @_;
320 print "not " unless @_ == 2 && @{$array} == 4;
321 print map { &{$sub}($_) } @{$array}
324 @array = (qw(O K)," ", $i++);
325 sub_aref { lc shift } @array;
341 @array = (qw(O K)," ", $i++);
342 sub_array { lc shift } @array;
[all …]
|
| /mirbsd/src/gnu/usr.bin/texinfo/info/ |
| D | info.h | 63 #define add_pointer_to_array(pointer, idx, array, slots, grow, type) \ argument
66 array = (type *)(xrealloc (array, (slots += grow) * sizeof (type))); \
67 array[idx++] = (type)pointer; \
68 array[idx] = (type)NULL; \
|
| D | variables.c | 147 REFERENCE **array = (REFERENCE **)NULL; variable
161 (entry, array_index, array, array_slots, 10, REFERENCE *);
168 line = info_read_completing_in_echo_area (window, prompt, array);
170 info_free_references (array);
253 REFERENCE **array = (REFERENCE **)NULL; in make_variable_completions_array() local
266 (entry, array_index, array, array_slots, 200, REFERENCE *); in make_variable_completions_array()
269 return (array); in make_variable_completions_array()
|
| /mirbsd/src/gnu/usr.bin/perl/jpl/docs/ |
| D | Tutorial.pod | 431 If you pass an array from Java into a Perl method, it arrives in the
435 an array of integers.
439 # Get the array elements
443 # Sort the array numerically
462 Converts scalar to an array of booleans.
466 Converts scalar to an array of bytes.
470 Converts scalar to an array of characters.
474 Converts scalar to an array of short integers.
478 Converts scalar to an array of integers.
482 Converts scalar to an array of long integers.
[all …]
|