/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/cpp/ |
H A D | 20000209-2.c | 7 #define DEFINE_CATEGORY(category, items) \ 8 const int _nl_value_type_##category[] = { NO_PAREN items }
|
/haiku-buildtools/jam/ |
H A D | hash.c | 28 /* Header attached to all data items entered into a hash table. */ 60 int bloat; /* tab.nel / items.nel */ 79 } items; member in struct:hash 102 if( enter && !hp->items.more ) 105 if( !enter && !hp->items.nel ) 125 i = (ITEM *)hp->items.next; 126 hp->items.next += hp->items.size; 127 hp->items.more--; 128 memcpy( (char *)&i->data, (char *)*data, hp->items [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.mike/ |
H A D | p11667.C | 11 LIST() { nitems = 16; items = new T[nitems]; }; 13 LIST(int u) { nitems = u; items = new T[nitems]; }; 16 return items[i]; 21 T* src = items; 32 if (items) delete[] items; 34 items = newlist; 39 T *items; member in class:LIST
|
/haiku-buildtools/gcc/libgcc/ |
H A D | siditi-object.mk | 2 # $(iter-items). On each inclusion, we advance $o to the next element. 5 o := $(firstword $(iter-items)) 6 iter-items := $(filter-out $o,$(iter-items))
|
H A D | static-object.mk | 2 # $(iter-items). On each inclusion, we advance $o to the next element. 4 o := $(firstword $(iter-items)) 5 iter-items := $(filter-out $o,$(iter-items))
|
H A D | shared-object.mk | 2 # $(iter-items). On each inclusion, we advance $o to the next element. 4 o := $(firstword $(iter-items)) 5 iter-items := $(filter-out $o,$(iter-items))
|
H A D | fixed-obj.mk | 2 # $(iter-items). On each inclusion, we advance $o to the next element. 5 o := $(firstword $(iter-items)) 6 iter-items := $(filter-out $o,$(iter-items))
|
H A D | Makefile.in | 365 iterator = $(srcdir)/empty.mk $(patsubst %,$(srcdir)/shared-object.mk,$(iter-items)) 403 iterator = $(srcdir)/empty.mk $(patsubst %,$(srcdir)/static-object.mk,$(iter-items)) 492 iter-items := $(sifuncs) $(difuncs) $(tifuncs) 496 include $(srcdir)/empty.mk $(patsubst %,$(srcdir)/siditi-object.mk,$(iter-items)) 775 iter-items := $(fixed-funcs) 779 include $(srcdir)/empty.mk $(patsubst %,$(srcdir)/fixed-obj.mk,$(iter-items)) 794 iter-items := $(fixed-conv-funcs) 798 include $(srcdir)/empty.mk $(patsubst %,$(srcdir)/fixed-obj.mk,$(iter-items)) 817 iter-items := $(LIB2ADD) $(LIB2ADD_ST) 835 iter-items [all...] |
/haiku-buildtools/gcc/libgcc/config/avr/ |
H A D | lib2-object.mk | 2 # $(iter-items). On each inclusion, we advance $o to the next element. 6 o := $(firstword $(iter-items)) 7 iter-items := $(filter-out $o,$(iter-items))
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | 941014-3.c | 11 gx_font_stack_item items[1 + 5 ]; member in struct:gx_font_stack_s 70 while ( (pfont = penum->fstack.items[fdepth].font)->FontType == ft_composite )
|
/haiku-buildtools/gcc/zlib/ |
H A D | zutil.c | 220 voidpf ZLIB_INTERNAL zcalloc (voidpf opaque, unsigned items, unsigned size) argument 223 ulg bsize = (ulg)items*size; 279 voidpf ZLIB_INTERNAL zcalloc (voidpf opaque, uInt items, uInt size) argument 282 return _halloc((long)items, size); 300 extern voidp calloc OF((uInt items, uInt size)); 304 voidpf ZLIB_INTERNAL zcalloc (opaque, items, size) 306 unsigned items; 309 if (opaque) items += size - size; /* make compiler happy */ 310 return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) : 311 (voidpf)calloc(items, siz [all...] |
H A D | zutil.h | 238 voidpf ZLIB_INTERNAL zcalloc OF((voidpf opaque, unsigned items, 243 #define ZALLOC(strm, items, size) \ 244 (*((strm)->zalloc))((strm)->opaque, (items), (size))
|
/haiku-buildtools/binutils/zlib/ |
H A D | zutil.c | 220 voidpf ZLIB_INTERNAL zcalloc (voidpf opaque, unsigned items, unsigned size) argument 223 ulg bsize = (ulg)items*size; 279 voidpf ZLIB_INTERNAL zcalloc (voidpf opaque, uInt items, uInt size) argument 282 return _halloc((long)items, size); 300 extern voidp calloc OF((uInt items, uInt size)); 304 voidpf ZLIB_INTERNAL zcalloc (opaque, items, size) 306 unsigned items; 309 if (opaque) items += size - size; /* make compiler happy */ 310 return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) : 311 (voidpf)calloc(items, siz [all...] |
H A D | zutil.h | 239 voidpf ZLIB_INTERNAL zcalloc OF((voidpf opaque, unsigned items, 244 #define ZALLOC(strm, items, size) \ 245 (*((strm)->zalloc))((strm)->opaque, (items), (size))
|
/haiku-buildtools/gcc/gcc/config/vms/ |
H A D | vms-ld.c | 392 struct lst items [1]; 398 struct lst items [2]; 421 item_lst1.items[0].buflen = LNM_C_NAMLENGTH; 422 item_lst1.items[0].item_code = LNM__STRING; 423 item_lst1.items[0].bufaddr = lnm_buff; 424 item_lst1.items[0].retlenaddr = &lnm_buff_len; 452 item_lst2.items[0].buflen = lnm_buff_len; 453 item_lst2.items[0].item_code = LNM__STRING; 454 item_lst2.items[0].bufaddr = lnm_buff; 455 item_lst2.items[ 391 struct lst items [1]; member in struct:__anon588 397 struct lst items [2]; member in struct:__anon589 [all...] |
/haiku-buildtools/gcc/gcc/testsuite/objc.dg/ |
H A D | objc-foreach-1.m | 15 - (unsigned int)countByEnumeratingWithState:(struct __objcFastEnumerationState *)state objects:(id *)items count:(unsigned int)stackcount
|
H A D | objc-foreach-2.m | 15 - (unsigned int)countByEnumeratingWithState:(struct __objcFastEnumerationState *)state objects:(id *)items count:(unsigned int)stackcount
|
H A D | objc-foreach-3.m | 16 - (unsigned int)countByEnumeratingWithState:(struct __objcFastEnumerationState *)state objects:(id *)items count:(unsigned int)stackcount
|
/haiku-buildtools/gcc/zlib/contrib/iostream2/ |
H A D | zstream.h | 115 inline int read(izstream& zs, T* x, Items items) { argument 116 return ::gzread(zs.fp(), x, items*sizeof(T)); 264 inline int write(ozstream& zs, const T* x, Items items) { argument 265 return ::gzwrite(zs.fp(), (voidp) x, items*sizeof(T));
|
/haiku-buildtools/binutils/zlib/contrib/iostream2/ |
H A D | zstream.h | 115 inline int read(izstream& zs, T* x, Items items) { argument 116 return ::gzread(zs.fp(), x, items*sizeof(T)); 264 inline int write(ozstream& zs, const T* x, Items items) { argument 265 return ::gzwrite(zs.fp(), (voidp) x, items*sizeof(T));
|
/haiku-buildtools/binutils/ld/testsuite/ld-scripts/ |
H A D | sysroot-prefix.exp | 175 proc run_sysroot_prefix_tests { descr templ items } { 176 foreach item $items {
|
/haiku-buildtools/gcc/gcc/ |
H A D | lto-compress.c | 84 lto_zalloc (void *opaque, unsigned items, unsigned size) argument 87 return xmalloc (items * size);
|
/haiku-buildtools/legacy/gcc/texinfo/emacs/ |
H A D | info.el | 549 (let ((menu-items '("top")) 556 (or (member (downcase nodename) menu-items) 563 (setq menu-items (cons nodename menu-items)))))) 1104 ;; there is a problem here in that if several menu items have the same 1129 (error "Too few items in menu")) 1229 (error "No more items in menu")) 1240 (error "No previous items in menu"))) 1254 ;; Since we have already gone thru all the items in this menu, 1673 (items (nrevers [all...] |
/haiku-buildtools/legacy/gcc/texinfo/util/ |
H A D | update-info | 202 It detects and inserts missing menu items into the info node file. 207 -d, --delete delete invalid menu items (ignore missing menu items) 211 menu items 601 # ###SECTION 1### functions used to insert missing menu items
|
/haiku-buildtools/gcc/gmp/demos/perl/ |
H A D | GMP.xs | 1176 if (items >= 2) 1182 if (items >= 3) 1430 TRACE (printf ("%s new, ix=%ld, items=%d\n", mpz_class, ix, (int) items)); 1433 switch (items) { 1983 if (items == 1) 1987 for (i = 1; i < items; i++) 2339 TRACE (printf ("%s new, ix=%ld, items=%d\n", mpq_class, ix, (int) items)); 2341 switch (items) { [all...] |