Searched refs:key (Results 851 - 875 of 892) sorted by relevance

<<313233343536

/osnet-11/usr/src/lib/gss_mechs/mech_krb5/krb5/unicode/
H A Dure.c549 ucs2_t key; member in struct:__anon1046
697 for (; n > 0 && tp->key != *sp; tp++, n--) ;
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Net/
H A DNNTP.pm719 C<OPTIONS> are passed in a hash like fashion, using key and value pairs.
846 to a hash where the key is a group name and each value is a reference to an
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Pod/
H A DHtml.pm906 foreach my $key (keys %Items) {
907 print CACHE "$key $Items{$key}\n";
918 foreach my $key (keys %Pages) {
919 print CACHE "$key $Pages{$key}\n";
H A DParseUtils.pm232 The B<new()> method can either be passed a set of key/value pairs or a single
H A DText.pm696 new() can take options, in the form of key/value pairs, that control the
H A DParser.pm439 key/value pairs in a hash-table. The newly constructed object will be
1314 key/value pairs and the specified parse-option names are set to the
1623 is fairly straightforward. The B<parse_text()> method is the key to doing
/osnet-11/usr/src/lib/libsldap/common/
H A Dns_writes.c3322 if (ptr->key == NULL || ptr->value == '\0' || ptr->mapname == '\0') {
3330 ptr->key);
3338 if (ptr->key != '\0') {
3340 (char *)ptr->key);
/osnet-11/usr/src/lib/libdevinfo/
H A Ddevinfo_devperm.c1019 void (*errcb)(minorperm_err_t mp_err, int key))
1018 i_devfs_read_minor_perm_by_driver(char *drvname, void (*errcb)(minorperm_err_t mp_err, int key)) argument
/osnet-11/usr/src/cmd/sendmail/src/
H A Dreadcf.c410 syserr("missing key name for lookup");
553 /* check if [key]@map:spec */
961 char *key; local
969 key = filename;
971 /* skip past key */
1051 sm_dprintf("fileclass: F{%s}: map class %s, key %s, spec %s\n",
1052 mn, cl, key, spec);
1081 p = (*map.map_class->map_lookup)(&map, key, NULL, &status);
3208 case O_SHMKEY: /* shared memory key */
3218 case O_SHMKEYFILE: /* shared memory key fil
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/
H A Dpp.c3917 char *key = SvPV(keysv, keylen); local
3918 SAVEDELETE(hv, savepvn(key,keylen), keylen);
4019 SV* key = *++MARK; local
4025 (void)hv_store_ent(hv,key,val,0);
/osnet-11/usr/src/cmd/sendmail/db/
H A Ddb.h118 void *data; /* key/data */
119 u_int32_t size; /* key/data length */
385 #define DB_KEYEMPTY ( -2) /* The key/data pair was deleted or
387 #define DB_KEYEXIST ( -3) /* The key/data pair already exists. */
506 DBT rkey; /* Returned key. */
555 u_int32_t hash_bigpages; /* Number of big key/data pages. */
1012 char *key; member in struct:entry
/osnet-11/usr/src/cmd/parted/
H A Dui.c50 extern int tgetnum (char* key);
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/Filter/Util/Call/
H A DCall.pm294 Here are a few examples which illustrate the key concepts - as such
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/ExtUtils/
H A DManifest.pm101 my($key,$val,$file,%all);
/osnet-11/usr/src/lib/lvm/libmeta/common/
H A Dmeta_metad.c122 v2_np->key = v1_np->key;
203 v1_np->key = v2_np->key;
3619 * the drive, but just a key into that other node's nodespace.
H A Dmeta_nameinfo.c1175 namep->key = MD_KEYBAD;
/osnet-11/usr/src/lib/libsasl/lib/
H A Dcommon.c1110 static void free_err_tsd(void *key) argument
1112 free(key);
1156 case SASL_TRYAGAIN: s = gettext("transient failure (e.g., weak key)");
1241 case SASL_TRYAGAIN: return "transient failure (e.g., weak key)";
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/
H A DMakefile.com50 mandatory_sumtype.o combine_keys.o key.o keyblocks.o
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/Storable/
H A DStorable.pm512 hashes with the elements sorted by their key. This allows you to
839 reference that was used for the key originally to record the value into
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/
H A DMemoize.pm102 $revmemotable{$wrapper} = "" . $cref; # Turn code ref into hash key
602 For the example above, this produces the key "13 1 2 3 4 5 6 7".
766 # ... now compute the hash key from the arguments ...
982 Some versions of C<DB_File> won't let you store data under a key of
987 C<"x"> to every key.
H A DSwitch.pm591 one could test for the existence of a single key in a series of hashes
/osnet-11/usr/src/lib/libntfs/common/include/ntfs/
H A Dlayout.h572 * COLLATION_NTOFS_ULONG - Sorting is done according to ascending le32 key
581 * le32 key values. E.g. used for $O index in FILE_Extend/$ObjId, which
1294 the index entry key. */
2179 * struct SII_INDEX_KEY - The index entry key used in the $SII index.
2194 * struct SDH_INDEX_KEY - The index entry key used in the $SDH index.
2444 * The index entries are sorted by the index key file_id. The collation rule is
2446 * primary key / is not a key at all. (AIA)
2491 * index key is the user_id of the user/group owning this quota control entry,
2492 * i.e. the key i
2666 } __attribute__((__packed__)) key; member in struct:__anon2118
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Attribute/
H A DHandlers.pm577 The argument after C<'autotie'> is a reference to a hash in which each key is
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Filter/
H A DSimple.pm417 (in which case the terminator is the value associated with the key
/osnet-11/usr/src/lib/libsqlite/src/
H A Dbuild.c665 ** of columns that form the primary key. If pList is NULL, then the
666 ** most recently added column of the table is the primary key.
668 ** A table can have at most one primary key. If the table already has
669 ** a primary key (and this is the second primary key) then create an
680 ** If the key is not an INTEGER PRIMARY KEY, then create a unique
681 ** index for the key. No index is created for INTEGER PRIMARY KEYs.
690 "table \"%s\" has more than one primary key", pTab->zName);
1335 ** This routine is called to create a new foreign key on the table
1337 ** in the current table point to the foreign key
[all...]

Completed in 239 milliseconds

<<313233343536