Mon, 12 Aug 2019 18:30:40 +0300
8223147: JFR Backport
8199712: Flight Recorder
8203346: JFR: Inconsistent signature of jfr_add_string_constant
8195817: JFR.stop should require name of recording
8195818: JFR.start should increase autogenerated name by one
8195819: Remove recording=x from jcmd JFR.check output
8203921: JFR thread sampling is missing fixes from JDK-8194552
8203929: Limit amount of data for JFR.dump
8203664: JFR start failure after AppCDS archive created with JFR StartFlightRecording
8003209: JFR events for network utilization
8207392: [PPC64] Implement JFR profiling
8202835: jfr/event/os/TestSystemProcess.java fails on missing events
Summary: Backport JFR from JDK11. Initial integration
Reviewed-by: neugens
duke@435 | 1 | /* |
kvn@3882 | 2 | * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | // FORMS.CPP - Definitions for ADL Parser Generic & Utility Forms Classes |
duke@435 | 26 | #include "adlc.hpp" |
duke@435 | 27 | |
duke@435 | 28 | //------------------------------Static Initializers---------------------------- |
duke@435 | 29 | // allocate arena used by forms |
duke@435 | 30 | Arena *Form::arena = Form::generate_arena(); // = Form::generate_arena(); |
duke@435 | 31 | Arena *Form::generate_arena() { |
duke@435 | 32 | return (new Arena); |
duke@435 | 33 | } |
duke@435 | 34 | |
duke@435 | 35 | //------------------------------NameList--------------------------------------- |
duke@435 | 36 | // reserved user-defined string |
duke@435 | 37 | const char *NameList::_signal = "$$SIGNAL$$"; |
never@850 | 38 | const char *NameList::_signal2 = "$$SIGNAL2$$"; |
never@850 | 39 | const char *NameList::_signal3 = "$$SIGNAL3$$"; |
duke@435 | 40 | |
duke@435 | 41 | // Constructor and Destructor |
duke@435 | 42 | NameList::NameList() : _cur(0), _max(4), _iter(0), _justReset(true) { |
duke@435 | 43 | _names = (const char**)malloc(_max*sizeof(char*)); |
duke@435 | 44 | } |
duke@435 | 45 | NameList::~NameList() { |
duke@435 | 46 | // The following free is a double-free, and crashes the program: |
duke@435 | 47 | //free(_names); // not owner of strings |
duke@435 | 48 | } |
duke@435 | 49 | |
duke@435 | 50 | void NameList::addName(const char *name) { |
duke@435 | 51 | if (_cur == _max) _names =(const char**)realloc(_names,(_max *=2)*sizeof(char*)); |
duke@435 | 52 | _names[_cur++] = name; |
duke@435 | 53 | } |
duke@435 | 54 | |
duke@435 | 55 | void NameList::add_signal() { |
duke@435 | 56 | addName( _signal ); |
duke@435 | 57 | } |
duke@435 | 58 | void NameList::clear() { |
duke@435 | 59 | _cur = 0; |
duke@435 | 60 | _iter = 0; |
duke@435 | 61 | _justReset = true; |
duke@435 | 62 | // _max = 4; Already allocated |
duke@435 | 63 | } |
duke@435 | 64 | |
duke@435 | 65 | int NameList::count() const { return _cur; } |
duke@435 | 66 | |
duke@435 | 67 | void NameList::reset() { _iter = 0; _justReset = true;} |
duke@435 | 68 | const char *NameList::iter() { |
duke@435 | 69 | if (_justReset) {_justReset=false; return (_iter < _cur ? _names[_iter] : NULL);} |
duke@435 | 70 | else return (_iter <_cur-1 ? _names[++_iter] : NULL); |
duke@435 | 71 | } |
duke@435 | 72 | const char *NameList::current() { return (_iter < _cur ? _names[_iter] : NULL); } |
twisti@1059 | 73 | const char *NameList::peek(int skip) { return (_iter + skip < _cur ? _names[_iter + skip] : NULL); } |
duke@435 | 74 | |
duke@435 | 75 | // Return 'true' if current entry is signal |
duke@435 | 76 | bool NameList::current_is_signal() { |
duke@435 | 77 | const char *entry = current(); |
duke@435 | 78 | return is_signal(entry); |
duke@435 | 79 | } |
duke@435 | 80 | |
duke@435 | 81 | // Return true if entry is a signal |
duke@435 | 82 | bool NameList::is_signal(const char *entry) { |
duke@435 | 83 | return ( (strcmp(entry,NameList::_signal) == 0) ? true : false); |
duke@435 | 84 | } |
duke@435 | 85 | |
duke@435 | 86 | // Search for a name in the list |
duke@435 | 87 | bool NameList::search(const char *name) { |
duke@435 | 88 | const char *entry; |
duke@435 | 89 | for(reset(); (entry = iter()) != NULL; ) { |
duke@435 | 90 | if(!strcmp(entry,name)) return true; |
duke@435 | 91 | } |
duke@435 | 92 | return false; |
duke@435 | 93 | } |
duke@435 | 94 | |
duke@435 | 95 | // Return index of name in list |
duke@435 | 96 | int NameList::index(const char *name) { |
duke@435 | 97 | int cnt = 0; |
duke@435 | 98 | const char *entry; |
duke@435 | 99 | for(reset(); (entry = iter()) != NULL; ) { |
duke@435 | 100 | if(!strcmp(entry,name)) return cnt; |
duke@435 | 101 | cnt++; |
duke@435 | 102 | } |
duke@435 | 103 | return Not_in_list; |
duke@435 | 104 | } |
duke@435 | 105 | |
duke@435 | 106 | // Return name at index in list |
duke@435 | 107 | const char *NameList::name(intptr_t index) { |
duke@435 | 108 | return ( index < _cur ? _names[index] : NULL); |
duke@435 | 109 | } |
duke@435 | 110 | |
duke@435 | 111 | void NameList::dump() { output(stderr); } |
duke@435 | 112 | |
duke@435 | 113 | void NameList::output(FILE *fp) { |
duke@435 | 114 | fprintf(fp, "\n"); |
duke@435 | 115 | |
duke@435 | 116 | // Run iteration over all entries, independent of position of iterator. |
duke@435 | 117 | const char *name = NULL; |
duke@435 | 118 | int iter = 0; |
duke@435 | 119 | bool justReset = true; |
duke@435 | 120 | |
duke@435 | 121 | while( ( name = (justReset ? |
duke@435 | 122 | (justReset=false, (iter < _cur ? _names[iter] : NULL)) : |
duke@435 | 123 | (iter < _cur-1 ? _names[++iter] : NULL)) ) |
duke@435 | 124 | != NULL ) { |
duke@435 | 125 | fprintf( fp, " %s,\n", name); |
duke@435 | 126 | } |
duke@435 | 127 | fprintf(fp, "\n"); |
duke@435 | 128 | } |
duke@435 | 129 | |
duke@435 | 130 | //------------------------------NameAndList------------------------------------ |
duke@435 | 131 | // Storage for a name and an associated list of names |
duke@435 | 132 | NameAndList::NameAndList(char *name) : _name(name) { |
duke@435 | 133 | } |
duke@435 | 134 | NameAndList::~NameAndList() { |
duke@435 | 135 | } |
duke@435 | 136 | |
duke@435 | 137 | // Add to entries in list |
duke@435 | 138 | void NameAndList::add_entry(const char *entry) { |
duke@435 | 139 | _list.addName(entry); |
duke@435 | 140 | } |
duke@435 | 141 | |
duke@435 | 142 | // Access the name and its associated list. |
duke@435 | 143 | const char *NameAndList::name() const { return _name; } |
duke@435 | 144 | void NameAndList::reset() { _list.reset(); } |
duke@435 | 145 | const char *NameAndList::iter() { return _list.iter(); } |
duke@435 | 146 | |
duke@435 | 147 | // Return the "index" entry in the list, zero-based |
duke@435 | 148 | const char *NameAndList::operator[](int index) { |
duke@435 | 149 | assert( index >= 0, "Internal Error(): index less than 0."); |
duke@435 | 150 | |
duke@435 | 151 | _list.reset(); |
duke@435 | 152 | const char *entry = _list.iter(); |
duke@435 | 153 | // Iterate further if it isn't at index 0. |
duke@435 | 154 | for ( int position = 0; position != index; ++position ) { |
duke@435 | 155 | entry = _list.iter(); |
duke@435 | 156 | } |
duke@435 | 157 | |
duke@435 | 158 | return entry; |
duke@435 | 159 | } |
duke@435 | 160 | |
duke@435 | 161 | |
duke@435 | 162 | void NameAndList::dump() { output(stderr); } |
duke@435 | 163 | void NameAndList::output(FILE *fp) { |
duke@435 | 164 | fprintf(fp, "\n"); |
duke@435 | 165 | |
duke@435 | 166 | // Output the Name |
duke@435 | 167 | fprintf(fp, "Name == %s", (_name ? _name : "") ); |
duke@435 | 168 | |
duke@435 | 169 | // Output the associated list of names |
duke@435 | 170 | const char *name; |
duke@435 | 171 | fprintf(fp, " ("); |
duke@435 | 172 | for (reset(); (name = iter()) != NULL;) { |
duke@435 | 173 | fprintf(fp, " %s,\n", name); |
duke@435 | 174 | } |
duke@435 | 175 | fprintf(fp, ")"); |
duke@435 | 176 | fprintf(fp, "\n"); |
duke@435 | 177 | } |
duke@435 | 178 | |
duke@435 | 179 | //------------------------------Form------------------------------------------- |
duke@435 | 180 | OpClassForm *Form::is_opclass() const { |
duke@435 | 181 | return NULL; |
duke@435 | 182 | } |
duke@435 | 183 | |
duke@435 | 184 | OperandForm *Form::is_operand() const { |
duke@435 | 185 | return NULL; |
duke@435 | 186 | } |
duke@435 | 187 | |
duke@435 | 188 | InstructForm *Form::is_instruction() const { |
duke@435 | 189 | return NULL; |
duke@435 | 190 | } |
duke@435 | 191 | |
duke@435 | 192 | MachNodeForm *Form::is_machnode() const { |
duke@435 | 193 | return NULL; |
duke@435 | 194 | } |
duke@435 | 195 | |
duke@435 | 196 | AttributeForm *Form::is_attribute() const { |
duke@435 | 197 | return NULL; |
duke@435 | 198 | } |
duke@435 | 199 | |
duke@435 | 200 | Effect *Form::is_effect() const { |
duke@435 | 201 | return NULL; |
duke@435 | 202 | } |
duke@435 | 203 | |
duke@435 | 204 | ResourceForm *Form::is_resource() const { |
duke@435 | 205 | return NULL; |
duke@435 | 206 | } |
duke@435 | 207 | |
duke@435 | 208 | PipeClassForm *Form::is_pipeclass() const { |
duke@435 | 209 | return NULL; |
duke@435 | 210 | } |
duke@435 | 211 | |
duke@435 | 212 | Form::DataType Form::ideal_to_const_type(const char *name) const { |
duke@435 | 213 | if( name == NULL ) { return Form::none; } |
duke@435 | 214 | |
duke@435 | 215 | if (strcmp(name,"ConI")==0) return Form::idealI; |
duke@435 | 216 | if (strcmp(name,"ConP")==0) return Form::idealP; |
coleenp@548 | 217 | if (strcmp(name,"ConN")==0) return Form::idealN; |
roland@4159 | 218 | if (strcmp(name,"ConNKlass")==0) return Form::idealNKlass; |
duke@435 | 219 | if (strcmp(name,"ConL")==0) return Form::idealL; |
duke@435 | 220 | if (strcmp(name,"ConF")==0) return Form::idealF; |
duke@435 | 221 | if (strcmp(name,"ConD")==0) return Form::idealD; |
duke@435 | 222 | if (strcmp(name,"Bool")==0) return Form::idealI; |
duke@435 | 223 | |
duke@435 | 224 | return Form::none; |
duke@435 | 225 | } |
duke@435 | 226 | |
duke@435 | 227 | Form::DataType Form::ideal_to_sReg_type(const char *name) const { |
duke@435 | 228 | if( name == NULL ) { return Form::none; } |
duke@435 | 229 | |
duke@435 | 230 | if (strcmp(name,"sRegI")==0) return Form::idealI; |
duke@435 | 231 | if (strcmp(name,"sRegP")==0) return Form::idealP; |
duke@435 | 232 | if (strcmp(name,"sRegF")==0) return Form::idealF; |
duke@435 | 233 | if (strcmp(name,"sRegD")==0) return Form::idealD; |
duke@435 | 234 | if (strcmp(name,"sRegL")==0) return Form::idealL; |
duke@435 | 235 | return Form::none; |
duke@435 | 236 | } |
duke@435 | 237 | |
duke@435 | 238 | Form::DataType Form::ideal_to_Reg_type(const char *name) const { |
duke@435 | 239 | if( name == NULL ) { return Form::none; } |
duke@435 | 240 | |
duke@435 | 241 | if (strcmp(name,"RegI")==0) return Form::idealI; |
duke@435 | 242 | if (strcmp(name,"RegP")==0) return Form::idealP; |
duke@435 | 243 | if (strcmp(name,"RegF")==0) return Form::idealF; |
duke@435 | 244 | if (strcmp(name,"RegD")==0) return Form::idealD; |
duke@435 | 245 | if (strcmp(name,"RegL")==0) return Form::idealL; |
duke@435 | 246 | |
duke@435 | 247 | return Form::none; |
duke@435 | 248 | } |
duke@435 | 249 | |
duke@435 | 250 | // True if 'opType', an ideal name, loads or stores. |
duke@435 | 251 | Form::DataType Form::is_load_from_memory(const char *opType) const { |
duke@435 | 252 | if( strcmp(opType,"LoadB")==0 ) return Form::idealB; |
twisti@1059 | 253 | if( strcmp(opType,"LoadUB")==0 ) return Form::idealB; |
twisti@993 | 254 | if( strcmp(opType,"LoadUS")==0 ) return Form::idealC; |
duke@435 | 255 | if( strcmp(opType,"LoadD")==0 ) return Form::idealD; |
duke@435 | 256 | if( strcmp(opType,"LoadD_unaligned")==0 ) return Form::idealD; |
duke@435 | 257 | if( strcmp(opType,"LoadF")==0 ) return Form::idealF; |
duke@435 | 258 | if( strcmp(opType,"LoadI")==0 ) return Form::idealI; |
duke@435 | 259 | if( strcmp(opType,"LoadKlass")==0 ) return Form::idealP; |
roland@4159 | 260 | if( strcmp(opType,"LoadNKlass")==0 ) return Form::idealNKlass; |
duke@435 | 261 | if( strcmp(opType,"LoadL")==0 ) return Form::idealL; |
duke@435 | 262 | if( strcmp(opType,"LoadL_unaligned")==0 ) return Form::idealL; |
duke@435 | 263 | if( strcmp(opType,"LoadPLocked")==0 ) return Form::idealP; |
duke@435 | 264 | if( strcmp(opType,"LoadP")==0 ) return Form::idealP; |
coleenp@548 | 265 | if( strcmp(opType,"LoadN")==0 ) return Form::idealN; |
duke@435 | 266 | if( strcmp(opType,"LoadRange")==0 ) return Form::idealI; |
duke@435 | 267 | if( strcmp(opType,"LoadS")==0 ) return Form::idealS; |
kvn@3882 | 268 | if( strcmp(opType,"LoadVector")==0 ) return Form::idealV; |
duke@435 | 269 | assert( strcmp(opType,"Load") != 0, "Must type Loads" ); |
duke@435 | 270 | return Form::none; |
duke@435 | 271 | } |
duke@435 | 272 | |
duke@435 | 273 | Form::DataType Form::is_store_to_memory(const char *opType) const { |
duke@435 | 274 | if( strcmp(opType,"StoreB")==0) return Form::idealB; |
kvn@3882 | 275 | if( strcmp(opType,"StoreCM")==0) return Form::idealB; |
duke@435 | 276 | if( strcmp(opType,"StoreC")==0) return Form::idealC; |
duke@435 | 277 | if( strcmp(opType,"StoreD")==0) return Form::idealD; |
duke@435 | 278 | if( strcmp(opType,"StoreF")==0) return Form::idealF; |
duke@435 | 279 | if( strcmp(opType,"StoreI")==0) return Form::idealI; |
duke@435 | 280 | if( strcmp(opType,"StoreL")==0) return Form::idealL; |
duke@435 | 281 | if( strcmp(opType,"StoreP")==0) return Form::idealP; |
kvn@3882 | 282 | if( strcmp(opType,"StoreN")==0) return Form::idealN; |
roland@4159 | 283 | if( strcmp(opType,"StoreNKlass")==0) return Form::idealNKlass; |
kvn@3882 | 284 | if( strcmp(opType,"StoreVector")==0 ) return Form::idealV; |
duke@435 | 285 | assert( strcmp(opType,"Store") != 0, "Must type Stores" ); |
duke@435 | 286 | return Form::none; |
duke@435 | 287 | } |
duke@435 | 288 | |
duke@435 | 289 | Form::InterfaceType Form::interface_type(FormDict &globals) const { |
duke@435 | 290 | return Form::no_interface; |
duke@435 | 291 | } |
duke@435 | 292 | |
duke@435 | 293 | //------------------------------FormList--------------------------------------- |
duke@435 | 294 | // Destructor |
duke@435 | 295 | FormList::~FormList() { |
duke@435 | 296 | // // This list may not own its elements |
duke@435 | 297 | // Form *cur = _root; |
duke@435 | 298 | // Form *next = NULL; |
duke@435 | 299 | // for( ; (cur = next) != NULL; ) { |
duke@435 | 300 | // next = (Form *)cur->_next; |
duke@435 | 301 | // delete cur; |
duke@435 | 302 | // } |
duke@435 | 303 | }; |
duke@435 | 304 | |
duke@435 | 305 | //------------------------------FormDict--------------------------------------- |
duke@435 | 306 | // Constructor |
duke@435 | 307 | FormDict::FormDict( CmpKey cmp, Hash hash, Arena *arena ) |
duke@435 | 308 | : _form(cmp, hash, arena) { |
duke@435 | 309 | } |
duke@435 | 310 | FormDict::~FormDict() { |
duke@435 | 311 | } |
duke@435 | 312 | |
duke@435 | 313 | // Return # of name-Form pairs in dict |
duke@435 | 314 | int FormDict::Size(void) const { |
duke@435 | 315 | return _form.Size(); |
duke@435 | 316 | } |
duke@435 | 317 | |
duke@435 | 318 | // Insert inserts the given key-value pair into the dictionary. The prior |
duke@435 | 319 | // value of the key is returned; NULL if the key was not previously defined. |
duke@435 | 320 | const Form *FormDict::Insert(const char *name, Form *form) { |
duke@435 | 321 | return (Form*)_form.Insert((void*)name, (void*)form); |
duke@435 | 322 | } |
duke@435 | 323 | |
duke@435 | 324 | // Finds the value of a given key; or NULL if not found. |
duke@435 | 325 | // The dictionary is NOT changed. |
duke@435 | 326 | const Form *FormDict::operator [](const char *name) const { |
duke@435 | 327 | return (Form*)_form[name]; |
duke@435 | 328 | } |
duke@435 | 329 | |
duke@435 | 330 | //------------------------------FormDict::private------------------------------ |
duke@435 | 331 | // Disable public use of constructor, copy-ctor, operator =, operator == |
duke@435 | 332 | FormDict::FormDict( ) : _form(cmpkey,hashkey) { |
duke@435 | 333 | assert( false, "NotImplemented"); |
duke@435 | 334 | } |
duke@435 | 335 | FormDict::FormDict( const FormDict & fd) : _form(fd._form) { |
duke@435 | 336 | } |
duke@435 | 337 | FormDict &FormDict::operator =( const FormDict &rhs) { |
duke@435 | 338 | assert( false, "NotImplemented"); |
duke@435 | 339 | _form = rhs._form; |
duke@435 | 340 | return *this; |
duke@435 | 341 | } |
duke@435 | 342 | // == compares two dictionaries; they must have the same keys (their keys |
duke@435 | 343 | // must match using CmpKey) and they must have the same values (pointer |
duke@435 | 344 | // comparison). If so 1 is returned, if not 0 is returned. |
duke@435 | 345 | bool FormDict::operator ==(const FormDict &d) const { |
duke@435 | 346 | assert( false, "NotImplemented"); |
duke@435 | 347 | return false; |
duke@435 | 348 | } |
duke@435 | 349 | |
duke@435 | 350 | // Print out the dictionary contents as key-value pairs |
twisti@1038 | 351 | static void dumpkey (const void* key) { fprintf(stdout, "%s", (char*) key); } |
duke@435 | 352 | static void dumpform(const void* form) { fflush(stdout); ((Form*)form)->dump(); } |
duke@435 | 353 | |
duke@435 | 354 | void FormDict::dump() { |
duke@435 | 355 | _form.print(dumpkey, dumpform); |
duke@435 | 356 | } |
duke@435 | 357 | |
duke@435 | 358 | //------------------------------SourceForm------------------------------------- |
duke@435 | 359 | SourceForm::SourceForm(char* code) : _code(code) { }; // Constructor |
duke@435 | 360 | SourceForm::~SourceForm() { |
duke@435 | 361 | } |
duke@435 | 362 | |
duke@435 | 363 | void SourceForm::dump() { // Debug printer |
duke@435 | 364 | output(stderr); |
duke@435 | 365 | } |
duke@435 | 366 | |
duke@435 | 367 | void SourceForm::output(FILE *fp) { |
duke@435 | 368 | fprintf(fp,"\n//%s\n%s\n",classname(),(_code?_code:"")); |
duke@435 | 369 | } |