Test data for the ABAP Function

Hello Experts,
Can you please provide me the valid test data for the function modules?
    /SCA/BIF_WORKINPROCESS_BO
                       and
    /SCA/BIF_WORKORDINF_MS
Thanks and Regards,
Kuldeep Verma

Hi ,
If u want to use the same data to test your function module then we can use this button. To use this button simply press F8 --> give the test data --> And then save this test in the test directory using the SAVE button.
--> Next time when retest it then their is no need to give all the other information just press Test Data directory..
Hope you understand.
Kuldeep

Similar Messages

Test Data for Function module

Hi all , I want to define test data for the function module . Can any one help how or where to define it.
- Neo

Hi Neo,
Are u talking abt testing a functional module separately without implementing in a program.
If this is the case, then do the following:
1.go to se37
2.write name of functional module and press F8.
3.there would be a screen which would give you place to write in values for the input parameters including internal table rows.
4.fill in and press F8.
If I have gt u wrong ,then pls clarify.
Rgds,
Shweta

Reg : test data for segment E1EDK02

Hi all ,
i need test data for the fields in the segment to be filled .i need to refer to which table .for qualifier ,document ,document item ,date and time to be filled up.thanx in advance ..............

problem solved .....

How to add Test data for a function module

Hi experts,
i want to add test data for a function module . i don't know how to proceed on it . please help me...
with regards,
James...
Valuable answers will be rewarded...

Hi,
- Go to SE37 and execute your FM
- Enter the data you want to pass to FM
- Hit 'Save' button. Enter the meaningful name for your test scenario and save. That's it you have saved the test data.
You can also enter some other test data and save that also. In short, you can save multiple test scenario. Also, you can give multiple test scenario a same name and they do not overwrite each other ( but normally you give different name to differentiate them)
Next time you come to execute the FM again, hit the "test data" button and it will show you all the test scenario you have stored before. Select the one you want to use and it will load the data in FM parameters.
Let me know if you need any other information.
Regards,
RS

Technical Specifiaction for the ABAP HR Functional Spec

HI Please help me to write a technical spec for the below functional spec.
As-Is Business Process
Duplicate Performance, Development and Career Plans are being created. Forms have been created with incorrect validity dates. Some people that should have forms dont and some that should not have forms do. We have no easy way to periodically audit for these situations.
To Be Business Process
Audit report to be run via the SRET report tree to check for duplicate plans, incorrect validity dates, and actives that are missing forms as well as terms that have forms that are not in completed status.   Should be able to save selections as a variant.
Selection Screen
Use selection screen from YAUMI tcode as a base model. We only need the top bar, the selection section,, and a section for invalid data edits, which will be modified as shown below. Additionally, there should be a section to choose templates.
Template section:
      This section can be modeled after the selection screen in program Y_HRHAP_PDPGEN. Each template is selected via drop down, and the plan end year is entered. Drop down to choose template that shows form name. For development and career, the expected end year is 9999, which would be entered in the year for those 2 templates. For the Performance plan, the current year is the end year, and would be entered.
Invalid Data Edits section:
   Checkboxes for:
1)     duplicate plans
2)     invalid validity dates
3)     missing plans for active
4)     terms with non completed plans
Logic
     Include the templates selected above for associates with the chosen selections.
     If duplicate plans checkbox is selected
            If the plan year end on the screen is 9999, see if there is any associate that has more than one of this template in status not equal to Complete. If so, output to audit report.
            If the plan year end on the screen is less than 9999 (i.e. 2007), then see if there is any pernr that has more than one of this template in a status that is not equal to Complete with an validity end date of 12/31/yyyy (where yyyy is the year on the selection screen). If so, output to audit report.
     If invalid validity dates is selected
        If the plan year end on the screen is 9999, see if there is any pernr that has that template in status not equal to Complete with an end date not equal to 12/31/9999. If so, output to audit report.
            If the plan year end on the screen is less than 9999 (i.e. 2007), then see if there is any pernr with that template in status not equal to Complete with an end date = 12/31/9999, or with an end date with a month and day not equal to 12/31. If so, output to audit report.
     If missing plans for active is selected
     See if there are any people in the selected population that do NOT have any of the selected templates in a status not equal to Complete If so, output to audit report.
      If terms with active plans is selected
     See if there are any people in the selected population that DO have any of the selected templates in a status not equal to Complete If so, output to audit report.
