/haiku-fatelf/src/bin/gawk/ |
H A D | awk.h | 512 } NODE; typedef in typeref:struct:exp_node 564 NODE *init; 565 NODE *cond; 566 NODE *incr; 672 extern NODE *BINMODE_node, *CONVFMT_node, *FIELDWIDTHS_node, *FILENAME_node; 673 extern NODE *FNR_node, *FS_node, *IGNORECASE_node, *NF_node; 674 extern NODE *NR_node, *OFMT_node, *OFS_node, *ORS_node, *RLENGTH_node; 675 extern NODE *RSTART_node, *RS_node, *RT_node, *SUBSEP_node, *PROCINFO_node; 676 extern NODE *LINT_node, *ERRNO_node, *TEXTDOMAIN_node; 677 ATTRIBUTE_EXPORTED extern NODE **stack_pt [all...] |
H A D | ext.c | 44 NODE * 45 do_ext(NODE *tree) 47 NODE *obj; 48 NODE *fun; 49 NODE *(*func) P((NODE *, void *)); 80 func = (NODE *(*) P((NODE *, void *))) dlsym(dl, fun->stptr); 93 make_builtin(char *name, NODE *(*func) P((NODE *)), in [all...] |
H A D | array.c | 45 static NODE *assoc_find P((NODE *symbol, NODE *subs, int hash1)); 46 static void grow_table P((NODE *symbol)); 80 NODE * 81 get_actual(NODE *symbol, int canfatal) 85 NODE *save_symbol = symbol; 137 array_vname(register const NODE *symbol) 150 const NODE *save_symbol = symbol; 256 NODE * [all...] |
H A D | awkgram.y | 43 static NODE *node_common P((NODETYPE op)); 44 static NODE *snode P((NODE *subn, NODETYPE op, int sindex)); 45 static NODE *make_for_loop P((NODE *init, NODE *cond, NODE *incr)); 46 static NODE *append_right P((NODE *list, NODE *ne [all...] |
H A D | node.c | 31 r_force_number(register NODE *n) 143 NODE * 144 format_val(const char *format, int index, register NODE *s) 175 NODE *dummy, *r; 177 extern NODE **fmt_list; /* declared in eval.c */ 218 NODE * 219 r_force_string(register NODE *s) 221 NODE *ret; 244 NODE * 245 r_dupnode(NODE * [all...] |
H A D | field.c | 28 typedef void (* Setfunc) P((long, char *, long, NODE *)); 30 static long (*parse_field) P((long, char **, int, NODE *, 31 Regexp *, Setfunc, NODE *)); 33 static long re_parse_field P((long, char **, int, NODE *, 34 Regexp *, Setfunc, NODE *)); 35 static long def_parse_field P((long, char **, int, NODE *, 36 Regexp *, Setfunc, NODE *)); 37 static long posix_def_parse_field P((long, char **, int, NODE *, 38 Regexp *, Setfunc, NODE *)); 39 static long null_parse_field P((long, char **, int, NODE *, [all...] |
H A D | eval.c | 32 static int eval_condition P((NODE *tree)); 33 static NODE *op_assign P((NODE *tree)); 34 static NODE *func_call P((NODE *tree)); 35 static NODE *match_op P((NODE *tree)); 38 static void push_forloop P((const char *varname, NODE **elems, size_t nelems)); 39 static void push_args P((int count, NODE *arglist, NODE **oldstac [all...] |
H A D | builtin.c | 73 extern NODE **fields_arr; 76 static NODE *sub_common P((NODE *tree, long how_many, int backdigs)); 144 NODE * 145 do_exp(NODE *tree) 147 NODE *tmp; 185 NODE * 186 do_fflush(NODE *tree) 189 NODE *tmp; 304 NODE * [all...] |
H A D | profile.c | 35 static void tree_eval P((NODE *tree)); 36 static void parenthesize P((NODETYPE parent_type, NODE *tree)); 37 static void eval_condition P((NODE *tree)); 38 static void pp_op_assign P((NODE *tree)); 39 static void pp_func_call P((NODE *tree)); 40 static void pp_match_op P((NODE *tree)); 41 static void pp_lhs P((NODE *ptr)); 42 static void pp_print_stmt P((const char *command, NODE *tree)); 43 static void pp_delete P((NODE *tree)); 44 static void pp_in_array P((NODE *arra [all...] |
H A D | awkgram.c | 169 static NODE *node_common P((NODETYPE op)); 170 static NODE *snode P((NODE *subn, NODETYPE op, int sindex)); 171 static NODE *make_for_loop P((NODE *init, NODE *cond, NODE *incr)); 172 static NODE *append_right P((NODE *list, NODE *ne [all...] |
H A D | main.c | 60 NODE *ARGC_node, *ARGIND_node, *ARGV_node, *BINMODE_node, *CONVFMT_node; 61 NODE *ENVIRON_node, *ERRNO_node, *FIELDWIDTHS_node, *FILENAME_node, *FNR_node; 62 NODE *FS_node, *IGNORECASE_node, *NF_node, *NR_node, *OFMT_node, *OFS_node; 63 NODE *ORS_node, *PROCINFO_node, *RLENGTH_node, *RSTART_node, *RS_node; 64 NODE *RT_node, *SUBSEP_node, *LINT_node, *TEXTDOMAIN_node; 88 NODE *Nnull_string; /* The global null string */ 94 NODE *begin_block = NULL; 97 NODE *end_block = NULL; 152 NODE *expression_value; 717 register NODE **tm [all...] |
H A D | io.c | 154 struct redirect *redirect P((NODE *tree, int *errflg)); 186 static NODE *RS; 194 extern NODE *ARGC_node; 195 extern NODE *ARGV_node; 196 extern NODE *ARGIND_node; 197 extern NODE *ERRNO_node; 198 extern NODE **fields_arr; 249 NODE *arg; 403 NODE *t; 489 redirect(NODE *tre [all...] |
H A D | re.c | 226 re_update(NODE *t) 228 NODE *t1;
|
/haiku-fatelf/src/kits/media/ |
H A D | SoundConsumer.cpp | 45 #define NODE fprintf macro 48 #define NODE(x...) 85 NODE(stderr, "SoundConsumer::SoundConsumer(%p, %p, %p, %p)\n", name, 125 NODE(stderr, "SoundConsumer::~SoundConsumer()\n"); 130 NODE(stderr, "wait_for_thread() B_INTERRUPTED\n"); 159 NODE(stderr, "SoundConsumer::SetHooks read reply: %#" B_PRIx32 375 NODE(stderr, "SoundConsumer: GetNextInput()\n"); 408 NODE(stderr, "SoundConsumer::BufferReceived()\n"); 466 NODE(stderr, "SoundConsumer::Connected()\n"); 517 NODE(stder [all...] |
/haiku-fatelf/src/tools/docbook/libxml2/ |
H A D | valid.c | 347 #define NODE ctxt->vstate->node macro 4681 NODE = xmlValidateSkipIgnorable(NODE); 4682 if ((NODE == NULL) && (CONT == NULL)) 4684 if ((NODE == NULL) && 4690 if ((NODE != NULL) && (NODE->type == XML_ENTITY_REF_NODE)) 4704 DEBUG_VALID_STATE(NODE, CONT) 4709 DEBUG_VALID_STATE(NODE, CONT) 4721 if (vstateVPush(ctxt, CONT, NODE, DEPT [all...] |
/haiku-fatelf/src/add-ons/translators/webp/libwebp/enc/ |
H A D | quant.c | 440 #define NODE(n, l) (nodes[(n) + 1][(l) + MIN_DELTA]) macro 492 NODE(n, m).cost = 0; 493 NODE(n, m).error = max_error; 494 NODE(n, m).ctx = ctx0; 514 Node* const cur = &NODE(n, m); 537 const Node* const prev = &NODE(n - 1, p); 591 NODE(n, best_node).prev = best_path[2]; // force best-prev for terminal 595 const Node* const node = &NODE(n, best_node); 605 #undef NODE macro
|