/macosx-10.10/Security-57031.1.35/Security/include/security_keychain/ |
H A D | SecInternal.h | 48 const void *keys[maxValues]; \ 53 keys[numValues] = (KEY); \ 60 #define DICT_CREATE(ALLOCATOR) CFDictionaryCreate((ALLOCATOR), keys, values, \
|
H A D | SecInternalP.h | 45 const void *keys[maxValues]; \ 50 keys[numValues] = (KEY); \ 57 #define DICT_CREATE(ALLOCATOR) CFDictionaryCreate((ALLOCATOR), keys, values, \
|
/macosx-10.10/Security-57031.1.35/Security/libsecurity_keychain/Security/ |
H A D | SecInternal.h | 48 const void *keys[maxValues]; \ 53 keys[numValues] = (KEY); \ 60 #define DICT_CREATE(ALLOCATOR) CFDictionaryCreate((ALLOCATOR), keys, values, \
|
H A D | SecInternalP.h | 45 const void *keys[maxValues]; \ 50 keys[numValues] = (KEY); \ 57 #define DICT_CREATE(ALLOCATOR) CFDictionaryCreate((ALLOCATOR), keys, values, \
|
/macosx-10.10/Security-57031.1.35/Security/libsecurity_keychain/lib/ |
H A D | SecInternal.h | 48 const void *keys[maxValues]; \ 53 keys[numValues] = (KEY); \ 60 #define DICT_CREATE(ALLOCATOR) CFDictionaryCreate((ALLOCATOR), keys, values, \
|
H A D | SecInternalP.h | 45 const void *keys[maxValues]; \ 50 keys[numValues] = (KEY); \ 57 #define DICT_CREATE(ALLOCATOR) CFDictionaryCreate((ALLOCATOR), keys, values, \
|
/macosx-10.10/Security-57031.1.35/Security/sec/Security/Regressions/secitem/ |
H A D | si-00-find-nothing.c | 20 const void *keys[] = { 26 CFDictionaryRef query = CFDictionaryCreate(NULL, keys, values, 27 array_size(keys), NULL, NULL);
|
/macosx-10.10/Security-57031.1.35/Security/sec/Security/ |
H A D | SecInternal.h | 42 const void *keys[maxValues]; \ 47 keys[numValues] = (KEY); \ 54 #define DICT_CREATE(ALLOCATOR) CFDictionaryCreate((ALLOCATOR), keys, values, \
|
/macosx-10.10/ruby-106/ruby/ext/tk/lib/tk/ |
H A D | scrollbox.rb | 11 def initialize_composite(keys=nil) 36 configure keys if keys
|
H A D | root.rb | 17 def Root.new(keys=nil, &b) 24 keys = _symbolkey2str(keys) 29 value = keys.delete(key.to_s) 34 if keys # wm commands ( for backward comaptibility ) 35 keys.each{|k,v|
|
/macosx-10.10/configd-699.1.5/configd.tproj/ |
H A D | _notifyremove.c | 41 removeKey(CFMutableArrayRef keys, CFStringRef key) argument 46 if (keys == NULL) { 51 n = CFArrayGetCount(keys); 52 i = CFArrayGetFirstIndexOfValue(keys, CFRangeMake(0, n), key); 59 CFArrayRemoveValueAtIndex(keys, i); 96 sc_status = removeKey(storePrivate->keys, key);
|
H A D | _configget.c | 165 CFArrayRef keys; local 171 sc_status = __SCDynamicStoreCopyKeyList(myContextRef->store, pattern, TRUE, &keys); 173 CFArrayApplyFunction(keys, 174 CFRangeMake(0, CFArrayGetCount(keys)), 177 CFRelease(keys); 185 __SCDynamicStoreCopyMultiple(SCDynamicStoreRef store, CFArrayRef keys, CFArrayRef patterns, CFDictionaryRef *values) argument 192 CFSTR("copy m : %5d : %ld keys, %ld patterns\n"), 194 keys ? CFArrayGetCount(keys) : 0, 204 if (keys) { 237 CFArrayRef keys = NULL; /* keys (un-serialized) */ local [all...] |
/macosx-10.10/WebKit2-7600.1.25/Shared/mac/ |
H A D | WebMemorySampler.mac.mm | 144 webKitMemoryStats.keys.append(String("Timestamp")); 146 webKitMemoryStats.keys.append(String("Total Bytes of Memory In Use")); 148 webKitMemoryStats.keys.append(String("Fast Malloc Zone Bytes")); 150 webKitMemoryStats.keys.append(String("Default Malloc Zone Bytes")); 152 webKitMemoryStats.keys.append(String("Dispatch Continuation Malloc Zone Bytes")); 154 webKitMemoryStats.keys.append(String("Purgeable Malloc Zone Bytes")); 156 webKitMemoryStats.keys.append(String("JavaScript Heap Bytes")); 158 webKitMemoryStats.keys.append(String("Total Bytes of Committed Memory")); 160 webKitMemoryStats.keys.append(String("Fast Malloc Zone Bytes")); 162 webKitMemoryStats.keys [all...] |
/macosx-10.10/bind9-45.101/bind9/bin/tests/system/dlvauto/ns1/ |
H A D | sign.sh | 40 # Create bind.keys file for the use of the resolving server 41 echo "managed-keys {" > bind.keys 48 ' >> bind.keys 55 ' >> bind.keys 56 echo "};" >> bind.keys
|
/macosx-10.10/postfix-255/postfix/mantools/ |
H A D | specmiss | 24 for $name (sort keys %found) {
|
/macosx-10.10/postfix-255/postfix/src/tls/ |
H A D | tls_scache.c | 114 /* Is null when requesting the current encryption keys. Otherwise, 181 static TLS_TICKET_KEY *keys[2]; variable 351 * XXX Berkeley DB supports huge database keys and values. SDBM seems to 544 * The keys array contains 2 elements, the current signing key and the 554 for (i = 0; i < 2 && keys[i]; ++i) { 555 if (memcmp(keyname, keys[i]->name, TLS_TICKET_NAMELEN) == 0) { 556 if (timecmp(keys[i]->tout + timeout, now) > 0) 557 return (keys[i]); 561 } else if (keys[0]) { 562 if (timecmp(keys[ [all...] |
/macosx-10.10/ruby-106/ruby/ext/ripper/lib/ripper/ |
H A D | core.rb | 22 PARSER_EVENTS = PARSER_EVENT_TABLE.keys 25 SCANNER_EVENTS = SCANNER_EVENT_TABLE.keys
|
/macosx-10.10/ruby-106/ruby/ext/tk/lib/tkextlib/bwidget/ |
H A D | dragsite.rb | 24 def self.register(path, keys={}) 25 tk_call('DragSite::register', path, *hash_kv(keys))
|
H A D | dropsite.rb | 24 def self.register(path, keys={}) 25 tk_call('DropSite::register', path, *hash_kv(keys))
|
H A D | panedwindow.rb | 27 def add(keys={}) 28 window(tk_send('add', *hash_kv(keys)))
|
/macosx-10.10/ruby-106/ruby/ext/tk/lib/tkextlib/tile/ |
H A D | tnotebook.rb | 100 def add(child, keys=nil) 101 if keys && keys != None 102 tk_send('add', _epath(child), *hash_kv(keys)) 122 def insert(idx, subwin, keys=nil) 123 if keys && keys != None 124 tk_send('insert', idx, subwin, *hash_kv(keys))
|
/macosx-10.10/ruby-106/ruby/sample/ |
H A D | occur2.rb | 11 for word in freq.keys.sort
|
/macosx-10.10/ruby-106/ruby/test/ |
H A D | profile_test_all.rb | 28 (GC.stat.keys + 38 $test_all_profile_out.puts "name\tmemsize_of_alls\t" + GC.stat.keys.join("\t")
|
/macosx-10.10/ruby-106/ruby/test/dbm/ |
H A D | test_dbm.rb | 249 keys = %w(foo bar baz) 251 @dbm[keys[0]], @dbm[keys[1]], @dbm[keys[2]] = values 252 assert_equal(values.reverse, @dbm.values_at(*keys.reverse)) 256 keys = %w(foo bar baz) 258 @dbm[keys[0]], @dbm[keys[1]], @dbm[keys[2]] = values 292 keys [all...] |
/macosx-10.10/ruby-106/ruby/test/sdbm/ |
H A D | test_sdbm.rb | 210 keys = %w(foo bar baz) 212 @sdbm[keys[0]], @sdbm[keys[1]], @sdbm[keys[2]] = values 213 assert_equal(values.reverse, @sdbm.values_at(*keys.reverse)) 217 keys = %w(foo bar baz) 219 @sdbm[keys[0]], @sdbm[keys[1]], @sdbm[keys[2]] = values 253 keys [all...] |