MarketInvoice - Take control of your cash flowGet StartedName Company Name Email Raise funds in 24 hours byselling your unpaid invoices online.Scaramouche & Fandango, male grooming brand, had their invoice paid in 20 hours instead of 90 days.
We have funded
of invoices so farThe
is buying invoices through MarketInvoice as part of the British Business Bank initiative.5 star ratingWhat is MarketInvoice?MarketInvoice helps businesses unlock funds in 24 hoursby selling their invoices online.&Our peer-to-peer lending platform taps into a network of investors who buy the invoices, and advance you cash quickly & affordably.Who can use MarketInvoice?You can use us if you’re a UK or Ireland-based business, that sells products or services to other businesses, and gets paid on terms. We love helping businesses succeed, which is why we approve around 90% of applications.How much does it cost?Our fees are transparent so you’ll always know how much you pay upfront. No setup fees, no hidden costs. Typically you'll pay between 1-3% of the face value of your invoice, and the fees come down as your company grows.&Gavin Williams,Founder of Fishrod Interactive,a MarketInvoice client"If everybody used MarketInvoice, everybody would get paid faster and life would be a lot easier!"Fishrod Interactive, based in London, has been developing useable web applications since 2008. Cost Example Do you use accounting software?MarketInvoice seamlessly integrates with leading accounting software like , , and
to help you get started in minutes. If you can't get the cash, you can't grow.The 9 hottest UK fintech startups most likely to be worth $1&billion next.The government is planning ?100m in funding for alternative lenders, including new internet finance firms.Fast-growing ventures fuel growth at MarketInvoice.Alternative business finance provider has launched in Manchester.Have Questions?We're here to helpTake your career to the next levelWe're hiring developers, marketers, sales people, data analysts, smart graduates, and much more. Come join the MarketInvoice team!This website uses cookies to improve user experience. By using our website you consent to all cookies in accordance with our Cookie Policy.c - Invalid pointer becoming valid again - Stack Overflow
to customize your list.
Stack Overflow is a community of 4.7 million programmers, just like you, helping each other.
J it only takes a minute:
Join the Stack Overflow community to:
Ask programming questions
Answer and help your peers
Get recognized for your expertise
int x = 0;
// p is no longer valid
int x = 0;
if (&x == p) {
// Is this valid?
Accessing a pointer after the thing it points to has been freed is undefined behavior, but what happens if some later allocation happens in the same area, and you explicitly compare the old pointer to a pointer to the new thing? Would it have mattered if I cast &x and p to uintptr_t before comparing them?
(I know it's not guaranteed that the two x variables occupy the same spot. I have no reason to do this, but I can imagine, say, an algorithm where you intersect a set of pointers that might have been freed with a set of definitely valid pointers, removing the invalid pointers in the process. If a previously-invalidated pointer is equal to a known good pointer, I'm curious what would happen.)
62.8k54186
By my understanding of the standard (6.2.4. (2))
The value of a pointer becomes indeterminate when the object it points to (or just past) reaches the end of its lifetime.
you have undefined behaviour when you compare
if (&x == p) {
as that meets these points listed in Annex J.2:
— The value of a pointer to an object whose lifetime has ended is used (6.2.4).
— The value of an object with automatic storage duration is used while it is indeterminate (6.2.4, 6.7.9, 6.8).
134k12211345
Okay, this seems to be interpreted as a two- make that three part question by some people.
First, there were concerns if using the poitner for a comparison is defined at all.
As is pointed out in the comments, the mere use of the pointer is UB, since $J.2: says use of pointer to object whose lifetime has ended is UB.
However, if that obstacle is passed (wich is well in the range of UB, it can work after all and will on many platforms), here is what I found about the other concerns:
Given the pointers do compare equal, the code is valid:
C Standard, §6.5.3.2,4:
[...] If an invalid value has been assigned to the pointer, the behavior of the unary * operator is undefined.
Although a footnote at that location explicitly says. that the address of an object after the end of its lifetime is an invalid pointer value, this does not apply here, since the if makes sure the pointer's value is the address of x and thus is valid.
C++ Standard, §3.9.2,3:
If an object of type T is located at an address A, a pointer of type cv T* whose value is the address A is said to point to that object, regardless of how the value was obtained. [ Note: For instance, the address one past the end of an array (5.7) would be considered to point to an unrelated object of the array’s element type that might be located at that address.
Emphasis is mine.
It will probably work with most of the compilers but it still is undefined behavior. For the C language these x are two different objects, one has ended its lifetime, so you have UB.
More seriously, some compilers may decide to fool you in a different way than you expect.
The C standard says
Two pointers compare equal if and only if both are null pointers, both
are pointers to the same object (including a pointer to an object and
a subobject at its beginning) or function, both are pointers to one
past the last element of the same array object, or one is a pointer to
one past the end of one array object and the other is a pointer to the
start of a different array object that happens to immediately follow
the first array object in the address space.
Note in particular the phrase "both are pointers to the same object". In the sense of the standard the two "x"s are not the same object. They may happen to be realized in the same memory location, but this is to the discretion of the compiler. Since they are clearly two distinct objects, declared in different scopes the comparison should in fact never be true. So an optimizer might well cut away that branch completely.
Another aspect that has not yet been discussed of all that is that the validity of this depends on the "lifetime" of the objects and not the scope. If you'd add a possible jump into that scope
int x = 0;
if (something) goto BLURB;
the lifetime would extend as long as the scope of the first x is reachable. Then everything is valid behavior, but still your test would always be false, and optimized out by a decent compiler.
From all that you see that you better leave it at argument for UB, and don't play such games in real code.
52.5k249112
It would work, if by work you use a very liberal definition, roughly equivalent to that it would not crash.
However, it is a bad idea. I cannot imagine a single reason why it is easier to cross your fingers and hope that the two local variables are stored in the same memory address than it is to write p=&x again. If this is just an academic question, then yes it's valid C - but whether the if statement is true or not is not guaranteed to be consistent across platforms or even different programs.
Edit: To be clear, the undefined behavior is whether &x == p in the second block. The value of p will not change, it's still a pointer to that address, that address just doesn't belong to you anymore. Now the compiler might (probably will) put the second x at that same address (assuming there isn't any other intervening code). If that happens to be true, it's perfectly legal to dereference p just as you would &x, as long as it's type is a pointer to an int or something smaller. Just like it's legal to say p = 0x; if (p == &x) {*p =}.
8,64222045
The behaviour is undefined. However, your question reminds me of another case where a somewhat similar concept was being employed. In the case alluded, there were these threads which would get different amounts of cpu times because of their priorities. So, thread 1 would get a little more time because thread 2 was waiting for I/O or something. Once its job was done, thread 1 would write values to the memory for the thread two to consume. This is not "sharing" the memory in a controlled way. It would write to the calling stack itself. Where variables in thread 2 would be allocated memory. Now, when thread 2 eventually got round to execution,all its declared variables would never have to be assigned values because the locations they were occupying had valid values. I don't know what they did if something went wrong in the process but this is one of the most hellish optimizations in C code I have ever witnessed.
2,89831421
Winner #2 in this
is rather similar to your code:
#include &stdio.h&
#include &stdlib.h&
int main() {
int *p = (int*)malloc(sizeof(int));
int *q = (int*)realloc(p, sizeof(int));
if (p == q)
printf("%d %d\n", *p, *q);
According to the post:
Using a recent version of Clang (r160635 for x86-64 on Linux):
$ clang -O realloc. ./a.out
This can only be explained if the Clang developers consider that this example, and yours, exhibit undefined behavior.
56.6k588181
Put aside the fact if it is valid (and I'm convinced now that it's not, see Arne Mertz's answer) I still think that it's academic.
The algorithm you are thinking of would not produce very useful results, as you could only compare two pointers, but you have no chance to determine if these pointers point to the same kind of object or to something completely different. A pointer to a struct could now be the address of a single char for example.
Your Answer
Sign up or
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Post as a guest
By posting your answer, you agree to the
Not the answer you're looking for?
Browse other questions tagged
Stack Overflow works best with JavaScript enabledTerms Of Use
Welcome to the website of the Brambles Group (&Brambles&) which consists of Brambles Limited (ABN 89 118 896 021) and its respective subsidiaries. Your access to this website (&Site&) is subject to these Terms of Use, together with any notices, disclaimers and any other conditions or statements contained on this Site (collectively referred to as &Terms&).
By using this Site you agree to be subject to these Terms. Brambles may at any time, at its sole discretion, amend, vary or modify these Terms. Modifications of the Terms will be effective immediately and any subsequent use by you of the Site will constitute your acceptance of those modifications.
This Site contains information provided by Brambles, information provided by third parties and links to other websites operated by third parties. Brambles gives no warranty as to the accuracy, reliability or completeness of any material contained on this Site. To the maximum extent permitted by law, Brambles excludes all liability for any loss or damage suffered by you through use or access to this Site, or your reliance on any information contained in this Site. To the extent that Brambles' liability cannot be lawfully excluded, such liability is limited, at Brambles' option and to the maximum extent permitted by law, to resupplying the material contained on this Site or any part of it to you, or to the cost of the resupply of the material contained on this Site or any part of it to you.
Financial Content
To the extent that the Site contains any financial information about the business of Brambles, such information has been provided as general information only. It is not intended to be professional advice and you should therefore not take action in reliance of such information contained on this Site, but should rather make your own independent enquiries and seek the advice of a relevant professional in relation to any of the financial information contained on this Site.
Intellectual Property
Unless otherwise expressly indicated on this Site, Brambles owns the copyright in the content of this Site. Except where necessary for viewing the content on your browser, or as permitted under the Copyright Act 1968 (Cth) or other applicable laws or these Terms, no information on this Site may be reproduced, adapted, uploaded to a third party, linked to, framed, performed in public, communicated, distributed or transmitted in any form by any process without the specific written consent of Brambles. Various trademarks appear on this Site. Unless otherwise expressly stated on this Site, Brambles is the owner or authorised user of all trademarks appearing on this Site. Unauthorised use of any trade mark appearing on this Site will infringe that trade mark owner's exclusive rights in relation to that trade mark and render you liable to prosecution.
If you leave this Site to connect with a third party's website, via a link contained within this Site, you do so entirely at your own risk. The content of the third party's website to which you link will not have been produced, reviewed or checked for accuracy by Brambles. Brambles is not responsible for any damage or loss caused by any defects, omissions or delays that may exist in the services, information or other content provided in any third party website, whether alleged, actual, direct, indirect, consequential or otherwise. Brambles makes no representations and gives no warranties as to, and will have no liability for, any electronic content delivered by any third party.
Other Loss or Damage
You agree to use this Site entirely at your own risk. Brambles will not be liable for any loss or damage from any cause (including negligence) to you or your system caused by or in connection with your use of the Site or you linking from the Site to any third party's website. You should take your own precautions in relation to protecting your system from viruses or other malfunction.
Confidential Information
Brambles may, in its sole discretion, grant you access to parts of this Site (the &Brambles Intranet&) that are not accessible to the general public, via a unique password or other security device provided to you by Brambles. The Brambles Intranet contains information concerning Brambles or other third parties which is commercially sensitive and strictly confidential.
You agree that any access to the Brambles Intranet is conditional upon you at all times keeping all information which you access on the Brambles Intranet in the strictest confidence. You may only use this information and disclose this information to such other persons or organisations and for such purpose as expressly authorised in writing to you by Brambles.
You will not disclose to any third party your unique password or other security device provided by Brambles, nor the fact that you have access to the Brambles Intranet to any third party, unless specifically authorised in writing to you by Brambles.
You acknowledge and agree that if you breach any of your obligations regarding the Brambles Intranet, this would cause Brambles or other third parties to suffer financial or other loss and damage, and Brambles or any other affected third party is entitled to immediately take whatever action is necessary (including commencing proceedings for injunctive relief) as is necessary to protect its interests and that you will be liable to pay damages, plus all costs and expenses (including all legal costs and disbursements on a full indemnity basis) incurred as a result of your conduct.
Other Terms
These Terms and this Site are governed by the law in force in the State of New South Wales, Australia, and you irrevocably submit to the non-exclusive jurisdiction of the courts of New South Wales, Australia, and courts of appeal from them, for the determination of any dispute concerning the Terms or this Site.
If any part of the Terms is found to be invalid or unenforceable, it will be severed and will not affect the remainder of the Terms, which will continue to have full force and effect. All rights not expressly granted by Brambles under these Terms are reserved to Brambles.
Brambles respects your right to privacy and your right to control the dissemination of personal information about you or your company. This privacy policy explains what type of information we collect from users of this Site, what we do with the information you provide, and how users can access the information provided through the Site. This privacy policy may change from time to time so please remember to check it frequently. By continuing to use the Site you agree to be bound by the terms of the privacy policy as amended from time to time.
What information do we collect?
Anonymous Browsing
In general, you can visit Brambles on the internet without telling us who you are or revealing any information about yourself, even your e-mail address. However, in such cases, our web servers may collect the name of the domain that you used to access the internet, the website you came from, and the website you visit next. This information may be aggregated to measure the number of visits to the Site, average time spent, page views, and other statistics about visitors to this Site. We may also use this data to monitor site performance and to make the Site both easier and more convenient to use.
Personal Information Collection
When you visit our Site, we collect certain technical and routing information about your computer to facilitate your use of the Site. For example, we may log environmental variables, such as browser type, operating system and CPU speed, and the internet protocol ("IP") address of your originating internet service provider, to try to bring you the best possible service. We may also record search requests and results to try to ensure the accuracy and efficiency of our search engine. We may use your IP address to track your use of the Site. This "click stream" data may be matched with other information you provide.
If you choose to use the sign-up function to receive information about Brambles, we may ask you to provide us with some basic information about you and/or your company & such as name, and email address & which enables us to provide information to you, and helps make our contact with you as productive as possible.
If you provide us with personal data or information about other individuals or companies, please ensure that they are aware of our privacy policy.
Please note that we do not knowingly solicit information from children and we do not knowingly market our products or services to children.
Cookie Policy
Brambles& cookie policy is designed to protect the privacy of internet users, increasing online security and data privacy. By continuing to use the Site you hereby consent to cookies from the Site.
About cookies
Cookies are files, often including unique identifiers, that are sent by web servers to web browsers, and which may then be sent back to the server each time the browser requests a page from the server.
Cookies can be used by web servers to identity and track users as they navigate different pages on a website, and to identify users returning to a website.
Cookies may be either "persistent" cookies or "session" cookies. A persistent cookie consists of a text file sent by a web server to a web browser, which will be stored by the browser and will remain valid until its set expiry date (unless deleted by the user before the expiry date). A session cookie, on the other hand, will expire at the end of the user session, when the web browser is closed.
How we use cookies
Cookies do not contain any information that personally identifies you, but information that we store about you may be linked, by us, to the information stored in and obtained from cookies.
We use the information we obtain from you for the following purposes:
to recognise your computer when you visit our website
to track you as you navigate our website
to improve the website's usability
to analyse the use of our website
There are different categories of cookies used for different purposes:
Category 1: strictly necessary cookies
These cookies are essential in order to enable you to move around the website and use its features, such as accessing secure areas of the website. Brambles does not use these types of cookies.
Category 2: performance cookies
These cookies collect information about how visitors use a website, for instance which pages you go to most often, and if you received an error message from any of the web pages. These cookies don't collect information that identifies a visitor. All information these cookies collect is aggregated and therefore anonymous. It is only used to improve how a website works. The cookies used are:
Cookie Name
Purpose / Description
Persistent for 2 years
Google Analytics - Unique ID representing you
30 minutes
Google Analytics - Timestamp of the exact moment in time when you enter our website
Google Analytics - Timestamp of the exact moment in time when you leave our website you leave our website
Persistent for 6 months
Google Analytics - Stores the referral type for how you found our website (direct, search result, ad link)
Tracking font size adjustments across pages
__session:xxxx (xxxx denotes a randomly generated number)
This cookie is used to store the visitor&s font size adjustments selection. The cookie allows any font size adjustments to be carried from page to page when the visitor navigates between pages on the website. Multiple cookies may be created if the user changes his font size preferences more than once. All the cookies will expire at the end of the session (when the browser is closed).
Category 3: functionality cookies
These cookies allow the website to remember choices you make (such as your user name, text size, language or the region you are in) and provide enhanced, more personal features. They may also be used to provide services you have asked for such as watching a video or commenting on a blog. The information these cookies collect may be anonymised and they cannot track your browsing activity on other websites. Brambles does not use these types of cookies.
Category 4: targeting cookies or advertising cookies
These cookies are used to deliver adverts more relevant to you and your interests. They are also used to limit the number of times you see an advertisement as well as help measure the effectiveness of the advertising campaign. They are usually placed by advertising networks with the website operator's permission. They remember that you have visited a website and this information is shared with other organisations such as advertisers. Quite often targeting or advertising cookies will be linked to site functionality provided by the other organisation. Brambles does not use these types of cookies.
Managing cookies
You can manage cookies through your web browser settings.
Deleting and blocking cookies
If you want to remove any cookies already set, you can do so from your browser. You can find out how to do this by going to the help menu in your browser or below:
If you want to delete any cookies already on your computer, follow the steps outlined below:
Internet Explorer
Select &Tools&
Select &Internet Options&
Select the &Privacy& tab and choose &Advanced Options& button
Check the &Override Automatic Cookie Handling& tick box
Disable the &First Party& cookies by choosing the &Block& option
Disable the &Third Party& cookies by choosing the &Block& option
Uncheck the option to &Always allow session cookie&'
Click on &OK& to confirm changes
Mozilla Firefox
Select the "Firefox" menu
Select "Options"
Select the "Privacy" tab
Under "History", select "Use custom settings for history" from the dropdown list
Uncheck the option "Accept cookies from sites"
Click on OK to confirm the changes
Google Chrome
Open the Tools menu by clicking on the Wrench icon
Select "Options"
Select "Under the Bonnet"
Select "Content settings"
Select "Block sites from setting any date"
Apple Safari
Open the Safari menu by clicking on the Gear icon
Select "Preferences"
Select the "Privacy" tab
Select the option "Always" for the setting "Block cookies"
Close the dialog box to confirm the changes
&Safari for iPhone and iPad (iOS)
From the home screen of your device, select the "Settings" icon
Select 'Safari' from the list
To adjust the cookie settings, tap 'Accept Cookies'
Choose either "Never", "From visited", or "Always"
&Android for Mobile
Select the browser App on your android phone
Push the 'Menu' button
From the options that are shown to be running, select the 'More' option
Select the 'Settings' function from the list of browser functions
Scroll down to the 'Accept cookies' option. If the box is checked, uncheck i if the box is unchecked, select it in order to enable cookies.
Deleting our cookies or disabling future cookies won't stop our website from working.
More Information
There are many online resources which will help you understand and make informed decisions about your cookie usage. We recommend the following resources:
Sharing of Information
When you provide information to us, we may share that information within Brambles or with affiliated or related companies. We may also aggregate general statistics that we gather about traffic patterns and provide these statist however, when we do, these statistics will not include any personal information that identifies individuals.
We may disclose information about you to others if we have a good faith belief that we are required to do so by law or legal process, to respond to claims, or to protect the rights, property or safety of Brambles, or others.
Special Provisions for our European Users
By providing us with information and data, you must understand and agree that Brambles may collect, use and disclose personal data for commercial and marketing purposes, and may provide such information (consistent with the terms of this privacy policy) within Brambles and related or affiliated companies - any or all of which may be outside your resident jurisdiction. In addition, such information and data may be stored on servers located outside your resident jurisdiction.
By providing us with data, you consent to the transfer of such data outside of your country or region (including, without limitation, outside of the European Union) consistent with the terms of this privacy policy. If you do not consent to the terms of this privacy policy, please do not use this Site and, if you have provided personal identifying data, please contact us about how you would like Brambles to handle such data.
How do you access and update your information? Please contact us if you wish to modify or verify personal identifying information that you have submitted to us or if you have questions about the information maintained by us.
What if we change our privacy policy?
Brambles reserves the right to modify or supplement this privacy policy at any time. We therefore suggest that you check the privacy policy regularly.
If you wish to discuss linking to this Site, publication of any material from this Site, or if you have any queries concerning the Terms or the use of this Site, please e-mail:
If you have any queries in relation to your privacy, please e-mail:
or phone +61 2 or fax +61 2
or write to the Brambles Privacy Office, GPO Box 4173 Sydney NSW 2000
Copyright Brambles Limited - all rights reserved.