The data pointer value is not valid.
数据指针值无效。
数据指针寄存器；
The data pointer will now contain the pointer to that label each time the callback is called.
现在每次调用回调时，data指针都会包含到那个标签的指针。
In order to storage the data reliably, this paper proposes storage the data pointer and its checksum redundantly.
本文采用了校验加冗余的方法对数据指针进行存储，达到了可靠存储的目的。
The semantic cache consists of disjoint semantic regions, and each semantic region includes a description and a corresponding data pointer.
语义缓存由互不相交的语义区域组成，每一个语义区域包括语义描述及其数据指针。
This allows you to create an arbitrarily complicated data structure for the thread to work on, and pass it in as a single pointer.
这样允许您创建一个任意复杂的数据结构，并将它作为一个指针传送给需要在这个数据结构上进行操作的线程。
You could even just use a single pointer and write data back into the buffer you got it from, although this might be a nuisance to program for on the other end.
您甚至只需要使用一个指针并将数据写回到读取数据所使用的缓冲区中即可，不过这对于另外一端的编程来说可能有些麻烦。
If a function needs to maintain the state of some data over successive calls, such as a working buffer or a pointer, the caller should provide this data.
如果函数需要在一系列调用期间维持某些数据的状态，比如工作缓存或指针，那么调用者应该提供此数据。
If there is no root or a pointer pointing to any part of the list then your data is lost in memory.
如果既没有根也没有指针指向链表，那么你的数据就丢失在内存中了。
This simple design, possible because the data obeys strict LIFO order, means that no complex data structure is needed to track stack contents - a simple pointer to the top of the stack will do.
这种简单的设计，很有可能是考虑到数据操作都符合后进先出（LIFO ）规则，这意味着访问栈的内容并不需要复杂的数据结构，一个简单的栈顶指针就能搞定一切。
Internally the data referenced by the pointer is copied into dynamically allocated memory.
在内部，相关数据通过指针被拷贝到动态分贝的内存上。
Instead of having multiple directly accessible arguments, you get a pointer into main memory and the SPE has to issue DMA requests to get the pointed-to data from main memory.
它没有使用多个可直接访问的参数，而是使用一个指向主存的指针，SPE需要发出dma请求来从主存中获取指针所指向的数据。
An alternative is a data storage method called a linked list, in which each piece of data includes a "pointer" that indicates the location of the next piece.
另外一个数据存储方式叫链接，通过在数据节点中增加一个指向下一个节点的指针来对数据进行存储。
The data example in the diagram is trickier because it uses a pointer.
下面图表中的示例由于使用了指针所以看起来不那么明了。
This is in contrast with conservative GC systems which requires you to guess whether some piece of memory contains an object pointer or just some random data that resembles an object pointer.
这和需要你猜测某个内存片包含对象指针和一些类似对象指针的随即数据的老式GC系统有鲜明的对比。
This is a pointer to a structure which holds the data about the SPE program itself.
是持有有关SPE程序本身的数据的结构的指针。
Listing 3. Update new row pointer and return test data.
列表3.更新新的行指针，并返回测试数据。
After the fork, the parent and child have copies of all open file descriptors and data values, so the pointer works for both.
执行fork之后，父进程和子进程获得打开的所有文件描述符和数据值的拷贝，所以指针对于它们都是有效的。
Gets the current file row pointer, stored as an object but used as an integer, from the global variable in the data area for the test engine (this will be set up later).
从测试引擎(稍后就会安装它)数据区域中的全局变量获取当前最为结果储存但是当作整数使用的文件行指针。
Important registers to look for when debugging through signals are the GPRs, instruction pointer (NIP), machine state register (MSR), trap, data address register (DAR), and so on.
在调试信号时，需要查看的一些重要寄存器包括GPR、指令指针(NIP)、机器状态寄存器(MSR)、Trap、数据地址寄存器(DAR)等等。
This is done by entering just enough data to overwrite the arguments with dummy data and a new return pointer to a different function; the new function is now executed. 10
这是通过输入足够的数据来用伪数据覆盖参数，及输入到不同函数的新返回指针来实现的，现在就执行新的函数了。
First, the Vee-Table pointer is used to access virtual functions, and data members are accessed directly using compile time offsets.
首先，Vee -Table指针用于访问虚函数，而对数据成员的访问直接使用编译时偏移量实现。
Binary trees are represented by nodes that have a data value and a left and right pointer; however, there are many data structures that require trees with more than just a left and right branch.
描述二叉树(binarytree)的节点有一个数据值、一个左指针和一个右指针；不过，很多数据体要求树不只有一个左分支和一个右分支。
In cases where data is not optimally modeled as a single document, MongoDB has the concept of a "DBRef", which is a pointer from a field in a document to another document.
在数据不宜被构造成单独文档的情况下，MongoDB有“DBRef”的概念，这是从文档的一个属性指向另一个文档的指针。
The code converts data into a pointer to GtkLabel.
代码把data转换成到GtkLabel的指针。
The difference among the three 64-bit models (LP64, LLP64, and ILP64) lies in the non-pointer data types.
这3 个 64位模型（LP64、LLP64和ILP64）之间的区别在于非浮点数据类型。
Key-values Stores. The main idea here is using a hash table where there is a unique key and a pointer to a particular item of data.
KV存储的主要思想是一个哈希表，每个item有一个主键和特定的数据值。
Key-values Stores. The main idea here is using a hash table where there is a unique key and a pointer to a particular item of data.
KV存储的主要思想是一个哈希表，每个item有一个主键和特定的数据值。
应用推荐