| /glibc-2.36/misc/ |
| D | tsearch.c | 109 } *node; typedef
132 } *node; typedef
134 #define RED(N) (node)((N)->left_node & ((uintptr_t) 0x1))
137 #define SETNODEPTR(NP,P) (*NP) = (node)((((uintptr_t)(*NP)) \
139 #define LEFT(N) (node)((N)->left_node & ~((uintptr_t) 0x1))
140 #define LEFTPTR(N) (node *)(&(N)->left_node)
143 #define RIGHT(N) (node)((N)->right_node)
144 #define RIGHTPTR(N) (node *)(&(N)->right_node)
146 #define DEREFNODEPTR(NP) (node)((uintptr_t)(*(NP)) & ~((uintptr_t) 0x1))
160 check_tree_recurse (node p, int d_sofar, int d_total) in check_tree_recurse()
[all …]
|
| /glibc-2.36/posix/ |
| D | regcomp.c | 45 static reg_errcode_t optimize_subexps (void *extra, bin_tree_t *node);
46 static reg_errcode_t lower_subexps (void *extra, bin_tree_t *node);
48 bin_tree_t *node);
49 static reg_errcode_t calc_first (void *extra, bin_tree_t *node);
50 static reg_errcode_t calc_next (void *extra, bin_tree_t *node);
51 static reg_errcode_t link_nfa_nodes (void *extra, bin_tree_t *node);
57 Idx node, bool root);
123 static void free_token (re_token_t *node);
124 static reg_errcode_t free_tree (void *extra, bin_tree_t *node);
125 static reg_errcode_t mark_opt_subexp (void *extra, bin_tree_t *node);
[all …]
|
| D | regexec.c | 24 static reg_errcode_t match_ctx_add_entry (re_match_context_t *cache, Idx node,
27 static reg_errcode_t match_ctx_add_subtop (re_match_context_t *mctx, Idx node,
30 Idx node, Idx str_idx);
96 Idx node, Idx str_idx,
172 const re_token_t *node, Idx idx);
1175 check_halt_node_context (const re_dfa_t *dfa, Idx node, unsigned int context) in check_halt_node_context() argument
1177 re_token_type_t type = dfa->nodes[node].type; in check_halt_node_context()
1178 unsigned int constraint = dfa->nodes[node].constraint; in check_halt_node_context()
1214 Idx *pidx, Idx node, re_node_set *eps_via_nodes, in proceed_next_node() argument
1218 if (IS_EPSILON_NODE (dfa->nodes[node].type)) in proceed_next_node()
[all …]
|
| D | regex_internal.h | 562 Idx node; member
574 Idx node; member
583 Idx node; member
626 Idx node; member
|
| D | regex_internal.c | 1650 re_token_t *node = dfa->nodes + nodes->elems[i]; in create_ci_newstate() local
1651 re_token_type_t type = node->type; in create_ci_newstate()
1652 if (type == CHARACTER && !node->constraint) in create_ci_newstate()
1655 newstate->accept_mb |= node->accept_mb; in create_ci_newstate()
1663 else if (type == ANCHOR || node->constraint) in create_ci_newstate()
1702 re_token_t *node = dfa->nodes + nodes->elems[i]; in create_cd_newstate() local
1703 re_token_type_t type = node->type; in create_cd_newstate()
1704 unsigned int constraint = node->constraint; in create_cd_newstate()
1709 newstate->accept_mb |= node->accept_mb; in create_cd_newstate()
|
| /glibc-2.36/iconv/ |
| D | gconv_db.c | 498 struct gconv_module *node; in find_derivation() local
508 node = __gconv_modules_db; in find_derivation()
509 while (node != NULL) in find_derivation()
511 int cmpres = strcmp (current->result_set, node->from_string); in find_derivation()
519 runp = node; in find_derivation()
647 node = node->left; in find_derivation()
649 node = node->right; in find_derivation()
812 free_modules_db (struct gconv_module *node) in free_modules_db() argument
814 if (node->left != NULL) in free_modules_db()
815 free_modules_db (node->left); in free_modules_db()
[all …]
|
| D | iconv_prog.c | 694 add_known_names (struct gconv_module *node) in add_known_names() argument
696 if (node->left != NULL) in add_known_names()
697 add_known_names (node->left); in add_known_names()
698 if (node->right != NULL) in add_known_names()
699 add_known_names (node->right); in add_known_names()
702 if (strcmp (node->from_string, "INTERNAL") != 0) in add_known_names()
703 tsearch (node->from_string, &printlist, (__compar_fn_t) strverscmp); in add_known_names()
704 if (strcmp (node->to_string, "INTERNAL") != 0) in add_known_names()
705 tsearch (node->to_string, &printlist, (__compar_fn_t) strverscmp); in add_known_names()
707 node = node->same; in add_known_names()
[all …]
|
| D | gconv_conf.c | 103 struct gconv_module *node = __gconv_modules_db; in detect_conflict() local
105 while (node != NULL) in detect_conflict()
107 int cmpres = strcmp (alias, node->from_string); in detect_conflict()
113 node = node->left; in detect_conflict()
115 node = node->right; in detect_conflict()
118 return node != NULL; in detect_conflict()
|
| /glibc-2.36/manual/ |
| D | summary.pl | 58 my $node;
68 $node = &get_node($line);
189 &record_entry($e, $p, $h, $s, $node);
195 &record_entry($e, $p, $defhdr, $defstd, $node);
199 &record_entry($e, $p, $h, $s, $node);
218 my ($ele, $proto, $hdr, $std, $node) = @_;
219 push @{$entries{$ele}{$proto}}, [$hdr, $std, $node];
341 my ($header, $standard, $node)
350 print "$header ($standard): \@ref{$node}.\n\n";
|
| D | libc.texinfo | 26 @c place of the node name, when no section title is explicitly given.
118 @node Top, Introduction, (dir), (dir)
129 @node Free Manuals, Copying, Contributors, Top
133 @node Copying, Documentation License, Free Manuals, Top
137 @node Documentation License, Concept Index, Copying, Top
142 @node Concept Index, Type Index, Documentation License, Top
147 @node Type Index, Function Index, Concept Index, Top
152 @node Function Index, Variable Index, Type Index, Top
157 @node Variable Index, File Index, Function Index, Top
162 @node File Index, , Variable Index, Top
|
| D | dir | 1 This is the file .../info/dir, which contains the topmost node of the
3 looking at that node, which is (dir)Top.
7 This (the Directory node) gives a menu of major topics.
|
| D | search.texi | 1 @node Searching and Sorting, Pattern Matching, Message Translation, Top
22 @node Comparison Functions
61 @node Array Search Function
149 @node Array Sort Function
207 @node Search/Sort Example
262 @node Hash Search Function
470 @node Tree Search Function
514 necessary to change the root node of the tree. So it must not be
547 and a pointer to the parent of the deleted node is returned by the
561 For the data in each tree node the function @var{freefct} is called.
[all …]
|
| D | xtract-typefun.awk | 6 /^@node/ {
8 sub(/^@node +/, "", name);
|
| D | libc-texinfo.sh | 13 while IFS=: read file node; do
15 echo "* $node:: `sed -n 's/^@c %MENU% //p' $file`" >&4
|
| D | lang.texi | 1 @c This node must have no pointers.
2 @node Language Features
3 @c @node Language Features, Library Summary, , Top
23 @node Consistency Checking
138 @node Variadic Functions
165 @node Why Variadic
203 @node How Variadic
236 @node Variadic Prototypes
269 @node Receiving Arguments
334 @node How Many Arguments
[all …]
|
| D | io.texi | 1 @node I/O Overview, I/O on Streams, Pattern Matching, Top
47 @node I/O Concepts, File Names, , I/O Overview
74 @node Streams and File Descriptors, File Position, , I/O Concepts
129 @node File Position, , Streams and File Descriptors, I/O Concepts
175 @node File Names, , I/O Concepts, I/O Overview
197 @node Directories, File Name Resolution, , File Names
235 @node File Name Resolution, File Name Errors, Directories, File Names
314 @node File Name Errors, File Name Portability, File Name Resolution, File Names
356 @node File Name Portability, , File Name Errors, File Names
|
| D | argp.texi | 1 @node Argp, Suboptions, Getopt, Parsing Program Arguments
103 @node Argp Global Variables, Argp Parsers, , Argp
158 @node Argp Parsers, Argp Flags, Argp Global Variables, Argp
230 @node Argp Option Vectors, Argp Parser Functions, Argp Parsers, Argp Parsers
304 @node Argp Option Flags, , , Argp Option Vectors
358 @node Argp Parser Functions, Argp Children, Argp Option Vectors, Argp Parsers
441 @node Argp Special Keys, Argp Parsing State, , Argp Parser Functions
572 @node Argp Parsing State, Argp Helper Functions, Argp Special Keys, Argp Parser Functions
657 @node Argp Helper Functions, , Argp Parsing State, Argp Parser Functions
883 @node Argp Children, Argp Help Filtering, Argp Parser Functions, Argp Parsers
[all …]
|
| D | threads.texi | 1 @node Threads
2 @c @node Threads, Dynamic Linker, Debugging Support, Top
17 @node ISO C Threads
40 @node ISO C Threads Return Values
72 @node ISO C Thread Management
194 @node Call Once
223 @node ISO C Mutexes
364 @node ISO C Condition Variables
454 @node ISO C Thread-local Storage
548 @node POSIX Threads
[all …]
|
| /glibc-2.36/sysdeps/mach/hurd/ |
| D | bind.c | 43 file_t dir, node, ifsock; in __bind() local
51 err = __dir_mkfile (dir, O_CREAT, 0666 & ~_hurd_umask, &node); in __bind()
56 err = __file_set_translator (node, in __bind()
67 err = __dir_lookup (node, "", 0, 0, &doretry, retryname, &ifsock); in __bind()
81 err = __dir_link (dir, node, n, 1); in __bind()
89 __mach_port_deallocate (__mach_task_self (), node); in __bind()
|
| D | symlinkat.c | 34 file_t dir, node; in symlinkat() local
49 err = __dir_mkfile (dir, O_WRITE, 0777 & ~_hurd_umask, &node); in symlinkat()
54 err = __file_set_translator (node, in symlinkat()
62 err = __dir_link (dir, node, name, 1); in symlinkat()
64 __mach_port_deallocate (__mach_task_self (), node); in symlinkat()
|
| D | symlink.c | 29 file_t dir, node; in __symlink() local
44 err = __dir_mkfile (dir, O_WRITE, 0777 & ~_hurd_umask, &node); in __symlink()
49 err = __file_set_translator (node, in __symlink()
57 err = __dir_link (dir, node, name, 1); in __symlink()
59 __mach_port_deallocate (__mach_task_self (), node); in __symlink()
|
| D | mknodat.c | 39 file_t dir, node; in __mknodat() local
95 errnode = err = __dir_mkfile (dir, O_WRITE, (mode & ~S_IFMT) & ~_hurd_umask, &node); in __mknodat()
99 err = __file_set_translator (node, in __mknodat()
107 err = __dir_link (dir, node, name, 1); in __mknodat()
111 __mach_port_deallocate (__mach_task_self (), node); in __mknodat()
|
| /glibc-2.36/sysdeps/htl/ |
| D | timer_routines.c | 224 struct list_head *node = list_first (&thread_free_list); in __timer_thread_alloc() local
226 if (node != list_null (&thread_free_list)) in __timer_thread_alloc()
228 struct thread_node *thread = thread_links2ptr (node); in __timer_thread_alloc()
229 list_unlink (node); in __timer_thread_alloc()
231 list_append (&thread_active_list, node); in __timer_thread_alloc()
522 struct list_head *node = list_first (&timer_free_list); in __timer_alloc() local
524 if (node != list_null (&timer_free_list)) in __timer_alloc()
526 struct timer_node *timer = timer_links2ptr (node); in __timer_alloc()
527 list_unlink_ip (node); in __timer_alloc()
|
| /glibc-2.36/sysdeps/unix/sysv/linux/ |
| D | getcpu.c | 24 __getcpu (unsigned int *cpu, unsigned int *node) in __getcpu() argument
27 return INLINE_VSYSCALL (getcpu, 3, cpu, node, NULL); in __getcpu()
29 return INLINE_SYSCALL_CALL (getcpu, cpu, node, NULL); in __getcpu()
|
| /glibc-2.36/malloc/ |
| D | tst-mtrace.c | 27 static void print (const void *node, VISIT value, int level);
97 print (const void *node, VISIT value, int level) in print() argument
101 fprintf (fp, "%3d: %s", ++cnt, *(const char **) node); in print()
|