Output
      Appraisee Pernr
      Appraisee Name
      Template name
      Validity Dates begin date and end date
      Status / Substatus
      Appraiser Pernr
      Appraiser Name
      Message :
          Duplicate plan
          Invalid Validity End Date
          Missing plan
          Plan not completed.
      For missing plan error, the fields for validity dates, status/substatus, appraiser pernr and appraiser name will be blank.
Thanks
Raja

Hi IB!
Please check the following links for docu:
http://help.sap.com/saphelp_erp2005vp/helpdata/en/80/ea89395eb58c4f9d0c3e837cf0909d/frameset.htm
Check this for ESS:
/people/srinivasarao.gv2/blog/2005/06/11/configuring-ess-in-sap-enterprise-portal-60
I hope it was in time!
Have a nice day!
Best regards,
Zsolt

Function module to determine the date for the nth weekday of the mth month

Hey folks,
Is there a function module which determines the date for the mth weekday of the nth month in the pth year.
For instance, if I input 2nd thursday of the 4th month in 2008, it should return me, 04/10/2008 (MM/DD/YYYY).
Thanks and Best Regards,
Puja.

Hi Ravi,
Hadn't been able to work on this lately...You solution was quite close, but did not work for a few scenarios....I tweaked the logic a bit to take care of them as well...
So here goes the code:
================================================
DATA first_day_of_month TYPE datum.
DATA day TYPE p.
CONCATENATE year month '01' INTO first_day_of_month.
CALL FUNCTION 'DAY_IN_WEEK'
 EXPORTING
 datum = first_day_of_month
 IMPORTING
 wotnr = day.
DATA day_number TYPE numc2.
IF day = weekday.
 IF recur = 1.
 DATA ls_date(10) TYPE c.
 CONCATENATE month '/01/' year INTO ls_date.
 CALL FUNCTION 'CONVERT_DATE_TO_INTERNAL'
 EXPORTING
 date_external = ls_date
 IMPORTING
 date_internal = date.
 ELSE.
 day_number = ( ( recur - 1 ) * 7 ) + 1.
 ENDIF.
ELSEIF day < weekday.
 day_number = ( ( recur - 1 ) * 7 ) + ( weekday - day ) + 1.
ELSE.
 day_number = ( ( recur - 1 ) * 7 ) + ( 7 - day ) + weekday + 1.
ENDIF.
IF date IS INITIAL.
 CONCATENATE year month day_number INTO date.
ENDIF.
====================================
There still could be some loopholes in this....am not sure....but it sure did seem to work for a couple of random checks that I performed.
Brownie points to you for giving me a direction.
Thanks,
Puja.

How can I change the default start-up date for a new functional location?

Is there a way to change the default date when creating a functional location? Whenever we create a new functional location, there is a date populated in the start-up date field. This date is our go-live date from last year and I cannot find the location in the IMG (if there is one) to stop the date from automatically populating with the date from the superior functional location. I tried setting the field from input to required but the date still populates automatically. Does anyone have any suggestions on how to leave the start-up date field blank when creating a new functional location?

That field is generally picked up from the immediate superior FL in the hierarchy through the inheritance functionality.You will have to overwrite this date.I dont think you can clear this field through Configuration functionality.
If you are in Ecc 6.0, you could get the help of developer to use implicit enhancement to initialize the field contents.
Regards
Narasimhan

A replacement for the Quicksort function in the C++ library

