/haiku-fatelf/src/tests/system/libroot/posix/bonnie++-1.03d/ |
H A D | bon_csv2txt | 68 @arr = split(/,/,$file[$i]); 69 my $size = $arr[1]; 71 my $desc = $arr[0] . " "; 75 , $desc, $arr[2], $arr[3], $arr[4], $arr[5], $arr[6], $arr[7] 76 , $arr[ [all...] |
H A D | bon_csv2txt.in | 68 @arr = split(/,/,$file[$i]); 69 my $size = $arr[1]; 71 my $desc = $arr[0] . " "; 75 , $desc, $arr[2], $arr[3], $arr[4], $arr[5], $arr[6], $arr[7] 76 , $arr[ [all...] |
/haiku-fatelf/src/kits/network/libbind/resolv/ |
H A D | res_findzonecut.c | 254 rr_a *arr; local 257 for (arr = HEAD(nsrr->addrs); arr != NULL; arr = NEXT(arr, link)) { 260 *addrs++ = arr->addr; 584 rr_a *arr; local 601 arr = malloc(sizeof *arr); 602 if (arr 646 rr_a *arr; local [all...] |
/haiku-fatelf/headers/libs/agg/ |
H A D | agg_array.h | 920 void quick_sort(Array& arr, Less less) argument 922 if(arr.size() < 2) return; 929 int limit = arr.size(); 944 swap_elements(arr[base], arr[pivot]); 950 e1 = &(arr[j]); 951 e2 = &(arr[i]); 954 e1 = &(arr[base]); 955 e2 = &(arr[i]); 958 e1 = &(arr[ 1031 remove_duplicates(Array& arr, Equal equal) argument 1048 invert_container(Array& arr) argument 1060 binary_search_pos(const Array& arr, const Value& val, Less less) argument [all...] |
/haiku-fatelf/src/bin/gdb/gdb/ |
H A D | ada-lang.c | 1204 desc_bounds (struct value *arr) 1206 struct type *type = ada_check_typedef (VALUE_TYPE (arr)); 1220 addr = value_as_long (arr); 1222 addr = VALUE_ADDRESS (arr) + VALUE_OFFSET (arr); 1230 return value_struct_elt (&arr, NULL, "P_BOUNDS", NULL, 1283 desc_data (struct value *arr) 1285 struct type *type = VALUE_TYPE (arr); 1287 return thin_data_pntr (arr); 1289 return value_struct_elt (&arr, NUL 1200 desc_bounds(struct value *arr) argument 1279 desc_data(struct value *arr) argument 1449 ada_type_of_array(struct value *arr, int bounds) argument 1500 ada_coerce_to_simple_array_ptr(struct value *arr) argument 1520 ada_coerce_to_simple_array(struct value *arr) argument 1658 decode_packed_array(struct value *arr) argument 1705 value_subscript_packed(struct value *arr, int arity, struct value **ind) argument 2052 ada_value_subscript(struct value *arr, int arity, struct value **ind) argument 2079 ada_value_ptr_subscript(struct value *arr, struct type *type, int arity, struct value **ind) argument 2312 ada_array_bound(struct value *arr, int n, int which) argument 2335 ada_array_length(struct value *arr, int n) argument 3558 make_array_descriptor(struct type *type, struct value *arr, CORE_ADDR *sp) argument [all...] |
/haiku-fatelf/src/libs/compat/freebsd_wlan/net80211/ |
H A D | ieee80211_phy.c | 246 #define N(arr) (int)(sizeof(arr) / sizeof(arr[0]))
|
/haiku-fatelf/src/bin/bash/ |
H A D | variables.h | 169 #define var_setarray(var, arr) ((var)->value = (char *)(arr)) 170 #define var_setassoc(var, arr) ((var)->value = (char *)(arr))
|
/haiku-fatelf/src/bin/gawk/ |
H A D | field.c | 45 static void set_element P((long num, char * str, long len, NODE *arr)); 798 NODE *src, *arr, *sep, *fs, *src2, *fs2, *tmp; local 806 arr = get_param(tree->rnode->lnode); 807 if (arr->type != Node_var_array) 825 assoc_clear(arr); 870 assoc_clear(arr); 874 fs2, rp, set_element, arr));
|
H A D | awkgram.y | 390 NODE *arr, *sub; 393 arr = $8->lnode; /* array var */ 396 if ( (arr->type == Node_var_new 397 || arr->type == Node_var_array 398 || arr->type == Node_param_list) 403 && strcmp($5, arr->vname) == 0) {
|
H A D | awkgram.c | 1826 NODE *arr, *sub; 1829 arr = yyvsp[0].nodeval->lnode; /* array var */ 1832 if ( (arr->type == Node_var_new 1833 || arr->type == Node_var_array 1834 || arr->type == Node_param_list) 1839 && strcmp(yyvsp[-3].sval, arr->vname) == 0) { 1823 NODE *arr, *sub; local
|
/haiku-fatelf/src/add-ons/kernel/drivers/network/wlan/broadcom43xx/dev/bwi/ |
H A D | bwiphy.c | 186 #define N(arr) (int)(sizeof(arr) / sizeof(arr[0])) 746 #define N(arr) (int)(sizeof(arr) / sizeof(arr[0]))
|
H A D | bwimac.c | 1667 #define N(arr) (int)(sizeof(arr) / sizeof(arr[0]))
|
H A D | if_bwi.c | 781 #define N(arr) (int)(sizeof(arr) / sizeof(arr[0])) 3843 #define N(arr) (int)(sizeof(arr) / sizeof(arr[0]))
|
H A D | bwirf.c | 1156 #define N(arr) (int)(sizeof(arr) / sizeof(arr[0]))
|
/haiku-fatelf/src/kits/network/libbind/irs/ |
H A D | irpmarshall.c | 1663 char **arr = NULL; local 1688 aptr = arr = malloc(count * sizeof (char *)); 1694 memset(arr, 0x0, count * sizeof (char *)); 1705 arr = malloc(sizeof (char *)); 1706 if (arr == NULL) { 1711 *arr = NULL; 1714 return (arr);
|
/haiku-fatelf/src/add-ons/input_server/methods/canna/rk/ |
H A D | RKintern.h | 433 #define WriteCT(csn, tick, arr){\ 434 (arr)[0] = (unsigned long) (csn);\ 435 (arr)[1] = (unsigned long) (tick);\
|
/haiku-fatelf/src/add-ons/input_server/methods/canna/lib/ |
H A D | lisp.c | 130 static int xfseq(char *fname, list l, unsigned char *arr, int arrsize); 2926 xfseq(char *fname, list l, unsigned char *arr, int arrsize) argument 2932 (arr[0] = (unsigned char)(symbolpointer(l)->fid)) != 255) { 2933 arr[1] = 0; 2947 (arr[i] = (unsigned char)(symbolpointer(temp)->fid)) == 255) { 2953 arr[i] = 0;
|
/haiku-fatelf/headers/private/media/ |
H A D | soundcard.h | 177 unsigned char arr[8]; member in struct:seq_event_rec
|