Search results

Jump to navigation Jump to search

Page title matches

  • In [[computer science]], a '''stack frame''' is a [[memory management]] strategy used to create and destroy temporary ...ate=2007-04-27}}</ref>. When the called procedure finishes executing, its stack frame is removed from the stack, and thread execution resumes back in the calling
    10 KB (1,573 words) - 11:37, 6 February 2024
  • 12 bytes (1 word) - 20:48, 14 November 2007
  • 154 bytes (19 words) - 20:03, 7 June 2008
  • Auto-populated based on [[Special:WhatLinksHere/Stack frame]]. Needs checking by a human.
    794 bytes (107 words) - 13:40, 29 April 2011

Page text matches

  • {{rpl|Stack frame}} {{r|Stack frame}}
    475 bytes (62 words) - 21:15, 16 March 2024
  • * [[Stack frame]], which describes the [[memory management]] strategy that makes this attac
    140 bytes (17 words) - 23:53, 29 June 2009
  • {{r|Stack frame}}
    566 bytes (76 words) - 15:51, 11 January 2010
  • ...de. Implemented within a [[compiler]], canary values modify a program's [[stack frame]] to detect---but not prevent---buffer overflow attacks, imposing a worst c ...o the function epilogue which check the canary value, as it appears in the stack frame. If incorrect, the new instructions cause the program to go into a fail-sa
    3 KB (380 words) - 05:48, 8 April 2024
  • {{r|Stack frame}}
    606 bytes (79 words) - 20:34, 11 January 2010
  • Auto-populated based on [[Special:WhatLinksHere/Stack frame]]. Needs checking by a human.
    794 bytes (107 words) - 13:40, 29 April 2011
  • * In many [[high-level language|high-level languages]], a [[stack frame]], based upon the idea of a stack, is used to store
    3 KB (537 words) - 00:36, 9 February 2010
  • {{r|Stack frame}}
    451 bytes (59 words) - 11:37, 11 January 2010
  • {{r|Stack frame}}
    497 bytes (64 words) - 19:44, 11 January 2010
  • {{r|Stack frame}}
    456 bytes (59 words) - 16:37, 11 January 2010
  • In [[computer science]], a '''stack frame''' is a [[memory management]] strategy used to create and destroy temporary ...ate=2007-04-27}}</ref>. When the called procedure finishes executing, its stack frame is removed from the stack, and thread execution resumes back in the calling
    10 KB (1,573 words) - 11:37, 6 February 2024
  • ...on problem is to assign each variable a distinct memory location using a [[stack frame]]. Although this solution produces correct results, they are generally quit * [[stack frame]]
    2 KB (347 words) - 00:34, 9 February 2010
  • {{r|Stack frame}}
    807 bytes (103 words) - 12:05, 6 March 2024
  • {{r|Stack frame}}
    3 KB (353 words) - 03:48, 24 September 2013
  • {{r|Stack frame}}
    1 KB (187 words) - 13:39, 29 April 2011
  • ...o the function epilogue which check the canary value, as it appears in the stack frame. If incorrect, the new instructions cause the program to go into a fail-sa
    9 KB (1,329 words) - 05:48, 8 April 2024
  • * [[threading]] and local variable [[scope]], requiring use of [[stack frame|stack frames]]
    3 KB (490 words) - 10:26, 30 March 2024
  • ...on problem is to assign each variable a distinct memory location using a [[stack frame]]. Although this solution produces correct results, they are generally quit
    9 KB (1,338 words) - 10:00, 16 July 2013
  • * [[stack frame]]
    7 KB (933 words) - 16:53, 16 February 2010
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)