Hi every one,
I'd like to introduce and share a new Triple State Quicksort algorithm which was the result of my research in sorting algorithms during the last few years. The new algorithm reduces the number of swaps to about two thirds (2/3) of classical Quicksort. A multitude
of other improvements are implemented. Test results against the std::sort() function shows an average of 43% improvement in speed throughout various input array types. It does this by trading space for performance at the price of n/2 temporary extra spaces.
The extra space is allocated automatically and efficiently in a way that reduces memory fragmentation and optimizes performance.
Triple State Algorithm
The classical way of doing Quicksort is as follows:
- Choose one element p. Called pivot. Try to make it close to the median.
- Divide the array into two parts. A lower (left) part that is all less than p. And a higher (right) part that is all greater than p.
- Recursively sort the left and right parts using the same method above.
- Stop recursion when a part reaches a size that can be trivially sorted.
The difference between the various implementations is in how they choose the pivot p, and where equal elements to the pivot are placed. There are several schemes as follows:
[ <=p | ? | >=p ]
[ =p | ? ]
[ <=p | =p | ? | >p ]
[ =p | p ] Then swap = part to middle at the end
[ =p | p | =p ] Then swap = parts to middle at the end
Where the goal (or the ideal goal) of the above schemes (at the end of a recursive stage) is to reach the following:
[ p ]
The above would allow exclusion of the =p part from further recursive calls thus reducing the number of comparisons. However, there is a difficulty in reaching the above scheme with minimal swaps. All previous implementation of Quicksort could not immediately
put =p elements in the middle using minimal swaps, first because p might not be in the perfect middle (i.e. median), second because we don’t know how many elements are in the =p part until we finish the current recursive stage.
The new Triple State method first enters a monitoring state 1 while comparing and swapping. Elements equal to p are immediately copied to the middle if they are not already there, following this scheme:
[ p ]
Then when either the left (<p) part or the right (>p) part meet the middle (=p) part, the algorithm will jump to one of two specialized states. One state handles the case for a relatively small =p part. And the other state handles the case for a relatively
large =p part. This method adapts to the nature of the input array better than the ordinary classical Quicksort.
Further reducing number of swaps
A typical quicksort loop scans from left, then scans from right. Then swaps. As follows:
while (l<=r)
while (ar[l]<p)
l++;
while (ar[r]>p)
r--;
if (l<r)
{ Swap(ar[l],ar[r]);
l++; r--;
else if (l==r)
{ l++; r--; break;
The Swap macro above does three copy operations:
Temp=ar[l]; ar[l]=ar[r]; ar[r]=temp;
There exists another method that will almost eliminate the need for that third temporary variable copy operation. By copying only the first ar[r] that is less than or equal to p, to the temp variable, we create an empty space in the array. Then we proceed scanning
from left to find the first ar[l] that is greater than or equal to p. Then copy ar[r]=ar[l]. Now the empty space is at ar[l]. We scan from right again then copy ar[l]=ar[r] and continue as such. As long as the temp variable hasn’t been copied back to the array,
the empty space will remain there juggling left and right. The following code snippet explains.
// Pre-scan from the right
while (ar[r]>p)
r--;
temp = ar[r];
// Main loop
while (l<r)
while (l<r && ar[l]<p)
l++;
if (l<r) ar[r--] = ar[l];
while (l<r && ar[r]>p)
r--;
if (l<r) ar[l++] = ar[r];
// After loop finishes, copy temp to left side
ar[r] = temp; l++;
if (temp==p) r--;
(For simplicity, the code above does not handle equal values efficiently. Refer to the complete code for the elaborate version).
This method is not new, a similar method has been used before (read: http://www.azillionmonkeys.com/qed/sort.html)
However it has a negative side effect on some common cases like nearly sorted or nearly reversed arrays causing undesirable shifting that renders it less efficient in those cases. However, when used with the Triple State algorithm combined with further common
cases handling, it eventually proves more efficient than the classical swapping approach.
Run time tests
Here are some test results, done on an i5 2.9Ghz with 6Gb of RAM. Sorting a random array of integers. Each test is repeated 5000 times. Times shown in milliseconds.
size std::sort() Triple State QuickSort
5000 2039 1609
6000 2412 1900
7000 2733 2220
8000 2993 2484
9000 3361 2778
10000 3591 3093
It gets even faster when used with other types of input or when the size of each element is large. The following test is done for random large arrays of up to 1000000 elements where each element size is 56 bytes. Test is repeated 25 times.
size std::sort() Triple State QuickSort
100000 1607 424
200000 3165 845
300000 4534 1287
400000 6461 1700
500000 7668 2123
600000 9794 2548
700000 10745 3001
800000 12343 3425
900000 13790 3865
1000000 15663 4348
Further extensive tests has been done following Jon Bentley’s framework of tests for the following input array types:
sawtooth: ar[i] = i % arange
random: ar[i] = GenRand() % arange + 1
stagger: ar[i] = (i* arange + i) % n
plateau: ar[i] = min(i, arange)
shuffle: ar[i] = rand()%arange? (j+=2): (k+=2)
I also add the following two input types, just to add a little torture:
Hill: ar[i] = min(i<(size>>1)? i:size-i,arange);
Organ Pipes: (see full code for details)
Where each case above is sorted then reordered in 6 deferent ways then sorted again after each reorder as follows:
Sorted, reversed, front half reversed, back half reversed, dithered, fort.
Note: GenRand() above is a certified random number generator based on Park-Miller method. This is to avoid any non-uniform behavior in C++ rand().
The complete test results can be found here:
http://solostuff.net/tsqsort/Tests_Percentage_Improvement_VC++.xls
or:
https://docs.google.com/spreadsheets/d/1wxNOAcuWT8CgFfaZzvjoX8x_WpusYQAlg0bXGWlLbzk/edit?usp=sharing
Theoretical Analysis
A Classical Quicksort algorithm performs less than 2n*ln(n) comparisons on the average (check JACEK CICHON’s paper) and less than 0.333n*ln(n) swaps on the average (check Wild and Nebel’s paper). Triple state will perform about the same number of comparisons
but with less swaps of about 0.222n*ln(n) in theory. In practice however, Triple State Quicksort will perform even less comparisons in large arrays because of a new 5 stage pivot selection algorithm that is used. Here is the detailed theoretical analysis:
http://solostuff.net/tsqsort/Asymptotic_analysis_of_Triple_State_Quicksort.pdf
Using SSE2 instruction set
SSE2 uses the 128bit sized XMM registers that can do memory copy operations in parallel since there are 8 registers of them. SSE2 is primarily used in speeding up copying large memory blocks in real-time graphics demanding applications.
In order to use SSE2, copied memory blocks have to be 16byte aligned. Triple State Quicksort will automatically detect if element size and the array starting address are 16byte aligned and if so, will switch to using SSE2 instructions for extra speedup. This
decision is made only once when the function is called so it has minor overhead.
Few other notes
- The standard C++ sorting function in almost all platforms religiously takes a “call back pointer” to a comparison function that the user/programmer provides. This is obviously for flexibility and to allow closed sourced libraries. Triple State
defaults to using a call back function. However, call back functions have bad overhead when called millions of times. Using inline/operator or macro based comparisons will greatly improve performance. An improvement of about 30% to 40% can be expected. Thus,
I seriously advise against using a call back function when ever possible. You can disable the call back function in my code by #undefining CALL_BACK precompiler directive.
- Like most other efficient implementations, Triple State switches to insertion sort for tiny arrays, whenever the size of a sub-part of the array is less than TINY_THRESH directive. This threshold is empirically chosen. I set it to 15. Increasing this
threshold will improve the speed when sorting nearly sorted and reversed arrays, or arrays that are concatenations of both cases (which are common). But will slow down sorting random or other types of arrays. To remedy this, I provide a dual threshold method
that can be enabled by #defining DUAL_THRESH directive. Once enabled, another threshold TINY_THRESH2 will be used which should be set lower than TINY_THRESH. I set it to 9. The algorithm is able to “guess” if the array or sub part of the array is already sorted
or reversed, and if so will use TINY_THRESH as it’s threshold, otherwise it will use the smaller threshold TINY_THRESH2. Notice that the “guessing” here is NOT fool proof, it can miss. So set both thresholds wisely.
- You can #define the RANDOM_SAMPLES precompiler directive to add randomness to the pivoting system to lower the chances of the worst case happening at a minor performance hit.
-When element size is very large (320 bytes or more). The function/algorithm uses a new “late swapping” method. This will auto create an internal array of pointers, sort the pointers array, then swap the original array elements to sorted order using minimal
swaps for a maximum of n/2 swaps. You can change the 320 bytes threshold with the LATE_SWAP_THRESH directive.
- The function provided here is optimized to the bone for performance. It is one monolithic piece of complex code that is ugly, and almost unreadable. Sorry about that, but inorder to achieve improved speed, I had to ignore common and good coding standards
a little. I don’t advise anyone to code like this, and I my self don’t. This is really a special case for sorting only. So please don’t trip if you see weird code, most of it have a good reason.
Finally, I would like to present the new function to Microsoft and the community for further investigation and possibly, inclusion in VC++ or any C++ library as a replacement for the sorting function.
You can find the complete VC++ project/code along with a minimal test program here:
http://solostuff.net/tsqsort/
Important: To fairly compare two sorting functions, both should either use or NOT use a call back function. If one uses and another doesn’t, then you will get unfair results, the one that doesn’t use a call back function will most likely win no matter how bad
it is!!
Ammar Muqaddas

Thanks for your interest.
Excuse my ignorance as I'm not sure what you meant by "1 of 5" optimization. Did you mean median of 5 ?
Regarding swapping pointers, yes it is common sense and rather common among programmers to swap pointers instead of swapping large data types, at the small price of indirect access to the actual data through the pointers.
However, there is a rather unobvious and quite terrible side effect of using this trick. After the pointer array is sorted, sequential (sorted) access to the actual data throughout the remaining of the program will suffer heavily because of cache misses.
Memory is being accessed randomly because the pointers still point to the unsorted data causing many many cache misses, which will render the program itself slow, although the sort was fast!!.
Multi-threaded qsort is a good idea in principle and easy to implement obviously because qsort itself is recursive. The thing is Multi-threaded qsort is actually just stealing CPU time from other cores that might be busy running other apps, this might slow
down other apps, which might not be ideal for servers. The thing researchers usually try to do is to do the improvement in the algorithm it self.
I Will try to look at your sorting code, lets see if I can compile it.

Issue in creating web service for a ABAP Function Module

Hi,
now i'm learning how to create web service for a ABAP Function Module. I used the following steps.
1. select the Function Module, named "zws_test".
2. in the context menu, select "create->proxy object". so we enter into wizard.
3. in the wizard, press the radio button "Service Provider".
4. in the next page, press the radio button "Existing ABAP Objects(Inside Out)".
5. In the next page, Enter the "zws_test_prvider" as Service Definition and select "Function Module" as Endpoint Type.
6. in the next page, enter "zws_test" as Function Module and mark the "Mapping der Namen" button
7. in the next page,select "PRF_DT_IF_SEC_LOW" as Profile and mark "Deploy Service".
8. Save in the local package.
9. then it will pop up a window with title "WSDL Source". i selected "URL/HTTP Destination" and press "OK".
10.in the next page, i enter the URL as "http://hostname:portnumber/", and press "OK".
11. then it will pop up a window with title "Display logs". A record with error message "HTTP error(return code 404, message "Not found")" appears.
12. i press "ok" and a service provider with name "zws_test_prvider" appears in my local package.
13. i use "zws_test_prvider"'s URL to create a service consumer "ZCO_WS_TEST_CONSUMER" and logic portal "LP1".
14. But when i test my service consumer "ZCO_WS_TEST_CONSUMER", it will throw an exception "cx_ai_system_fault" with errortext "SOAP:14 Unexpected element -el=definitions ns=http://schemas.xmlsoap.org/wsdl/".
15. I use t-code SM59 to test connection and get the following info.
      Status HTTP Response     200
      Status Text                      OK
      Duration Test Call             328 ms.
who can give me the reasons about item 11 and 14, and explain me how to create service provider and service consumer for a Function Module.
Thanks in advance
Johnney

have you seen this weblog
/people/thomas.jung3/blog/2004/11/15/bsp-150-a-developer146s-journal-part-xiii-developing-abap-webservices

Set data for the x-axis

Hi,
I made a program which allows the user to configure and measure Temperature and voltage using a DAQ device. I also set a possibility for the user to save his data of his test to lvm file and then upload and read it on a waveform chart. My problem is that while the user gets multiple plots represented in the y axis (the different Temperature/voltage channels signals of the DAQ), the x-axis is set to time by default.
How can I change it? I would like to allow the user to change the x-axis from time to one of the plots of his tests data.
for example, lets say I get 2 signals of temperature (mod1/ai0 and mod1/ai1) and 2 signals of voltage (mod2/ai0 and mod2/ai1) on the y axis (amplitude) during 3 hours (represented in x-axis) and I would like to allow the user the option to play with the data so he can see temperature on the y axis as a function of the voltage on the x axis (instead of time) and the option to configure any kind of combination while the program is running (set mod1/ai0 in the y-axis and mod2/ai0 in the x-axis, for instance).
I have tried various things but nothing seems to work. It looks like it is very easy to change plots between multiple Y-axis with property node of "Active plot" and "Y scale index" but I can't figure out how to change plots from the Y-axis to X-axis and vice versa.
I hope this clumsy message is somehow clear..
Thanks a lot in advance,
Shahar L.
Detectomat Gmbh
Hamburg, Germany

Hi Shahar,
You will have to use an XY graph, not a waveform chart, if you want to set the X-axis data. Under "Find Examples", see "Fundamentals"..."Graphs and Charts" for some examples of XY-graphs and how to use them. You can't change the X-axis data of a waveform chart, as you have discovered.
Hope this is helpful...
Diane

Need TEST DATA for CP_BD_DIRECT_INPUT_PLAN..

Hi.
I want to update a Created Routing with the help of "CP_BD_DIRECT_INPUT_PLAN" function module. I am trying but getting error. Can any one help me with providing TEST DATA for "CP_BD_DIRECT_INPUT_PLAN" for Creating/Changing Operations???
Or is it a good way to use CP_BD_DIRECT_INPUT_PLAN for Routing update???
please answer.
Advance thanks,
~Guru
Edited by: gtipturnagaraja on Nov 18, 2010 10:33 AM

Hi,
the cause of this message is a change number (rc271_di_imp-aennr), which has an valid-from date different to the valid-from date of the work plan (aenr-datuv was the 01 September 2010 and plko-datuv the 10 November 2010).
By clearing of the change number into structure rc271_di_imp structure appears this message does not occur.
Regards
Peter
Edited by: Peter Loeff on Nov 10, 2010 4:33 PM

Type of testing data for WRICEF list

Hello Gurus
Please find my requirement below in detail.
My requirement.
I got a functional specification and I need to developed a object (i.e. any of the objects like reports, interface, enchantments etc) for that FS. After developing that object I need to do the testing, I mean UTP right. For doing testing of that object I need to have some test data right. So Now I want to know what type of data I can ask to the functional consultant. Is there any global checklist available which is applicable for all types of objects because for interfaces the requirement of test data will be different and for reports it is different and so on for other objects also. If I provide that checklist, the functional consultant will provide the required test data for his object.
Now I got a job to create a global template with my inputs for test data. So that functional consulants will check that template and provide the test data for his relavent object. This is my requirement , so please suggest me accordingly.
if i post my question in a wrong way , please excuse and suggest me accordingly based on my requirement.
thanks in advanc.e
Reg
RAj

i got the solution. so withdrawing the question.

SAP paging overflow when storing data in the ABAP/4 memory.

I am trying to create a data source in BI7.0 in the Datawarehousing Workbench. But along the process when i need to select a view i get an error detailed in the following error file extract: Please go through and assist.
untime Errors MEMORY_NO_MORE_PAGING
Date and Time 06.06.2009 14:21:35
Short text
SAP paging overflow when storing data in the ABAP/4 memory.
What happened?
The current program requested storage space from the SAP paging area,
but this request could not be fulfilled.
of this area in the SAP system profile.
What can you do?
Note which actions and input led to the error.
For further help in handling the problem, contact your SAP administrator
You can use the ABAP dump analysis transaction ST22 to view and manage
termination messages, in particular for long term reference.
Error analysis
The ABAP/4 runtime system and the ABAP/4 compiler use a common
interface to store different types of data in different parts of
the SAP paging area. This data includes the
ABAP/4 memory (EXPORT TO MEMORY), the SUBMIT REPORT parameters,
CALL DIALOG and CALL TRANSACTION USING, as well as internally defined
macros (specified with DEFINE).
To store further data in the SAP paging area, you attempted to
allocate a new SAP paging block, but no more blocks were
available.
When the SAP paging overflow occurred, the ABAP/4 memory contained
entries for 20 of different IDs.
Please note:
To facilitate error handling, the ABAP/4 memory was
deleted.
How to correct the error
The amount of storage space (in bytes) filled at termination time was:
Roll area...................... 8176
Extended memory (EM)........... 13587912
Assigned memory (HEAP)......... 0
Short area..................... " "
Paging area.................... 40960
Maximum address space.......... " "
By calling Transaction SM04 and choosing 'Goto' -> 'Block list',
you can display an overview of the current roll and paging memory
levels resulting from active users and their transactions. Try to
decide from this whether another program requires a lot of memory
space (perhaps too much).
The system log contains more detailed information about the
termination. Check for any unwanted recursion.
Determine whether the error also occurs with small volumes of
data. Check the profile (parameter "rdisp/PG_MAXFS", see
Installation Guidelines).
Is the disk or the file system that contains the paging file
full to the extent that it cannot be increased, although it has
not yet reached the size defined in the profile? Is the
operating system configured to accommodate files of such a
size?
The ABAP processor stores different types of data in the SAP
paging area. These include:
(1) Data clusters (EXPORT ... TO MEMORY ...)
(2) Parameters for calling programs (SUBMIT REPORT ...),
Dialog modules (CALL DIALOG ...) and transactions
(CALL TRANSACTION USING ...)
(3) Internally defined program macros (DEFINE ...)
Accordingly, you should check the relevant statements in a program
that results in an overflow of the SAP paging area.
It is critical when many internal tables, possibly with
different IDs, are written to memory (EXPORT).
If the error occures in a non-modified SAP program, you may be able to
find an interim solution in an SAP Note.
If you have access to SAP Notes, carry out a search with the following
keywords:
"MEMORY_NO_MORE_PAGING" " "
"SAPLWDTM" or "LWDTMU20"
"TABC_ACTIVATE_AND_UPDATE"
If you cannot solve the problem yourself and want to send an error
notification to SAP, include the following information:
1. The description of the current problem (short dump)
To save the description, choose "System->List->Save->Local File
(Unconverted)".
2. Corresponding system log
Display the system log by calling transaction SM21.
Restrict the time interval to 10 minutes before and five minutes
after the short dump. Then choose "System->List->Save->Local File
(Unconverted)".
3. If the problem occurs in a problem of your own or a modified SAP
program: The source code of the program
In the editor, choose "Utilities->More
Utilities->Upload/Download->Download".
4. Details about the conditions under which the error occurred or which
actions and input led to the error.

Hi Huggins,
Maintenance of the Paging File is owned by your basis team.
They should increase this in order for your transaction to process successfully.
Just for your reference, in case the OS used is windows server 2003, paging file value can be checked through;
Right click in the My Computer>properties.
Then go to Advance tab;
Then there should be a performance section, click the settings
Then Advance tab again. The paging file can be seen from there.
(and can be adjusted from there also)
The value of the paging file in general will be dependent with the available RAM from the hardware.
Hope this helps. Thanks a lot.
- Jeff

Unable to see the data for the hierarchy in rsa3

Hi Gurus,
i am trying to check the data for the standard hierarchy in rsa3,but it is showing an error message saying that error 6 in functional module rss_program_generate.Please help me out.
thanks
bhaskar

Check if this helps seemed relevant
Error 6 in function module RSS_PROGRAM_GENERATE
Error 6 in function module RSS_PROGRAM_GENERATE
error Error 6 in function module RSS_PROGRAM_GENERATE

Generation of program code for the ABAP Query

Dear all,
In the creation of the ABAP query, in the final step of SQ01, Query- more functions- generate program is made.
Why the program code is generated for the ABAP query? please give the logical explaination for the same.
Thanks and Regards,
Prash

Prash,
a) Do you mean Program code does not have significance in query creation?
No it does not mean this. All queries run based on an ABAP program. In the standard query editing process, when you save and execute the query, you will automatically re-build the existing ABAP program as necessary. You do not need, though, to execute the menu steps you outlined in order to build, maintain, or execute the query. It is only there for special purposes, as outlined above by Jürgen
b) Can we see the program code generated in any transaction?
From any screen, System > Status. Place your cursor on the field in "Program (screen)". Double click.
Rgds,
DB49

Test data for the ABAP Function

Similar Messages

Maybe you are looking for