Both are fine. For modern code with no global state, especially the multithreaded kind, everything is better than the errno.h mess.
Both are fine. For modern code with no global state, especially the multithreaded kind, everything is better than the errno.h mess.
In fact there's a Charter describing it better than I can:
Now, how do those error-related proposals violate it? Such as:
http://www.open-std.org/jtc1/sc22/wg14/www/docs/n2289.pdf
It seems to be very delicate about being backwards-compatible.
errno.h isn't so much builtin to C. It's just part of the standard libary, and more so of POSIX. It's only used for interfacing with the OS. And it's not that bad, since errno is a thread local variable.
Yes, errors are just data. And everything is data, including the code itself, right? It a question of abstractions introduced to the language and the program at question.
errno.h is bad. It's inconvenient, it's global, even if it's a thread-local something, it's cumbersome to use.
AFAIK, there are 2 error-related proposals for inclusion. One is making errors special, the other is a bit more generic. Both would improve on the current situation.
> It a question of abstractions introduced to the language and the program at question.
I don't think these kind of abstractions are in the spirit of C. As it says in the Charter linked here, "provide only one way to do an operation".
A more acceptable way to me would be allowing multiple return values in general. But maybe there are technical reasons why this is not done. Or it has to do with the complexities that such a mechanism would add to the expression syntax.
Unfortunately the discussion around N2289 is more about providing something a lot like exceptions for both C and C++ but without all the exception problems.
The proposal really has some ugly corners related to how one actually handles the errors. You can read the discussion here:
https://www.reddit.com/r/cpp/comments/9owiju/exceptions_may_...
This could certainly be made more general, or just done via tagged unions (the way multiple return values can be done via structs), but there are massive advantages to be had by building it into the language and calling convention.
The implementation can be far more efficient than any of a) the standard `int f(ret *out)` idiom, b) using errno, or c) some sort of `struct my_tagged_union f()` (which nobody uses anyway because it's a huge pain syntactically). In addition to being cheaper, the proposed built-in version of (c) is also syntactically simple enough to become a standard, shared mechanism.
Really, really hard to believe. Not only since returning unions is already legal (isn't it)? What function do you have in mind where an explit error-return-pointer argument is not close to maximally efficient?
The second problem is that existing calling conventions for `struct { bool tag; union { .. }; }` put everything in memory anyway, using a hidden pointer argument. Further, there's no way to put this type in the standard library because C doesn't have generics.
The new implementation can put that single-bit tag in the CPU's carry flag where it has dedicated branch instructions and doesn't interfere with other values. It can leave the actual return value in a register without any kind of union aggregate lowering.
So far this is all just calling convention tweaks, and could be done by pattern-matching user-defined tagged unions, but building it into the language a) makes it possible to standardize its semantics and connect it to platforms' C ABIs so other languages can also participate and b) makes it far simpler to implement and use so it's actually likely to be adopted.
The same reasoning applies to putting effort into register allocators, or switching from setjmp/longjmp to table-based unwinding, etc.
You need to make sure that you keep the size and complexity of the language and its specification within reasonable limits. So you can't just add "all of them" with a blanket statement that they will add up.
I do like how Go does the posix interface where errors are handled as multiple return statements and cleanups using defer.
You cannot take sizeof a function, and you can't copy functions around, for instance. The address of a function is a value ("data"), but not the function itself.
Conditional compilation is just a compatibility workaround to them.
But that only strengthens the point: language features are just abstractions we use to reason about data. One can always strip all the abstractions and end up working with raw bits.
If there's a useful way to think about certain kinds of data - it might be useful to codify that way as a language feature. Such as specialised error handling.
(let ((counter 0))
(lambda () (incf counter))
When we evaluate this we get a function. It contains the captured lexical environment. If we call that function, the captured counter variable mutates.Now suppose we had a copy-function library function. I would expect it that if we apply it to this function, we get an object which carries a duplicate of the lexical environment. This means it has its own instance of counter. If we call the original function, the copied function's counter stays the same and vice versa.
I don't remember seeing such a copy-function in any Lisp dialect; there isn't one in ANSI CL. It seems it might be useful, same as the ability to copy a structure or OOP object.
I mean, security trumps convenience and uptime, right guys? Y'all do build your functions with domain and range in mind, right guys?
Not in a heart-lung machine, no.
It is not used for reporting. Rather, various functions in C and POSIX return an indication that some exceptional situation has occurred. Then errno holds a value which classifies the cause of that situation. It doesn't report the error.
(In the case of portable ISO C, we can't even depend on that; we must set errno to zero before calling most library functions. If that function fails, then if errno is nonzero, it has a value pertaining to that function.)
Some newer functions in POSIX return the errno value, like pthread_mutex_lock. That makes sense when the return value has no other purpose like "bytes processed" or whatever. The errno values are positive, so they combine poorly with in-band signaling.
Anyway, optimizing is possible based on the return value: like putting the expected success case into the hot code path or whatever.
Optimizing errno is so easy that many compilers by default do not even update errno for many math functions because it hopelessly destroy any chance of vectorizing and aggressive optimizations.
if (library_function(arg).result < 0) ..
we have lost the errno. For the complete analysis, we must now do: struct error;
error = library_function(arg);
// test error.result; if bad, work with error.num
Yes we have had struct returns (proper, on-stack ones) for more than 30 years, which means we could have had API's like this for 30 years.I agree that errno for math functions isn't such a great fit. It's much better suited for I/O and resource management.
match library_function(arg) {
Ok(num) => // success
Err(errno) => // failure
}
But since C doesn't have proper sum types, we have to approximate this pattern with things like errno or returned structs. struct error res = library_function(arg);
if (res.result)
{
// use res.errno
...
}
Also remember the whole thread is about improving the syntax for this sort of stuff. C could take (another) page from C++: auto [result, errno] = library_function(arg);
if (result == -1)
{
// use errno ...
}It's just a macro for a function like:
#define errno (*__get_errno_location())
This is equivalent to having getter-setter functions, like in Microsoft's Win32 API, which has GetLastError and SetLastError.