Home
last modified time | relevance | path

Searched refs:key (Results 1 – 25 of 236) sorted by relevance

12345678910

/trafficserver/tools/
H A Dslow_log_report.pl26 my ($stats, $key, $value) = @_;
28 $stats->{$key}->{total} = 0 if (!defined $stats->{$key}->{total});
29 $stats->{$key}->{count} = 0 if (!defined $stats->{$key}->{count});
33 $stats->{$key}->{count}++ if $value >= 0;
43 foreach my $key (
51 my $count = $stats->{$key}->{count};
52 my $total = $stats->{$key}->{total};
53 if (!defined $stats->{$key}->{values}) {
83 foreach my $key (keys %data) {
84 next if (!defined $data{$key});
[all …]
H A Dtraffic_cacheable.pl200 foreach my $key (sort keys %response_codes) {
201 … printf("\t%s: %d (%.2f%%)\n", $key, $response_codes{$key}, $response_codes{$key} / $count * 100);
206 …printf("\t%s: %d (%.2f%%)\n", $pretty_name{$key}, $histogram{$key}, $histogram{$key} / $count * 10…
211 …intf("\t%s: %d (%.2f%%)\n", $pretty_name{$key}, $histogram_with_heuristic{$key}, $histogram_with_h…
216 foreach my $key (sort keys %cache_control_exists) {
217 …printf("\t\t%s: %d (%.2f%%)\n", $key, $cache_control_exists{$key}, $cache_control_exists{$key} / $…
221 foreach my $key (sort keys %expires_exists) {
222 …printf("\t\t%s: %d (%.2f%%)\n", $key, $expires_exists{$key}, $expires_exists{$key} / $count * 100)…
227 …printf("\t\t%s: %d (%.2f%%)\n", $key, $last_modified_exists{$key}, $last_modified_exists{$key} / $…
231 foreach my $key (sort keys %pragma_exists) {
[all …]
/trafficserver/lib/yamlcpp/src/
H A Dsimplekey.cpp63 if (key.pIndent) { in InsertPotentialSimpleKey()
65 key.pMapStart = key.pIndent->pStartToken; in InsertPotentialSimpleKey()
72 key.pKey = &m_tokens.back(); in InsertPotentialSimpleKey()
75 m_simpleKeys.push(key); in InsertPotentialSimpleKey()
85 SimpleKey& key = m_simpleKeys.top(); in InvalidateSimpleKey() local
86 if (key.flowLevel != GetFlowLevel()) in InvalidateSimpleKey()
89 key.Invalidate(); in InvalidateSimpleKey()
101 SimpleKey key = m_simpleKeys.top(); in VerifySimpleKey() local
112 if (INPUT.line() != key.mark.line || INPUT.pos() - key.mark.pos > 1024) in VerifySimpleKey()
117 key.Validate(); in VerifySimpleKey()
[all …]
H A Dnode_data.cpp199 throw BadSubscript(key); in insert()
202 insert_map_pair(key, value); in insert()
212 if (it->first->is(key)) in get()
229 throw BadSubscript(key); in get()
233 if (it->first->is(key)) in get()
238 insert_map_pair(key, value); in get()
249 if (it->first->is(key)) in remove()
255 if (it->first->is(key)) { in remove()
275 m_map.emplace_back(&key, &value); in insert_map_pair()
307 node& key = pMemory->create_node(); in convert_sequence_to_map() local
[all …]
/trafficserver/plugins/experimental/mysql_remap/lib/
H A Ddictionary.c127 len = strlen(key); in dictionary_hash()
196 free(d->key); in dictionary_del()
230 if (!strcmp(key, d->key[i])) { in dictionary_get()
283 if (!strcmp(key, d->key[i])) { /* Same key */ in dictionary_set()
300 d->key = (char **)mem_double(d->key, d->size * sizeof(char *)); in dictionary_set()
318 d->key[i] = xstrdup(key); in dictionary_set()
342 if (key == NULL) { in dictionary_unset()
354 if (!strcmp(key, d->key[i])) { in dictionary_unset()
365 free(d->key[i]); in dictionary_unset()
366 d->key[i] = NULL; in dictionary_unset()
[all …]
H A Diniparser.c161 if (d->key[i] == NULL) { in iniparser_getnsec()
196 if (d->key[i] == NULL) { in iniparser_getsecname()
209 return d->key[i]; in iniparser_getsecname()
234 if (d->key[i] == NULL) { in iniparser_dump()
274 if (d->key[i] == NULL) { in iniparser_dump_ini()
324 lc_key = strlwc(key); in iniparser_getstring()
538 strcpy(key, strstrip(key)); in iniparser_line()
539 strcpy(key, strlwc(key)); in iniparser_line()
556 strcpy(key, strstrip(key)); in iniparser_line()
557 strcpy(key, strlwc(key)); in iniparser_line()
[all …]
/trafficserver/lib/yamlcpp/include/yaml-cpp/node/detail/
H A Dimpl.h30 return key < sequence.size() ? sequence[key] : nullptr; in get()
35 if (key > sequence.size() || (key > 0 && !sequence[key - 1]->is_defined())) in get()
37 if (key == sequence.size()) in get()
39 return sequence[key]; in get()
70 if (key >= sequence.size()) { in remove()
105 inline node* node_data::get(const Key& key, in get() argument
118 throw BadSubscript(key); in get()
122 if (it->first->equals(key, pMemory)) { in get()
146 throw BadSubscript(key); in get()
150 if (it->first->equals(key, pMemory)) { in get()
[all …]
H A Dnode_ref.h58 m_pData->insert(key, value, pMemory); in insert()
67 node& get(const Key& key, shared_memory_holder pMemory) { in get() argument
68 return m_pData->get(key, pMemory); in get()
72 return m_pData->remove(key, pMemory); in remove()
75 node* get(node& key, shared_memory_holder pMemory) const { in get() argument
78 node& get(node& key, shared_memory_holder pMemory) { in get() argument
79 return m_pData->get(key, pMemory); in get()
81 bool remove(node& key, shared_memory_holder pMemory) { in remove() argument
82 return m_pData->remove(key, pMemory); in remove()
87 void force_insert(const Key& key, const Value& value, in force_insert() argument
[all …]
H A Dnode.h114 m_pRef->insert(key, value, pMemory); in insert()
115 key.add_dependency(*this); in insert()
129 node& value = m_pRef->get(key, pMemory); in get()
135 return m_pRef->remove(key, pMemory); in remove()
144 node& get(node& key, shared_memory_holder pMemory) { in get() argument
145 node& value = m_pRef->get(key, pMemory); in get()
146 key.add_dependency(*this); in get()
150 bool remove(node& key, shared_memory_holder pMemory) { in remove() argument
151 return m_pRef->remove(key, pMemory); in remove()
156 void force_insert(const Key& key, const Value& value, in force_insert() argument
[all …]
/trafficserver/contrib/python/
H A Dcompare_records_config.py53 for key in sorted(tuple(set(old) | set(new))):
54 if key not in old:
55 old[key] = "missing"
56 if key not in new:
57 new[key] = "missing"
59 for key in sorted(old):
60 if old[key].startswith('@') and old[key].endswith('@'):
63 if old[key] != new[key]:
64 print("%s %s -> %s" % (key, old[key], new[key]))
H A Dcompare_RecordsConfigcc.py80 for key in rc_in:
81 if key in ignore_keys:
83 if key not in rc_cc:
84 print("%s missing -> %s" % (key, "%s %s" % rc_in[key]))
86 if rc_cc[key] != rc_in[key]:
87 print("%s : %s -> %s" % (key, "%s %s" % rc_cc[key], "%s %s" % rc_in[key]))
/trafficserver/iocore/cache/
H A DRamCacheLRU.cc27 CryptoHash key; member
94 new_bucket[e->key.slice32(3) % anbuckets].push(e); in resize_hashtable()
127 uint32_t i = key->slice32(3) % nbuckets; in get()
130 if (e->key == *key && e->auxkey1 == auxkey1 && e->auxkey2 == auxkey2) { in get()
149 uint32_t b = e->key.slice32(3) % nbuckets; in remove()
168 uint32_t i = key->slice32(3) % nbuckets; in put()
170 uint16_t k = key->slice32(3) >> 16; in put()
180 if (e->key == *key) { in put()
193 e->key = *key; in put()
224 uint32_t i = key->slice32(3) % nbuckets; in fixup()
[all …]
H A DCacheRead.cc50 c->first_key = c->key = c->earliest_key = *key; in open_read()
113 c->first_key = c->key = c->earliest_key = *key; in open_read()
582 if (doc->key == key) { in openReadReadDone()
637 next_CacheKey(&key, &key); in openReadReadDone()
694 next_CacheKey(&key, &key); in openReadMain()
698 prev_CacheKey(&key, &key); in openReadMain()
865 if (!(doc->key == key)) { // collision in openReadStartEarliest()
871 next_CacheKey(&key, &doc->key); in openReadStartEarliest()
1129 if (key == doc->key) { // is this my data? in openReadStartHead()
1134 next_CacheKey(&key, &doc->key); in openReadStartHead()
[all …]
H A DCacheDir.cc779 if (b->evac_frags.key == *key) { in dir_lookaside_probe()
804 b->evac_frags.key = *key; in dir_lookaside_insert()
821 if (b->evac_frags.key == *key) { in dir_lookaside_fixup()
834 DDebug("dir_lookaside", "fixup %X %X failed", key->slice32(0), key->slice32(1)); in dir_lookaside_fixup()
868 if (b->evac_frags.key == *key) { in dir_lookaside_remove()
877 DDebug("dir_lookaside", "remove %X %X failed", key->slice32(0), key->slice32(1)); in dir_lookaside_remove()
1442 CacheKey key; in EXCLUSIVE_REGRESSION_TEST() local
1485 dir_insert(&key, d, &dir); in EXCLUSIVE_REGRESSION_TEST()
1511 dir_insert(&key, d, &dir); in EXCLUSIVE_REGRESSION_TEST()
1526 dir_insert(&key, d, &dir); in EXCLUSIVE_REGRESSION_TEST()
[all …]
H A DCacheTest.cc220 CacheKey k = key; in fill_buffer()
247 CacheKey k = key; in check_buffer()
310 lookup_test.key = write_test.key; in EXCLUSIVE_REGRESSION_TEST()
316 read_test.key = write_test.key; in EXCLUSIVE_REGRESSION_TEST()
320 remove_test.key = write_test.key; in EXCLUSIVE_REGRESSION_TEST()
324 lookup_fail_test.key = write_test.key; in EXCLUSIVE_REGRESSION_TEST()
328 read_fail_test.key = write_test.key; in EXCLUSIVE_REGRESSION_TEST()
364 replace_test.key = replace_write_test.key; in EXCLUSIVE_REGRESSION_TEST()
381 replace_read_test.key = replace_test.key; in EXCLUSIVE_REGRESSION_TEST()
398 pread_test.key = large_write_test.key; in EXCLUSIVE_REGRESSION_TEST()
[all …]
H A DRamCacheCLFUS.cc52 CryptoHash key; member
249 if (e->key == *key && e->auxkey1 == auxkey1 && e->auxkey2 == auxkey2) { in get()
362 uint32_t b = e->key.slice32(3) % this->_nbuckets; in _tick()
406 uint32_t b = e->key.slice32(3) % this->_nbuckets; in _destroy()
461 CryptoHash key = e->key; in compress_entries() local
508 if (ee->key == key && ee->data == edata) { in compress_entries()
589 if (e->key == *key) { in put()
641 uint16_t k = key->slice32(3) >> 16; in put()
707 e->key = *key; in put()
741 e->key = *key; in put()
[all …]
/trafficserver/include/tscore/
H A DMT_hashtable.h39 key_t key; member
104 return (int)(((key >> MT_HASHTABLE_PARTITION_BITS) ^ key) % a_bucket_num); in bucket_id()
108 bucket_id(key_t key) in bucket_id() argument
215 while (cur != NULL && cur->key != key) { in insert_entry()
230 newEntry->key = key; in insert_entry()
252 while (cur != NULL && cur->key != key) { in remove_entry()
277 while (cur != NULL && cur->key != key) { in lookup_entry()
369 part_num(key_t key) in part_num() argument
377 return hashTables[part_num(key)]->insert_entry(key, data); in insert_entry()
383 return hashTables[part_num(key)]->remove_entry(key); in remove_entry()
[all …]
H A DTrie.h43 T *Search(const char *key, int key_len = -1) const;
97 void _CheckArgs(const char *key, int &key_len) const;
112 Trie<T>::_CheckArgs(const char *key, int &key_len) const in _CheckArgs() argument
114 if (!key) { in _CheckArgs()
117 key_len = strlen(key); in _CheckArgs()
125 _CheckArgs(key, key_len); in Insert()
141 next_node = curr_node->GetChild(key[i]); in Insert()
144 Debug("Trie::Insert", "Creating child node for char %c (%d)", key[i], key[i]); in Insert()
145 curr_node = curr_node->AllocateChild(key[i]); in Insert()
171 _CheckArgs(key, key_len); in Search()
[all …]
/trafficserver/iocore/hostdb/
H A DP_RefCountCache.h63 uint64_t key; member
67 : key(key), size(size), expiry_time(expiry_time) in RefCountCacheItemMeta()
134 hash_of(key_type key) in hash_of()
136 return key; in hash_of()
141 return v->meta.key; in key_of()
158 Ptr<C> get(uint64_t key);
217 this->erase(key); in put()
404 Ptr<C> get(uint64_t key);
406 void erase(uint64_t key);
487 return this->partitions[this->partition_for_key(key)]->get(key); in get()
[all …]
/trafficserver/plugins/experimental/cookie_remap/
H A Dcookiejar.cc76 char *key; in parse() local
84 for (key = strsep(&cp, sepstr); key != nullptr; key = strsep(&cp, sepstr)) { in parse()
85 char *val = strchr(key, '='); in parse()
125 if (val_check && verify_name(key) != 0) { in parse()
130 addElement(key, addme); in parse()
132 addSubElement(key, addme); in parse()
141 CookieJar::addElement(const char *key, const char *val) in addElement() argument
146 m_jar.insert(std::make_pair(key, cval)); in addElement()
150 CookieJar::addSubElement(const char *key, const char *val) in addSubElement() argument
153 m_currentVal->m_subelements.insert(std::make_pair(key, val)); in addSubElement()
/trafficserver/proxy/logging/
H A DLogFieldAliasMap.h89 …virtual int asInt(char *key, IntType *val, bool case_sensitive = false) const = 0;
90 …virtual int asString(IntType key, char *buf, size_t bufLen, size_t *numChars = nullptr) const = 0;
133 asInt(char *key, IntType *val, bool case_sensitive) const override in asInt() argument
141 found = (strcmp(key, m_table[i].name) == 0); in asInt()
143 found = (strcasecmp(key, m_table[i].name) == 0); in asInt()
159 asString(IntType key, char *buf, size_t bufLen, size_t *numCharsPtr = nullptr) const override in asString() argument
164 size_t i = key - m_min; in asString()
165 if (m_entries && key >= m_min && key <= m_max && m_table[i].valid) { in asString()
168 ink_strlcpy(buf, m_table[key - m_min].name, bufLen); in asString()
/trafficserver/plugins/experimental/uri_signing/
H A Dparse.c59 const char *key, *key_end; in get_jws_from_uri() local
74 key = param; in get_jws_from_uri()
85 …if ((size_t)(key_end - key) == termination_ct && !strncmp(paramName, key, (size_t)(key_end - key))… in get_jws_from_uri()
90 PluginDebug("Decoding JWS: %.*s", (int)(key_end - key), key); in get_jws_from_uri()
94 …PluginDebug("Unable to read JWS: %.*s, %s", (int)(key_end - key), key, err.message ? err.message :… in get_jws_from_uri()
96 PluginDebug("Parsed JWS: %.*s (%16p)", (int)(key_end - key), key, jws); in get_jws_from_uri()
100 *strip_ct = ((key - uri) + (end - value_end)); in get_jws_from_uri()
108 memcpy(strip_uri, uri, (key - uri)); in get_jws_from_uri()
109 memcpy(strip_uri + (key - uri), value_end + 1, (end - value_end + 1)); in get_jws_from_uri()
112 memcpy(strip_uri, uri, (key - uri - 1)); in get_jws_from_uri()
[all …]
/trafficserver/lib/yamlcpp/include/yaml-cpp/
H A Dexceptions.h106 stream << KEY_NOT_FOUND << ": " << key; in KEY_NOT_FOUND_WITH_KEY()
114 stream << KEY_NOT_FOUND << ": " << key; in KEY_NOT_FOUND_WITH_KEY()
126 stream << BAD_SUBSCRIPT << " (key: \"" << key << "\")"; in BAD_SUBSCRIPT_WITH_KEY()
134 stream << BAD_SUBSCRIPT << " (key: \"" << key << "\")"; in BAD_SUBSCRIPT_WITH_KEY()
140 if (key.empty()) { in INVALID_NODE_WITH_KEY()
212 : KeyNotFound(mark_, key_), key(key_) {} in TypedKeyNotFound()
215 T key; member in YAML::TypedKeyNotFound
220 const T& key) { in MakeTypedKeyNotFound() argument
221 return TypedKeyNotFound<T>(mark, key); in MakeTypedKeyNotFound()
226 InvalidNode(std::string key) in InvalidNode() argument
[all …]
/trafficserver/plugins/lua/
H A Dts_lua_context.c54 const char *key; in ts_lua_context_get() local
57 key = luaL_checklstring(L, 2, &key_len); in ts_lua_context_get()
59 if (key && key_len) { in ts_lua_context_get()
63 lua_pushlstring(L, key, key_len); in ts_lua_context_get()
75 const char *key; in ts_lua_context_set() local
78 key = luaL_checklstring(L, 2, &key_len); in ts_lua_context_set()
83 lua_pushlstring(L, key, key_len); // push key -2 in ts_lua_context_set()
/trafficserver/src/tscpp/api/
H A DHeaders.cc571 Headers::erase(const std::string &key) in erase() argument
573 return erase(key.c_str(), key.length()); in erase()
595 if ((*it).name() == key) { in count()
605 return count(key.c_str(), key.length()); in count()
625 return values(key, join.c_str()); in values()
635 Headers::find(const std::string &key) in find() argument
637 return find(key.c_str(), key.length()); in find()
657 … TSMimeHdrFieldNameSet(state_->hdr_buf_, state_->hdr_loc_, field_loc, key.c_str(), key.length()); in append()
669 erase(key); in set()
670 return append(key, value); in set()
[all …]

Completed in 118 milliseconds

12345678910