Age | Commit message (Collapse) | Author | |
---|---|---|---|
2017-12-14 | Merge pull request #1653 from tonyrog/makedep_side_effect | Björn Gustavsson | |
Add -MMD option to erlc OTP-14830 | |||
2017-12-08 | Merge pull request #1634 from bjorng/bjorn/get_stacktrace-syntax/OTP-14692 | Björn Gustavsson | |
Add syntax in try/catch to retrieve the stacktrace directly | |||
2017-12-07 | Merge branch 'hasse/stdlib/base64/OTP-14624' | Hans Bolinder | |
* hasse/stdlib/base64/OTP-14624: stdlib: Add base64 benchmarks stdlib: Do not check base64 input more than needed stdlib: Minor optimization of base64 stdlib: Use binary_to_list in base64 when it is faster stdlib: Optimize base64 functions | |||
2017-12-06 | Add -MMD option to erlc | Tony Rogvall | |
The compile option makedep_side_effect, erlc -MMD, instructs the compiler to emit dependencies and continue to compile as normal. | |||
2017-12-04 | Merge pull request #1646 from tsloughter/hibernate_after_spec | Hans Bolinder | |
add hibernate_after to the gen options type spec | |||
2017-11-30 | Add syntax in try/catch to retrieve the stacktrace directly | Björn Gustavsson | |
This commit adds a new syntax for retrieving the stacktrace without calling erlang:get_stacktrace/0. That allow us to deprecate erlang:get_stacktrace/0 and ultimately remove it. The problem with erlang:get_stacktrace/0 is that it can keep huge terms in a process for an indefinite time after an exception. The stacktrace can be huge after a 'function_clause' exception or a failed call to a BIF or operator, because the arguments for the call will be included in the stacktrace. For example: 1> catch abs(lists:seq(1, 1000)). {'EXIT',{badarg,[{erlang,abs, [[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20|...]], []}, {erl_eval,do_apply,6,[{file,"erl_eval.erl"},{line,674}]}, {erl_eval,expr,5,[{file,"erl_eval.erl"},{line,431}]}, {shell,exprs,7,[{file,"shell.erl"},{line,687}]}, {shell,eval_exprs,7,[{file,"shell.erl"},{line,642}]}, {shell,eval_loop,3,[{file,"shell.erl"},{line,627}]}]}} 2> erlang:get_stacktrace(). [{erlang,abs, [[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22, 23,24|...]], []}, {erl_eval,do_apply,6,[{file,"erl_eval.erl"},{line,674}]}, {erl_eval,expr,5,[{file,"erl_eval.erl"},{line,431}]}, {shell,exprs,7,[{file,"shell.erl"},{line,687}]}, {shell,eval_exprs,7,[{file,"shell.erl"},{line,642}]}, {shell,eval_loop,3,[{file,"shell.erl"},{line,627}]}] 3> We can extend the syntax for clauses in try/catch to optionally bind the stacktrace to a variable. Here is an example using the current syntax: try Expr catch C:E -> Stk = erlang:get_stacktrace(), . . . In the new syntax, it would look like: try Expr catch C:E:Stk -> . . . Only a variable (not a pattern) is allowed in the stacktrace position, to discourage matching of the stacktrace. (Matching would also be expensive, because the raw format of the stacktrace would have to be converted to the cooked form before matching.) Note that: try Expr catch E -> . . . is a shorthand for: try Expr catch throw:E -> . . . If the stacktrace is to be retrieved for a throw, the 'throw:' prefix must be explicitly included: try Expr catch throw:E:Stk -> . . . | |||
2017-11-30 | erl_parse: Use a new pat_expr rule for pattern expressions | Björn Gustavsson | |
In the grammar file for the Erlang language, patterns are parsed as expressions. erl_lint will then weed out expressions that are not legal patterns. The rule sharing causes problems if we were to introduce new syntax, for example a pattern followed by a ':'. There would be a shift/reduce conflict, and a pattern followed by a ':' would be parsed as a remote call. Introduce a new pat_expr rule to express exactly the subset of expressions that is allowed in pattern. Note: For the moment, we must allow full expressions in case clauses to keep 'merl' working. | |||
2017-11-30 | Merge branch 'maint' | Dan Gudmundsson | |
* maint: Avoid falling measurements testcases on slow machines stdlib: string optimize special case for ASCII stdlib: Minor unicode_util opts | |||
2017-11-29 | stdlib: string optimize special case for ASCII | Dan Gudmundsson | |
Avoid unicode_util module call for ASCII strings | |||
2017-11-28 | add hibernate_after to the gen options type spec | Tristan Sloughter | |
2017-11-28 | stdlib: Do not check base64 input more than needed | Hans Bolinder | |
Often the decode functions return a function_clause error, but not always, and the errors have not been consistent between modifications of the base64 module. Now the errors are returned as they happen--no attempt to make them look nice is done. The alternative, to ensure that, for example, {badarg, Culprit} is always returned upon bad input, was deemed pointless. | |||
2017-11-28 | stdlib: Minor optimization of base64 | Hans Bolinder | |
Using /bits instead of /binary is faster when constructing binaries. | |||
2017-11-28 | stdlib: Use binary_to_list in base64 when it is faster | Hans Bolinder | |
It is sometimes faster to use binary_to_list on input, at least when not considering time for garbage collections. The three functions all return a list, and the temporary list created by binary_to_list should be reclaimed very fast. The implementation from before is thus kept. | |||
2017-11-28 | stdlib: Optimize base64 functions | Hans Bolinder | |
A few test cases with zeroes are added. They were not handled correctly before. The access of DECODE_MAP is moved into the inlined function b64d, for symmetry. The function b64e is also inlined. The speed-up is small, but measurable. Note: encode(List), decode(List) and mime_decode(List) no longer call list_to_binary. This can break code that calls the functions with I/O-lists as input. | |||
2017-11-20 | Merge pull request #1631 from peterdmv/stdlib/extend_uri_string/OTP-14747 | Péter Dimitrov | |
Extend uri_string module (compose_query and dissect_query) | |||
2017-11-20 | Merge branch 'lukas/stdlib/maps_iterators/OTP-14012' | Lukas Larsson | |
* lukas/stdlib/maps_iterators/OTP-14012: erts: Limit size of first iterator for hashmaps Update primary bootstrap Update preloaded modules erts: Remove erts_internal:maps_to_list/2 stdlib: Make io_lib and io_lib_pretty use maps iterator erts: Implement batching maps:iterator erts: Implement maps path iterator erts: Implement map iterator using a stack stdlib: Introduce maps iterator API Conflicts: bootstrap/lib/stdlib/ebin/io_lib.beam bootstrap/lib/stdlib/ebin/io_lib_pretty.beam erts/emulator/beam/bif.tab erts/preloaded/ebin/erlang.beam erts/preloaded/ebin/erts_internal.beam erts/preloaded/ebin/zlib.beam | |||
2017-11-20 | stdlib: Make io_lib and io_lib_pretty use maps iterator | Lukas Larsson | |
2017-11-20 | erts: Implement batching maps:iterator | Lukas Larsson | |
This iterator implementation fetches multiple elements to iterate over in one call to erts_internal:maps_next instead of one at a time. This means that the memory usage will go up for the iterator as we are buffering elements, but the usage is still bounded. In this implementation the max memory usage is 1000 words. Using this approach makes the iterator as fast as using maps:to_list, so maps:iterator/2 has been removed. | |||
2017-11-15 | Merge pull request #1602 from sirihansen/siri/supervisor/store-children-in-map | Siri Hansen | |
Refactor supervisor, and store children in a map instead of a list OTP-14586 | |||
2017-11-09 | stdlib: Implement compose and dissect query (HTML5) | Péter Dimitrov | |
Implement functions for handling form-urlencoded query strings based on the HTML5 specification. | |||
2017-11-09 | [supervisor] Store children in map instead of list | Siri Hansen | |
2017-11-09 | [supervisor] Change Name to Id | Siri Hansen | |
2017-11-09 | [supervisor] Use map instead of dict for dynamic children | Siri Hansen | |
2017-11-09 | [supervisor] Refactor to improve maintainability | Siri Hansen | |
2017-11-09 | [supervisor] Add macros to use in guards | Siri Hansen | |
2017-11-09 | [supervisor] Refactor handling of dynamic children | Siri Hansen | |
2017-11-06 | stdlib: Remove compose_query and dissect_query | Péter Dimitrov | |
compose_query/{1,2} and dissect_query/1 removed as the implemented specification (HTML 2.0) is old. They will be re-implemented based on HTML5. | |||
2017-11-03 | stdlib: Refactor functions in uri_string | Péter Dimitrov | |
2017-11-01 | stdlib: Add uri_string module to stdlib.app.src | Péter Dimitrov | |
2017-10-31 | stdlib: Fix case normalization (normalize/1) | Péter Dimitrov | |
2017-10-31 | stdlib: Refactor helper functions in uri_string | Péter Dimitrov | |
2017-10-27 | stdlib: Implement normalize/1 | Péter Dimitrov | |
Implements the following Syntax-Based Normalizations: - Case Normalization - Percent-Encoding Normalization - Path Segment Normalization - Scheme-Based Normalization - HTTP(S) - Basic support for FTP, SSH, SFTP, TFTP | |||
2017-10-27 | stdlib: Allow undefined port in uri_map() | Péter Dimitrov | |
uri_map() updated to allow 'undefined' ports in order to align the implementation with RFC 3986: port = *DIGIT An 'undefined' port is mapped to a ":" during recompose operation. | |||
2017-10-26 | stdlib: Update documentation, error tuples | Péter Dimitrov | |
2017-10-25 | stdlib: Refactor dissect_query | Péter Dimitrov | |
2017-10-25 | stdlib: Refactor compose_query | Péter Dimitrov | |
2017-10-24 | stdlib: Refactor parsed binary calculation | Péter Dimitrov | |
2017-10-24 | stdlib: Update supported separators (query string) | Péter Dimitrov | |
Update list of supported separators: - escaped_amp (default): "&" - amp: "&" - semicolon: ";" | |||
2017-10-23 | stdlib: Update documentation (uri_string) | Péter Dimitrov | |
2017-10-23 | stdlib: Improve error handling | Péter Dimitrov | |
2017-10-23 | stdlib: Implement compose_query and dissect_query | Péter Dimitrov | |
2017-10-23 | stdlib: Improve support of mixed lists (transcode) | Péter Dimitrov | |
- transcode/2 flattens input lists in order to be able to handle lists with percent-encoded parts that are split into muliple list and binary segments. - Add additional tests for transcoding mixed lists. | |||
2017-10-23 | stdlib: Change handling of queries ["?" query] | Péter Dimitrov | |
Previously when parsing queries the first "?" was part of the parsed query in the result Map. This behavior has been changed to follow the patterns used with other URI components and to not include the special character(s) that mark the start of a specific component. | |||
2017-10-23 | stdlib: Implement transcode/2. | Péter Dimitrov | |
2017-10-23 | stdlib: Add property tests, bugfixes | Péter Dimitrov | |
- Add property tests using PropEr. - Add new testcases to uri_string_SUITE. - Improve calculation of parsed binary. - Verify if input to parse() is UTF8 encoded. - Update is_valid_map(): added check for path and host. | |||
2017-10-23 | stdlib: Improve calculation of parsed binary | Péter Dimitrov | |
- Improved calculation of parsed binary. - Added tests for special corner cases. - Fixed dialyzer warnings. | |||
2017-10-23 | stdlib: Implement recompose | Péter Dimitrov | |
- Implemented recompose function with percent-encoding and validation of IPv4/IPv6 addresses. - Added test for recompose that uses a generated test vector (URI combinations based on a fix set of URI components). - Added test for parse-recompose using a generated test vector. - Removed parsing functions for lists. Lists are converted to binary before parsing. | |||
2017-10-23 | stdlib: Add support to parse percent-encoded URIs | Péter Dimitrov | |
2017-10-23 | stdlib: Add support for parsing IPv4 and IPv6 | Péter Dimitrov | |
2017-10-23 | stdlib: Implement uri_string:parse | Péter Dimitrov | |