/macosx-10.10/postfix-255/postfix/src/util/ |
H A D | cidr_match.c | 69 * address byte count for a CIDR_MATCH entry. 100 CIDR_MATCH *entry; local 106 for (entry = list; entry; entry = entry->next) { 107 if (entry->addr_family == addr_family) { 109 if (entry->mask_shift < entry->addr_bit_count) { 110 for (np = entry [all...] |
/macosx-10.10/Heimdal-398.1.2/lib/kadm5/ |
H A D | chpass_s.c | 79 ret = hdb_add_current_keys_to_history(context->context, &ent.entry); 92 num_keys = ent.entry.keys.len; 93 keys = ent.entry.keys.val; 95 ent.entry.keys.len = 0; 96 ent.entry.keys.val = NULL; 98 ret = _kadm5_set_keys(context, &ent.entry, password, 109 ext = hdb_find_extension(&ent.entry, choice_HDB_extension_data_hist_keys); 111 existsp = _kadm5_exists_keys_hist(ent.entry.keys.val, 112 ent.entry.keys.len, 123 ent.entry [all...] |
/macosx-10.10/bootp-298/bootplib/ |
H A D | nbsp.c | 42 NBSPEntry_print(NBSPEntryRef entry) argument 44 printf("%s: path %s%s\n", entry->name, entry->path, 45 entry->is_readonly ? " [read-only]" : ""); 73 NBSPEntryRef entry = (NBSPEntryRef)dynarray_element(dlist, i); local 74 NBSPEntry_print(entry); 171 NBSPEntryRef entry; local 243 entry = malloc(sizeof(*entry) + sharename_len + sharedir_len + 2); 244 if (entry [all...] |
/macosx-10.10/tcl-105/tk/tk/tests/ttk/ |
H A D | entry.test | 2 # Tile package: entry widget tests 26 test entry-1.1 "Create entry widget" -body { 27 ttk::entry .e 30 test entry-1.2 "Insert" -body { 35 test entry-1.3 "Selection" -body { 40 test entry-1.4 "Delete" -body { 45 test entry-1.5 "Deletion - insert cursor" -body { 52 test entry-1.6 "Deletion - insert cursor at end" -body { 59 test entry [all...] |
/macosx-10.10/cxxfilt-11/cxxfilt/bfd/ |
H A D | hash.c | 36 entry for it, and to traverse a hash table. There is 45 entry, because they were designed for use by the linker back 102 string in the hash table and to create a new entry. 118 If the @var{create} argument is <<TRUE>>, and a new entry is 137 hash table entry (a <<struct bfd_hash_entry *>>) and the 150 which each entry in the hash table. Some also find it 178 You must define a structure for an entry in the hash table, 181 The first field in the structure for an entry in the hash 182 table must be of the type used for an entry in the hash table 202 entry i 558 bfd_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string ATTRIBUTE_UNUSED) argument 649 strtab_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument 743 struct strtab_hash_entry *entry; local 805 struct strtab_hash_entry *entry; local [all...] |
/macosx-10.10/tcl-105/tcl_ext/incrtcl/incrTcl/itk/generic/ |
H A D | itk_option.c | 73 Tcl_HashEntry *entry; 127 entry = Tcl_CreateHashEntry(&optTable->options, switchName, &newEntry); 154 Tcl_SetHashValue(entry, (ClientData)opt); 155 Itk_OptListAdd(&optTable->order, entry); 255 Tcl_HashEntry *entry; 270 entry = Tcl_CreateHashEntry(itkClasses, (char*)cdefn, &newEntry); 276 Tcl_SetHashValue(entry, (ClientData)optTable); 289 optTable = (ItkClassOptTable*)Tcl_GetHashValue(entry); 315 Tcl_HashEntry *entry; 321 entry 72 Tcl_HashEntry *entry; local 251 Tcl_HashEntry *entry; local 310 Tcl_HashEntry *entry; local 350 Tcl_HashEntry *entry; local 471 Tcl_HashEntry *entry; local 564 Tcl_HashEntry *entry, *entry2; local [all...] |
/macosx-10.10/WebCore-7600.1.25/html/parser/ |
H A D | create-html-entity-table | 70 entries.sort(key = lambda entry: entry[ENTITY]) 112 for entry in entries: 113 output_file.write("static const LChar %s[] = \"%s\";\n" % (convert_entity_to_cpp_name(entry[ENTITY]), entry[ENTITY])) 120 for entry in entries: 121 letter = entry[ENTITY][0] 124 values = entry[VALUE].split(' ') 127 convert_entity_to_cpp_name(entry[ENTITY]), 128 len(entry[ENTIT [all...] |
/macosx-10.10/bind9-45.101/bind9/lib/dns/ |
H A D | acache.c | 48 #define DNS_ACACHEENTRY_VALID(entry) ISC_MAGIC_VALID(entry, ACACHEENTRY_MAGIC) 90 #define acache_storetime(entry, t) \ 91 (isc_atomic_store((isc_int32_t *)&(entry)->lastused, (t))) 98 #define acache_storetime(entry, t) ((entry)->lastused = (t)) 147 dns_acacheentry_t *current_entry; /* The bookmark entry to 220 holding this entry */ 223 dns_zone_t *zone; /* zone this entry 225 dns_db_t *db; /* DB this entry belong 298 dns_acacheentry_t *entry, *entry_next; local 409 destroy_entry(dns_acacheentry_t *entry) argument 493 clear_entry(dns_acache_t *acache, dns_acacheentry_t *entry) argument 757 entry_stale(acache_cleaner_t *cleaner, dns_acacheentry_t *entry, isc_stdtime32_t now32, unsigned int interval) argument 801 dns_acacheentry_t *entry, *next = NULL; local 1273 dns_acacheentry_t *entry; local 1433 dns_acache_getentry(dns_acacheentry_t *entry, dns_zone_t **zonep, dns_db_t **dbp, dns_dbversion_t **versionp, dns_dbnode_t **nodep, dns_name_t *fname, dns_message_t *msg, isc_stdtime_t now) argument 1528 dns_acache_setentry(dns_acache_t *acache, dns_acacheentry_t *entry, dns_zone_t *zone, dns_db_t *db, dns_dbversion_t *version, dns_dbnode_t *node, dns_name_t *fname) argument 1653 dns_acache_cancelentry(dns_acacheentry_t *entry) argument 1693 dns_acacheentry_t *entry; local [all...] |
/macosx-10.10/shell_cmds-179/find/ |
H A D | function.c | 264 f_Xmin(PLAN *plan, FTSENT *entry) argument 267 COMPARE((now - entry->fts_statp->st_ctime + 270 COMPARE((now - entry->fts_statp->st_atime + 273 COMPARE((now - entry->fts_statp->st_birthtime + 276 COMPARE((now - entry->fts_statp->st_mtime + 308 f_Xtime(PLAN *plan, FTSENT *entry) argument 313 xtime = entry->fts_statp->st_atime; 315 xtime = entry->fts_statp->st_birthtime; 317 xtime = entry->fts_statp->st_ctime; 319 xtime = entry 378 f_acl(PLAN *plan __unused, FTSENT *entry) argument 395 f_acl(PLAN *plan __unused, FTSENT *entry) argument 453 f_xattr(PLAN *plan __unused, FTSENT *entry) argument 467 f_xattrname(PLAN *plan, FTSENT *entry) argument 487 f_delete(PLAN *plan __unused, FTSENT *entry) argument 560 f_depth(PLAN *plan, FTSENT *entry) argument 606 f_empty(PLAN *plan __unused, FTSENT *entry) argument 657 f_exec(PLAN *plan, FTSENT *entry) argument 845 f_flags(PLAN *plan, FTSENT *entry) argument 909 f_fstype(PLAN *plan, FTSENT *entry) argument 1009 f_group(PLAN *plan, FTSENT *entry) argument 1048 f_inum(PLAN *plan, FTSENT *entry) argument 1097 f_links(PLAN *plan, FTSENT *entry) argument 1122 f_ls(PLAN *plan __unused, FTSENT *entry) argument 1144 f_name(PLAN *plan, FTSENT *entry) argument 1181 f_newer(PLAN *plan, FTSENT *entry) argument 1231 f_nogroup(PLAN *plan __unused, FTSENT *entry) argument 1251 f_nouser(PLAN *plan __unused, FTSENT *entry) argument 1271 f_path(PLAN *plan, FTSENT *entry) argument 1287 f_perm(PLAN *plan, FTSENT *entry) argument 1340 f_print(PLAN *plan __unused, FTSENT *entry) argument 1361 f_print0(PLAN *plan __unused, FTSENT *entry) argument 1376 f_prune(PLAN *plan __unused, FTSENT *entry) argument 1392 f_regex(PLAN *plan, FTSENT *entry) argument 1472 f_size(PLAN *plan, FTSENT *entry) argument 1538 f_type(PLAN *plan, FTSENT *entry) argument 1598 f_user(PLAN *plan, FTSENT *entry) argument 1651 f_expr(PLAN *plan, FTSENT *entry) argument 1698 f_not(PLAN *plan, FTSENT *entry) argument 1717 f_or(PLAN *plan, FTSENT *entry) argument [all...] |
/macosx-10.10/ICU-531.30/icuSources/i18n/ |
H A D | transreg.cpp | 474 // entry object owns it. It should only be deleted when the 535 TransliteratorEntry *entry = find(ID); local 536 return (entry == 0) ? 0 537 : instantiateEntry(ID, entry, aliasReturn, status); 545 TransliteratorEntry *entry = find(ID); local 547 if (entry == 0) { 562 // called reg->reget(), and the entry will already have been fixed up. 563 // We have to detect this so we don't stomp over existing entry 566 if (entry->entryType == TransliteratorEntry::RULES_FORWARD || 567 entry 618 TransliteratorEntry *entry = new TransliteratorEntry(); local 632 TransliteratorEntry *entry = new TransliteratorEntry(); local 647 TransliteratorEntry *entry = new TransliteratorEntry(); local 668 TransliteratorEntry *entry = new TransliteratorEntry(); local 1028 TransliteratorEntry* entry = 0; local 1122 TransliteratorEntry *entry = new TransliteratorEntry(); local 1176 TransliteratorEntry* entry; local 1245 instantiateEntry(const UnicodeString& ID, TransliteratorEntry *entry, TransliteratorAlias* &aliasReturn, UErrorCode& status) argument [all...] |
/macosx-10.10/ruby-106/ruby/lib/rubygems/commands/ |
H A D | query_command.rb | 200 def entry_details entry, detail_tuple, specs, platforms 207 entry << "\n" 209 spec_platforms entry, platforms 210 spec_authors entry, spec 211 spec_homepage entry, spec 212 spec_license entry, spec 213 spec_loaded_from entry, spec, specs 214 spec_summary entry, spec 217 def entry_versions entry, name_tuples, platforms 235 entry << " (#{lis [all...] |
/macosx-10.10/JavaScriptCore-7600.1.17/dfg/ |
H A D | DFGOSREntry.cpp | 87 OSREntryData* entry = jitCode->osrEntryDataForBytecodeIndex(bytecodeIndex); local 89 if (!entry) { 95 ASSERT(entry->m_bytecodeIndex == bytecodeIndex); 97 // The code below checks if it is safe to perform OSR entry. It may find 106 // values, then OSR entry is not possible at this time. It's tempting to 121 for (size_t argument = 0; argument < entry->m_expectedValues.numberOfArguments(); ++argument) { 125 entry->m_expectedValues.argument(argument).dump(WTF::dataFile()); 137 if (!entry->m_expectedValues.argument(argument).validate(value)) { 141 ", expected ", entry->m_expectedValues.argument(argument), ".\n"); 147 for (size_t local = 0; local < entry [all...] |
/macosx-10.10/Heimdal-398.1.2/lib/krb5/ |
H A D | keytab.c | 97 krb5_keytab_entry entry; 111 while((ret = krb5_kt_next_entry(context, keytab, &entry, &cursor)) == 0){ 112 krb5_unparse_name(context, entry.principal, &principal); 115 krb5_kt_free_entry(context, &entry); 352 krb5_keytab_entry entry; local 363 ret = krb5_kt_get_entry (context, keytab, principal, vno, enctype, &entry); 367 ret = krb5_copy_keyblock (context, &entry.keyblock, key); 368 krb5_kt_free_entry(context, &entry); 508 * Match any aliases in keytab `entry' with `principal'. 513 krb5_keytab_entry *entry, 512 compare_aliseses(krb5_context context, krb5_keytab_entry *entry, krb5_error_code (*cmp)(krb5_context, krb5_const_principal, krb5_const_principal), krb5_const_principal principal) argument 543 krb5_kt_compare(krb5_context context, krb5_keytab_entry *entry, krb5_const_principal principal, krb5_kvno vno, krb5_enctype enctype) argument 619 krb5_kt_get_entry(krb5_context context, krb5_keytab id, krb5_const_principal principal, krb5_kvno kvno, krb5_enctype enctype, krb5_keytab_entry *entry) argument 717 krb5_kt_free_entry(krb5_context context, krb5_keytab_entry *entry) argument 768 krb5_kt_next_entry(krb5_context context, krb5_keytab id, krb5_keytab_entry *entry, krb5_kt_cursor *cursor) argument 823 krb5_kt_add_entry(krb5_context context, krb5_keytab id, krb5_keytab_entry *entry) argument 851 krb5_kt_remove_entry(krb5_context context, krb5_keytab id, krb5_keytab_entry *entry) argument 879 krb5_keytab_entry entry; local [all...] |
/macosx-10.10/Security-57031.1.35/Security/libsecurity_apple_x509_tp/lib/ |
H A D | tpOcspCache.cpp | 47 #pragma mark ---- single cache entry ---- 50 * One cache entry, just a parsed OCSPResponse plus an optional URI and a 51 * "latest" nextUpdate time. An entry is stale when its nextUpdate time has 149 * Private routine, remove entry 'n' from cache. 176 /* restart every time we delete a stale entry */ 179 OcspCacheEntry *entry = mEntries[dex]; local 180 if(entry->expireTime() < now) { 181 tpOcspCacheDebug("OcspCache::scanForStale: deleting stale entry %p", 182 entry); 202 OcspCacheEntry *entry local 247 OcspCacheEntry *entry = new OcspCacheEntry(ocspResp, localResponderURI); local [all...] |
/macosx-10.10/apr-32/apr/apr/file_io/os2/ |
H A D | dir.c | 81 &thedir->entry, sizeof(thedir->entry), &entries, FIL_STANDARD); 83 rv = DosFindNext(thedir->handle, &thedir->entry, sizeof(thedir->entry), &entries); 95 finfo->size = thedir->entry.cbFile; 96 finfo->csize = thedir->entry.cbFileAlloc; 99 finfo->filetype = (thedir->entry.attrFile & FILE_DIRECTORY) ? APR_DIR : APR_REG; 101 apr_os2_time_to_apr_time(&finfo->mtime, thedir->entry.fdateLastWrite, 102 thedir->entry.ftimeLastWrite); 103 apr_os2_time_to_apr_time(&finfo->atime, thedir->entry [all...] |
/macosx-10.10/libarchive-30/libarchive/libarchive/ |
H A D | archive_read_support_format_cpio.c | 134 static void record_hardlink(struct cpio *cpio, struct archive_entry *entry); 225 struct archive_entry *entry) 234 r = (cpio->read_header(a, cpio, entry, &namelength, &name_pad)); 245 archive_entry_set_pathname(entry, cpio->entry_name.s); 249 if (archive_entry_filetype(entry) == AE_IFLNK) { 256 archive_entry_set_symlink(entry, cpio->entry_linkname.s); 261 * ACL description for the following entry. Read this body 273 record_hardlink(cpio, entry); 396 struct archive_entry *entry, size_t *namelength, size_t *name_pad) 425 archive_entry_set_devmajor(entry, atol1 224 archive_read_format_cpio_read_header(struct archive_read *a, struct archive_entry *entry) argument 395 header_newc(struct archive_read *a, struct cpio *cpio, struct archive_entry *entry, size_t *namelength, size_t *name_pad) argument 528 header_odc(struct archive_read *a, struct cpio *cpio, struct archive_entry *entry, size_t *namelength, size_t *name_pad) argument 576 header_bin_le(struct archive_read *a, struct cpio *cpio, struct archive_entry *entry, size_t *namelength, size_t *name_pad) argument 612 header_bin_be(struct archive_read *a, struct cpio *cpio, struct archive_entry *entry, size_t *namelength, size_t *name_pad) argument 728 record_hardlink(struct cpio *cpio, struct archive_entry *entry) argument [all...] |
/macosx-10.10/ruby-106/ruby/lib/rubygems/package/ |
H A D | tar_reader.rb | 52 # Iterates over files in the tarball yielding each entry 61 entry = Gem::Package::TarReader::Entry.new header, @io 62 size = entry.header.size 64 yield entry 67 pending = size - entry.bytes_read 84 entry.close 104 # Seeks through the tar file until it finds the +entry+ with +name+ and 108 def seek name # :yields: entry 109 found = find do |entry| 110 entry [all...] |
/macosx-10.10/IOFireWireFamily-456/IOFireWireFamily.kmodproj/ |
H A D | IOLocalConfigDirectory.cpp | 184 IOConfigEntry * entry = OSDynamicCast( IOConfigEntry, fEntries->getObject(i) ); local 185 if( entry == NULL ) 192 if( (entry->fType == kConfigImmediateKeyType) && (entry->fKey == kConfigGenerationKey) ) 194 entry->fValue++; 225 * depends on the entry data, and we can't (legally) overwrite data in an 234 IOConfigEntry *entry = OSDynamicCast(IOConfigEntry, fEntries->getObject(i)); local 237 if(!entry) 243 switch(entry->fType) 246 val = entry 280 IOConfigEntry *entry = OSDynamicCast(IOConfigEntry, fEntries->getObject(i)); local 349 IOConfigEntry *entry = IOConfigEntry::create(key, value); local 385 IOConfigEntry *entry = IOConfigEntry::create(key, kConfigDirectoryKeyType, value); local 465 IOConfigEntry *entry = IOConfigEntry::create(key, value); local 543 IOConfigEntry *entry = OSDynamicCast(IOConfigEntry, fEntries->getObject(i)); local [all...] |
/macosx-10.10/bash-94.1.2/bash-3.2/lib/malloc/ |
H A D | table.c | 34 #define FIND_ALLOC 0x01 /* allocate new entry or find existing */ 35 #define FIND_EXIST 0x02 /* find existing entry */ 111 /* oops. table is full. replace an existing free entry. */ 130 /* wow. entirely full. return mem_overflow dummy entry. */ 148 mr_table_t *entry; local 150 entry = find_entry (mem, FIND_EXIST); 151 if (entry == 0) 155 (entry->flags & MT_ALLOC) ? "allocated" : "free", 156 (entry->flags & MT_ALLOC) ? "allocated" : "freed", 157 entry 250 mr_table_t entry; local [all...] |
/macosx-10.10/pdisk-9/ |
H A D | cmdline.c | 140 partition_map * entry; local 157 entry = find_entry_by_disk_address(j, map); 158 if (!entry) { 162 DPME * p = entry->data; 176 partition_map * entry; local 199 entry = find_entry_by_disk_address(part, map); 201 if (!entry) { 204 else if (strcmp(entry->data->dpme_type, kFreeType) == 0 205 || strcmp(entry->data->dpme_type, kMapType) == 0) { 207 part, entry 244 partition_map * entry; local [all...] |
/macosx-10.10/Heimdal-398.1.2/admin/ |
H A D | add.c | 53 krb5_keytab_entry entry; local 60 memset(&entry, 0, sizeof(entry)); 66 ret = krb5_parse_name(context, opt->principal_string, &entry.principal); 144 data, len, &entry.keyblock); 156 &entry.keyblock); 159 entry.principal, &entry.keyblock); 163 ret = krb5_generate_random_keyblock(context, enctype, &entry.keyblock); 169 entry [all...] |
H A D | purge.c | 108 krb5_keytab_entry entry; local 128 while(krb5_kt_next_entry(context, keytab, &entry, &cursor) == 0) { 129 add_entry (entry.principal, entry.vno, entry.timestamp, &head); 130 krb5_kt_free_entry(context, &entry); 142 while(krb5_kt_next_entry(context, keytab, &entry, &cursor) == 0) { 143 struct e *e = get_entry (entry.principal, head); 146 krb5_warnx (context, "ignoring extra entry"); 150 if (entry [all...] |
/macosx-10.10/Libinfo-459/lookup.subproj/ |
H A D | si_data.c | 48 l->entry = (si_item_t **)reallocf(l->entry, size); 49 if (l->entry != NULL) 51 l->entry[l->count++] = si_item_retain(e); 55 if ((l == NULL) || (l->entry == NULL)) 86 l->entry = (si_item_t **)reallocf(l->entry, size); 87 if (l->entry) 91 item = x->entry[i]; 93 l->entry[ [all...] |
/macosx-10.10/OpenLDAP-499.27/OpenLDAP/tests/progs/ |
H A D | slapd-modrdn.c | 43 char *entry, int maxloop, int maxretries, int delay, 54 "-e <entry> " 75 char *entry = NULL; local 124 case 'e': /* entry to rename */ 125 entry = strdup( optarg ); 158 if (( entry == NULL ) || ( port == -1 && uri == NULL )) 161 if ( *entry == '\0' ) { 163 fprintf( stderr, "%s: invalid EMPTY entry DN.\n", 172 do_modrdn( uri, manager, &passwd, entry, 182 struct berval *passwd, char *entry, in 181 do_modrdn( char *uri, char *manager, struct berval *passwd, char *entry, int maxloop, int maxretries, int delay, int friendly, int chaserefs ) argument [all...] |
/macosx-10.10/llvmCore-3425.0.34/include/llvm/Support/ |
H A D | Registry.h | 18 /// A simple registry entry which provides only a name, description, and 43 typedef SimpleRegistryEntry<T> entry; typedef in class:llvm::RegistryTraits 47 static const char *nameof(const entry &Entry) { return Entry.getName(); } 48 static const char *descof(const entry &Entry) { return Entry.getDesc(); } 59 typedef typename U::entry entry; typedef in class:llvm::Registry 68 static void Announce(const entry &E) { 86 const entry& Val; 89 node(const entry& V) : Next(0), Val(V) { 112 const entry [all...] |