Lines Matching refs:our

28 our program down to something small and standalone. As part of this
73 First we make our anonymous function that contains our top level
74 statement be our "main":
147 our piece of Kaleidoscope language down to an executable program via this
162 construct one for our fib.ks file.
176 of our IR level descriptions. Construction for it takes a module so we
177 need to construct it shortly after we construct our module. We've left it
180 Next we're going to create a small container to cache some of our frequent
181 data. The first will be our compile unit, but we'll also write a bit of
182 code for our one type since we won't have to worry about multiple typed
204 And then later on in ``main`` when we're constructing our module:
217 and we follow the C ABI in our llvm code generation so it's the closest
221 we're using shell redirection to put our source into the Kaleidoscope
239 Now that we have our ``Compile Unit`` and our source locations, we can add
241 add a few lines of code to describe a context for our subprogram, in this
253 source locations of 0 (since our AST doesn't currently have source location
254 information) and construct our function definition:
267 and we now have an DISubprogram that contains a reference to all of our
299 line and column of the "source file". As we lex every token we set our current
302 ``getchar()`` with our new ``advance()`` that keeps track of the information
303 and then we have added to all of our AST classes a source location:
327 giving us locations for each of our expressions and variables.
330 location so it can use that when we generate the rest of our code and make
348 the main file scope (like when we created our function), or now we can be
392 we have in scope. Let's get our function arguments set up so we can get
393 decent backtraces and see how our functions are being called. It isn't
409 Here we're doing a few things. First, we're grabbing our current scope
410 for the variable so we can say what range of code our variable is valid
446 Here is the complete code listing for our running example, enhanced with