Searched refs:names (Results 1 - 25 of 240) sorted by relevance

12345678910

/freebsd-10.0-release/contrib/ncurses/ncurses/base/
H A DMKkeyname.awk47 names = names"\n\t\""$1"\\0\""
62 print "static const char key_names[] = "names";"
/freebsd-10.0-release/usr.bin/getconf/
H A DMakefile8 confstr.names limits.names pathconf.names sysconf.names \
9 conflicting.names unique.names
11 .SUFFIXES: .gperf .names
19 .gperf.names:
23 conflicts: conflicting.names unique.names
[all...]
/freebsd-10.0-release/contrib/diff/src/
H A Ddir.c37 size_t nnames; /* Number of names. */
38 char const **names; /* Sorted names of files in dir, followed by 0. */ member in struct:dirdata
39 char *data; /* Allocated storage for file names. */
42 /* Whether file names in directories should be compared with
53 /* Read a directory and get its vector of names. */
62 char const **names; local
71 dirdata->names = 0;
131 /* Create the `names' table from the `data' table. */
132 if (PTRDIFF_MAX / sizeof *names
226 char const **volatile names[2]; local
[all...]
/freebsd-10.0-release/sys/dev/drm2/
H A Ddrm_gem_names.c41 MALLOC_DEFINE(M_GEM_NAMES, "gem_name", "Hash headers for the gem names");
43 static void drm_gem_names_delete_name(struct drm_gem_names *names,
47 drm_gem_names_init(struct drm_gem_names *names) argument
50 names->unr = new_unrhdr(1, INT_MAX, NULL); /* XXXKIB */
51 names->names_hash = hashinit(1000 /* XXXKIB */, M_GEM_NAMES,
52 &names->hash_mask);
53 mtx_init(&names->lock, "drmnames", NULL, MTX_DEF);
57 drm_gem_names_fini(struct drm_gem_names *names) argument
62 mtx_lock(&names->lock);
63 for (i = 0; i <= names
76 gem_name_hash_index(struct drm_gem_names *names, int name) argument
83 drm_gem_name_ref(struct drm_gem_names *names, uint32_t name, void (*ref)(void *)) argument
120 drm_gem_find_name(struct drm_gem_names *names, void *ptr) argument
131 drm_gem_name_create(struct drm_gem_names *names, void *p, uint32_t *name) argument
155 drm_gem_names_delete_name(struct drm_gem_names *names, struct drm_gem_name *np) argument
166 drm_gem_names_remove(struct drm_gem_names *names, uint32_t name) argument
184 drm_gem_names_foreach(struct drm_gem_names *names, int (*f)(uint32_t, void *, void *), void *arg) argument
[all...]
H A Ddrm_gem_names.h54 void drm_gem_names_init(struct drm_gem_names *names);
55 void drm_gem_names_fini(struct drm_gem_names *names);
56 uint32_t drm_gem_find_name(struct drm_gem_names *names, void *ptr);
57 void *drm_gem_name_ref(struct drm_gem_names *names, uint32_t name,
59 int drm_gem_name_create(struct drm_gem_names *names, void *obj, uint32_t *name);
60 void drm_gem_names_foreach(struct drm_gem_names *names,
62 void *drm_gem_names_remove(struct drm_gem_names *names, uint32_t name);
/freebsd-10.0-release/usr.bin/users/
H A Dusers.c13 * 4. Neither the name of the University nor the names of its contributors
61 namebuf *names = NULL; local
83 names = realloc(names, sizeof(*names) * nmax);
84 if (!names) {
89 (void)strlcpy(names[ncnt], ut->ut_user, sizeof(*names));
94 qsort(names, ncnt, sizeof(namebuf), scmp);
95 (void)printf("%s", names[
[all...]
/freebsd-10.0-release/contrib/libarchive/libarchive/
H A Darchive_write_add_filter_by_name.c44 /* A table that maps names to functions. */
46 struct { const char *name; int (*setter)(struct archive *); } names[] = variable in typeref:struct:__anon1572
67 for (i = 0; names[i].name != NULL; i++) {
68 if (strcmp(name, names[i].name) == 0)
69 return ((names[i].setter)(a));
H A Darchive_write_set_format_by_name.c43 /* A table that maps names to functions. */
45 struct { const char *name; int (*setter)(struct archive *); } names[] = variable in typeref:struct:__anon1579
82 for (i = 0; names[i].name != NULL; i++) {
83 if (strcmp(name, names[i].name) == 0)
84 return ((names[i].setter)(a));
/freebsd-10.0-release/contrib/ncurses/misc/
H A Dchkdef.cmd54 * `names' associates a code to a name
58 names. = ''
93 when names.new_code \= '' then
95 if names.new_code \= new_name then
98 say 'Conflict with "'names.new_code'" & "'new_name'" being @'new_code
103 names.new_code = new_name
H A Dcmpdef.cmd59 names. = ''
90 names.number = name
110 if names.number = '' then
113 say 'Conflict old =' names.number ', new =' name 'at @'number
H A Dmakedef.cmd59 * `names' is the stem where symbols are stored sequentially
65 names. = ''
132 when names.last = new_name then
140 names.last = new_name
163 say ' "'names.inx'" @'codes.inx' NONAME'
/freebsd-10.0-release/lib/libc/gen/
H A Dscandir.c13 * 4. Neither the name of the University nor the names of its contributors
67 struct dirent *d, *p, **names = NULL; local
76 names = (struct dirent **)malloc(arraysz * sizeof(struct dirent *));
77 if (names == NULL)
82 continue; /* just selected names */
101 names2 = (struct dirent **)realloc((char *)names,
107 names = names2;
110 names[nitems++] = p;
114 qsort_r(names, nitems, sizeof(struct dirent *),
116 *namelist = names;
[all...]
/freebsd-10.0-release/contrib/file/
H A Dnames.h29 * Names.h - names and types used by ascmagic in file(1).
35 * $File: names.h,v 1.32 2008/02/11 00:19:29 rrt Exp $
77 { "cannot happen error on names.h/types", "error/x-error" }
116 static const struct names { struct
119 } names[] = { variable in typeref:struct:names
173 #define NNAMES (sizeof(names)/sizeof(struct names))
/freebsd-10.0-release/tools/tools/mtxstat/
H A Dmtxstat.pl47 my @names; # Field names
79 @names = split(' ', $header);
80 if (defined($key) && !grep(/^$key$/, @names)) {
85 my @fields = split(' ', $_, @names);
88 foreach (@names) {
/freebsd-10.0-release/contrib/ncurses/ncurses/tty/
H A DMKexpanded.sh64 /* these are names we'd like to see */
/freebsd-10.0-release/release/picobsd/tinyware/vm/
H A Dvm.c42 char names[CNT*16]; local
52 len=sizeof(names);
53 i = sysctlbyname("hw.intrnames", &names, &len, NULL, 0);
57 for( i=0, a = names ; i < CNT && a < names+sizeof(names) ; ) {
59 while (a < names+sizeof(names) && *a)
/freebsd-10.0-release/contrib/subversion/subversion/libsvn_subr/
H A Dgenctype.py25 # Table of ASCII character names
26 names = ('nul', 'soh', 'stx', 'etx', 'eot', 'enq', 'ack', 'bel', variable
60 if len(names[c]) == 1:
61 name = names[c].center(3)
63 name = names[c].ljust(3)
/freebsd-10.0-release/sys/contrib/ia64/libuwx/test/
H A Ddump_context.c34 static char *names[] = { local
77 if (valid & 1) printf(" %s", names[i]);
85 printf(" %-8s %08x %08x", names[j],
94 printf(" %-8s %08x %08x", names[j],
/freebsd-10.0-release/contrib/unbound/services/
H A Dmodstack.c19 * Neither the name of the NLNET LABS nor the names of its contributors may
113 /** The list of module names */
118 static const char* names[] = { local
125 return names;
150 const char** names = module_list_avail(); local
154 while(names[i]) {
155 if(strncmp(names[i], s, strlen(names[i])) == 0) {
156 s += strlen(names[i]);
/freebsd-10.0-release/contrib/one-true-awk/
H A Dmaketab.c26 * this program makes the table to link function names
111 char *names[SIZE]; variable
125 names[i] = "";
141 names[tok-FIRSTTOKEN] = (char *) malloc(strlen(name)+1);
142 strcpy(names[tok-FIRSTTOKEN], name);
153 printf("\tnullproc,\t/* %s */\n", names[i]);
155 printf("\t%s,\t/* %s */\n", table[i], names[i]);
/freebsd-10.0-release/contrib/binutils/binutils/
H A Dsysinfo.y31 static char *names[] = {" ","[n]","[n][m]"};
262 char *p = names[rdepth];
272 names[rdepth], size);
279 names[rdepth],size/8);
312 names[rdepth],
318 names[rdepth],
324 printf("\tput%s(raw,%d,%d,&idx,ptr->%s%s);\n", type,size/8,size%8,id,names[rdepth]);
394 printf("if (ptr->%s%s == %s) { tabout(); printf(\"%s\\n\");}\n", name, names[rdepth],$4,$3);
/freebsd-10.0-release/contrib/llvm/lib/Target/R600/
H A DAMDILIntrinsicInfo.cpp35 static const char* const names[] = { local
47 std::string Result(names[IntrID - Intrinsic::num_intrinsics]);
/freebsd-10.0-release/contrib/apr/helpers/
H A Dapr_rename.pl9 my %names;
17 $names{$old} = $new;
20 my $pattern = join '|', keys %names;
44 print " $file:$. apr_$_ -> apr_$names{$_}\n";
60 s/([^_\"]*$prefix)($pattern)\b/$1$names{$2}/og;
/freebsd-10.0-release/contrib/groff/src/utils/xtotroff/
H A Dxtotroff.c77 FontNamesAmbiguous(const char *font_name, char **names, int count) argument
86 if (!CanonicalizeFontName(names[i], i == 0 ? name1 : name2)) {
87 fprintf(stderr, "bad font name: %s\n", names[i]);
92 fprintf(stderr, " matches %s\n", names[0]);
93 fprintf(stderr, " and %s\n", names[i]);
104 char **names; local
130 names = XListFonts(dpy, name_string, 100000, &count);
136 if (FontNamesAmbiguous(font_name, names, count))
139 XParseFontName(names[0], &parsed, &attributes);
151 fi = XLoadQueryFont(dpy, names[
[all...]
/freebsd-10.0-release/contrib/libarchive/libarchive/test/
H A Dtest_fuzz.c51 const char **names; member in struct:files
62 for (n = 0; filesets[n].names != NULL; ++n) {
70 extract_reference_files(filesets[n].names);
79 r = archive_read_open_filenames(a, filesets[n].names, 16384);
82 if (filesets[n].names[0] == NULL || filesets[n].names[1] == NULL) {
85 skipping("Cannot uncompress %s", filesets[n].names[0]);
98 if (filesets[n].names[0] == NULL || filesets[n].names[1] == NULL) {
103 "uncompressed test file: %s", filesets[n].names[
[all...]

Completed in 217 milliseconds

12345678910